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_IOTPpurchase-PT-C03M03P03D03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418100079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464330568349


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m 3.897sec


RS generation: 0m 0.398sec


-> reachability set: #nodes 6056 (6.1e+03) #states 354,176 (5)



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

checking: EF [2<=BrandSelection_p11_5]
normalized: E [true U 2<=BrandSelection_p11_5]

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

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [3<=p3_8]
normalized: E [true U 3<=p3_8]

abstracting: (3<=p3_8) states: 116
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.249sec

checking: EF [3<=PayReceipt_p21_15]
normalized: E [true U 3<=PayReceipt_p21_15]

abstracting: (3<=PayReceipt_p21_15) states: 16
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.144sec

checking: EF [~ [~ [[1<=Status_p22_11 | 3<=Order_p22_6]]]]
normalized: E [true U [1<=Status_p22_11 | 3<=Order_p22_6]]

abstracting: (3<=Order_p22_6) states: 256
abstracting: (1<=Status_p22_11) states: 51,376 (4)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: AG [[~ [1<=Organization_p21_2] | [~ [1<=p5_2] & 1<=p3_5]]]
normalized: ~ [E [true U ~ [[[1<=p3_5 & ~ [1<=p5_2]] | ~ [1<=Organization_p21_2]]]]]

abstracting: (1<=Organization_p21_2) states: 21,512 (4)
abstracting: (1<=p5_2) states: 15,918 (4)
abstracting: (1<=p3_5) states: 79,456 (4)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: AG [~ [[3<=p8_3 & [2<=Organization_p20_2 | 2<=Organization_p20_7]]]]
normalized: ~ [E [true U [3<=p8_3 & [2<=Organization_p20_2 | 2<=Organization_p20_7]]]]

abstracting: (2<=Organization_p20_7) states: 848
abstracting: (2<=Organization_p20_2) states: 848
abstracting: (3<=p8_3) states: 75,700 (4)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.475sec

checking: AG [[Order_p22_3<=ConsumerOffer_p1 | ~ [[1<=Payment_p20 | 3<=Organization_p22_2]]]]
normalized: ~ [E [true U ~ [[Order_p22_3<=ConsumerOffer_p1 | ~ [[1<=Payment_p20 | 3<=Organization_p22_2]]]]]]

abstracting: (3<=Organization_p22_2) states: 16
abstracting: (1<=Payment_p20) states: 21,512 (4)
abstracting: (Order_p22_3<=ConsumerOffer_p1) states: 334,144 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.143sec

checking: EF [~ [[2<=HowDeliver_p12_2 | [1<=OfferResponce_p10 | OfferResponce_p10<=p1_2]]]]
normalized: E [true U ~ [[2<=HowDeliver_p12_2 | [1<=OfferResponce_p10 | OfferResponce_p10<=p1_2]]]]

abstracting: (OfferResponce_p10<=p1_2) states: 90,176 (4)
abstracting: (1<=OfferResponce_p10) states: 333,496 (5)
abstracting: (2<=HowDeliver_p12_2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[1<=p6_2 & [[1<=p12_0 & Status_p22_13<=DeliveryNote_p22_12] & ~ [3<=Status_p21_14]]]]
normalized: E [true U [1<=p6_2 & [~ [3<=Status_p21_14] & [1<=p12_0 & Status_p22_13<=DeliveryNote_p22_12]]]]

abstracting: (Status_p22_13<=DeliveryNote_p22_12) states: 320,408 (5)
abstracting: (1<=p12_0) states: 333,496 (5)
abstracting: (3<=Status_p21_14) states: 16
abstracting: (1<=p6_2) states: 90,176 (4)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

checking: EF [[3<=Status_p21_5 & [~ [p3_3<=Status_p21_5] & [2<=p8_1 | 3<=p12_4]]]]
normalized: E [true U [3<=Status_p21_5 & [[2<=p8_1 | 3<=p12_4] & ~ [p3_3<=Status_p21_5]]]]

abstracting: (p3_3<=Status_p21_5) states: 333,496 (5)
abstracting: (3<=p12_4) states: 0
abstracting: (2<=p8_1) states: 1,072 (3)
abstracting: (3<=Status_p21_5) states: 16
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[Status_p20_6<=p5_3 | [p5_4<=p1_3 | 3<=OfferRequest_p10]]]
normalized: ~ [E [true U ~ [[Status_p20_6<=p5_3 | [p5_4<=p1_3 | 3<=OfferRequest_p10]]]]]

abstracting: (3<=OfferRequest_p10) states: 0
abstracting: (p5_4<=p1_3) states: 99,964 (4)
abstracting: (Status_p20_6<=p5_3) states: 333,864 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.180sec

checking: AG [[~ [[p3_2<=Delivery_p22_4 & 3<=PaymentResponse_p11_12]] & [3<=PayReceipt_p21_15 | ~ [DeliveryHandlerDelivery_p8_0<=p3_9]]]]
normalized: ~ [E [true U ~ [[~ [[p3_2<=Delivery_p22_4 & 3<=PaymentResponse_p11_12]] & [3<=PayReceipt_p21_15 | ~ [DeliveryHandlerDelivery_p8_0<=p3_9]]]]]]

