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-171624201600292.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-d0m08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201600292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 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 1717179106183

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-d0m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:11:47] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 18:11:47] [INFO ] Transformed 553 places.
[2024-05-31 18:11:47] [INFO ] Transformed 150 transitions.
[2024-05-31 18:11:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 187 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 33 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:47] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 18:11:47] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-31 18:11:47] [INFO ] Invariant cache hit.
[2024-05-31 18:11:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-31 18:11:48] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-31 18:11:48] [INFO ] Invariant cache hit.
[2024-05-31 18:11:48] [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
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 11 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 37 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 40 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 places in 39 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 37 places in 39 ms of which 0 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 38 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 36 ms of which 1 ms to minimize.
[2024-05-31 18:11:50] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-31 18:11:53] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 4 ms to minimize.
[2024-05-31 18:11:53] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/241 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 182 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7588 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: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/119 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 320 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8151 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: 15/15 constraints]
After SMT, in 15978ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 15998ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 16565 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 (9196 resets) in 2081 ms. (19 steps per ms) remains 45/90 properties
BEST_FIRST walk for 4004 steps (191 resets) in 52 ms. (75 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (171 resets) in 53 ms. (74 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (196 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (207 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (200 resets) in 25 ms. (154 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (208 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (197 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (186 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (195 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (176 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (214 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (204 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (197 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (193 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (182 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (180 resets) in 14 ms. (266 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4002 steps (207 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (179 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (201 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (190 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (195 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (207 resets) in 25 ms. (153 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (186 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (800 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (800 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (397 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (375 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (425 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (403 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (412 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (383 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (387 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (417 resets) in 22 ms. (173 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (393 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (394 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (416 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (397 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (419 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (415 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (388 resets) in 18 ms. (210 steps per ms) remains 39/44 properties
BEST_FIRST walk for 4002 steps (352 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (416 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (398 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (410 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (391 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
[2024-05-31 18:12:05] [INFO ] Invariant cache hit.
[2024-05-31 18:12:05] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 20/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 21/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 119/207 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 34/241 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:12:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/241 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 172 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2440 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: 39/39 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 20/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 21/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 119/207 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 43/136 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 5 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:12:08] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 3 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 5 ms to minimize.
[2024-05-31 18:12:09] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 17/186 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 34/241 variables, 14/200 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 26/246 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 17 (OVERLAPS) 0/241 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 248 constraints, problems are : Problem set: 0 solved, 39 unsolved in 4412 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: 39/39 constraints, Known Traps: 42/42 constraints]
After SMT, in 6899ms problems are : Problem set: 0 solved, 39 unsolved
Parikh walk visited 1 properties in 1454 ms.
Support contains 46 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 92 transition count 123
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 92 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 90 transition count 121
Applied a total of 24 rules in 18 ms. Remains 90 /102 variables (removed 12) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 90/102 places, 121/139 transitions.
RANDOM walk for 4000000 steps (914888 resets) in 20513 ms. (194 steps per ms) remains 19/38 properties
BEST_FIRST walk for 400003 steps (19758 resets) in 648 ms. (616 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19649 resets) in 620 ms. (644 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19852 resets) in 610 ms. (654 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (19873 resets) in 634 ms. (629 steps per ms) remains 16/19 properties
BEST_FIRST walk for 400004 steps (19609 resets) in 569 ms. (701 steps per ms) remains 11/16 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 785 ms. (508 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 779 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400001 steps (40499 resets) in 590 ms. (676 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400003 steps (40458 resets) in 593 ms. (673 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400003 steps (40881 resets) in 598 ms. (667 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400002 steps (40282 resets) in 607 ms. (657 steps per ms) remains 10/11 properties
BEST_FIRST walk for 400003 steps (40791 resets) in 555 ms. (719 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (40738 resets) in 564 ms. (707 steps per ms) remains 10/10 properties
// Phase 1: matrix 121 rows 90 cols
[2024-05-31 18:12:22] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 18:12:22] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 25/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 87/151 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 54/205 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/211 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/211 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 144 constraints, problems are : Problem set: 0 solved, 10 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 25/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 87/151 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 54/205 variables, 23/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 31/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/211 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/211 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 154 constraints, problems are : Problem set: 0 solved, 10 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 943ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 5 properties in 1527 ms.
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 79 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 79 transition count 99
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 70 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 68 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 66 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 65 transition count 79
Applied a total of 53 rules in 39 ms. Remains 65 /90 variables (removed 25) and now considering 79/121 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 65/90 places, 79/121 transitions.
RANDOM walk for 4000000 steps (915860 resets) in 6104 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (199637 resets) in 2402 ms. (1664 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 3496 ms. (1143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (405605 resets) in 2666 ms. (1499 steps per ms) remains 2/4 properties
// Phase 1: matrix 79 rows 65 cols
[2024-05-31 18:12:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 18:12:29] [INFO ] State equation strengthened by 27 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) 22/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/110 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/142 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/144 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/144 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 94 constraints, problems are : Problem set: 0 solved, 2 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 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) 22/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/110 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/142 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/144 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 96 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 82 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 79/79 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 59 transition count 67
Applied a total of 16 rules in 14 ms. Remains 59 /65 variables (removed 6) and now considering 67/79 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 59/65 places, 67/79 transitions.
RANDOM walk for 4000000 steps (917052 resets) in 3771 ms. (1060 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 2327 ms. (1718 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5082 steps, run visited all 1 properties in 21 ms. (steps per millisecond=242 )
Probabilistic random walk after 5082 steps, saw 2271 distinct states, run finished after 27 ms. (steps per millisecond=188 ) properties seen :1
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 44149 ms.
ITS solved all properties within timeout

BK_STOP 1717179151505

--------------------
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-d0m08"
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-d0m08, 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-171624201600292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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