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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 27K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 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 67K 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-06-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717201089128

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:18:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:18:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:18:10] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 00:18:10] [INFO ] Transformed 154 places.
[2024-06-01 00:18:10] [INFO ] Transformed 319 transitions.
[2024-06-01 00:18:10] [INFO ] Found NUPN structural information;
[2024-06-01 00:18:10] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
RANDOM walk for 40000 steps (2009 resets) in 2526 ms. (15 steps per ms) remains 8/16 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (244 resets) in 317 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (264 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (167 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (263 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (256 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (272 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (268 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (273 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
[2024-06-01 00:18:11] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2024-06-01 00:18:11] [INFO ] Computed 18 invariants in 16 ms
[2024-06-01 00:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 37/127 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 27/154 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 27/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 281/435 variables, 154/326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/436 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/436 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 327 constraints, problems are : Problem set: 0 solved, 8 unsolved in 892 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 37/127 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 00:18:12] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 13 ms to minimize.
[2024-06-01 00:18:12] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-06-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 27/154 variables, 8/159 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 27/186 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:18:13] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 7/193 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 6/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 281/435 variables, 154/353 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 7/360 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 00:18:14] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 6/366 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 00:18:15] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 1/367 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/435 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1/436 variables, 1/368 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/436 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 368 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3912 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 34/34 constraints]
After SMT, in 4949ms problems are : Problem set: 1 solved, 7 unsolved
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 566 ms.
Support contains 13 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 201 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 636 edges and 147 vertex of which 137 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 137 transition count 261
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 22 place count 131 transition count 253
Reduce places removed 2 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 2 with 4 rules applied. Total rules applied 26 place count 129 transition count 251
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 128 transition count 250
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 28 place count 128 transition count 246
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 39 place count 121 transition count 246
Discarding 64 places :
Symmetric choice reduction at 4 with 64 rule applications. Total rules 103 place count 57 transition count 118
Iterating global reduction 4 with 64 rules applied. Total rules applied 167 place count 57 transition count 118
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 175 place count 49 transition count 102
Iterating global reduction 4 with 8 rules applied. Total rules applied 183 place count 49 transition count 102
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 190 place count 49 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 198 place count 45 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 201 place count 45 transition count 112
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 217 place count 45 transition count 112
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 232 place count 45 transition count 112
Applied a total of 232 rules in 54 ms. Remains 45 /154 variables (removed 109) and now considering 112/294 (removed 182) transitions.
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 112 rows 45 cols
[2024-06-01 00:18:17] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 00:18:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 3 (OVERLAPS) 112/157 variables, 45/50 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 19/69 constraints. Problems are: Problem set: 16 solved, 92 unsolved
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
[2024-06-01 00:18:18] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/71 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/71 constraints. Problems are: Problem set: 16 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 71 constraints, problems are : Problem set: 16 solved, 92 unsolved in 1662 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 16 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 2/45 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 112/157 variables, 45/52 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 19/71 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 92/163 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/163 constraints. Problems are: Problem set: 16 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/163 constraints. Problems are: Problem set: 16 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 163 constraints, problems are : Problem set: 16 solved, 92 unsolved in 1755 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 92/108 constraints, Known Traps: 2/2 constraints]
After SMT, in 3531ms problems are : Problem set: 16 solved, 92 unsolved
Search for dead transitions found 16 dead transitions in 3533ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/154 places, 96/294 transitions.
Graph (complete) has 174 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 44 transition count 96
Applied a total of 4 rules in 6 ms. Remains 44 /45 variables (removed 1) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3605 ms. Remains : 44/154 places, 96/294 transitions.
RANDOM walk for 40000 steps (7050 resets) in 616 ms. (64 steps per ms) remains 3/4 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (1586 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1631 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1553 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
// Phase 1: matrix 96 rows 44 cols
[2024-06-01 00:18:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 00:18:21] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 79/106 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 34/140 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 68 constraints, problems are : Problem set: 0 solved, 3 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 79/106 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/140 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 71 constraints, problems are : Problem set: 0 solved, 3 unsolved in 111 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 87 ms.
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 96/96 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 39 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 39 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 37 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 37 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 36 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 36 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 36 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 31 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 31 transition count 79
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 31 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 30 transition count 78
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 36 place count 30 transition count 77
Applied a total of 36 rules in 17 ms. Remains 30 /44 variables (removed 14) and now considering 77/96 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 30/44 places, 77/96 transitions.
RANDOM walk for 40000 steps (8890 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1802 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2891 steps, run visited all 1 properties in 11 ms. (steps per millisecond=262 )
Probabilistic random walk after 2891 steps, saw 1034 distinct states, run finished after 14 ms. (steps per millisecond=206 ) properties seen :1
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11174 ms.
ITS solved all properties within timeout

BK_STOP 1717201101486

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

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