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 IOTPpurchase-PT-C12M10P15D17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913300092
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463723815562


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

Net: IOTPpurchase_PT_C12M10P15D17
(NrP: 111 NrTr: 45 NrArc: 224)

net check time: 0m 0.000sec

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

init dd package: 0m 3.978sec


RS generation: 4m 6.335sec


-> reachability set: #nodes 730767 (7.3e+05) #states 92,677,131,972,792 (13)



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

checking: place_bound(p12_3)
normalized: place_bound(p12_3)

-> the formula is 1

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(Status_p22_13)
normalized: place_bound(Status_p22_13)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-1 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Delivery_p20_10)
normalized: place_bound(Delivery_p20_10)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p1_2)
normalized: place_bound(p1_2)

-> the formula is 11

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-3 11 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Status_p20)
normalized: place_bound(Status_p20)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p11_7)
normalized: place_bound(p11_7)

-> the formula is 1

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(DeliveryHandlerDelivery_p8_0)
normalized: place_bound(DeliveryHandlerDelivery_p8_0)

-> the formula is 17

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-6 17 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Organization_p20_2)
normalized: place_bound(Organization_p20_2)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p10_0)
normalized: place_bound(p10_0)

-> the formula is 1

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p3_10)
normalized: place_bound(p3_10)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Organization_p22_5)
normalized: place_bound(Organization_p22_5)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-10 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(MerchantPayment_p4_0)
normalized: place_bound(MerchantPayment_p4_0)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6_4)
normalized: place_bound(p6_4)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-12 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(PayReceipt_p21_15)
normalized: place_bound(PayReceipt_p21_15)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ConsumerDelivery_p6_0)
normalized: place_bound(ConsumerDelivery_p6_0)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(PaymentRequest_p11_9)
normalized: place_bound(PaymentRequest_p11_9)

-> the formula is 1

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 4m37.015sec


BK_STOP 1463724092688

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

check for maximal unmarked siphon
ok
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.000sec

25204 341685 1475677 2187101 2280586
iterations count:5976 (132), effective:1208 (26)

initing FirstDep: 0m 0.001sec

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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 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 IOTPpurchase-PT-C12M10P15D17, 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 r065kn-blw3-146358913300092"
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 ;