abstracting: (DeliveryHandlerDelivery_p8_0<=p3_9) states: 102,635 (5)
abstracting: (3<=PayReceipt_p21_15) states: 16
abstracting: (3<=PaymentResponse_p11_12) states: 0
abstracting: (p3_2<=Delivery_p22_4) states: 285,600 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.468sec

checking: EF [[[PaySchemeData_p11_10<=Order_p20 & ~ [Organization_p22_9<=Organization_p22_2]] & [2<=p7_2 & 1<=Organization_p20_2]]]
normalized: E [true U [[PaySchemeData_p11_10<=Order_p20 & ~ [Organization_p22_9<=Organization_p22_2]] & [2<=p7_2 & 1<=Organization_p20_2]]]

abstracting: (1<=Organization_p20_2) states: 21,512 (4)
abstracting: (2<=p7_2) states: 848
abstracting: (Organization_p22_9<=Organization_p22_2) states: 329,056 (5)
abstracting: (PaySchemeData_p11_10<=Order_p20) states: 321,954 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AG [[[[Payment_p21_7<=p3_7 | Organization_p21_2<=p3_2] & ~ [2<=Status_p21_5]] | 2<=p11_11]]
normalized: ~ [E [true U ~ [[2<=p11_11 | [~ [2<=Status_p21_5] & [Payment_p21_7<=p3_7 | Organization_p21_2<=p3_2]]]]]]

abstracting: (Organization_p21_2<=p3_2) states: 335,864 (5)
abstracting: (Payment_p21_7<=p3_7) states: 338,882 (5)
abstracting: (2<=Status_p21_5) states: 848
abstracting: (2<=p11_11) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AG [[[[2<=Status_p21_9 & 2<=p6_5] | [DeliveryRequest_p12_5<=Payment_p21_1 | 3<=p4_5]] | [~ [Order_p22_6<=p2_1] & [1<=OfferResponce_p10 | 2<=Delivery_p20_10]]]]
normalized: ~ [E [true U ~ [[[[1<=OfferResponce_p10 | 2<=Delivery_p20_10] & ~ [Order_p22_6<=p2_1]] | [[DeliveryRequest_p12_5<=Payment_p21_1 | 3<=p4_5] | [2<=Status_p21_9 & 2<=p6_5]]]]]]

abstracting: (2<=p6_5) states: 11,088 (4)
abstracting: (2<=Status_p21_9) states: 416
abstracting: (3<=p4_5) states: 16
abstracting: (DeliveryRequest_p12_5<=Payment_p21_1) states: 322,408 (5)
abstracting: (Order_p22_6<=p2_1) states: 288,496 (5)
abstracting: (2<=Delivery_p20_10) states: 848
abstracting: (1<=OfferResponce_p10) states: 333,496 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.333sec

checking: AG [[[[1<=DeliveryHandlerDelivery_p8_0 & 2<=OfferResponce_p10] & [2<=p12_7 & Delivery_p22_1<=ConsumerOffer_p1]] | [[3<=p1_1 | p5_4<=p3_2] | Delivery_p20_10<=p4_4]]]
normalized: ~ [E [true U ~ [[[Delivery_p20_10<=p4_4 | [3<=p1_1 | p5_4<=p3_2]] | [[2<=p12_7 & Delivery_p22_1<=ConsumerOffer_p1] & [1<=DeliveryHandlerDelivery_p8_0 & 2<=OfferResponce_p10]]]]]]

abstracting: (2<=OfferResponce_p10) states: 0
abstracting: (1<=DeliveryHandlerDelivery_p8_0) states: 260,788 (5)
abstracting: (Delivery_p22_1<=ConsumerOffer_p1) states: 334,144 (5)
abstracting: (2<=p12_7) states: 0
abstracting: (p5_4<=p3_2) states: 116,542 (5)
abstracting: (3<=p1_1) states: 64
abstracting: (Delivery_p20_10<=p4_4) states: 333,496 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec


Total processing time: 0m 8.565sec


BK_STOP 1464330576947

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

8663
iterations count:1267 (28), effective:247 (5)

initing FirstDep: 0m 0.000sec


iterations count:654 (14), effective:124 (2)

iterations count:678 (15), effective:132 (2)

iterations count:253 (5), effective:42 (0)

iterations count:451 (10), effective:86 (1)

iterations count:862 (19), effective:149 (3)

iterations count:592 (13), effective:113 (2)

iterations count:256 (5), effective:44 (0)

iterations count:669 (14), effective:130 (2)

iterations count:650 (14), effective:118 (2)

iterations count:465 (10), effective:89 (1)

iterations count:314 (6), effective:55 (1)

iterations count:476 (10), effective:92 (2)

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_IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_IOTPpurchase-PT-C03M03P03D03.tgz
mv S_IOTPpurchase-PT-C03M03P03D03 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_IOTPpurchase-PT-C03M03P03D03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r161kn-blw3-146416418100079"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;