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 S_IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441636900111
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494775478873

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=CTLCardinality.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.001sec

net check time: 0m 0.000sec

init dd package: 0m 1.095sec

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


RS generation: 4m 1.938sec


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



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

checking: EX [EF [[2<=p10_2 | 3<=Delivery_p22_1]]]
normalized: EX [E [true U [2<=p10_2 | 3<=Delivery_p22_1]]]

abstracting: (3<=Delivery_p22_1)
states: 779,238,152,856 (11)
abstracting: (2<=p10_2)
states: 0
.-> the formula is TRUE

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

MC time: 1m15.426sec

checking: AG [AF [~ [WhatDeliver_p12_1<=p1_2]]]
normalized: ~ [E [true U EG [WhatDeliver_p12_1<=p1_2]]]

abstracting: (WhatDeliver_p12_1<=p1_2)
states: 86,120,194,391,136 (13)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m27.583sec

checking: EG [AF [p4_1<=p6_6]]
normalized: EG [~ [EG [~ [p4_1<=p6_6]]]]

abstracting: (p4_1<=p6_6)
states: 77,421,406,398,168 (13)
..............................
before gc: list nodes free: 860632

after gc: idd nodes used:4472480, unused:59527520; list nodes free:306313025
......................................................................
before gc: list nodes free: 2371320

after gc: idd nodes used:5845619, unused:58154381; list nodes free:299770406
MC time: 3m54.749sec

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

abstracting: (2<=p5_2)
states: 3,667,880,724,776 (12)
abstracting: (3<=BrandSelection_p11_5)
states: 0
-> the formula is TRUE

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

MC time: 0m32.151sec

checking: A [[1<=Organization_p20_7 & ~ [1<=Status_p21_5]] U EG [Status_p21_5<=p12_3]]
normalized: [~ [EG [~ [EG [Status_p21_5<=p12_3]]]] & ~ [E [~ [EG [Status_p21_5<=p12_3]] U [~ [[1<=Organization_p20_7 & ~ [1<=Status_p21_5]]] & ~ [EG [Status_p21_5<=p12_3]]]]]]

abstracting: (Status_p21_5<=p12_3)
states: 84,437,943,745,312 (13)
.
EG iterations: 1
abstracting: (1<=Status_p21_5)
states: 20,678,820,835,784 (13)
abstracting: (1<=Organization_p20_7)
states: 20,678,820,835,784 (13)
abstracting: (Status_p21_5<=p12_3)
states: 84,437,943,745,312 (13)
.
EG iterations: 1
abstracting: (Status_p21_5<=p12_3)
states: 84,437,943,745,312 (13)
.
EG iterations: 1
.........................................................................................................................................
EG iterations: 137
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m29.556sec

checking: A [[~ [1<=WhatDeliver_p12_1] & ~ [1<=Organization_p22_5]] U EG [p7_1<=Delivery_p20]]
normalized: [~ [EG [~ [EG [p7_1<=Delivery_p20]]]] & ~ [E [~ [EG [p7_1<=Delivery_p20]] U [~ [[~ [1<=Organization_p22_5] & ~ [1<=WhatDeliver_p12_1]]] & ~ [EG [p7_1<=Delivery_p20]]]]]]

abstracting: (p7_1<=Delivery_p20)
states: 75,553,296,600,928 (13)

before gc: list nodes free: 1006565

after gc: idd nodes used:5085741, unused:58914259; list nodes free:307456541
.............................................................................
before gc: list nodes free: 1950681

after gc: idd nodes used:7636474, unused:56363526; list nodes free:302612139
MC time: 4m 6.021sec

checking: AG [AF [[p10_0<=Delivery_p20_10 & p11_7<=PaySchemeData_p11_10]]]
normalized: ~ [E [true U EG [~ [[p10_0<=Delivery_p20_10 & p11_7<=PaySchemeData_p11_10]]]]]

abstracting: (p11_7<=PaySchemeData_p11_10)
states: 37,420,584,943,162 (13)
abstracting: (p10_0<=Delivery_p20_10)
states: 38,873,535,823,416 (13)
.........................................................................................................................................................................................
EG iterations: 185
-> the formula is FALSE

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

MC time: 2m57.161sec

