Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604200783.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HealthRecord-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604200783
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 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 70K 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-11-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717201420110

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:23:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:23:41] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 00:23:41] [INFO ] Transformed 159 places.
[2024-06-01 00:23:41] [INFO ] Transformed 334 transitions.
[2024-06-01 00:23:41] [INFO ] Found NUPN structural information;
[2024-06-01 00:23:41] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
RANDOM walk for 40000 steps (2679 resets) in 2100 ms. (19 steps per ms) remains 11/16 properties
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (360 resets) in 701 ms. (56 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (390 resets) in 1339 ms. (29 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (387 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (389 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (381 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (394 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (399 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (247 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (393 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (387 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (395 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
[2024-06-01 00:23:43] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2024-06-01 00:23:43] [INFO ] Computed 18 invariants in 9 ms
[2024-06-01 00:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 36/130 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 29/159 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 29/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 294/453 variables, 159/336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/454 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 337 constraints, problems are : Problem set: 0 solved, 11 unsolved in 949 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 36/130 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 12 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 29/159 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 29/184 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
Problem HealthRecord-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 16/200 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 5/205 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 6 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 4 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:23:47] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 12/217 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 294/453 variables, 159/376 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 10/386 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:23:48] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 1/387 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/454 variables, 1/388 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 389 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5009 ms.
Refiners :[Domain max(s): 159/159 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 42/42 constraints]
After SMT, in 6184ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (complete) has 677 edges and 159 vertex of which 151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 151 transition count 294
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 41 place count 116 transition count 224
Iterating global reduction 1 with 35 rules applied. Total rules applied 76 place count 116 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 113 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 113 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 113 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 113 transition count 216
Applied a total of 86 rules in 38 ms. Remains 113 /159 variables (removed 46) and now considering 216/307 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 113/159 places, 216/307 transitions.
RANDOM walk for 40000 steps (2717 resets) in 536 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (362 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (393 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (392 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (390 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (389 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (386 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (238 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (389 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (384 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (384 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 984861 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :1 out of 10
Probabilistic random walk after 984861 steps, saw 127488 distinct states, run finished after 3004 ms. (steps per millisecond=327 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 216 rows 113 cols
[2024-06-01 00:23:52] [INFO ] Computed 10 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 19/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 15/113 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 216/329 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 123 constraints, problems are : Problem set: 0 solved, 9 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 19/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 15/113 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:53] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:23:54] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 216/329 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:23:55] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:23:56] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:23:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:23:56] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/329 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/329 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 170 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 38/38 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1300 ms.
Support contains 60 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 216/216 transitions.
Graph (trivial) has 19 edges and 113 vertex of which 4 / 113 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 94 transition count 178
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 94 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 40 place count 94 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 93 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 93 transition count 171
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 1 with 2 rules applied. Total rules applied 44 place count 92 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 92 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 46 place count 92 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 91 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 91 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 90 transition count 166
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 90 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 89 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 89 transition count 164
Applied a total of 54 rules in 40 ms. Remains 89 /113 variables (removed 24) and now considering 164/216 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 89/113 places, 164/216 transitions.
RANDOM walk for 40000 steps (3084 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (460 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (515 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (510 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (505 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2658454 steps, run timeout after 3001 ms. (steps per millisecond=885 ) properties seen :3 out of 4
Probabilistic random walk after 2658454 steps, saw 325214 distinct states, run finished after 3001 ms. (steps per millisecond=885 ) properties seen :3
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 164 rows 89 cols
[2024-06-01 00:24:01] [INFO ] Computed 10 invariants in 4 ms
[2024-06-01 00:24:01] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/89 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 164/253 variables, 89/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/253 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 89/89 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/89 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:24:01] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:24:01] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 164/253 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 89/89 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 29 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 164/164 transitions.
Graph (trivial) has 43 edges and 89 vertex of which 2 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 369 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 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 87 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 86 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 85 transition count 160
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 21 place count 70 transition count 130
Iterating global reduction 2 with 15 rules applied. Total rules applied 36 place count 70 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 70 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 68 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 68 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 67 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 67 transition count 121
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 3 with 2 rules applied. Total rules applied 45 place count 66 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 66 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 50 place count 64 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 64 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 63 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 63 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 62 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 62 transition count 118
Applied a total of 55 rules in 38 ms. Remains 62 /89 variables (removed 27) and now considering 118/164 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 62/89 places, 118/164 transitions.
RANDOM walk for 40000 steps (4131 resets) in 458 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (709 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2123112 steps, run visited all 1 properties in 1766 ms. (steps per millisecond=1202 )
Probabilistic random walk after 2123112 steps, saw 254631 distinct states, run finished after 1770 ms. (steps per millisecond=1199 ) properties seen :1
FORMULA HealthRecord-PT-11-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 22487 ms.
ITS solved all properties within timeout

BK_STOP 1717201443822

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-11, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604200783"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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