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

--------------------
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

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

=== Now, execution of the tool begins

BK_START 1717201296195

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:21:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:21:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:21:37] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 00:21:37] [INFO ] Transformed 157 places.
[2024-06-01 00:21:37] [INFO ] Transformed 327 transitions.
[2024-06-01 00:21:37] [INFO ] Found NUPN structural information;
[2024-06-01 00:21:37] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
RANDOM walk for 40000 steps (2366 resets) in 2208 ms. (18 steps per ms) remains 13/16 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (354 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (207 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (342 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (345 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (376 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (354 resets) in 72 ms. (547 steps per ms) remains 12/13 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (354 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (331 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (351 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (229 resets) in 806 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (353 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (261 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (346 resets) in 31 ms. (1250 steps per ms) remains 12/12 properties
[2024-06-01 00:21:39] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-06-01 00:21:39] [INFO ] Computed 18 invariants in 16 ms
[2024-06-01 00:21:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem HealthRecord-PT-09-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem HealthRecord-PT-09-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-09-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 25/140 variables, 10/125 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 25/150 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/153 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/157 variables, 5/158 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 17/175 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 288/445 variables, 157/332 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/446 variables, 1/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 333 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1157 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem HealthRecord-PT-09-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 33/132 variables, 10/109 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 33/142 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/143 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 00:21:40] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 18 ms to minimize.
[2024-06-01 00:21:40] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 4/147 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 3/150 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/152 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/152 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/157 variables, 7/159 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 25/184 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:21:41] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 10 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
Problem HealthRecord-PT-09-ReachabilityFireability-2024-03 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 12/196 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 5/201 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 7/208 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/209 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 5 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 2/211 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 2 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 5/216 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 0/216 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 288/445 variables, 157/373 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 7/380 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 5/385 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 4/389 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/446 variables, and 389 constraints, problems are : Problem set: 5 solved, 7 unsolved in 5009 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 50/50 constraints]
After SMT, in 6372ms problems are : Problem set: 5 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 26 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 659 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 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 147 transition count 281
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 146 transition count 280
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 39 place count 112 transition count 212
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 112 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 111 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 111 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 110 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 110 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 110 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 109 transition count 205
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 109 transition count 205
Applied a total of 84 rules in 72 ms. Remains 109 /157 variables (removed 48) and now considering 205/301 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 109/157 places, 205/301 transitions.
RANDOM walk for 40000 steps (2676 resets) in 443 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (405 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (257 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (438 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (410 resets) in 36 ms. (1081 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (426 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (416 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (416 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
// Phase 1: matrix 205 rows 109 cols
[2024-06-01 00:21:45] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/314 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 120 constraints, problems are : Problem set: 0 solved, 6 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 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/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/109 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 205/314 variables, 109/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 144 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 18/18 constraints]
After SMT, in 2137ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 988 ms.
Support contains 77 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 105 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 104 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 104 transition count 195
Applied a total of 11 rules in 11 ms. Remains 104 /109 variables (removed 5) and now considering 195/205 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/109 places, 195/205 transitions.
RANDOM walk for 40000 steps (2701 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (407 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (254 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (445 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1367721 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :0 out of 3
Probabilistic random walk after 1367721 steps, saw 186075 distinct states, run finished after 3007 ms. (steps per millisecond=454 ) properties seen :0
// Phase 1: matrix 195 rows 104 cols
[2024-06-01 00:21:52] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/104 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 195/299 variables, 104/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 115 constraints, problems are : Problem set: 0 solved, 3 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 195/299 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:21:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/299 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 127 constraints, problems are : Problem set: 0 solved, 3 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1162ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 261 ms.
Support contains 70 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 195/195 transitions.
Graph (trivial) has 3 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 98 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 98 transition count 184
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 98 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 97 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 97 transition count 182
Applied a total of 14 rules in 20 ms. Remains 97 /104 variables (removed 7) and now considering 182/195 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 97/104 places, 182/195 transitions.
RANDOM walk for 40000 steps (2637 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (424 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (451 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1505461 steps, run visited all 2 properties in 2124 ms. (steps per millisecond=708 )
Probabilistic random walk after 1505461 steps, saw 202907 distinct states, run finished after 2127 ms. (steps per millisecond=707 ) properties seen :2
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 18557 ms.
ITS solved all properties within timeout

BK_STOP 1717201315932

--------------------
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-09"
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-09, 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-171640604100767"
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 [ "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 ;