Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r225-tall-167856407100113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407100113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 5 18:22 model.pnml

--------------------
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-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678606627747

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C03M03P03D03
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: IOTPpurchase_PT_C03M03P03D03
(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 2.811sec


RS generation: 0m 0.183sec


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



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

checking: EG [p12_0<=3]
normalized: EG [p12_0<=3]

abstracting: (p12_0<=3)
states: 354,176 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [AG [p7_3<=1]]
normalized: E [true U ~ [E [true U ~ [p7_3<=1]]]]

abstracting: (p7_3<=1)
states: 313,056 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

checking: EG [AF [p11_13<=2]]
normalized: EG [~ [EG [~ [p11_13<=2]]]]

abstracting: (p11_13<=2)
states: 354,176 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.051sec

checking: AX [~ [EG [~ [EG [A [2<=DeliveryNote_p22_12 U p10_0<=0]]]]]]
normalized: ~ [EX [EG [~ [EG [[~ [EG [~ [p10_0<=0]]] & ~ [E [~ [p10_0<=0] U [~ [2<=DeliveryNote_p22_12] & ~ [p10_0<=0]]]]]]]]]]

abstracting: (p10_0<=0)
states: 33,232 (4)
abstracting: (2<=DeliveryNote_p22_12)
states: 1,072 (3)
abstracting: (p10_0<=0)
states: 33,232 (4)
abstracting: (p10_0<=0)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
...............................................................................................
EG iterations: 95

EG iterations: 0
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.302sec

checking: AF [AX [EG [[EX [PayReceipt_p21_12<=3] | E [PaymentRequest_p11_9<=2 U 3<=p12_4]]]]]
normalized: ~ [EG [EX [~ [EG [[E [PaymentRequest_p11_9<=2 U 3<=p12_4] | EX [PayReceipt_p21_12<=3]]]]]]]

abstracting: (PayReceipt_p21_12<=3)
states: 354,176 (5)
.abstracting: (3<=p12_4)
states: 0
abstracting: (PaymentRequest_p11_9<=2)
states: 354,176 (5)

EG iterations: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: ~ [AX [AG [EF [[AX [p3_2<=p3_4] & E [1<=PaySchemeData_p11_10 U DeliveryResponse_p12_6<=3]]]]]]
normalized: EX [E [true U ~ [E [true U [E [1<=PaySchemeData_p11_10 U DeliveryResponse_p12_6<=3] & ~ [EX [~ [p3_2<=p3_4]]]]]]]]

abstracting: (p3_2<=p3_4)
states: 277,856 (5)
.abstracting: (DeliveryResponse_p12_6<=3)
states: 354,176 (5)
abstracting: (1<=PaySchemeData_p11_10)
states: 33,626 (4)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: E [EX [3<=p1_1] U EX [AF [E [AG [Organization_p20_7<=p5_3] U EX [ConsumerOffer_p1<=Status_p22_7]]]]]
normalized: E [EX [3<=p1_1] U EX [~ [EG [~ [E [~ [E [true U ~ [Organization_p20_7<=p5_3]]] U EX [ConsumerOffer_p1<=Status_p22_7]]]]]]]

abstracting: (ConsumerOffer_p1<=Status_p22_7)
states: 320,944 (5)
.abstracting: (Organization_p20_7<=p5_3)
states: 333,864 (5)
......................................................
EG iterations: 54
.abstracting: (3<=p1_1)
states: 64
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.319sec

checking: EF [[AX [[AF [[p8_1<=0 | 2<=Status_p21_11]] | ~ [[EF [p6_6<=p4_5] | ~ [2<=p1_2]]]]] & 3<=p11_13]]
normalized: E [true U [3<=p11_13 & ~ [EX [~ [[~ [[~ [2<=p1_2] | E [true U p6_6<=p4_5]]] | ~ [EG [~ [[p8_1<=0 | 2<=Status_p21_11]]]]]]]]]]

abstracting: (2<=Status_p21_11)
states: 808
abstracting: (p8_1<=0)
states: 327,952 (5)
.
EG iterations: 1
abstracting: (p6_6<=p4_5)
states: 320,296 (5)
abstracting: (2<=p1_2)
states: 8,216 (3)
.abstracting: (3<=p11_13)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.064sec

checking: EF [E [~ [[3<=p3_6 & DeliveryNote_p22_14<=2]] U AG [~ [[[PaymentHandlerPayment_p5_0<=2 | 2<=p3_4] & MerchantPayment_p4_0<=Organization_p21_2]]]]]
normalized: E [true U E [~ [[3<=p3_6 & DeliveryNote_p22_14<=2]] U ~ [E [true U [MerchantPayment_p4_0<=Organization_p21_2 & [PaymentHandlerPayment_p5_0<=2 | 2<=p3_4]]]]]]

abstracting: (2<=p3_4)
states: 848
abstracting: (PaymentHandlerPayment_p5_0<=2)
states: 280,546 (5)
abstracting: (MerchantPayment_p4_0<=Organization_p21_2)
states: 260,312 (5)
abstracting: (DeliveryNote_p22_14<=2)
states: 354,112 (5)
abstracting: (3<=p3_6)
states: 16
-> the formula is FALSE

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

MC time: 0m 0.052sec

checking: [~ [EF [~ [Delivery_p22_1<=1]]] & AF [AX [[[[[p3_7<=Payment_p21_3 & PaymentHandlerPayment_p5_0<=1] & 1<=PaymentNote_p21_13] | EG [p4_3<=p11_7]] | ~ [EX [1<=MerchantPayment_p4_0]]]]]]
normalized: [~ [EG [EX [~ [[[[1<=PaymentNote_p21_13 & [p3_7<=Payment_p21_3 & PaymentHandlerPayment_p5_0<=1]] | EG [p4_3<=p11_7]] | ~ [EX [1<=MerchantPayment_p4_0]]]]]]] & ~ [E [true U ~ [Delivery_p22_1<=1]]]]

abstracting: (Delivery_p22_1<=1)
states: 353,328 (5)
abstracting: (1<=MerchantPayment_p4_0)
states: 97,704 (4)
.abstracting: (p4_3<=p11_7)
states: 344,640 (5)
.
EG iterations: 1
abstracting: (PaymentHandlerPayment_p5_0<=1)
states: 188,236 (5)
abstracting: (p3_7<=Payment_p21_3)
states: 354,176 (5)
abstracting: (1<=PaymentNote_p21_13)
states: 29,844 (4)
..................
EG iterations: 17
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

checking: E [EG [AF [AX [[Delivery_p22_8<=2 | OfferResponce_p10<=1]]]] U AG [[AF [[AG [DeliveryResponse_p12_6<=Delivery_p22_4] & [PayReceipt_p21_15<=Delivery_p22_1 & PaymentRequest_p11_9<=1]]] & AG [PaymentResponse_p11_12<=3]]]]
normalized: E [EG [~ [EG [EX [~ [[Delivery_p22_8<=2 | OfferResponce_p10<=1]]]]]] U ~ [E [true U ~ [[~ [E [true U ~ [PaymentResponse_p11_12<=3]]] & ~ [EG [~ [[[PayReceipt_p21_15<=Delivery_p22_1 & PaymentRequest_p11_9<=1] & ~ [E [true U ~ [DeliveryResponse_p12_6<=Delivery_p22_4]]]]]]]]]]]]

abstracting: (DeliveryResponse_p12_6<=Delivery_p22_4)
states: 325,104 (5)
abstracting: (PaymentRequest_p11_9<=1)
states: 354,176 (5)
abstracting: (PayReceipt_p21_15<=Delivery_p22_1)
states: 333,496 (5)

EG iterations: 0
abstracting: (PaymentResponse_p11_12<=3)
states: 354,176 (5)
abstracting: (OfferResponce_p10<=1)
states: 354,176 (5)
abstracting: (Delivery_p22_8<=2)
states: 354,160 (5)
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.137sec

checking: AF [[[EG [p6_7<=Status_p22_13] & E [AX [~ [p8_1<=2]] U p3_8<=3]] & ~ [[p3_8<=3 & [EG [[2<=p6_2 & 1<=Organization_p20_7]] & E [[1<=Status_p20_6 & Status_p21_14<=1] U p3_6<=0]]]]]]
normalized: ~ [EG [~ [[~ [[p3_8<=3 & [E [[1<=Status_p20_6 & Status_p21_14<=1] U p3_6<=0] & EG [[2<=p6_2 & 1<=Organization_p20_7]]]]] & [E [~ [EX [p8_1<=2]] U p3_8<=3] & EG [p6_7<=Status_p22_13]]]]]]

abstracting: (p6_7<=Status_p22_13)
states: 320,944 (5)
.
EG iterations: 1
abstracting: (p3_8<=3)
states: 354,176 (5)
abstracting: (p8_1<=2)
states: 354,160 (5)
.abstracting: (1<=Organization_p20_7)
states: 21,512 (4)
abstracting: (2<=p6_2)
states: 8,216 (3)
.............
EG iterations: 13
abstracting: (p3_6<=0)
states: 332,664 (5)
abstracting: (Status_p21_14<=1)
states: 353,328 (5)
abstracting: (1<=Status_p20_6)
states: 21,512 (4)
abstracting: (p3_8<=3)
states: 354,176 (5)
.............................................................................................
EG iterations: 93
-> the formula is TRUE

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

MC time: 0m 0.954sec

checking: EG [[EX [E [[E [DeliveryHandlerDelivery_p8_0<=Organization_p22_9 U PaySchemeData_p21_10<=2] | E [p2_1<=Status_p20 U Organization_p20_2<=3]] U AX [p10_2<=DeliveryRequest_p12_5]]] & A [[AG [A [p11_4<=3 U 2<=Status_p21_14]] | ~ [p7_3<=3]] U 3<=BrandSelection_p11_5]]]
normalized: EG [[[~ [EG [~ [3<=BrandSelection_p11_5]]] & ~ [E [~ [3<=BrandSelection_p11_5] U [~ [[~ [p7_3<=3] | ~ [E [true U ~ [[~ [EG [~ [2<=Status_p21_14]]] & ~ [E [~ [2<=Status_p21_14] U [~ [p11_4<=3] & ~ [2<=Status_p21_14]]]]]]]]]] & ~ [3<=BrandSelection_p11_5]]]]] & EX [E [[E [p2_1<=Status_p20 U Organization_p20_2<=3] | E [DeliveryHandlerDelivery_p8_0<=Organization_p22_9 U PaySchemeData_p21_10<=2]] U ~ [EX [~ [p10_2<=DeliveryRequest_p12_5]]]]]]]

abstracting: (p10_2<=DeliveryRequest_p12_5)
states: 334,928 (5)
.abstracting: (PaySchemeData_p21_10<=2)
states: 354,160 (5)
abstracting: (DeliveryHandlerDelivery_p8_0<=Organization_p22_9)
states: 102,460 (5)
abstracting: (Organization_p20_2<=3)
states: 354,176 (5)
abstracting: (p2_1<=Status_p20)
states: 333,496 (5)
.abstracting: (3<=BrandSelection_p11_5)
states: 0
abstracting: (2<=Status_p21_14)
states: 848
abstracting: (p11_4<=3)
states: 354,176 (5)
abstracting: (2<=Status_p21_14)
states: 848
abstracting: (2<=Status_p21_14)
states: 848
.
EG iterations: 1
abstracting: (p7_3<=3)
states: 354,176 (5)
abstracting: (3<=BrandSelection_p11_5)
states: 0
abstracting: (3<=BrandSelection_p11_5)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: AG [A [E [AF [[Status_p22_7<=PaySchemeData_p11_10 | p2_1<=3]] U AF [[BrandList_p11_2<=Delivery_p20 & 2<=p4_4]]] U [[[~ [p6_1<=1] & AF [PaymentAmount_p11_6<=p12_3]] | 3<=Payment_p20_9] | [[EF [Delivery_p20_10<=Organization_p22_5] | [[3<=p11_0 & 2<=Delivery_p20] | p8_1<=ConsumerPayment_p3]] & ~ [PaymentNote_p21_16<=2]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[3<=Payment_p20_9 | [~ [p6_1<=1] & ~ [EG [~ [PaymentAmount_p11_6<=p12_3]]]]] | [[E [true U Delivery_p20_10<=Organization_p22_5] | [p8_1<=ConsumerPayment_p3 | [3<=p11_0 & 2<=Delivery_p20]]] & ~ [PaymentNote_p21_16<=2]]]]]] & ~ [E [~ [[[3<=Payment_p20_9 | [~ [p6_1<=1] & ~ [EG [~ [PaymentAmount_p11_6<=p12_3]]]]] | [[E [true U Delivery_p20_10<=Organization_p22_5] | [p8_1<=ConsumerPayment_p3 | [3<=p11_0 & 2<=Delivery_p20]]] & ~ [PaymentNote_p21_16<=2]]]] U [~ [E [~ [EG [~ [[Status_p22_7<=PaySchemeData_p11_10 | p2_1<=3]]]] U ~ [EG [~ [[BrandList_p11_2<=Delivery_p20 & 2<=p4_4]]]]]] & ~ [[[3<=Payment_p20_9 | [~ [p6_1<=1] & ~ [EG [~ [PaymentAmount_p11_6<=p12_3]]]]] | [[E [true U Delivery_p20_10<=Organization_p22_5] | [p8_1<=ConsumerPayment_p3 | [3<=p11_0 & 2<=Delivery_p20]]] & ~ [PaymentNote_p21_16<=2]]]]]]]]]]]

