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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 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 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 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 70K 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 1716475880228

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:51:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:51:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:51:21] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-23 14:51:21] [INFO ] Transformed 159 places.
[2024-05-23 14:51:21] [INFO ] Transformed 334 transitions.
[2024-05-23 14:51:21] [INFO ] Found NUPN structural information;
[2024-05-23 14:51:21] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 173 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 159/159 places, 334/334 transitions.
Graph (trivial) has 270 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 127 place count 91 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 128 place count 91 transition count 238
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 182 place count 64 transition count 271
Applied a total of 182 rules in 61 ms. Remains 64 /159 variables (removed 95) and now considering 271/334 (removed 63) transitions.
[2024-05-23 14:51:21] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
// Phase 1: matrix 220 rows 64 cols
[2024-05-23 14:51:21] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 14:51:21] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-23 14:51:21] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2024-05-23 14:51:21] [INFO ] Invariant cache hit.
[2024-05-23 14:51:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-23 14:51:22] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-23 14:51:22] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2024-05-23 14:51:22] [INFO ] Invariant cache hit.
[2024-05-23 14:51:22] [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, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 17 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-23 14:51:24] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-23 14:51:25] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:51:25] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:51:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-23 14:51:26] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:51:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 219/283 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 83/241 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 12 (OVERLAPS) 1/284 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 14 (OVERLAPS) 0/284 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 242 constraints, problems are : Problem set: 0 solved, 255 unsolved in 11630 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: 255/255 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 219/283 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 83/241 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 255/496 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 1/284 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 13 (OVERLAPS) 0/284 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 497 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14482 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: 255/255 constraints, Known Traps: 12/12 constraints]
After SMT, in 26661ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 26689ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/159 places, 271/334 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 27212 ms. Remains : 64/159 places, 271/334 transitions.
Discarding 220 transitions out of 271. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5527 resets) in 2069 ms. (19 steps per ms) remains 17/50 properties
BEST_FIRST walk for 4004 steps (76 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (74 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (80 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (74 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (107 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (68 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (73 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (74 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (77 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (71 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (70 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (66 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (70 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (69 resets) in 8 ms. (444 steps per ms) remains 14/15 properties
[2024-05-23 14:51:49] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2024-05-23 14:51:49] [INFO ] Invariant cache hit.
[2024-05-23 14:51:49] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 5 places in 38 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, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 219/283 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/284 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/284 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 232 constraints, problems are : Problem set: 0 solved, 14 unsolved in 744 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: 14/14 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 219/283 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 14/245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/284 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/284 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 246 constraints, problems are : Problem set: 0 solved, 14 unsolved in 942 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: 14/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 1717ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 8 properties in 1239 ms.
Support contains 16 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 271/271 transitions.
Graph (complete) has 385 edges and 64 vertex of which 55 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 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 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 55 transition count 253
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 47 transition count 213
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 47 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 44 place count 47 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 46 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 46 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 45 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 45 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 45 transition count 176
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 76 place count 45 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 78 place count 44 transition count 156
Applied a total of 78 rules in 50 ms. Remains 44 /64 variables (removed 20) and now considering 156/271 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 44/64 places, 156/271 transitions.
RANDOM walk for 4000000 steps (554985 resets) in 8729 ms. (458 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (89509 resets) in 3844 ms. (1040 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (89457 resets) in 2004 ms. (1995 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (101255 resets) in 2471 ms. (1618 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (73636 resets) in 2037 ms. (1962 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (73783 resets) in 2006 ms. (1993 steps per ms) remains 4/5 properties
[2024-05-23 14:51:58] [INFO ] Flow matrix only has 141 transitions (discarded 15 similar events)
// Phase 1: matrix 141 rows 44 cols
[2024-05-23 14:51:58] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 14:51:58] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 141/185 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/44 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 141/185 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 93 ms.
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 156/156 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 41 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 39 transition count 126
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 39 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 37 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 37 transition count 120
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 37 transition count 108
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 37 transition count 108
Applied a total of 34 rules in 15 ms. Remains 37 /44 variables (removed 7) and now considering 108/156 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 37/44 places, 108/156 transitions.
RANDOM walk for 4000000 steps (571936 resets) in 6602 ms. (605 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (91677 resets) in 1802 ms. (2218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (91915 resets) in 1749 ms. (2285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (107396 resets) in 2228 ms. (1794 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1862 steps, run visited all 3 properties in 18 ms. (steps per millisecond=103 )
Probabilistic random walk after 1862 steps, saw 739 distinct states, run finished after 21 ms. (steps per millisecond=88 ) 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 41074 ms.
ITS solved all properties within timeout

BK_STOP 1716475922489

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

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