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.r154-tall-174876825600377.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 Peterson-PT-3, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600377
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748844119203

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 06:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:02:00] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-02 06:02:00] [INFO ] Transformed 244 places.
[2025-06-02 06:02:00] [INFO ] Transformed 332 transitions.
[2025-06-02 06:02:00] [INFO ] Found NUPN structural information;
[2025-06-02 06:02:00] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 199 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 54 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2025-06-02 06:02:00] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2025-06-02 06:02:00] [INFO ] Computed 15 invariants in 13 ms
[2025-06-02 06:02:01] [INFO ] Implicit Places using invariants in 263 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 292 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 364 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
RANDOM walk for 40000 steps (8 resets) in 1492 ms. (26 steps per ms) remains 42/172 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
[2025-06-02 06:02:01] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2025-06-02 06:02:01] [INFO ] Computed 11 invariants in 7 ms
[2025-06-02 06:02:01] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 12 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 4 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 3 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:02:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2025-06-02 06:02:03] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 4 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 17/130 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:02:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/84 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 152/236 variables, 84/219 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 57/276 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 0/236 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 276 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3988 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 40/133 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/84 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 152/236 variables, 84/219 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 57/276 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 31/307 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/236 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 307 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1625 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 40/40 constraints]
After SMT, in 5666ms problems are : Problem set: 0 solved, 31 unsolved
Parikh walk visited 3 properties in 956 ms.
Support contains 36 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 84/84 places, 176/176 transitions.
RANDOM walk for 4000000 steps (8 resets) in 17394 ms. (229 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 446 ms. (894 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 483 ms. (826 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 407 ms. (980 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 404 ms. (987 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 415 ms. (961 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 410 ms. (973 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 404 ms. (987 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 406 ms. (982 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 408 ms. (978 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 400 ms. (997 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 405 ms. (985 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 399 ms. (1000 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 392 ms. (1017 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 399 ms. (1000 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 398 ms. (1002 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 400 ms. (997 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 405 ms. (985 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 396 ms. (1007 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 395 ms. (1010 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 406 ms. (982 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 397 ms. (1005 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 381 ms. (1047 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 372 ms. (1072 steps per ms) remains 26/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 374 ms. (1066 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 385 ms. (1036 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 380 ms. (1049 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 369 ms. (1081 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 374 ms. (1066 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 121825 steps, run visited all 26 properties in 683 ms. (steps per millisecond=178 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 689 ms. (steps per millisecond=176 ) properties seen :26
Able to resolve query QuasiLiveness after proving 172 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 17230 ms.
ITS solved all properties within timeout

BK_STOP 1748844137751

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="Peterson-PT-3"
export BK_EXAMINATION="QuasiLiveness"
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 Peterson-PT-3, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825600377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;