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.r180-tall-171640604100743.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
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 r180-tall-171640604100743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716519678182

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 03:01:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:01:19] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-24 03:01:19] [INFO ] Transformed 154 places.
[2024-05-24 03:01:19] [INFO ] Transformed 319 transitions.
[2024-05-24 03:01:19] [INFO ] Found NUPN structural information;
[2024-05-24 03:01:19] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
RANDOM walk for 40000 steps (2000 resets) in 1713 ms. (23 steps per ms) remains 9/16 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (246 resets) in 595 ms. (67 steps per ms) remains 8/9 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (270 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
[2024-05-24 03:01:20] [INFO ] Flatten gal took : 94 ms
BEST_FIRST walk for 40004 steps (156 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
[2024-05-24 03:01:20] [INFO ] Flatten gal took : 48 ms
BEST_FIRST walk for 40004 steps (276 resets) in 66 ms. (597 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (273 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
[2024-05-24 03:01:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7374101740731555224.gal : 39 ms
BEST_FIRST walk for 40004 steps (274 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2024-05-24 03:01:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3067943589965445425.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7374101740731555224.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3067943589965445425.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (282 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (269 resets) in 50 ms. (784 steps per ms) remains 7/7 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3067943589965445425.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 49
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :49 after 6913
[2024-05-24 03:01:20] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2024-05-24 03:01:20] [INFO ] Computed 18 invariants in 23 ms
[2024-05-24 03:01:20] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :6913 after 36865
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :36865 after 46081
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :46081 after 59905
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :59905 after 158209
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :158209 after 371713
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 50/112 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 42/154 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 42/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :371713 after 1.71725e+06
At refinement iteration 8 (OVERLAPS) 281/435 variables, 154/326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 03:01:22] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 20 ms to minimize.
[2024-05-24 03:01:22] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 1 ms to minimize.
[2024-05-24 03:01:22] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.71725e+06 after 5.09491e+06
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/436 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/436 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 333 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2512 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 50/112 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 50/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:01:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 5 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HealthRecord-PT-06-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 42/154 variables, 8/139 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 42/181 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 10 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 17 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:01:24] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 3 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 12/197 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 4/201 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:01:25] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 3/205 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 2/207 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 281/435 variables, 154/361 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 6/367 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 4/371 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:26] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :5.09491e+06 after 1.08672e+07
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/435 variables, 1/377 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:01:27] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 2/379 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1/436 variables, 1/380 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:01:28] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:01:28] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:01:28] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/436 variables, 3/383 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/436 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 383 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5013 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 50/50 constraints]
After SMT, in 7764ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 113 edges and 154 vertex of which 8 / 154 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 642 edges and 150 vertex of which 142 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) 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 142 transition count 270
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 139 transition count 266
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 14 place count 138 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 138 transition count 263
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 19 place count 135 transition count 263
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 60 place count 94 transition count 181
Iterating global reduction 3 with 41 rules applied. Total rules applied 101 place count 94 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 90 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 90 transition count 173
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 87 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 87 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 85 transition count 178
Applied a total of 120 rules in 68 ms. Remains 85 /154 variables (removed 69) and now considering 178/294 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 85/154 places, 178/294 transitions.
RANDOM walk for 40000 steps (4111 resets) in 413 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (811 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (402 resets) in 97 ms. (408 steps per ms) remains 5/6 properties
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (780 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (813 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (839 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (803 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
// Phase 1: matrix 178 rows 85 cols
[2024-05-24 03:01:28] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:01:28] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/85 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 178/263 variables, 85/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 11/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/85 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:29] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 178/263 variables, 85/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:01:30] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/263 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/263 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 139 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 29/29 constraints]
After SMT, in 1910ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 429 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 178/178 transitions.
Graph (trivial) has 109 edges and 85 vertex of which 6 / 85 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 354 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 80 transition count 171
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 79 transition count 169
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 78 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 78 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 11 place count 76 transition count 167
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 42 place count 45 transition count 105
Iterating global reduction 3 with 31 rules applied. Total rules applied 73 place count 45 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 38 transition count 86
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 38 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 93 place count 38 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 36 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 36 transition count 74
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 103 place count 36 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 108 place count 33 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 33 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 116 place count 30 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 117 place count 29 transition count 87
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 29 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 123 place count 29 transition count 82
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 124 place count 28 transition count 76
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 28 transition count 76
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 126 place count 27 transition count 73
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 27 transition count 73
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 132 place count 27 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 134 place count 26 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 136 place count 26 transition count 78
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 138 place count 26 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 140 place count 24 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 143 place count 24 transition count 73
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 152 place count 24 transition count 73
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 160 place count 24 transition count 73
Applied a total of 160 rules in 34 ms. Remains 24 /85 variables (removed 61) and now considering 73/178 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 24/85 places, 73/178 transitions.
RANDOM walk for 40000 steps (12705 resets) in 547 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1598 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 709 steps, run visited all 1 properties in 8 ms. (steps per millisecond=88 )
Probabilistic random walk after 709 steps, saw 300 distinct states, run finished after 12 ms. (steps per millisecond=59 ) properties seen :1
FORMULA HealthRecord-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 12132 ms.

BK_STOP 1716519691537

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="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-5568"
echo " Executing tool itstools"
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 r180-tall-171640604100743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;