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.r498-tall-171640618000507.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 HealthRecord-PT-15, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K 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 1717194093190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:34] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 22:21:34] [INFO ] Transformed 163 places.
[2024-05-31 22:21:34] [INFO ] Transformed 348 transitions.
[2024-05-31 22:21:34] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:34] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 174 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 163/163 places, 348/348 transitions.
Graph (trivial) has 278 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 0 with 138 rules applied. Total rules applied 139 place count 91 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 140 place count 91 transition count 246
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 194 place count 64 transition count 279
Applied a total of 194 rules in 68 ms. Remains 64 /163 variables (removed 99) and now considering 279/348 (removed 69) transitions.
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 224 transitions (discarded 55 similar events)
// Phase 1: matrix 224 rows 64 cols
[2024-05-31 22:21:34] [INFO ] Computed 18 invariants in 17 ms
[2024-05-31 22:21:34] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 224 transitions (discarded 55 similar events)
[2024-05-31 22:21:34] [INFO ] Invariant cache hit.
[2024-05-31 22:21:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-31 22:21:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 224 transitions (discarded 55 similar events)
[2024-05-31 22:21:34] [INFO ] Invariant cache hit.
[2024-05-31 22:21:34] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-31 22:21:36] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 9 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-31 22:21:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-31 22:21:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 223/287 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 83/238 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 1/288 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 14 (OVERLAPS) 0/288 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 239 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10697 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-31 22:21:46] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:21:47] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:21:47] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
[2024-05-31 22:21:47] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 223/287 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 83/242 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 263/505 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 1/288 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 14 (OVERLAPS) 0/288 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 506 constraints, problems are : Problem set: 0 solved, 263 unsolved in 15503 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 13/13 constraints]
After SMT, in 26706ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 26721ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/163 places, 279/348 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 27173 ms. Remains : 64/163 places, 279/348 transitions.
Discarding 228 transitions out of 279. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (6414 resets) in 1876 ms. (21 steps per ms) remains 27/50 properties
BEST_FIRST walk for 4003 steps (89 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (78 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (81 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (83 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (87 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (85 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (87 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (77 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (87 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (85 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (85 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (86 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (120 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (104 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4003 steps (81 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (80 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (80 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (80 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (78 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (89 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (78 resets) in 20 ms. (190 steps per ms) remains 13/24 properties
BEST_FIRST walk for 4004 steps (75 resets) in 10 ms. (364 steps per ms) remains 13/13 properties
[2024-05-31 22:22:02] [INFO ] Flow matrix only has 224 transitions (discarded 55 similar events)
[2024-05-31 22:22:02] [INFO ] Invariant cache hit.
[2024-05-31 22:22:02] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 29/55 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 29/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 223/287 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/288 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/288 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 232 constraints, problems are : Problem set: 0 solved, 13 unsolved in 681 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 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/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 29/55 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 29/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 223/287 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/288 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/288 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 245 constraints, problems are : Problem set: 0 solved, 13 unsolved in 966 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 1683ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 9 properties in 642 ms.
Support contains 13 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 279/279 transitions.
Graph (complete) has 393 edges and 64 vertex of which 55 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 55 transition count 263
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 18 place count 45 transition count 213
Iterating global reduction 1 with 10 rules applied. Total rules applied 28 place count 45 transition count 213
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 46 place count 45 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 42 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 42 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 39 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 39 transition count 156
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 76 place count 39 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 39 transition count 130
Applied a total of 84 rules in 51 ms. Remains 39 /64 variables (removed 25) and now considering 130/279 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 39/64 places, 130/279 transitions.
RANDOM walk for 4000000 steps (643026 resets) in 8129 ms. (492 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (85636 resets) in 1726 ms. (2316 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (85578 resets) in 1709 ms. (2339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (108140 resets) in 2204 ms. (1814 steps per ms) remains 3/3 properties
[2024-05-31 22:22:08] [INFO ] Flow matrix only has 113 transitions (discarded 17 similar events)
// Phase 1: matrix 113 rows 39 cols
[2024-05-31 22:22:08] [INFO ] Computed 9 invariants in 4 ms
[2024-05-31 22:22:08] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/152 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 86 constraints, problems are : Problem set: 0 solved, 3 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 113/152 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/152 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 89 constraints, problems are : Problem set: 0 solved, 3 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 12 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 130/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 38 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 128
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 38 transition count 128
Applied a total of 11 rules in 10 ms. Remains 38 /39 variables (removed 1) and now considering 128/130 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 38/39 places, 128/130 transitions.
RANDOM walk for 4000000 steps (580322 resets) in 8867 ms. (451 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (71456 resets) in 1785 ms. (2239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000001 steps (71504 resets) in 1781 ms. (2244 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000000 steps (111108 resets) in 2374 ms. (1684 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1913 steps, run visited all 3 properties in 22 ms. (steps per millisecond=86 )
Probabilistic random walk after 1913 steps, saw 779 distinct states, run finished after 26 ms. (steps per millisecond=73 ) properties seen :3
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 38514 ms.
ITS solved all properties within timeout

BK_STOP 1717194132849

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="HealthRecord-PT-15"
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 HealthRecord-PT-15, 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 r498-tall-171640618000507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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