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.r140-smll-174876533400077.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 MedleyA-PT-04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533400077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 28K 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 1748927878978

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:18:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:18:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:18:01] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2025-06-03 05:18:01] [INFO ] Transformed 115 places.
[2025-06-03 05:18:01] [INFO ] Transformed 107 transitions.
[2025-06-03 05:18:01] [INFO ] Found NUPN structural information;
[2025-06-03 05:18:01] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 389 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 114 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 90 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 49 place count 90 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 84 transition count 77
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 67 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 61 transition count 60
Applied a total of 107 rules in 78 ms. Remains 61 /115 variables (removed 54) and now considering 60/107 (removed 47) transitions.
// Phase 1: matrix 60 rows 61 cols
[2025-06-03 05:18:01] [INFO ] Computed 8 invariants in 15 ms
[2025-06-03 05:18:01] [INFO ] Implicit Places using invariants in 394 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/115 places, 60/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 59 cols
[2025-06-03 05:18:01] [INFO ] Computed 7 invariants in 3 ms
[2025-06-03 05:18:02] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-03 05:18:02] [INFO ] Invariant cache hit.
[2025-06-03 05:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 05:18:02] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 59/115 places, 59/107 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1090 ms. Remains : 59/115 places, 59/107 transitions.
Discarding 13 transitions out of 59. Remains 46
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6094 resets) in 2304 ms. (17 steps per ms) remains 23/45 properties
BEST_FIRST walk for 4001 steps (324 resets) in 103 ms. (38 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (301 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (319 resets) in 75 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (300 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (277 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (320 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (326 resets) in 51 ms. (76 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (324 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (323 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (305 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (314 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (320 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (328 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (320 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (321 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (324 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (315 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (332 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (326 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (326 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (317 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (305 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (326 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
[2025-06-03 05:18:03] [INFO ] Invariant cache hit.
[2025-06-03 05:18:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 13/38 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-03 05:18:04] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 15/53 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-03 05:18:04] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
[2025-06-03 05:18:04] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2025-06-03 05:18:04] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-03 05:18:04] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 59/112 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/118 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 131 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1525 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 13/38 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 15/53 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 59/112 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 6/118 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/118 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/118 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 0/118 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 153 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1510 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
After SMT, in 3135ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 0 properties in 2509 ms.
Support contains 25 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 54 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 54 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 54 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 48
Applied a total of 12 rules in 19 ms. Remains 53 /59 variables (removed 6) and now considering 48/59 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 53/59 places, 48/59 transitions.
RANDOM walk for 4000000 steps (393433 resets) in 22142 ms. (180 steps per ms) remains 18/22 properties
BEST_FIRST walk for 400004 steps (21419 resets) in 1158 ms. (345 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21489 resets) in 1117 ms. (357 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21637 resets) in 1125 ms. (355 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21588 resets) in 1148 ms. (348 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21563 resets) in 1170 ms. (341 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21572 resets) in 1128 ms. (354 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21585 resets) in 1130 ms. (353 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21579 resets) in 1118 ms. (357 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21596 resets) in 1107 ms. (361 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21567 resets) in 1118 ms. (357 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21503 resets) in 1134 ms. (352 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21574 resets) in 1134 ms. (352 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21589 resets) in 1137 ms. (351 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21513 resets) in 1153 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21648 resets) in 1162 ms. (343 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (21500 resets) in 1019 ms. (392 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21507 resets) in 1128 ms. (354 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21531 resets) in 1122 ms. (356 steps per ms) remains 18/18 properties
// Phase 1: matrix 48 rows 53 cols
[2025-06-03 05:18:21] [INFO ] Computed 7 invariants in 2 ms
[2025-06-03 05:18:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 23/45 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 48/93 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 8/101 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 61 constraints, problems are : Problem set: 0 solved, 18 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 23/45 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-03 05:18:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 48/93 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 8/101 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-03 05:18:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
[2025-06-03 05:18:23] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2025-06-03 05:18:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2025-06-03 05:18:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/101 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 84 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 5/5 constraints]
After SMT, in 1745ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1186 ms.
Support contains 19 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 53/53 places, 48/48 transitions.
RANDOM walk for 4000000 steps (393326 resets) in 19081 ms. (209 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21649 resets) in 1155 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21561 resets) in 1136 ms. (351 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21543 resets) in 1149 ms. (347 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21440 resets) in 1103 ms. (362 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21534 resets) in 1116 ms. (358 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21583 resets) in 1153 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21495 resets) in 1142 ms. (349 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21494 resets) in 1150 ms. (347 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (21597 resets) in 1157 ms. (345 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21491 resets) in 1134 ms. (352 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21532 resets) in 1133 ms. (352 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21518 resets) in 1232 ms. (324 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21549 resets) in 1040 ms. (384 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (21649 resets) in 1154 ms. (346 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (21648 resets) in 1082 ms. (369 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21519 resets) in 1085 ms. (368 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (21589 resets) in 1073 ms. (372 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (21583 resets) in 1036 ms. (385 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 2203 steps, run visited all 18 properties in 46 ms. (steps per millisecond=47 )
Probabilistic random walk after 2203 steps, saw 1069 distinct states, run finished after 53 ms. (steps per millisecond=41 ) properties seen :18
Able to resolve query QuasiLiveness after proving 46 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 36646 ms.
ITS solved all properties within timeout

BK_STOP 1748927917657

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r140-smll-174876533400077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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