fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r065kn-blw3-146358913300097
Last Updated
June 30, 2016

About the Execution of Marcie for IOTPpurchase-PT-C12M10P15D17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10593.880 1703548.00 1703030.00 20.20 FFTFFTFTTFFTTFTF normal

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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913300097
=====================================================================


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


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_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.946sec


RS generation: 3m53.948sec


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



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

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

abstracting: (2<=PaymentHandlerPayment_p5_0) states: 80,348,532,973,820 (13)
-> the formula is TRUE

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

MC time: 0m53.540sec

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

abstracting: (2<=PayReceipt_p21_12) states: 5,598,456,441,160 (12)
-> the formula is FALSE

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

MC time: 0m17.308sec

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

abstracting: (MerchantDelivery_p4_6<=Status_p21_14) states: 3,738,418,101,696 (12)
-> the formula is FALSE

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

MC time: 0m 3.120sec

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

abstracting: (p11_8<=p12_0) states: 78,537,839,785,584 (13)
-> the formula is FALSE

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

MC time: 0m18.147sec

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

abstracting: (DeliveryNote_p22_14<=p4_4) states: 67,534,727,447,776 (13)

before gc: list nodes free: 1979096

after gc: idd nodes used:3457140, unused:60542860; list nodes free:309674524
-> the formula is FALSE

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

MC time: 3m42.963sec

checking: EF [p11_8<=Status_p22_13]
normalized: E [true U p11_8<=Status_p22_13]

abstracting: (p11_8<=Status_p22_13) states: 41,843,301,158,584 (13)
-> the formula is TRUE

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

MC time: 0m28.535sec

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

abstracting: (WhatDeliver_p12_1<=p12_7) states: 88,510,290,312,712 (13)
-> the formula is FALSE

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

MC time: 1m 0.549sec

checking: EF [[~ [[3<=HowDeliver_p12_2 & 2<=p11_8]] & 1<=Status_p21_14]]
normalized: E [true U [1<=Status_p21_14 & ~ [[3<=HowDeliver_p12_2 & 2<=p11_8]]]]

abstracting: (2<=p11_8) states: 0
abstracting: (3<=HowDeliver_p12_2) states: 0
abstracting: (1<=Status_p21_14) states: 20,678,820,835,784 (13)
-> the formula is TRUE

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

MC time: 0m20.341sec

checking: AG [~ [~ [[p1_1<=p7_1 | Organization_p22_9<=p4_5]]]]
normalized: ~ [E [true U ~ [[p1_1<=p7_1 | Organization_p22_9<=p4_5]]]]

abstracting: (Organization_p22_9<=p4_5) states: 69,081,866,720,008 (13)
abstracting: (p1_1<=p7_1) states: 67,534,727,447,776 (13)

before gc: list nodes free: 5917285

after gc: idd nodes used:3542891, unused:60457109; list nodes free:309055447
-> the formula is FALSE

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

MC time: 4m15.096sec

checking: EF [[[~ [3<=p5_2] | p3_8<=Delivery_p22_8] & ~ [~ [2<=PaidFor_p11_1]]]]
normalized: E [true U [2<=PaidFor_p11_1 & [p3_8<=Delivery_p22_8 | ~ [3<=p5_2]]]]

abstracting: (3<=p5_2) states: 626,637,440,130 (11)
abstracting: (p3_8<=Delivery_p22_8) states: 46,133,841,114,448 (13)
abstracting: (2<=PaidFor_p11_1) states: 0
-> the formula is FALSE

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

MC time: 0m 4.884sec

checking: AG [~ [[[p6_6<=p3_3 | 1<=p4_2] & [1<=Status_p21_5 & 3<=OfferResponce_p10]]]]
normalized: ~ [E [true U [[p6_6<=p3_3 | 1<=p4_2] & [1<=Status_p21_5 & 3<=OfferResponce_p10]]]]

abstracting: (3<=OfferResponce_p10) states: 0
abstracting: (1<=Status_p21_5) states: 20,678,820,835,784 (13)
abstracting: (1<=p4_2) states: 20,678,820,835,784 (13)
abstracting: (p6_6<=p3_3) states: 67,534,727,447,776 (13)
-> the formula is TRUE

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

MC time: 0m 7.695sec

checking: EF [[3<=p3_2 & [2<=Organization_p22_5 | [2<=PaymentRequest_p11_9 & Order_p22_10<=p6_2]]]]
normalized: E [true U [3<=p3_2 & [2<=Organization_p22_5 | [2<=PaymentRequest_p11_9 & Order_p22_10<=p6_2]]]]

