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-3254
Executing tool marcie
Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494452256038

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.097sec

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 3.604sec


RS generation: 4m 3.396sec


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



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

checking: EF [1<=Organization_p22_2]
normalized: E [true U 1<=Organization_p22_2]

abstracting: (1<=Organization_p22_2)
states: 20,678,820,835,784 (13)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.064sec

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

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

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.561sec

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

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

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

MC time: 0m 0.573sec

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

abstracting: (3<=p3_7)
states: 779,238,152,856 (11)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.476sec

checking: AG [p4_5<=p4_5]
normalized: ~ [E [true U ~ [p4_5<=p4_5]]]

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

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=PaymentRequest_p11_9 & 2<=PaymentRequest_p11_9]]
normalized: E [true U [3<=PaymentRequest_p11_9 & 2<=PaymentRequest_p11_9]]

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

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

MC time: 0m 0.064sec

checking: AG [MerchantDelivery_p4_6<=p7_2]
normalized: ~ [E [true U ~ [MerchantDelivery_p4_6<=p7_2]]]

abstracting: (MerchantDelivery_p4_6<=p7_2)
states: 7,052,056,531,240 (12)
-> the formula is FALSE

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

MC time: 0m10.704sec

checking: AG [Organization_p22_5<=Status_p20]
normalized: ~ [E [true U ~ [Organization_p22_5<=Status_p20]]]

abstracting: (Organization_p22_5<=Status_p20)
states: 48,506,697,597,360 (13)
-> the formula is FALSE

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

MC time: 1m55.117sec

checking: AG [Delivery_p22_4<=Organization_p21_8]
normalized: ~ [E [true U ~ [Delivery_p22_4<=Organization_p21_8]]]

abstracting: (Delivery_p22_4<=Organization_p21_8)
states: 47,984,797,695,776 (13)
-> the formula is FALSE

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

MC time: 0m40.037sec

checking: EF [[~ [Order_p22_6<=Delivery_p20_10] | 3<=Status_p21_11]]
normalized: E [true U [3<=Status_p21_11 | ~ [Order_p22_6<=Delivery_p20_10]]]

abstracting: (Order_p22_6<=Delivery_p20_10)
states: 48,506,697,597,360 (13)
abstracting: (3<=Status_p21_11)
states: 978,240,858,184 (11)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.554sec

checking: EF [~ [[[1<=MerchantOffer_p2 | 3<=Status_p20_6] | ~ [2<=p4_1]]]]
normalized: E [true U ~ [[~ [2<=p4_1] | [1<=MerchantOffer_p2 | 3<=Status_p20_6]]]]

abstracting: (3<=Status_p20_6)
states: 779,238,152,856 (11)
abstracting: (1<=MerchantOffer_p2)
states: 59,054,196,243,368 (13)
abstracting: (2<=p4_1)
states: 4,222,601,069,000 (12)
-> the formula is TRUE

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

MC time: 0m18.845sec

checking: EF [~ [[[2<=Order_p22_3 | PaymentAmount_p11_6<=Payment_p20] | 3<=Delivery_p20]]]
normalized: E [true U ~ [[3<=Delivery_p20 | [2<=Order_p22_3 | PaymentAmount_p11_6<=Payment_p20]]]]

abstracting: (PaymentAmount_p11_6<=Payment_p20)
states: 79,108,282,064,848 (13)
abstracting: (2<=Order_p22_3)
states: 4,222,601,069,000 (12)
abstracting: (3<=Delivery_p20)
states: 779,238,152,856 (11)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.485sec

checking: AG [~ [[~ [PayReceipt_p21_15<=p11_11] | [1<=p7_3 | 3<=Organization_p21_4]]]]
normalized: ~ [E [true U [~ [PayReceipt_p21_15<=p11_11] | [1<=p7_3 | 3<=Organization_p21_4]]]]

abstracting: (3<=Organization_p21_4)
states: 2,733,269,037,648 (12)
abstracting: (1<=p7_3)
states: 59,054,196,243,368 (13)
abstracting: (PayReceipt_p21_15<=p11_11)

before gc: list nodes free: 722775