abstracting: (PaymentNote_p21_16<=2)
states: 354,160 (5)
abstracting: (2<=Delivery_p20)
states: 848
abstracting: (3<=p11_0)
states: 0
abstracting: (p8_1<=ConsumerPayment_p3)
states: 329,056 (5)
abstracting: (Delivery_p20_10<=Organization_p22_5)
states: 335,576 (5)
abstracting: (PaymentAmount_p11_6<=p12_3)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p6_1<=1)
states: 353,328 (5)
abstracting: (3<=Payment_p20_9)
states: 16
abstracting: (2<=p4_4)
states: 848
abstracting: (BrandList_p11_2<=Delivery_p20)
states: 334,328 (5)
.
EG iterations: 1
abstracting: (p2_1<=3)
states: 354,176 (5)
abstracting: (Status_p22_7<=PaySchemeData_p11_10)
states: 321,234 (5)
.
EG iterations: 1
abstracting: (PaymentNote_p21_16<=2)
states: 354,160 (5)
abstracting: (2<=Delivery_p20)
states: 848
abstracting: (3<=p11_0)
states: 0
abstracting: (p8_1<=ConsumerPayment_p3)
states: 329,056 (5)
abstracting: (Delivery_p20_10<=Organization_p22_5)
states: 335,576 (5)
abstracting: (PaymentAmount_p11_6<=p12_3)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p6_1<=1)
states: 353,328 (5)
abstracting: (3<=Payment_p20_9)
states: 16
abstracting: (PaymentNote_p21_16<=2)
states: 354,160 (5)
abstracting: (2<=Delivery_p20)
states: 848
abstracting: (3<=p11_0)
states: 0
abstracting: (p8_1<=ConsumerPayment_p3)
states: 329,056 (5)
abstracting: (Delivery_p20_10<=Organization_p22_5)
states: 335,576 (5)
abstracting: (PaymentAmount_p11_6<=p12_3)
states: 352,744 (5)
....................................
EG iterations: 36
abstracting: (p6_1<=1)
states: 353,328 (5)
abstracting: (3<=Payment_p20_9)
states: 16
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: [EG [[A [p3_1<=p6_1 U [[[3<=p11_13 & DeliveryNote_p22_14<=1] | A [1<=p3_1 U p6_3<=p5_4]] & [AF [1<=Payment_p21_1] | [p11_4<=2 | p6_3<=DeliveryResponse_p12_6]]]] | p4_4<=p2_2]] | AX [[[AG [[[1<=PayReceipt_p21_12 | PaymentAmount_p11_6<=3] & p4_5<=0]] & ConsumerOffer_p1<=0] | [AG [EF [2<=DeliveryRequest_p12_5]] & ~ [p4_3<=p12_7]]]]]
normalized: [~ [EX [~ [[[~ [p4_3<=p12_7] & ~ [E [true U ~ [E [true U 2<=DeliveryRequest_p12_5]]]]] | [ConsumerOffer_p1<=0 & ~ [E [true U ~ [[p4_5<=0 & [1<=PayReceipt_p21_12 | PaymentAmount_p11_6<=3]]]]]]]]]] | EG [[p4_4<=p2_2 | [~ [EG [~ [[[[p11_4<=2 | p6_3<=DeliveryResponse_p12_6] | ~ [EG [~ [1<=Payment_p21_1]]]] & [[~ [EG [~ [p6_3<=p5_4]]] & ~ [E [~ [p6_3<=p5_4] U [~ [1<=p3_1] & ~ [p6_3<=p5_4]]]]] | [3<=p11_13 & DeliveryNote_p22_14<=1]]]]]] & ~ [E [~ [[[[p11_4<=2 | p6_3<=DeliveryResponse_p12_6] | ~ [EG [~ [1<=Payment_p21_1]]]] & [[~ [EG [~ [p6_3<=p5_4]]] & ~ [E [~ [p6_3<=p5_4] U [~ [1<=p3_1] & ~ [p6_3<=p5_4]]]]] | [3<=p11_13 & DeliveryNote_p22_14<=1]]]] U [~ [p3_1<=p6_1] & ~ [[[[p11_4<=2 | p6_3<=DeliveryResponse_p12_6] | ~ [EG [~ [1<=Payment_p21_1]]]] & [[~ [EG [~ [p6_3<=p5_4]]] & ~ [E [~ [p6_3<=p5_4] U [~ [1<=p3_1] & ~ [p6_3<=p5_4]]]]] | [3<=p11_13 & DeliveryNote_p22_14<=1]]]]]]]]]]]

