Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2265
Executing tool marcie
Input is CircularTrains-PT-048, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r008kn-ebro-143214239200372
=====================================================================

--------------------
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 CircularTrains-PT-048-ReachabilityBounds-0
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-1
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-10
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-11
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-12
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-13
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-14
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-15
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-2
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-3
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-4
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-5
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-6
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-7
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-8
FORMULA_NAME CircularTrains-PT-048-ReachabilityBounds-9

=== Now, execution of the tool begins

BK_START 1432335701245

Model: CircularTrains-PT-048
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 96 NrTr: 48 NrArc: 192)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 3084 (3.1e+03) #states 23,973,456,915 (10)



starting MCC model checker
--------------------------

checking: [[[[[[maxVal(F13)<=1 & maxVal(F8)<=1] & maxVal(F20)<=2] & [[maxVal(Section_47)<=1 & maxVal(Section_10)<=3] & [maxVal(F7)<=2 & maxVal(Section_36)<=1]]] & [[[maxVal(Section_46)<=3 & maxVal(Section_8)<=3] & [maxVal(Section_27)<=1 & maxVal(Section_15)<=1]] & maxVal(F15)<=2]] & maxVal(Section_35)<=3] & maxVal(F37)<=1]
normalized: [maxVal(F37)<=1 & [maxVal(Section_35)<=3 & [[[maxVal(F20)<=2 & [maxVal(F13)<=1 & maxVal(F8)<=1]] & [[maxVal(Section_47)<=1 & maxVal(Section_10)<=3] & [maxVal(F7)<=2 & maxVal(Section_36)<=1]]] & [maxVal(F15)<=2 & [[maxVal(Section_27)<=1 & maxVal(Section_15)<=1] & [maxVal(Section_46)<=3 & maxVal(Section_8)<=3]]]]]]

abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (2<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
-> the formula is FALSE

FORMULA CircularTrains-PT-048-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(F24)<=2 & maxVal(F30)<=3]
normalized: [maxVal(F24)<=2 & maxVal(F30)<=3]

abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(F10)<=2 & maxVal(F39)<=1] & [[[maxVal(Section_40)<=2 & [maxVal(Section_36)<=2 & maxVal(Section_22)<=3]] & [maxVal(Section_46)<=1 & maxVal(Section_29)<=1]] & maxVal(F13)<=3]] & maxVal(F31)<=1]
normalized: [maxVal(F31)<=1 & [[maxVal(F13)<=3 & [[maxVal(Section_46)<=1 & maxVal(Section_29)<=1] & [maxVal(Section_40)<=2 & [maxVal(Section_36)<=2 & maxVal(Section_22)<=3]]]] & [maxVal(F10)<=2 & maxVal(F39)<=1]]]

abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(F18)<=3 & [[[[maxVal(Section_24)<=1 & maxVal(Section_2)<=1] & maxVal(F20)<=2] & [[maxVal(Section_44)<=3 & maxVal(F36)<=3] & maxVal(Section_33)<=1]] & maxVal(Section_47)<=2]] & [[[[maxVal(Section_2)<=3 & [maxVal(F18)<=3 & maxVal(F6)<=3]] & [maxVal(F22)<=1 & maxVal(Section_35)<=3]] & maxVal(Section_41)<=1] & [[maxVal(F10)<=1 & maxVal(Section_12)<=1] & [maxVal(Section_27)<=3 & maxVal(Section_3)<=2]]]]
normalized: [[maxVal(F18)<=3 & [maxVal(Section_47)<=2 & [[maxVal(F20)<=2 & [maxVal(Section_24)<=1 & maxVal(Section_2)<=1]] & [maxVal(Section_33)<=1 & [maxVal(Section_44)<=3 & maxVal(F36)<=3]]]]] & [[maxVal(Section_41)<=1 & [[maxVal(Section_2)<=3 & [maxVal(F18)<=3 & maxVal(F6)<=3]] & [maxVal(F22)<=1 & maxVal(Section_35)<=3]]] & [[maxVal(Section_27)<=3 & maxVal(Section_3)<=2] & [maxVal(F10)<=1 & maxVal(Section_12)<=1]]]]

abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (2<=2) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F24)<=3
normalized: maxVal(F24)<=3

abstracting: (1<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F33)<=3
normalized: maxVal(F33)<=3

abstracting: (1<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(F38)<=3
normalized: maxVal(F38)<=3

abstracting: (2<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Section_46)<=1
normalized: maxVal(Section_46)<=1

abstracting: (1<=1) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Section_34)<=1
normalized: maxVal(Section_34)<=1

