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.r496-tall-171640604200791.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-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604200791
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 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 71K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-12-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717201498192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:24:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:24:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:24:59] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-01 00:24:59] [INFO ] Transformed 160 places.
[2024-06-01 00:24:59] [INFO ] Transformed 340 transitions.
[2024-06-01 00:24:59] [INFO ] Found NUPN structural information;
[2024-06-01 00:24:59] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
RANDOM walk for 40000 steps (2901 resets) in 1776 ms. (22 steps per ms) remains 11/16 properties
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (360 resets) in 699 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (219 resets) in 761 ms. (52 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (357 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (361 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (348 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (309 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (212 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (334 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (361 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (366 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (351 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
[2024-06-01 00:25:00] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2024-06-01 00:25:00] [INFO ] Computed 18 invariants in 13 ms
[2024-06-01 00:25:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 32/129 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 32/139 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 31/160 variables, 8/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 31/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 299/459 variables, 160/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/460 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/460 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 339 constraints, problems are : Problem set: 0 solved, 11 unsolved in 975 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-12-ReachabilityFireability-2024-06 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-12-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 32/129 variables, 10/107 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 32/139 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 11 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 7/146 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/147 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem HealthRecord-PT-12-ReachabilityFireability-2024-00 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 31/160 variables, 8/155 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 31/186 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:25:02] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 3 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
Problem HealthRecord-PT-12-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:25:03] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
Problem HealthRecord-PT-12-ReachabilityFireability-2024-08 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 20/206 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 4 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 10/216 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:04] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 8/224 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 1/225 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:25:05] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 2/227 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 0/227 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 299/459 variables, 160/387 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 7/394 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:06] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 1/395 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 0/395 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/460 variables, 1/396 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-01 00:25:06] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:25:06] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:25:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/460 variables, 3/399 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 399 constraints, problems are : Problem set: 4 solved, 7 unsolved in 5010 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 53/53 constraints]
After SMT, in 6165ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 119 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 682 edges and 158 vertex of which 150 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 294
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 149 transition count 292
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 148 transition count 291
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 67 place count 89 transition count 173
Iterating global reduction 3 with 59 rules applied. Total rules applied 126 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 88 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 88 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 86 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 84 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 84 transition count 179
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 154 place count 84 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 84 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 84 transition count 178
Applied a total of 156 rules in 80 ms. Remains 84 /160 variables (removed 76) and now considering 178/312 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 84/160 places, 178/312 transitions.
RANDOM walk for 40000 steps (4059 resets) in 437 ms. (91 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (578 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (592 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (569 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (588 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (603 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (595 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
// Phase 1: matrix 178 rows 84 cols
[2024-06-01 00:25:07] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 00:25:07] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 54/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/84 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 178/262 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 106 constraints, problems are : Problem set: 0 solved, 6 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 54/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:25:07] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-06-01 00:25:07] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:25:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 3 ms to minimize.
[2024-06-01 00:25:07] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/84 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:25:08] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 178/262 variables, 84/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:25:09] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:25:09] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/262 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:25:09] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/262 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:25:09] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/262 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/262 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 136 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 24/24 constraints]
After SMT, in 2421ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 3654 steps, including 193 resets, run visited all 6 properties in 12 ms. (steps per millisecond=304 )
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 22 ms.
All properties solved without resorting to model-checking.
Total runtime 10708 ms.
ITS solved all properties within timeout

BK_STOP 1717201510056

--------------------
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 ReachabilityFireability -timeout 360 -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-12"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-12, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604200791"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;