About the Execution of 2024-gold for CopsAndRobbers-PT-CRL025X003
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15683.860 | 95119.00 | 116563.00 | 325.80 | T | normal |
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.r266-tall-174931350100122.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 CopsAndRobbers-PT-CRL025X003, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-tall-174931350100122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.0K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 13:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 13:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 13:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 16K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 137K Jun 5 20:08 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 1749319110184
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CopsAndRobbers-PT-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 17:58:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-07 17:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:58:31] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-07 17:58:31] [INFO ] Transformed 135 places.
[2025-06-07 17:58:31] [INFO ] Transformed 179 transitions.
[2025-06-07 17:58:31] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 157 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 135/135 places, 179/179 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 110 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 25 place count 110 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 109 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 108 transition count 177
Applied a total of 29 rules in 38 ms. Remains 108 /135 variables (removed 27) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 108 cols
[2025-06-07 17:58:31] [INFO ] Computed 28 invariants in 21 ms
[2025-06-07 17:58:31] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6200 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 26406ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 26424ms
[2025-06-07 17:58:58] [INFO ] Invariant cache hit.
[2025-06-07 17:58:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 17:58:58] [INFO ] Invariant cache hit.
[2025-06-07 17:58:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-07 17:58:58] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-06-07 17:58:58] [INFO ] Invariant cache hit.
[2025-06-07 17:58:58] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 35922ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 35924ms
Starting structural reductions in LIVENESS mode, iteration 1 : 108/135 places, 177/179 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63223 ms. Remains : 108/135 places, 177/179 transitions.
Discarding 24 transitions out of 177. Remains 153
Initial state reduction rules removed 26 formulas.
RANDOM walk for 40005 steps (8 resets) in 1890 ms. (21 steps per ms) remains 49/127 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4004 steps (24 resets) in 20 ms. (190 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4002 steps (10 resets) in 80 ms. (49 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 25 ms. (154 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 41 ms. (95 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4002 steps (9 resets) in 91 ms. (43 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4003 steps (24 resets) in 8 ms. (444 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 1/2 properties
[2025-06-07 17:59:35] [INFO ] Invariant cache hit.
[2025-06-07 17:59:35] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/52 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/57 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/59 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/187 variables, 59/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 98/285 variables, 49/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 49/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/52 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/57 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/59 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/187 variables, 59/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 98/285 variables, 49/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 49/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 177/177 transitions.
Applied a total of 0 rules in 13 ms. Remains 108 /108 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Running 127 sub problems to find dead transitions.
[2025-06-07 17:59:36] [INFO ] Invariant cache hit.
[2025-06-07 17:59:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5735 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 25854ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 25856ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25870 ms. Remains : 108/108 places, 177/177 transitions.
RANDOM walk for 4000002 steps (8 resets) in 7079 ms. (564 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2666942 steps (6 resets) in 3085 ms. (864 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 153 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 93823 ms.
ITS solved all properties within timeout
BK_STOP 1749319205303
--------------------
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="CopsAndRobbers-PT-CRL025X003"
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 CopsAndRobbers-PT-CRL025X003, 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 r266-tall-174931350100122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-CRL025X003.tgz
mv CopsAndRobbers-PT-CRL025X003 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 '
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 ;