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-2270
Executing tool marcie
Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433637542220

Model: IOTPpurchase-PT-C12M10P15D17
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: 111 NrTr: 45 NrArc: 224)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m19sec


-> reachability set: #nodes 55417 (5.5e+04) #states 92,677,131,972,792 (13)



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

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

abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p8_1)<=2 & [maxVal(PaymentRequest_p11_9)<=3 & maxVal(p11_3)<=3]] & maxVal(p3_4)<=1]
normalized: [maxVal(p3_4)<=1 & [maxVal(p8_1)<=2 & [maxVal(PaymentRequest_p11_9)<=3 & maxVal(p11_3)<=3]]]

abstracting: (1<=3) states: 92,677,131,972,792 (13)
abstracting: (1<=3) states: 92,677,131,972,792 (13)
abstracting: (12<=2) states: 0
abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 92,677,131,972,792 (13)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (12<=3) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(PaySchemeData_p11_10)<=3 & maxVal(p12_7)<=3] & [maxVal(Organization_p22_9)<=3 & [maxVal(MerchantPayment_p4_0)<=3 & maxVal(Organization_p21_2)<=3]]]
normalized: [[maxVal(Organization_p22_9)<=3 & [maxVal(MerchantPayment_p4_0)<=3 & maxVal(Organization_p21_2)<=3]] & [maxVal(PaySchemeData_p11_10)<=3 & maxVal(p12_7)<=3]]

abstracting: (1<=3) states: 92,677,131,972,792 (13)
abstracting: (1<=3) states: 92,677,131,972,792 (13)
abstracting: (10<=3) states: 0
abstracting: (10<=3) states: 0
abstracting: (12<=3) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p12_0)<=2 & [[[[maxVal(p8_3)<=3 & maxVal(PayReceipt_p21_15)<=3] & [maxVal(p3_5)<=3 & maxVal(PayReceipt_p21_15)<=1]] & maxVal(Organization_p22_5)<=3] & maxVal(DeliveryRequest_p12_5)<=1]] & [[maxVal(DeliveryNote_p22_14)<=3 & maxVal(Status_p22_11)<=1] & [maxVal(p4_2)<=1 & maxVal(Status_p22_13)<=2]]]
normalized: [[[maxVal(p4_2)<=1 & maxVal(Status_p22_13)<=2] & [maxVal(DeliveryNote_p22_14)<=3 & maxVal(Status_p22_11)<=1]] & [maxVal(p12_0)<=2 & [maxVal(DeliveryRequest_p12_5)<=1 & [maxVal(Organization_p22_5)<=3 & [[maxVal(p8_3)<=3 & maxVal(PayReceipt_p21_15)<=3] & [maxVal(p3_5)<=3 & maxVal(PayReceipt_p21_15)<=1]]]]]]

abstracting: (10<=1) states: 0
abstracting: (10<=3) states: 0
abstracting: (10<=3) states: 0
abstracting: (17<=3) states: 0
abstracting: (12<=3) states: 0
abstracting: (1<=1) states: 92,677,131,972,792 (13)
abstracting: (1<=2) states: 92,677,131,972,792 (13)
abstracting: (12<=1) states: 0
abstracting: (12<=3) states: 0
abstracting: (12<=2) states: 0
abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (12<=2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(Order_p20)<=3 & [maxVal(PaymentNote_p21_16)<=3 & maxVal(p1_1)<=1]] & maxVal(p3_10)<=1] & maxVal(Order_p22_6)<=3] & [[maxVal(PayReceipt_p21_15)<=3 & maxVal(DeliveryNote_p22_12)<=1] & [maxVal(p10_2)<=1 & maxVal(ConsumerDelivery_p6_0)<=2]]]
normalized: [[maxVal(Order_p22_6)<=3 & [maxVal(p3_10)<=1 & [maxVal(Order_p20)<=3 & [maxVal(PaymentNote_p21_16)<=3 & maxVal(p1_1)<=1]]]] & [[maxVal(PayReceipt_p21_15)<=3 & maxVal(DeliveryNote_p22_12)<=1] & [maxVal(p10_2)<=1 & maxVal(ConsumerDelivery_p6_0)<=2]]]

abstracting: (10<=2) states: 0
abstracting: (1<=1) states: 92,677,131,972,792 (13)
abstracting: (12<=1) states: 0
abstracting: (10<=3) states: 0
abstracting: (12<=1) states: 0
abstracting: (10<=3) states: 0
abstracting: (10<=3) states: 0
abstracting: (10<=1) states: 0
abstracting: (12<=3) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(PaidFor_p11_1)<=2 & maxVal(p1_3)<=3]
normalized: [maxVal(PaidFor_p11_1)<=2 & maxVal(p1_3)<=3]

abstracting: (10<=3) states: 0
abstracting: (1<=2) states: 92,677,131,972,792 (13)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 92,677,131,972,792 (13)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(PaidFor_p11_1)<=2 & maxVal(p8_3)<=1]
normalized: [maxVal(PaidFor_p11_1)<=2 & maxVal(p8_3)<=1]

abstracting: (17<=1) states: 0
abstracting: (1<=2) states: 92,677,131,972,792 (13)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m26sec


BK_STOP 1433637569031

--------------------
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

6737 82498 166412 177276 175255
iterations count:5835 (129), effective:1208 (26)

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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-2270"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C12M10P15D17, 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 r232su-smll-143354324800125"
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 ;