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.r070-smll-174854076100027.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 DBSingleClientW-PT-d0m09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076100027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K 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 1748644870239

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 22:41:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 22:41:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:41:12] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-05-30 22:41:12] [INFO ] Transformed 553 places.
[2025-05-30 22:41:12] [INFO ] Transformed 150 transitions.
[2025-05-30 22:41:12] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 307 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 63 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2025-05-30 22:41:12] [INFO ] Computed 2 invariants in 25 ms
[2025-05-30 22:41:13] [INFO ] Implicit Places using invariants in 627 ms returned []
[2025-05-30 22:41:13] [INFO ] Invariant cache hit.
[2025-05-30 22:41:13] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 22:41:13] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 22:41:13] [INFO ] Invariant cache hit.
[2025-05-30 22:41:13] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-05-30 22:41:17] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 24 ms to minimize.
[2025-05-30 22:41:17] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2025-05-30 22:41:17] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2025-05-30 22:41:18] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2025-05-30 22:41:18] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2025-05-30 22:41:18] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12906 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
After SMT, in 21085ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 21107ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 22384 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9258 resets) in 2986 ms. (13 steps per ms) remains 48/90 properties
BEST_FIRST walk for 4003 steps (202 resets) in 66 ms. (59 steps per ms) remains 45/48 properties
BEST_FIRST walk for 4002 steps (191 resets) in 143 ms. (27 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (190 resets) in 130 ms. (30 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (202 resets) in 82 ms. (48 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (202 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (213 resets) in 51 ms. (76 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (204 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (238 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (190 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (185 resets) in 28 ms. (138 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4001 steps (204 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (202 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (207 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (199 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (203 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (189 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (204 resets) in 28 ms. (138 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (183 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (181 resets) in 59 ms. (66 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (174 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (182 resets) in 40 ms. (97 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (205 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (800 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (800 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (424 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (417 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (392 resets) in 20 ms. (190 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4003 steps (429 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (430 resets) in 27 ms. (143 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (402 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (355 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (417 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (400 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (402 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (418 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (400 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (399 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (390 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (405 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (397 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (429 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (401 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (420 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
[2025-05-30 22:41:36] [INFO ] Invariant cache hit.
[2025-05-30 22:41:36] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 20/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 22/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 20/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 22/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2025-05-30 22:41:39] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 3 ms to minimize.
[2025-05-30 22:41:39] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2025-05-30 22:41:39] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2025-05-30 22:41:39] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-05-30 22:41:40] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 28/241 variables, 12/177 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 16/193 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 24/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (OVERLAPS) 0/241 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 217 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 10/10 constraints]
After SMT, in 7275ms problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 91 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 91 transition count 124
Applied a total of 22 rules in 48 ms. Remains 91 /102 variables (removed 11) and now considering 124/139 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 91/102 places, 124/139 transitions.
RANDOM walk for 4000000 steps (915473 resets) in 23593 ms. (169 steps per ms) remains 13/40 properties
BEST_FIRST walk for 4000003 steps (198557 resets) in 5013 ms. (797 steps per ms) remains 4/13 properties
BEST_FIRST walk for 4000004 steps (197811 resets) in 3510 ms. (1139 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000000 steps (403646 resets) in 3470 ms. (1152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (403794 resets) in 4200 ms. (952 steps per ms) remains 2/3 properties
// Phase 1: matrix 124 rows 91 cols
[2025-05-30 22:41:55] [INFO ] Computed 2 invariants in 3 ms
[2025-05-30 22:41:55] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/138 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/203 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/215 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/138 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 65/203 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 40/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/215 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/215 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 854 steps, including 87 resets, run visited all 2 properties in 32 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 48 ms.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 43310 ms.
ITS solved all properties within timeout

BK_STOP 1748644915634

--------------------
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 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="DBSingleClientW-PT-d0m09"
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 DBSingleClientW-PT-d0m09, 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 r070-smll-174854076100027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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