abstracting: (DeliveryNote_p22_14<=1)
states: 352,000 (5)
abstracting: (3<=p11_13)
states: 0
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (1<=p3_1)
states: 21,512 (4)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=Payment_p21_1)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (p6_3<=DeliveryResponse_p12_6)
states: 320,880 (5)
abstracting: (p11_4<=2)
states: 354,176 (5)
abstracting: (p3_1<=p6_1)
states: 333,496 (5)
abstracting: (DeliveryNote_p22_14<=1)
states: 352,000 (5)
abstracting: (3<=p11_13)
states: 0
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (1<=p3_1)
states: 21,512 (4)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=Payment_p21_1)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (p6_3<=DeliveryResponse_p12_6)
states: 320,880 (5)
abstracting: (p11_4<=2)
states: 354,176 (5)
abstracting: (DeliveryNote_p22_14<=1)
states: 352,000 (5)
abstracting: (3<=p11_13)
states: 0
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (1<=p3_1)
states: 21,512 (4)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
abstracting: (p6_3<=p5_4)
states: 344,382 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=Payment_p21_1)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (p6_3<=DeliveryResponse_p12_6)
states: 320,880 (5)
abstracting: (p11_4<=2)
states: 354,176 (5)
..........................................................................
EG iterations: 74
abstracting: (p4_4<=p2_2)
states: 333,496 (5)
.
EG iterations: 1
abstracting: (PaymentAmount_p11_6<=3)
states: 354,176 (5)
abstracting: (1<=PayReceipt_p21_12)
states: 29,844 (4)
abstracting: (p4_5<=0)
states: 332,664 (5)
abstracting: (ConsumerOffer_p1<=0)
states: 318,832 (5)
abstracting: (2<=DeliveryRequest_p12_5)
states: 0
abstracting: (p4_3<=p12_7)
states: 342,368 (5)
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.193sec