abstracting: (1<=1) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(Section_33)<=3 & [[maxVal(Section_41)<=1 & maxVal(F43)<=1] & maxVal(Section_45)<=1]] & [[maxVal(F48)<=1 & [maxVal(Section_25)<=1 & maxVal(Section_40)<=1]] & [[maxVal(Section_7)<=2 & maxVal(Section_9)<=3] & maxVal(Section_29)<=1]]] & [[maxVal(Section_46)<=3 & [[maxVal(F19)<=2 & maxVal(Section_14)<=1] & [maxVal(Section_41)<=2 & maxVal(Section_25)<=3]]] & [[maxVal(Section_5)<=1 & [maxVal(Section_24)<=3 & maxVal(F43)<=1]] & [[maxVal(F39)<=2 & maxVal(Section_10)<=3] & maxVal(F19)<=1]]]] & [maxVal(Section_42)<=1 & maxVal(Section_12)<=1]]
normalized: [[maxVal(Section_42)<=1 & maxVal(Section_12)<=1] & [[[[maxVal(Section_5)<=1 & [maxVal(Section_24)<=3 & maxVal(F43)<=1]] & [maxVal(F19)<=1 & [maxVal(F39)<=2 & maxVal(Section_10)<=3]]] & [maxVal(Section_46)<=3 & [[maxVal(F19)<=2 & maxVal(Section_14)<=1] & [maxVal(Section_41)<=2 & maxVal(Section_25)<=3]]]] & [[[maxVal(F48)<=1 & [maxVal(Section_25)<=1 & maxVal(Section_40)<=1]] & [maxVal(Section_29)<=1 & [maxVal(Section_7)<=2 & maxVal(Section_9)<=3]]] & [maxVal(Section_33)<=3 & [maxVal(Section_45)<=1 & [maxVal(Section_41)<=1 & maxVal(F43)<=1]]]]]]

abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(F29)<=1 & [maxVal(Section_44)<=3 & [maxVal(F7)<=1 & maxVal(F4)<=2]]] & [[maxVal(F28)<=3 & maxVal(F3)<=1] & maxVal(Section_12)<=1]] & [[maxVal(F40)<=3 & [[maxVal(F17)<=2 & maxVal(Section_5)<=3] & [maxVal(F24)<=2 & maxVal(Section_14)<=3]]] & [[maxVal(Section_21)<=3 & [maxVal(Section_34)<=1 & maxVal(F44)<=1]] & [[maxVal(F47)<=1 & maxVal(F26)<=1] & [maxVal(F1)<=3 & maxVal(F21)<=2]]]]] & maxVal(F11)<=1]
normalized: [maxVal(F11)<=1 & [[[[maxVal(Section_21)<=3 & [maxVal(Section_34)<=1 & maxVal(F44)<=1]] & [[maxVal(F1)<=3 & maxVal(F21)<=2] & [maxVal(F47)<=1 & maxVal(F26)<=1]]] & [maxVal(F40)<=3 & [[maxVal(F24)<=2 & maxVal(Section_14)<=3] & [maxVal(F17)<=2 & maxVal(Section_5)<=3]]]] & [[maxVal(F29)<=1 & [maxVal(Section_44)<=3 & [maxVal(F7)<=1 & maxVal(F4)<=2]]] & [maxVal(Section_12)<=1 & [maxVal(F28)<=3 & maxVal(F3)<=1]]]]]

abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
abstracting: (2<=1) states: 0
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-048-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(F22)<=3 & [[maxVal(F13)<=1 & maxVal(F38)<=3] & maxVal(F43)<=1]]
normalized: [maxVal(F22)<=3 & [maxVal(F43)<=1 & [maxVal(F13)<=1 & maxVal(F38)<=3]]]

abstracting: (2<=3) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Section_29)<=2
normalized: maxVal(Section_29)<=2

abstracting: (1<=2) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Section_22)<=3
normalized: maxVal(Section_22)<=3

abstracting: (1<=3) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(F23)<=1 & [[[maxVal(F42)<=2 & [[maxVal(F23)<=3 & maxVal(Section_10)<=1] & maxVal(Section_19)<=2]] & [maxVal(Section_46)<=1 & [[maxVal(Section_43)<=3 & maxVal(F10)<=1] & [maxVal(Section_26)<=2 & maxVal(F23)<=2]]]] & maxVal(F4)<=1]]
normalized: [maxVal(F23)<=1 & [maxVal(F4)<=1 & [[maxVal(Section_46)<=1 & [[maxVal(Section_26)<=2 & maxVal(F23)<=2] & [maxVal(Section_43)<=3 & maxVal(F10)<=1]]] & [maxVal(F42)<=2 & [maxVal(Section_19)<=2 & [maxVal(F23)<=3 & maxVal(Section_10)<=1]]]]]]

abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (2<=3) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=3) states: 23,973,456,915 (10)
abstracting: (2<=2) states: 23,973,456,915 (10)
abstracting: (1<=2) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (1<=1) states: 23,973,456,915 (10)
abstracting: (2<=1) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-048-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Section_46)<=2
normalized: maxVal(Section_46)<=2

abstracting: (1<=2) states: 23,973,456,915 (10)
-> the formula is TRUE

FORMULA CircularTrains-PT-048-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432335710459

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

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m0sec

3458
iterations count:1888 (39), effective:384 (8)

initing FirstDep: 0m0sec

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="CircularTrains-PT-048"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is CircularTrains-PT-048, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r008kn-ebro-143214239200372"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;