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

About the Execution of LTSMin+red for HealthRecord-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
322.243 6876.00 17286.00 98.40 TTFFFFFFTTFFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604000710.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-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604000710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-02-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717200778187

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:12:59] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-01 00:12:59] [INFO ] Transformed 119 places.
[2024-06-01 00:12:59] [INFO ] Transformed 225 transitions.
[2024-06-01 00:12:59] [INFO ] Found NUPN structural information;
[2024-06-01 00:12:59] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2361 resets) in 2227 ms. (17 steps per ms) remains 10/13 properties
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (71 resets) in 406 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (352 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (366 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (367 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (307 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (358 resets) in 143 ms. (277 steps per ms) remains 9/10 properties
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (365 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
[2024-06-01 00:13:00] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2024-06-01 00:13:00] [INFO ] Computed 14 invariants in 16 ms
[2024-06-01 00:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 26/104 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 26/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 15/119 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 15/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HealthRecord-PT-02-ReachabilityCardinality-2024-02 is UNSAT
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 210/329 variables, 119/252 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/330 variables, 1/253 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/330 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 253 constraints, problems are : Problem set: 1 solved, 8 unsolved in 780 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 32/103 variables, 8/79 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 32/111 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 16 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 20 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 7 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
Problem HealthRecord-PT-02-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 13/124 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 8 ms to minimize.
[2024-06-01 00:13:02] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/126 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/127 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/128 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem HealthRecord-PT-02-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 16/119 variables, 6/135 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 16/151 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
Problem HealthRecord-PT-02-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 8/159 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 1/160 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-06-01 00:13:03] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 2/162 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 210/329 variables, 119/281 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/329 variables, 5/286 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 3 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 5/291 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-06-01 00:13:04] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/329 variables, 1/292 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/329 variables, 0/292 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/330 variables, 1/293 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/330 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/330 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 293 constraints, problems are : Problem set: 4 solved, 5 unsolved in 3113 ms.
Refiners :[Domain max(s): 119/119 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 35/35 constraints]
After SMT, in 4014ms problems are : Problem set: 4 solved, 5 unsolved
Finished Parikh walk after 110 steps, including 2 resets, run visited all 5 properties in 3 ms. (steps per millisecond=36 )
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-02-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 11 ms.
All properties solved without resorting to model-checking.
Total runtime 5681 ms.
ITS solved all properties within timeout

BK_STOP 1717200785063

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-02"
export BK_EXAMINATION="ReachabilityCardinality"
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-02, examination is ReachabilityCardinality"
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-171640604000710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-02.tgz
mv HealthRecord-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;