Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r482-tall-171624201600287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d0m07, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201600287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 1717179091202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:11:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:11:32] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-31 18:11:32] [INFO ] Transformed 553 places.
[2024-05-31 18:11:32] [INFO ] Transformed 150 transitions.
[2024-05-31 18:11:32] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 173 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 29 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-31 18:11:32] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 18:11:32] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 18:11:32] [INFO ] Invariant cache hit.
[2024-05-31 18:11:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-31 18:11:33] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-31 18:11:33] [INFO ] Invariant cache hit.
[2024-05-31 18:11:33] [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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3423 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 138/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 305 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6679 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: 0/0 constraints]
After SMT, in 10356ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 10374ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 10918 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 (9210 resets) in 1899 ms. (21 steps per ms) remains 54/90 properties
BEST_FIRST walk for 4003 steps (202 resets) in 36 ms. (108 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (188 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (176 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (198 resets) in 75 ms. (52 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (210 resets) in 67 ms. (58 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (178 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (214 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (184 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (211 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (216 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (195 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (182 resets) in 32 ms. (121 steps per ms) remains 50/53 properties
BEST_FIRST walk for 4004 steps (204 resets) in 22 ms. (174 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4003 steps (198 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (194 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (206 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (192 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (181 resets) in 17 ms. (222 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (197 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (205 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (179 resets) in 18 ms. (210 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (220 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (226 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (199 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (210 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (197 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (209 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (190 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (800 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (800 resets) in 22 ms. (173 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (390 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (421 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (398 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (406 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (419 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (423 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (397 resets) in 19 ms. (200 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4002 steps (373 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (433 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (403 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (392 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (430 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (398 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (400 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (408 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (418 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (395 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (426 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (423 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (415 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (429 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
[2024-05-31 18:11:44] [INFO ] Invariant cache hit.
[2024-05-31 18:11:44] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 18/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 45 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, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1463 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: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 18/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 9 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 2 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:46] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 6 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 19/174 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:11:47] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 6 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:48] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 2 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-31 18:11:49] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 2 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/241 variables, and 230 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/102 constraints, ReadFeed: 47/63 constraints, PredecessorRefiner: 16/45 constraints, Known Traps: 75/75 constraints]
After SMT, in 6515ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 126
Applied a total of 18 rules in 26 ms. Remains 93 /102 variables (removed 9) and now considering 126/139 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 93/102 places, 126/139 transitions.
RANDOM walk for 4000000 steps (915901 resets) in 18169 ms. (220 steps per ms) remains 15/45 properties
BEST_FIRST walk for 400003 steps (20027 resets) in 490 ms. (814 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (19813 resets) in 458 ms. (871 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400003 steps (19916 resets) in 439 ms. (909 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (19877 resets) in 460 ms. (867 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400004 steps (19966 resets) in 427 ms. (934 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (20036 resets) in 434 ms. (919 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 732 ms. (545 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (40454 resets) in 575 ms. (694 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400001 steps (40323 resets) in 558 ms. (715 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400001 steps (40338 resets) in 559 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40639 resets) in 580 ms. (688 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (40456 resets) in 577 ms. (692 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40332 resets) in 568 ms. (702 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40302 resets) in 565 ms. (706 steps per ms) remains 13/13 properties
// Phase 1: matrix 126 rows 93 cols
[2024-05-31 18:11:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 18:11:58] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 24/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 92/159 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 52/211 variables, 22/113 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 8/219 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 18:11:58] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-31 18:11:58] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/219 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/219 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 153 constraints, problems are : Problem set: 0 solved, 13 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 24/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 92/159 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 18:11:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:11:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 52/211 variables, 22/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 30/149 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 8/219 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/219 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 168 constraints, problems are : Problem set: 0 solved, 13 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 1553ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1378 ms.
Support contains 18 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 126/126 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 84 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 84 transition count 107
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 75 transition count 98
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 75 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 73 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 73 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 71 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 70 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 70 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 70 transition count 88
Applied a total of 48 rules in 20 ms. Remains 70 /93 variables (removed 23) and now considering 88/126 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 70/93 places, 88/126 transitions.
RANDOM walk for 4000000 steps (916102 resets) in 11548 ms. (346 steps per ms) remains 3/13 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 3246 ms. (1231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (405303 resets) in 2482 ms. (1610 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (404586 resets) in 2493 ms. (1603 steps per ms) remains 2/3 properties
// Phase 1: matrix 88 rows 70 cols
[2024-05-31 18:12:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 18:12:07] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/112 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/154 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/158 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 33/33 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/112 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/154 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/158 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/158 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 93 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Parikh walk visited 2 properties in 17 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 35863 ms.
ITS solved all properties within timeout

BK_STOP 1717179128261

--------------------
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-d0m07"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d0m07, 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 r482-tall-171624201600287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m07.tgz
mv DBSingleClientW-PT-d0m07 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;