checking: [E [[[[~ [[EF [p3_2<=2] | [2<=Organization_p20_7 | Organization_p22_9<=Payment_p21_3]]] | [E [p11_4<=OfferResponce_p10 U 2<=HowDeliver_p12_2] | ~ [Organization_p21_4<=p3_4]]] | p8_2<=0] & ~ [[1<=p7_1 | [AG [p5_4<=0] | [EG [p7_3<=3] | [p3_1<=1 | 1<=Status_p20]]]]]] U ~ [AF [[[[PaymentRequest_p11_9<=p7_1 | 1<=PaymentRequest_p11_9] & ~ [2<=p5_3]] | AF [1<=Order_p20_8]]]]] | EG [p12_3<=1]]
normalized: [E [[[p8_2<=0 | [~ [[E [true U p3_2<=2] | [2<=Organization_p20_7 | Organization_p22_9<=Payment_p21_3]]] | [~ [Organization_p21_4<=p3_4] | E [p11_4<=OfferResponce_p10 U 2<=HowDeliver_p12_2]]]] & ~ [[1<=p7_1 | [[[p3_1<=1 | 1<=Status_p20] | EG [p7_3<=3]] | ~ [E [true U ~ [p5_4<=0]]]]]]] U EG [~ [[[[PaymentRequest_p11_9<=p7_1 | 1<=PaymentRequest_p11_9] & ~ [2<=p5_3]] | ~ [EG [~ [1<=Order_p20_8]]]]]]] | EG [p12_3<=1]]

