fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300175
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HealthRecord-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
253.044 149061.00 288684.00 379.80 FFTTTTTTTTTFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477300175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K Apr 30 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 30 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 71K May 10 09:34 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-13-ReachabilityFireability-00
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-01
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-02
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-03
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-04
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-05
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-06
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-07
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-08
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-09
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-10
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-11
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-12
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-13
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-14
FORMULA_NAME HealthRecord-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654187240195

Running Version 202205111006
[2022-06-02 16:27:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:27:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:27:23] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2022-06-02 16:27:23] [INFO ] Transformed 161 places.
[2022-06-02 16:27:23] [INFO ] Transformed 341 transitions.
[2022-06-02 16:27:23] [INFO ] Found NUPN structural information;
[2022-06-02 16:27:23] [INFO ] Parsed PT model containing 161 places and 341 transitions in 425 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Incomplete random walk after 10000 steps, including 777 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA HealthRecord-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-06-02 16:27:25] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2022-06-02 16:27:25] [INFO ] Computed 18 place invariants in 22 ms
[2022-06-02 16:27:26] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-02 16:27:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2022-06-02 16:27:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2022-06-02 16:27:27] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2022-06-02 16:27:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 16:27:27] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :5 sat :9
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 6 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2022-06-02 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2022-06-02 16:27:28] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2022-06-02 16:27:28] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2022-06-02 16:27:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2022-06-02 16:27:28] [INFO ] After 1425ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 301 ms.
[2022-06-02 16:27:28] [INFO ] After 2546ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
FORMULA HealthRecord-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HealthRecord-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1984 ms.
Support contains 29 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 129 edges and 161 vertex of which 2 / 161 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 687 edges and 160 vertex of which 150 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Discarding 10 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 297
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 149 transition count 296
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 73 place count 81 transition count 160
Iterating global reduction 2 with 68 rules applied. Total rules applied 141 place count 81 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 77 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 77 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 151 place count 77 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 74 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 74 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 164 place count 71 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 71 transition count 162
Applied a total of 165 rules in 101 ms. Remains 71 /161 variables (removed 90) and now considering 162/313 (removed 151) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/161 places, 162/313 transitions.
Incomplete random walk after 1000000 steps, including 114207 resets, run finished after 26329 ms. (steps per millisecond=37 ) properties (out of 9) seen :3
FORMULA HealthRecord-PT-13-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 892135 steps, including 16976 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 18812 resets, run finished after 4803 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 18793 resets, run finished after 4973 ms. (steps per millisecond=201 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 960798 steps, including 18148 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 8673 resets, run finished after 3085 ms. (steps per millisecond=324 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 18985 resets, run finished after 4113 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-02 16:28:24] [INFO ] Flow matrix only has 157 transitions (discarded 5 similar events)
// Phase 1: matrix 157 rows 71 cols
[2022-06-02 16:28:24] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-02 16:28:24] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-02 16:28:24] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-02 16:28:24] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-02 16:28:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 16:28:24] [INFO ] After 52ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-02 16:28:24] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-06-02 16:28:24] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2022-06-02 16:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2022-06-02 16:28:24] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2022-06-02 16:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-02 16:28:24] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-02 16:28:24] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 22 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 162/162 transitions.
Graph (trivial) has 38 edges and 71 vertex of which 6 / 71 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 154
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 66 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 63 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 63 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 62 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 24 place count 62 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 61 transition count 144
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 42 place count 61 transition count 144
Applied a total of 42 rules in 33 ms. Remains 61 /71 variables (removed 10) and now considering 144/162 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/71 places, 144/162 transitions.
Incomplete random walk after 1000000 steps, including 88621 resets, run finished after 22852 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
FORMULA HealthRecord-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 924163 steps, including 15019 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 16218 resets, run finished after 4614 ms. (steps per millisecond=216 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 16222 resets, run finished after 4950 ms. (steps per millisecond=202 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 16241 resets, run finished after 4491 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-02 16:29:06] [INFO ] Flow matrix only has 137 transitions (discarded 7 similar events)
// Phase 1: matrix 137 rows 61 cols
[2022-06-02 16:29:06] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-02 16:29:06] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 16:29:07] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-02 16:29:07] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 16:29:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 16:29:07] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 16:29:07] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-06-02 16:29:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-02 16:29:07] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2022-06-02 16:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2022-06-02 16:29:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2022-06-02 16:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-02 16:29:07] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-02 16:29:07] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 144/144 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 141
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 23 place count 59 transition count 141
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 59 transition count 141
Applied a total of 25 rules in 31 ms. Remains 59 /61 variables (removed 2) and now considering 141/144 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 141/144 transitions.
Incomplete random walk after 1000000 steps, including 87235 resets, run finished after 21776 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 964256 steps, including 15819 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 16385 resets, run finished after 4496 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 16309 resets, run finished after 4914 ms. (steps per millisecond=203 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 16481 resets, run finished after 4504 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Finished probabilistic random walk after 443052 steps, run visited all 4 properties in 821 ms. (steps per millisecond=539 )
Probabilistic random walk after 443052 steps, saw 78630 distinct states, run finished after 822 ms. (steps per millisecond=538 ) properties seen :4
FORMULA HealthRecord-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 146442 ms.

BK_STOP 1654187389256

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-13, 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 r114-smll-165264477300175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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