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.r188-tall-171640616800477.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 greatspnxred
Input is HealthRecord-PT-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616800477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K 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 5.3K 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.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21: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 68K 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 1716475801189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:50:02] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-23 14:50:02] [INFO ] Transformed 157 places.
[2024-05-23 14:50:02] [INFO ] Transformed 327 transitions.
[2024-05-23 14:50:02] [INFO ] Found NUPN structural information;
[2024-05-23 14:50:02] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 171 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 157/157 places, 327/327 transitions.
Graph (trivial) has 266 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 91 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 122 place count 91 transition count 234
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 176 place count 64 transition count 267
Applied a total of 176 rules in 65 ms. Remains 64 /157 variables (removed 93) and now considering 267/327 (removed 60) transitions.
[2024-05-23 14:50:02] [INFO ] Flow matrix only has 218 transitions (discarded 49 similar events)
// Phase 1: matrix 218 rows 64 cols
[2024-05-23 14:50:02] [INFO ] Computed 18 invariants in 15 ms
[2024-05-23 14:50:02] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 14:50:02] [INFO ] Flow matrix only has 218 transitions (discarded 49 similar events)
[2024-05-23 14:50:02] [INFO ] Invariant cache hit.
[2024-05-23 14:50:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-23 14:50:02] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-23 14:50:03] [INFO ] Flow matrix only has 218 transitions (discarded 49 similar events)
[2024-05-23 14:50:03] [INFO ] Invariant cache hit.
[2024-05-23 14:50:03] [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, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-23 14:50:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 8 ms to minimize.
[2024-05-23 14:50:04] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
[2024-05-23 14:50:04] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 7 places in 50 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, 251 unsolved
[2024-05-23 14:50:05] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-23 14:50:06] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:50:06] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:50:06] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (OVERLAPS) 217/281 variables, 64/157 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 83/240 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (OVERLAPS) 1/282 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 241 constraints, problems are : Problem set: 0 solved, 251 unsolved in 10321 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: 251/251 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 217/281 variables, 64/157 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 83/240 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 251/491 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 11 (OVERLAPS) 1/282 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 13 (OVERLAPS) 0/282 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 492 constraints, problems are : Problem set: 0 solved, 251 unsolved in 12998 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: 251/251 constraints, Known Traps: 11/11 constraints]
After SMT, in 23754ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 23778ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/157 places, 267/327 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 24272 ms. Remains : 64/157 places, 267/327 transitions.
Discarding 216 transitions out of 267. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5144 resets) in 1575 ms. (25 steps per ms) remains 17/50 properties
BEST_FIRST walk for 4003 steps (68 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (70 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (68 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (70 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (105 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (37 resets) in 26 ms. (148 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (74 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (76 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (68 resets) in 8 ms. (444 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (71 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (62 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
[2024-05-23 14:50:27] [INFO ] Flow matrix only has 218 transitions (discarded 49 similar events)
[2024-05-23 14:50:27] [INFO ] Invariant cache hit.
[2024-05-23 14:50:27] [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-23 14:50:27] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-23 14:50:27] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 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) 217/281 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/282 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 232 constraints, problems are : Problem set: 0 solved, 13 unsolved in 674 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) 217/281 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 13/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/282 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/282 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 245 constraints, problems are : Problem set: 0 solved, 13 unsolved in 826 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 1522ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 8 properties in 660 ms.
Support contains 14 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 267/267 transitions.
Graph (complete) has 381 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 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 248
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 21 place count 45 transition count 198
Iterating global reduction 1 with 10 rules applied. Total rules applied 31 place count 45 transition count 198
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 49 place count 45 transition count 180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 42 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 42 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 39 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 39 transition count 141
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 79 place count 39 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 39 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 38 transition count 101
Applied a total of 103 rules in 28 ms. Remains 38 /64 variables (removed 26) and now considering 101/267 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 38/64 places, 101/267 transitions.
RANDOM walk for 4000000 steps (487027 resets) in 7030 ms. (568 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000002 steps (84271 resets) in 2735 ms. (1461 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (84044 resets) in 1591 ms. (2512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (90987 resets) in 2099 ms. (1904 steps per ms) remains 3/3 properties
[2024-05-23 14:50:33] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
// Phase 1: matrix 93 rows 38 cols
[2024-05-23 14:50:33] [INFO ] Computed 9 invariants in 3 ms
[2024-05-23 14:50:33] [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) 21/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 93/131 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 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) 21/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 93/131 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 88 constraints, problems are : Problem set: 0 solved, 3 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 100
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 37 transition count 99
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 10 place count 37 transition count 99
Applied a total of 10 rules in 9 ms. Remains 37 /38 variables (removed 1) and now considering 99/101 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 37/38 places, 99/101 transitions.
RANDOM walk for 4000000 steps (497428 resets) in 6393 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (86536 resets) in 1671 ms. (2392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (86671 resets) in 1658 ms. (2411 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (96941 resets) in 2170 ms. (1842 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1864 steps, run visited all 3 properties in 14 ms. (steps per millisecond=133 )
Probabilistic random walk after 1864 steps, saw 740 distinct states, run finished after 17 ms. (steps per millisecond=109 ) 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 35003 ms.
ITS solved all properties within timeout

BK_STOP 1716475837328

--------------------
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="HealthRecord-PT-09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-09, 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 r188-tall-171640616800477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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