checking: ~ [AF [[~ [p5_2<=Organization_p22_9] | [1<=PaymentNote_p21_16 & p3_1<=Delivery_p22_1]]]]
normalized: EG [~ [[[1<=PaymentNote_p21_16 & p3_1<=Delivery_p22_1] | ~ [p5_2<=Organization_p22_9]]]]

abstracting: (p5_2<=Organization_p22_9)
states: 78,186,161,058,518 (13)
abstracting: (p3_1<=Delivery_p22_1)
states: 75,553,296,600,928 (13)
abstracting: (1<=PaymentNote_p21_16)
states: 20,678,820,835,784 (13)

before gc: list nodes free: 737746

after gc: idd nodes used:6847953, unused:57152047; list nodes free:307772950
..................................
before gc: list nodes free: 4634814

after gc: idd nodes used:10688299, unused:53311701; list nodes free:287335136
MC time: 4m10.643sec

checking: [E [[1<=p4_3 | 3<=PaymentNote_p21_16] U DeliveryRequest_p12_5<=Payment_p21_3] & AX [AF [1<=Status_p20_6]]]
normalized: [~ [EX [EG [~ [1<=Status_p20_6]]]] & E [[1<=p4_3 | 3<=PaymentNote_p21_16] U DeliveryRequest_p12_5<=Payment_p21_3]]

abstracting: (DeliveryRequest_p12_5<=Payment_p21_3)
states: 78,499,004,143,640 (13)
abstracting: (3<=PaymentNote_p21_16)
states: 779,238,152,856 (11)
abstracting: (1<=p4_3)
states: 56,557,168,748,832 (13)
abstracting: (1<=Status_p20_6)
states: 20,678,820,835,784 (13)
......................................................................MC time: 3m22.011sec

checking: [E [~ [3<=Organization_p21_8] U [3<=p11_8 & p7_1<=PaymentAmount_p11_6]] | 2<=Organization_p22_9]
normalized: [2<=Organization_p22_9 | E [~ [3<=Organization_p21_8] U [3<=p11_8 & p7_1<=PaymentAmount_p11_6]]]

abstracting: (p7_1<=PaymentAmount_p11_6)
states: 74,885,680,995,848 (13)
abstracting: (3<=p11_8)
states: 0
abstracting: (3<=Organization_p21_8)
states: 626,637,440,130 (11)
abstracting: (2<=Organization_p22_9)
states: 7,664,537,491,456 (12)
-> the formula is FALSE

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

MC time: 0m 5.311sec

checking: [EG [EX [1<=p5_1]] | ~ [[AG [p3_8<=p3_9] | [3<=PaymentResponse_p11_12 | ~ [p6_4<=OfferRequest_p10]]]]]
normalized: [~ [[[3<=PaymentResponse_p11_12 | ~ [p6_4<=OfferRequest_p10]] | ~ [E [true U ~ [p3_8<=p3_9]]]]] | EG [EX [1<=p5_1]]]

abstracting: (1<=p5_1)
states: 19,312,022,689,932 (13)
..
EG iterations: 1
abstracting: (p3_8<=p3_9)
states: 45,573,386,563,456 (13)

before gc: list nodes free: 14379350

after gc: idd nodes used:7785578, unused:56214422; list nodes free:302884618
abstracting: (p6_4<=OfferRequest_p10)
states: 67,682,767,255,560 (13)
abstracting: (3<=PaymentResponse_p11_12)
states: 0
-> the formula is TRUE

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

MC time: 1m34.941sec

checking: [DeliveryResponse_p12_6<=DeliveryNote_p22_14 & EF [[[2<=p4_5 & Status_p21_11<=Delivery_p22_8] & p5_4<=OfferRequest_p10]]]
normalized: [DeliveryResponse_p12_6<=DeliveryNote_p22_14 & E [true U [p5_4<=OfferRequest_p10 & [2<=p4_5 & Status_p21_11<=Delivery_p22_8]]]]

abstracting: (Status_p21_11<=Delivery_p22_8)
states: 71,062,007,086,720 (13)
abstracting: (2<=p4_5)
states: 4,222,601,069,000 (12)
abstracting: (p5_4<=OfferRequest_p10)
states: 7,703,206,424,218 (12)
abstracting: (DeliveryResponse_p12_6<=DeliveryNote_p22_14)
states: 76,346,109,993,088 (13)
-> the formula is TRUE

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

