About the Execution of GreatSPN+red for ResAllocation-PT-R003C020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
289.752 | 4421.00 | 11212.00 | 92.90 | FFFFTFFTFTTTFFFT | 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.r311-tall-171662337500823.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 greatspnxred
Input is ResAllocation-PT-R003C020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337500823
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 11 23:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 23:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 ResAllocation-PT-R003C020-ReachabilityFireability-2024-00
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-01
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-02
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-03
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-04
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-05
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-06
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-07
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-08
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-09
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-10
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-11
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-12
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-13
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-14
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716775192088
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 01:59:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 01:59:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:59:53] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-27 01:59:53] [INFO ] Transformed 120 places.
[2024-05-27 01:59:53] [INFO ] Transformed 80 transitions.
[2024-05-27 01:59:53] [INFO ] Found NUPN structural information;
[2024-05-27 01:59:53] [INFO ] Parsed PT model containing 120 places and 80 transitions and 354 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (905 resets) in 1922 ms. (20 steps per ms) remains 6/14 properties
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 518 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 1154 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
// Phase 1: matrix 80 rows 120 cols
[2024-05-27 01:59:54] [INFO ] Computed 60 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ResAllocation-PT-R003C020-ReachabilityFireability-2024-00 is UNSAT
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ResAllocation-PT-R003C020-ReachabilityFireability-2024-01 is UNSAT
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 44/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 16/168 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 12/180 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 80/200 variables, 120/300 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/300 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/300 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 300 constraints, problems are : Problem set: 2 solved, 4 unsolved in 497 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 93/93 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem ResAllocation-PT-R003C020-ReachabilityFireability-2024-04 is UNSAT
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ResAllocation-PT-R003C020-ReachabilityFireability-2024-10 is UNSAT
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 27/120 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 11 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 22/115 variables, 30/153 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 22/175 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 01:59:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 5/180 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/119 variables, 2/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 4/186 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/186 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/120 variables, 1/187 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 1/188 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/188 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 80/200 variables, 120/308 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 2/310 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-27 01:59:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 1/311 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-27 01:59:56] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 01:59:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 2/313 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 0/313 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/200 variables, 0/313 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 313 constraints, problems are : Problem set: 4 solved, 2 unsolved in 722 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 1372ms problems are : Problem set: 4 solved, 2 unsolved
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 29 ms.
Support contains 10 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 106 transition count 66
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 45 place count 106 transition count 49
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_6_2.t_6_3 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 rules applied. Total rules applied 50 place count 62 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 58 place count 57 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 76 place count 46 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 81 place count 46 transition count 29
Ensure Unique test removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 85 place count 42 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 42 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 38 transition count 27
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 38 transition count 25
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 98 place count 33 transition count 25
Applied a total of 98 rules in 39 ms. Remains 33 /120 variables (removed 87) and now considering 25/80 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 33/120 places, 25/80 transitions.
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3636 steps (1 resets) in 24 ms. (145 steps per ms) remains 0/1 properties
FORMULA ResAllocation-PT-R003C020-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 3223 ms.
ITS solved all properties within timeout
BK_STOP 1716775196509
--------------------
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 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="ResAllocation-PT-R003C020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ResAllocation-PT-R003C020, 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 r311-tall-171662337500823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 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 '
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 ;