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-2979
Executing tool marcie
Input is S_Peterson-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146000542
=====================================================================

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-2-UpperBounds-0
FORMULA_NAME Peterson-COL-2-UpperBounds-1
FORMULA_NAME Peterson-COL-2-UpperBounds-10
FORMULA_NAME Peterson-COL-2-UpperBounds-11
FORMULA_NAME Peterson-COL-2-UpperBounds-12
FORMULA_NAME Peterson-COL-2-UpperBounds-13
FORMULA_NAME Peterson-COL-2-UpperBounds-14
FORMULA_NAME Peterson-COL-2-UpperBounds-15
FORMULA_NAME Peterson-COL-2-UpperBounds-2
FORMULA_NAME Peterson-COL-2-UpperBounds-3
FORMULA_NAME Peterson-COL-2-UpperBounds-4
FORMULA_NAME Peterson-COL-2-UpperBounds-5
FORMULA_NAME Peterson-COL-2-UpperBounds-6
FORMULA_NAME Peterson-COL-2-UpperBounds-7
FORMULA_NAME Peterson-COL-2-UpperBounds-8
FORMULA_NAME Peterson-COL-2-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1464801887811


Marcie rev. 8535M (built: crohr on 2016-04-27)
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=UpperBounds.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=108|T|=138|A|=432
Time for unfolding: 0m 3.415sec

Net: Peterson_COL_2
(NrP: 108 NrTr: 138 NrArc: 432)

net check time: 0m 0.063sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec

init dd package: 0m 6.994sec


RS generation: 0m 0.683sec


-> reachability set: #nodes 4923 (4.9e+03) #states 20,754 (4)



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

