fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640602300759
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for HealthRecord-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
408.928 11408.00 26193.00 109.40 TTFTTTFFTTTFTTFF normal

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.r179-tall-171640602300759.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300759
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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-08-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716490726128

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:58:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 18:58:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:58:47] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-23 18:58:47] [INFO ] Transformed 156 places.
[2024-05-23 18:58:47] [INFO ] Transformed 326 transitions.
[2024-05-23 18:58:47] [INFO ] Found NUPN structural information;
[2024-05-23 18:58:47] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 172 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 26 transitions
Reduce redundant transitions removed 26 transitions.
RANDOM walk for 40000 steps (2243 resets) in 1992 ms. (20 steps per ms) remains 9/16 properties
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (297 resets) in 351 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (292 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (292 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (294 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (176 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (302 resets) in 545 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (163 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (198 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (169 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
[2024-05-23 18:58:48] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2024-05-23 18:58:48] [INFO ] Computed 18 invariants in 18 ms
[2024-05-23 18:58:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HealthRecord-PT-08-ReachabilityFireability-2024-07 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-08-ReachabilityFireability-2024-11 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-08-ReachabilityFireability-2024-14 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 38/133 variables, 10/105 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 38/143 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/144 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 23/156 variables, 7/151 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 23/174 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 287/443 variables, 156/330 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/444 variables, 1/331 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/444 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 331 constraints, problems are : Problem set: 3 solved, 6 unsolved in 715 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 61/110 variables, 10/59 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 61/120 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 11 ms to minimize.
[2024-05-23 18:58:49] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/124 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 46/156 variables, 8/132 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 46/178 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
Problem HealthRecord-PT-08-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 4/182 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 2/184 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/184 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 287/443 variables, 156/340 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 5/345 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:58:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 3/348 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 5 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 10/358 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:58:51] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 2/360 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:58:52] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 4/364 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/443 variables, 0/364 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/444 variables, 1/365 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/365 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/365 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 365 constraints, problems are : Problem set: 4 solved, 5 unsolved in 3119 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 29/29 constraints]
After SMT, in 4016ms problems are : Problem set: 4 solved, 5 unsolved
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 736 ms.
Support contains 10 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 188 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 650 edges and 150 vertex of which 140 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 140 transition count 269
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 134 transition count 262
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 133 transition count 260
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 131 transition count 259
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 27 place count 131 transition count 256
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 35 place count 126 transition count 256
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 106 place count 55 transition count 114
Iterating global reduction 4 with 71 rules applied. Total rules applied 177 place count 55 transition count 114
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 186 place count 46 transition count 96
Iterating global reduction 4 with 9 rules applied. Total rules applied 195 place count 46 transition count 96
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 204 place count 46 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 210 place count 43 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 43 transition count 110
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 214 place count 43 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 217 place count 40 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 40 transition count 105
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 236 place count 40 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 40 transition count 105
Applied a total of 237 rules in 79 ms. Remains 40 /156 variables (removed 116) and now considering 105/300 (removed 195) transitions.
Running 101 sub problems to find dead transitions.
[2024-05-23 18:58:53] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 40 cols
[2024-05-23 18:58:53] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 18:58:53] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 97/137 variables, 40/46 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/74 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/137 variables, 0/74 constraints. Problems are: Problem set: 2 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 74 constraints, problems are : Problem set: 2 solved, 99 unsolved in 1440 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 97/137 variables, 40/46 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/74 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 99/173 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 173 constraints, problems are : Problem set: 2 solved, 99 unsolved in 2019 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 99/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3594ms problems are : Problem set: 2 solved, 99 unsolved
Search for dead transitions found 2 dead transitions in 3596ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/156 places, 103/300 transitions.
Graph (complete) has 164 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 38 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 37 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 37 transition count 96
Applied a total of 5 rules in 12 ms. Remains 37 /40 variables (removed 3) and now considering 96/103 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3704 ms. Remains : 37/156 places, 96/300 transitions.
RANDOM walk for 40000 steps (2494 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (567 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6516 steps, run visited all 2 properties in 28 ms. (steps per millisecond=232 )
Probabilistic random walk after 6516 steps, saw 1593 distinct states, run finished after 32 ms. (steps per millisecond=203 ) properties seen :2
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10178 ms.
ITS solved all properties within timeout

BK_STOP 1716490737536

--------------------
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-08"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-08, 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 r179-tall-171640602300759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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