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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K 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 1717179927194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:25:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:25:28] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-31 18:25:28] [INFO ] Transformed 360 places.
[2024-05-31 18:25:28] [INFO ] Transformed 311 transitions.
[2024-05-31 18:25:28] [INFO ] Found NUPN structural information;
[2024-05-31 18:25:28] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 201 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 357 transition count 288
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 334 transition count 288
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 334 transition count 279
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 325 transition count 279
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 234 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 230 transition count 204
Applied a total of 257 rules in 77 ms. Remains 230 /360 variables (removed 130) and now considering 204/311 (removed 107) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-05-31 18:25:28] [INFO ] Computed 62 invariants in 33 ms
[2024-05-31 18:25:29] [INFO ] Implicit Places using invariants in 450 ms returned [115]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 229/360 places, 204/311 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 588 ms. Remains : 229/360 places, 204/311 transitions.
Discarding 45 transitions out of 204. Remains 159
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1388 resets) in 1875 ms. (21 steps per ms) remains 69/158 properties
BEST_FIRST walk for 4003 steps (17 resets) in 36 ms. (108 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (21 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (19 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (21 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (22 resets) in 53 ms. (74 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (21 resets) in 42 ms. (93 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (21 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (21 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (19 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (16 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (15 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (18 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (18 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (17 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 69/69 properties
// Phase 1: matrix 204 rows 229 cols
[2024-05-31 18:25:30] [INFO ] Computed 61 invariants in 4 ms
[2024-05-31 18:25:30] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/97 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 65/162 variables, 25/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 65/193 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 56/218 variables, 27/220 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 56/276 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:32] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 5/223 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:25:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 204/427 variables, 223/510 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/433 variables, and 516 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5019 ms.
Refiners :[Domain max(s): 223/229 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 223/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/97 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 65/162 variables, 25/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 65/193 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 56/218 variables, 27/220 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 56/276 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 5/223 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 204/427 variables, 223/510 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 20/536 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 21 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/433 variables, and 543 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5008 ms.
Refiners :[Domain max(s): 223/229 constraints, Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 223/229 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 20/69 constraints, Known Traps: 10/10 constraints]
After SMT, in 10120ms problems are : Problem set: 0 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 204/204 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 212 transition count 166
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 212 transition count 166
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 212 transition count 156
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 212 transition count 153
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 209 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 205 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 205 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 205 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 204 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 204 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 203 transition count 144
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 203 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 202 transition count 143
Applied a total of 69 rules in 66 ms. Remains 202 /229 variables (removed 27) and now considering 143/204 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 202/229 places, 143/204 transitions.
RANDOM walk for 4000000 steps (183441 resets) in 34628 ms. (115 steps per ms) remains 63/69 properties
BEST_FIRST walk for 400001 steps (3828 resets) in 1429 ms. (279 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4439 resets) in 1169 ms. (341 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4441 resets) in 1045 ms. (382 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (4406 resets) in 997 ms. (400 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4460 resets) in 1053 ms. (379 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4442 resets) in 964 ms. (414 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4426 resets) in 978 ms. (408 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4482 resets) in 1084 ms. (368 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (4432 resets) in 946 ms. (422 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4499 resets) in 1007 ms. (396 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4461 resets) in 1046 ms. (382 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4478 resets) in 1059 ms. (377 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (4441 resets) in 1083 ms. (369 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4457 resets) in 1021 ms. (391 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (4459 resets) in 1104 ms. (361 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3516 resets) in 1055 ms. (378 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3550 resets) in 959 ms. (416 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3604 resets) in 1016 ms. (393 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3579 resets) in 947 ms. (421 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3576 resets) in 925 ms. (431 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (3595 resets) in 927 ms. (431 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3594 resets) in 938 ms. (425 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3593 resets) in 1077 ms. (371 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3614 resets) in 1154 ms. (346 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400001 steps (3513 resets) in 900 ms. (443 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3508 resets) in 1121 ms. (356 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3556 resets) in 1167 ms. (342 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3588 resets) in 905 ms. (441 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3562 resets) in 965 ms. (414 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (3867 resets) in 1237 ms. (323 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (3810 resets) in 960 ms. (416 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3865 resets) in 1008 ms. (396 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3811 resets) in 1061 ms. (376 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (3811 resets) in 953 ms. (419 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3837 resets) in 1084 ms. (368 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3860 resets) in 1048 ms. (381 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3791 resets) in 936 ms. (426 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3770 resets) in 921 ms. (433 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3764 resets) in 1035 ms. (386 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3798 resets) in 1011 ms. (395 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3839 resets) in 1025 ms. (389 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3767 resets) in 1184 ms. (337 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3761 resets) in 929 ms. (430 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3824 resets) in 833 ms. (479 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3783 resets) in 750 ms. (532 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3809 resets) in 750 ms. (532 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3823 resets) in 748 ms. (534 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3847 resets) in 746 ms. (535 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3862 resets) in 767 ms. (520 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3815 resets) in 743 ms. (537 steps per ms) remains 63/63 properties
Finished probabilistic random walk after 443585 steps, run visited all 63 properties in 2600 ms. (steps per millisecond=170 )
Probabilistic random walk after 443585 steps, saw 104332 distinct states, run finished after 2607 ms. (steps per millisecond=170 ) properties seen :63
Able to resolve query QuasiLiveness after proving 159 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 40952 ms.
ITS solved all properties within timeout

BK_STOP 1717179969349

--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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-171624201900432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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