fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r203-smll-167840349300279
Last Updated
May 14, 2023

About the Execution of Smart+red for HealthRecord-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
514.472 51340.00 69880.00 627.60 FTTFTFTFTTTTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r203-smll-167840349300279.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
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 r203-smll-167840349300279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 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-00
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678577913850

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 23:38:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 23:38:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:38:37] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-11 23:38:37] [INFO ] Transformed 154 places.
[2023-03-11 23:38:37] [INFO ] Transformed 319 transitions.
[2023-03-11 23:38:37] [INFO ] Found NUPN structural information;
[2023-03-11 23:38:37] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 16) seen :4
FORMULA HealthRecord-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
FORMULA HealthRecord-PT-06-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 23:38:39] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2023-03-11 23:38:39] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-11 23:38:40] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2023-03-11 23:38:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 23:38:40] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 23:38:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 23:38:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2023-03-11 23:38:40] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-11 23:38:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:38:41] [INFO ] After 215ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2023-03-11 23:38:41] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 9 ms to minimize.
[2023-03-11 23:38:41] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 1 ms to minimize.
[2023-03-11 23:38:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-03-11 23:38:41] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-11 23:38:42] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2023-03-11 23:38:42] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2023-03-11 23:38:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 517 ms
[2023-03-11 23:38:42] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-11 23:38:42] [INFO ] After 2332ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA HealthRecord-PT-06-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 52 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 97 edges and 154 vertex of which 10 / 154 are part of one of the 5 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 640 edges and 149 vertex of which 140 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 140 transition count 268
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 137 transition count 263
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 135 transition count 261
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 135 transition count 259
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 132 transition count 259
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 65 place count 89 transition count 173
Iterating global reduction 3 with 43 rules applied. Total rules applied 108 place count 89 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 87 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 87 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 85 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 85 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 84 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 84 transition count 166
Applied a total of 120 rules in 97 ms. Remains 84 /154 variables (removed 70) and now considering 166/294 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 84/154 places, 166/294 transitions.
Incomplete random walk after 10000 steps, including 997 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 2178264 steps, run timeout after 3001 ms. (steps per millisecond=725 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 2178264 steps, saw 262742 distinct states, run finished after 3002 ms. (steps per millisecond=725 ) properties seen :7
FORMULA HealthRecord-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 166 rows 84 cols
[2023-03-11 23:38:46] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-11 23:38:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-11 23:38:46] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 23:38:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 23:38:46] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-11 23:38:46] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 23:38:46] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 166/166 transitions.
Graph (trivial) has 106 edges and 84 vertex of which 4 / 84 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 350 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 81 transition count 161
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 80 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 79 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 79 transition count 156
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 75 transition count 156
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 45 place count 44 transition count 94
Iterating global reduction 3 with 31 rules applied. Total rules applied 76 place count 44 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 38 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 38 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 94 place count 38 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 36 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 36 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 101 place count 36 transition count 67
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
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 109 place count 32 transition count 85
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 32 transition count 84
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 114 place count 32 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 118 place count 28 transition count 80
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 121 place count 28 transition count 77
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 134 place count 28 transition count 77
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 146 place count 28 transition count 77
Applied a total of 146 rules in 46 ms. Remains 28 /84 variables (removed 56) and now considering 77/166 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 28/84 places, 77/166 transitions.
Incomplete random walk after 10000 steps, including 1679 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 367 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1091 steps, run visited all 1 properties in 12 ms. (steps per millisecond=90 )
Probabilistic random walk after 1091 steps, saw 440 distinct states, run finished after 13 ms. (steps per millisecond=83 ) properties seen :1
FORMULA HealthRecord-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9098 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running HealthRecord (PT), instance 06
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 154 places, 319 transitions, 835 arcs.
Final Score: 2538.03
Took : 14 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA HealthRecord-PT-06-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA HealthRecord-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678577965190

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="smartxred"
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-5348"
echo " Executing tool smartxred"
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 r203-smll-167840349300279"
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 ;