MC time: 0m39.039sec

checking: ~ [[[[[PayReceipt_p21_12<=p4_2 | 3<=Status_p21_11] | 3<=Order_p22_10] | p8_3<=PaymentRequest_p11_9] & AG [p3_9<=Delivery_p20_10]]]
normalized: ~ [[~ [E [true U ~ [p3_9<=Delivery_p20_10]]] & [p8_3<=PaymentRequest_p11_9 | [3<=Order_p22_10 | [PayReceipt_p21_12<=p4_2 | 3<=Status_p21_11]]]]]

abstracting: (3<=Status_p21_11)
states: 978,240,858,184 (11)
abstracting: (PayReceipt_p21_12<=p4_2)
states: 68,916,048,123,276 (13)
abstracting: (3<=Order_p22_10)
states: 1,836,571,161,864 (12)
abstracting: (p8_3<=PaymentRequest_p11_9)
states: 6,413,786,459,280 (12)
abstracting: (p3_9<=Delivery_p20_10)
states: 68,373,732,500,404 (13)
-> the formula is TRUE

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

MC time: 1m 2.902sec

checking: [[~ [[Order_p22_3<=p5_2 & ~ [p12_0<=Payment_p20_9]]] & AF [MerchantDelivery_p4_6<=Status_p21_14]] | EG [[p3_8<=Organization_p21_4 | 1<=p3_1]]]
normalized: [EG [[p3_8<=Organization_p21_4 | 1<=p3_1]] | [~ [EG [~ [MerchantDelivery_p4_6<=Status_p21_14]]] & ~ [[Order_p22_3<=p5_2 & ~ [p12_0<=Payment_p20_9]]]]]

abstracting: (p12_0<=Payment_p20_9)
states: 34,247,670,743,728 (13)
abstracting: (Order_p22_3<=p5_2)
states: 75,312,178,878,014 (13)
abstracting: (MerchantDelivery_p4_6<=Status_p21_14)
states: 3,738,418,101,696 (12)
.
EG iterations: 1
abstracting: (1<=p3_1)
states: 20,678,820,835,784 (13)
abstracting: (p3_8<=Organization_p21_4)
states: 50,037,121,750,442 (13)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m54.315sec

checking: E [~ [~ [p4_2<=ConsumerDelivery_p6_0]] U [[p11_0<=p1_1 & 3<=Delivery_p22_1] & [PaymentNote_p21_16<=MerchantOffer_p2 | Delivery_p22_8<=Payment_p21_3]]]
normalized: E [p4_2<=ConsumerDelivery_p6_0 U [[PaymentNote_p21_16<=MerchantOffer_p2 | Delivery_p22_8<=Payment_p21_3] & [p11_0<=p1_1 & 3<=Delivery_p22_1]]]

abstracting: (3<=Delivery_p22_1)
states: 779,238,152,856 (11)
abstracting: (p11_0<=p1_1)
states: 41,843,301,158,584 (13)
abstracting: (Delivery_p22_8<=Payment_p21_3)
states: 73,069,655,984,552 (13)
abstracting: (PaymentNote_p21_16<=MerchantOffer_p2)
states: 83,133,699,891,824 (13)
abstracting: (p4_2<=ConsumerDelivery_p6_0)
states: 75,553,296,600,928 (13)

before gc: list nodes free: 12604331

after gc: idd nodes used:17801078, unused:46198922; list nodes free:251231292

BK_TIME_CONFINEMENT_REACHED

--------------------
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:672 (14), effective:129 (2)

iterations count:49 (1), effective:1 (0)

net_ddint.h:596: Timeout: after 232 sec


iterations count:45 (1), effective:0 (0)

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

iterations count:45 (1), effective:0 (0)

net_ddint.h:596: Timeout: after 241 sec


iterations count:128 (2), effective:23 (0)

net_ddint.h:596: Timeout: after 224 sec


iterations count:52 (1), effective:2 (0)

net_ddint.h:596: Timeout: after 201 sec


iterations count:278 (6), effective:58 (1)

iterations count:691 (15), effective:159 (3)

iterations count:554 (12), effective:124 (2)

sat_reach.icc:155: Timeout: after 293 sec

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