abstracting: (p12_3<=1)
states: 354,176 (5)

EG iterations: 0
abstracting: (1<=Order_p20_8)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (2<=p5_3)
states: 808
abstracting: (1<=PaymentRequest_p11_9)
states: 20,680 (4)
abstracting: (PaymentRequest_p11_9<=p7_1)
states: 334,328 (5)
.
EG iterations: 1
abstracting: (p5_4<=0)
states: 94,150 (4)
abstracting: (p7_3<=3)
states: 354,176 (5)

EG iterations: 0
abstracting: (1<=Status_p20)
states: 21,512 (4)
abstracting: (p3_1<=1)
states: 353,328 (5)
abstracting: (1<=p7_1)
states: 21,512 (4)
abstracting: (2<=HowDeliver_p12_2)
states: 0
abstracting: (p11_4<=OfferResponce_p10)
states: 334,312 (5)
abstracting: (Organization_p21_4<=p3_4)
states: 313,632 (5)
abstracting: (Organization_p22_9<=Payment_p21_3)
states: 330,136 (5)
abstracting: (2<=Organization_p20_7)
states: 848
abstracting: (p3_2<=2)
states: 353,984 (5)
abstracting: (p8_2<=0)
states: 327,952 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.264sec

totally nodes used: 5185903 (5.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2854425 11556246 14410671
used/not used/entry size/cache size: 14571220 52537644 16 1024MB
basic ops cache: hits/miss/sum: 262169 1341132 1603301
used/not used/entry size/cache size: 2198232 14578984 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: 20064 80117 100181
used/not used/entry size/cache size: 79774 8308834 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 62694375
1 3781999
2 519805
3 94598
4 15337
5 1827
6 495
7 182
8 50
9 48
>= 10 148

Total processing time: 0m10.007sec


BK_STOP 1678606637803

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


initing FirstDep: 0m 0.002sec


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

initing FirstDep: 0m 0.000sec


iterations count:405 (9), effective:88 (1)

iterations count:51 (1), effective:3 (0)

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

iterations count:98 (2), effective:16 (0)

iterations count:262 (5), effective:47 (1)

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

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

iterations count:51 (1), effective:3 (0)

iterations count:279 (6), effective:52 (1)

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

iterations count:287 (6), effective:52 (1)

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

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

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

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

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

iterations count:294 (6), effective:73 (1)

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

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

iterations count:146 (3), effective:30 (0)

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

iterations count:146 (3), effective:30 (0)

iterations count:146 (3), effective:30 (0)

iterations count:63 (1), effective:5 (0)

iterations count:55 (1), effective:3 (0)

iterations count:55 (1), effective:3 (0)

iterations count:200 (4), effective:29 (0)

iterations count:55 (1), effective:3 (0)

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

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

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

iterations count:54 (1), effective:3 (0)

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-C03M03P03D03"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r225-tall-167856407100113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;