checking: place_bound(idle_process0,idle_process1,idle_process2)
normalized: place_bound(idle_process0,idle_process1,idle_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-4 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: place_bound(wantSection_process0_false,wantSection_process0_true,wantSection_process1_false,wantSection_process1_true,wantSection_process2_false,wantSection_process2_true)
normalized: place_bound(wantSection_process0_false,wantSection_process0_true,wantSection_process1_false,wantSection_process1_true,wantSection_process2_false,wantSection_process2_true)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(endTurn_process0_tour0,endTurn_process0_tour1,endTurn_process1_tour0,endTurn_process1_tour1,endTurn_process2_tour0,endTurn_process2_tour1)
normalized: place_bound(endTurn_process0_tour0,endTurn_process0_tour1,endTurn_process1_tour0,endTurn_process1_tour1,endTurn_process2_tour0,endTurn_process2_tour1)

-> the formula is 2

FORMULA Peterson-COL-2-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testTurn_process0_tour0,testTurn_process0_tour1,testTurn_process1_tour0,testTurn_process1_tour1,testTurn_process2_tour0,testTurn_process2_tour1)
normalized: place_bound(testTurn_process0_tour0,testTurn_process0_tour1,testTurn_process1_tour0,testTurn_process1_tour1,testTurn_process2_tour0,testTurn_process2_tour1)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testTurn_process0_tour0,testTurn_process0_tour1,testTurn_process1_tour0,testTurn_process1_tour1,testTurn_process2_tour0,testTurn_process2_tour1)
normalized: place_bound(testTurn_process0_tour0,testTurn_process0_tour1,testTurn_process1_tour0,testTurn_process1_tour1,testTurn_process2_tour0,testTurn_process2_tour1)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wantSection_process0_false,wantSection_process0_true,wantSection_process1_false,wantSection_process1_true,wantSection_process2_false,wantSection_process2_true)
normalized: place_bound(wantSection_process0_false,wantSection_process0_true,wantSection_process1_false,wantSection_process1_true,wantSection_process2_false,wantSection_process2_true)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)
normalized: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)
normalized: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(isEndLoop_process0_tour0_process0,isEndLoop_process0_tour0_process1,isEndLoop_process0_tour0_process2,isEndLoop_process0_tour1_process0,isEndLoop_process0_tour1_process1,isEndLoop_process0_tour1_process2,isEndLoop_process1_tour0_process0,isEndLoop_process1_tour0_process1,isEndLoop_process1_tour0_process2,isEndLoop_process1_tour1_process0,isEndLoop_process1_tour1_process1,isEndLoop_process1_tour1_process2,isEndLoop_process2_tour0_process0,isEndLoop_process2_tour0_process1,isEndLoop_process2_tour0_process2,isEndLoop_process2_tour1_process0,isEndLoop_process2_tour1_process1,isEndLoop_process2_tour1_process2)
normalized: place_bound(isEndLoop_process0_tour0_process0,isEndLoop_process0_tour0_process1,isEndLoop_process0_tour0_process2,isEndLoop_process0_tour1_process0,isEndLoop_process0_tour1_process1,isEndLoop_process0_tour1_process2,isEndLoop_process1_tour0_process0,isEndLoop_process1_tour0_process1,isEndLoop_process1_tour0_process2,isEndLoop_process1_tour1_process0,isEndLoop_process1_tour1_process1,isEndLoop_process1_tour1_process2,isEndLoop_process2_tour0_process0,isEndLoop_process2_tour0_process1,isEndLoop_process2_tour0_process2,isEndLoop_process2_tour1_process0,isEndLoop_process2_tour1_process1,isEndLoop_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-2 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)
normalized: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-3 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)
normalized: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testIdentity_process0_tour0_process0,testIdentity_process0_tour0_process1,testIdentity_process0_tour0_process2,testIdentity_process0_tour1_process0,testIdentity_process0_tour1_process1,testIdentity_process0_tour1_process2,testIdentity_process1_tour0_process0,testIdentity_process1_tour0_process1,testIdentity_process1_tour0_process2,testIdentity_process1_tour1_process0,testIdentity_process1_tour1_process1,testIdentity_process1_tour1_process2,testIdentity_process2_tour0_process0,testIdentity_process2_tour0_process1,testIdentity_process2_tour0_process2,testIdentity_process2_tour1_process0,testIdentity_process2_tour1_process1,testIdentity_process2_tour1_process2)
normalized: place_bound(testIdentity_process0_tour0_process0,testIdentity_process0_tour0_process1,testIdentity_process0_tour0_process2,testIdentity_process0_tour1_process0,testIdentity_process0_tour1_process1,testIdentity_process0_tour1_process2,testIdentity_process1_tour0_process0,testIdentity_process1_tour0_process1,testIdentity_process1_tour0_process2,testIdentity_process1_tour1_process0,testIdentity_process1_tour1_process1,testIdentity_process1_tour1_process2,testIdentity_process2_tour0_process0,testIdentity_process2_tour0_process1,testIdentity_process2_tour0_process2,testIdentity_process2_tour1_process0,testIdentity_process2_tour1_process1,testIdentity_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-8 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(isEndLoop_process0_tour0_process0,isEndLoop_process0_tour0_process1,isEndLoop_process0_tour0_process2,isEndLoop_process0_tour1_process0,isEndLoop_process0_tour1_process1,isEndLoop_process0_tour1_process2,isEndLoop_process1_tour0_process0,isEndLoop_process1_tour0_process1,isEndLoop_process1_tour0_process2,isEndLoop_process1_tour1_process0,isEndLoop_process1_tour1_process1,isEndLoop_process1_tour1_process2,isEndLoop_process2_tour0_process0,isEndLoop_process2_tour0_process1,isEndLoop_process2_tour0_process2,isEndLoop_process2_tour1_process0,isEndLoop_process2_tour1_process1,isEndLoop_process2_tour1_process2)
normalized: place_bound(isEndLoop_process0_tour0_process0,isEndLoop_process0_tour0_process1,isEndLoop_process0_tour0_process2,isEndLoop_process0_tour1_process0,isEndLoop_process0_tour1_process1,isEndLoop_process0_tour1_process2,isEndLoop_process1_tour0_process0,isEndLoop_process1_tour0_process1,isEndLoop_process1_tour0_process2,isEndLoop_process1_tour1_process0,isEndLoop_process1_tour1_process1,isEndLoop_process1_tour1_process2,isEndLoop_process2_tour0_process0,isEndLoop_process2_tour0_process1,isEndLoop_process2_tour0_process2,isEndLoop_process2_tour1_process0,isEndLoop_process2_tour1_process1,isEndLoop_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)
normalized: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-12 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)
normalized: place_bound(beginLoop_process0_tour0_process0,beginLoop_process0_tour0_process1,beginLoop_process0_tour0_process2,beginLoop_process0_tour1_process0,beginLoop_process0_tour1_process1,beginLoop_process0_tour1_process2,beginLoop_process1_tour0_process0,beginLoop_process1_tour0_process1,beginLoop_process1_tour0_process2,beginLoop_process1_tour1_process0,beginLoop_process1_tour1_process1,beginLoop_process1_tour1_process2,beginLoop_process2_tour0_process0,beginLoop_process2_tour0_process1,beginLoop_process2_tour0_process2,beginLoop_process2_tour1_process0,beginLoop_process2_tour1_process1,beginLoop_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)
normalized: place_bound(testAlone_process0_tour0_process0,testAlone_process0_tour0_process1,testAlone_process0_tour0_process2,testAlone_process0_tour1_process0,testAlone_process0_tour1_process1,testAlone_process0_tour1_process2,testAlone_process1_tour0_process0,testAlone_process1_tour0_process1,testAlone_process1_tour0_process2,testAlone_process1_tour1_process0,testAlone_process1_tour1_process1,testAlone_process1_tour1_process2,testAlone_process2_tour0_process0,testAlone_process2_tour0_process1,testAlone_process2_tour0_process2,testAlone_process2_tour1_process0,testAlone_process2_tour1_process1,testAlone_process2_tour1_process2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m17.656sec


BK_STOP 1464801905522

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
testAlone_process2_tour0_process2
testAlone_process1_tour1_process1
testAlone_process1_tour0_process1
testAlone_process0_tour0_process0
testAlone_process0_tour1_process0
testAlone_process2_tour1_process2

The net has transition(s) that can never fire:
notAlone_2_0_2
notAlone_2_1_2
notAlone_0_0_0
notAlone_0_1_0
alone1_0_1_0
notAlone_1_1_1
notAlone_1_0_1
alone1_0_0_0
alone1_1_1_1
alone1_2_1_2
alone1_2_0_2
alone1_1_0_1

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: 0m 0.003sec

1019 2441 2476 3843 4585 4763
iterations count:6469 (46), effective:419 (3)

initing FirstDep: 0m 0.000sec

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="S_Peterson-COL-2"
export BK_EXAMINATION="UpperBounds"
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/S_Peterson-COL-2.tgz
mv S_Peterson-COL-2 execution

# this is for BenchKit: explicit launching of the test

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