after gc: idd nodes used:3960457, unused:60039543; list nodes free:308461575
states: 84,232,584,018,560 (13)
-> the formula is FALSE

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

MC time: 0m50.019sec

checking: EF [[[~ [Payment_p20<=p11_8] & 2<=Status_p22_7] | 1<=PaymentRequest_p11_9]]
normalized: E [true U [1<=PaymentRequest_p11_9 | [2<=Status_p22_7 & ~ [Payment_p20<=p11_8]]]]

abstracting: (Payment_p20<=p11_8)
states: 85,567,161,044,952 (13)
abstracting: (2<=Status_p22_7)
states: 8,663,342,737,528 (12)
abstracting: (1<=PaymentRequest_p11_9)
states: 17,123,835,371,864 (13)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.903sec

checking: AG [~ [[~ [Status_p21_11<=p10_0] & [1<=p11_13 | 2<=Organization_p22_5]]]]
normalized: ~ [E [true U [[1<=p11_13 | 2<=Organization_p22_5] & ~ [Status_p21_11<=p10_0]]]]

abstracting: (Status_p21_11<=p10_0)
states: 81,355,920,770,856 (13)
abstracting: (2<=Organization_p22_5)
states: 21,553,659,192,744 (13)
abstracting: (1<=p11_13)
states: 67,171,617,611,252 (13)
-> the formula is FALSE

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

MC time: 0m54.433sec

checking: EF [[[[p3_10<=Organization_p22_9 & 3<=p4_4] & [p11_7<=p3_8 | PaymentNote_p21_16<=Status_p22_13]] & [[p3_1<=p8_1 | p10_2<=PaySchemeData_p11_10] | [2<=PayReceipt_p21_15 & 1<=PaySchemeData_p21_10]]]]
normalized: E [true U [[[2<=PayReceipt_p21_15 & 1<=PaySchemeData_p21_10] | [p3_1<=p8_1 | p10_2<=PaySchemeData_p11_10]] & [[p11_7<=p3_8 | PaymentNote_p21_16<=Status_p22_13] & [p3_10<=Organization_p22_9 & 3<=p4_4]]]]

abstracting: (3<=p4_4)
states: 779,238,152,856 (11)
abstracting: (p3_10<=Organization_p22_9)
states: 77,091,902,318,568 (13)
abstracting: (PaymentNote_p21_16<=Status_p22_13)
states: 77,421,406,398,168 (13)
abstracting: (p11_7<=p3_8)
states: 65,556,697,881,264 (13)
abstracting: (p10_2<=PaySchemeData_p11_10)
states: 79,924,374,792,022 (13)
abstracting: (p3_1<=p8_1)
states: 77,091,902,318,568 (13)
abstracting: (1<=PaySchemeData_p21_10)
states: 34,956,164,655,088 (13)
abstracting: (2<=PayReceipt_p21_15)
states: 4,222,601,069,000 (12)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.807sec

totally nodes used: 90446483 (9.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 255411848 610578646 865990494
used/not used/entry size/cache size: 57794254 9314610 16 1024MB
basic ops cache: hits/miss/sum: 47333325 120365512 167698837
used/not used/entry size/cache size: 16089368 687848 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3975864 9886559 13862423
used/not used/entry size/cache size: 4218567 4170041 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 43106818
1 18650062
2 4451753
3 772277
4 110599
5 14014
6 2105
7 665
8 214
9 53
>= 10 304

Total processing time: 12m58.591sec


BK_STOP 1494453035812

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

check for maximal unmarked siphon
ok
check for constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:5976 (132), effective:1208 (26)

initing FirstDep: 0m 0.000sec


iterations count:254 (5), effective:43 (0)

iterations count:639 (14), effective:126 (2)

iterations count:259 (5), effective:49 (1)

iterations count:674 (14), effective:168 (3)

iterations count:377 (8), effective:91 (2)

iterations count:484 (10), effective:114 (2)

iterations count:1069 (23), effective:190 (4)

iterations count:359 (7), effective:78 (1)

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

iterations count:316 (7), effective:69 (1)

iterations count:449 (9), effective:92 (2)

iterations count:956 (21), effective:219 (4)

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="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-3254"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C12M10P15D17, 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 r031-blw7-149440473800115"
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 ;