abstracting: (Order_p22_10<=p6_2) states: 78,637,192,268,224 (13)
abstracting: (2<=PaymentRequest_p11_9) states: 0
abstracting: (2<=Organization_p22_5) states: 21,553,659,192,744 (13)
abstracting: (3<=p3_2) states: 6,067,920,744,640 (12)
-> the formula is TRUE

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

MC time: 0m47.282sec

checking: AG [[[~ [3<=Status_p21_5] & [3<=MerchantOffer_p2 | 1<=p12_0]] | ~ [[2<=p11_8 | Delivery_p22_1<=PaidFor_p11_1]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p11_8 | Delivery_p22_1<=PaidFor_p11_1]] | [[3<=MerchantOffer_p2 | 1<=p12_0] & ~ [3<=Status_p21_5]]]]]]

abstracting: (3<=Status_p21_5) states: 779,238,152,856 (11)
abstracting: (1<=p12_0) states: 75,553,296,600,928 (13)
abstracting: (3<=MerchantOffer_p2) states: 15,681,011,835,576 (13)
abstracting: (Delivery_p22_1<=PaidFor_p11_1) states: 74,885,680,995,848 (13)
abstracting: (2<=p11_8) states: 0
-> the formula is FALSE

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

MC time: 0m46.115sec

checking: EF [[~ [[2<=p3_4 | p6_3<=Status_p22_7]] & [~ [p7_3<=p4_4] & ~ [1<=Organization_p22_2]]]]
normalized: E [true U [[~ [p7_3<=p4_4] & ~ [1<=Organization_p22_2]] & ~ [[2<=p3_4 | p6_3<=Status_p22_7]]]]

abstracting: (p6_3<=Status_p22_7) states: 69,482,260,462,296 (13)
abstracting: (2<=p3_4) states: 4,222,601,069,000 (12)
abstracting: (1<=Organization_p22_2) states: 20,678,820,835,784 (13)
abstracting: (p7_3<=p4_4) states: 40,399,139,074,040 (13)
-> the formula is TRUE

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

MC time: 2m50.158sec

checking: AG [~ [[[Delivery_p22_8<=p11_4 | 3<=PaymentAmount_p11_6] & [p5_2<=DeliveryRequest_p12_5 & 1<=PaymentResponse_p11_12]]]]
normalized: ~ [E [true U [[Delivery_p22_8<=p11_4 | 3<=PaymentAmount_p11_6] & [p5_2<=DeliveryRequest_p12_5 & 1<=PaymentResponse_p11_12]]]]

abstracting: (1<=PaymentResponse_p11_12) states: 25,505,514,361,540 (13)
abstracting: (p5_2<=DeliveryRequest_p12_5) states: 77,180,911,953,220 (13)
abstracting: (3<=PaymentAmount_p11_6) states: 0
abstracting: (Delivery_p22_8<=p11_4) states: 81,274,632,316,112 (13)

before gc: list nodes free: 1923986

after gc: idd nodes used:2119780, unused:61880220; list nodes free:316230709
-> the formula is FALSE

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

MC time: 1m34.940sec

checking: EF [[[1<=p10_2 & ~ [Status_p22_11<=p2_2]] | [[p4_1<=WhatDeliver_p12_1 & Organization_p21_2<=p3_8] & ~ [DeliveryRequest_p12_5<=p7_2]]]]
normalized: E [true U [[[p4_1<=WhatDeliver_p12_1 & Organization_p21_2<=p3_8] & ~ [DeliveryRequest_p12_5<=p7_2]] | [1<=p10_2 & ~ [Status_p22_11<=p2_2]]]]

abstracting: (Status_p22_11<=p2_2) states: 50,859,569,019,184 (13)
abstracting: (1<=p10_2) states: 17,123,835,371,864 (13)
abstracting: (DeliveryRequest_p12_5<=p7_2) states: 74,482,416,985,160 (13)
abstracting: (Organization_p21_2<=p3_8) states: 82,782,283,481,364 (13)
abstracting: (p4_1<=WhatDeliver_p12_1) states: 74,885,680,995,848 (13)
-> the formula is TRUE

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

MC time: 6m23.292sec


Total processing time: 28m23.341sec


BK_STOP 1463725832598

--------------------
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.000sec

498226 732932
iterations count:2856 (63), effective:568 (12)

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

iterations count:217 (4), effective:32 (0)

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

iterations count:635 (14), effective:157 (3)

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

iterations count:467 (10), effective:88 (1)

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

iterations count:688 (15), effective:155 (3)
730532
iterations count:1054 (23), effective:207 (4)

iterations count:565 (12), effective:121 (2)

iterations count:764 (16), effective:179 (3)

iterations count:354 (7), effective:80 (1)

iterations count:680 (15), effective:164 (3)

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="/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 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 r065kn-blw3-146358913300097"
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 ;