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-167856407200129.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-C12M10P15D17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407200129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:17 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.5K 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.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 15:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-C12M10P15D17-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-09
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

=== Now, execution of the tool begins

BK_START 1678607031191

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-C12M10P15D17
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_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 2.914sec


RS generation: 1m57.817sec


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



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

checking: EG [AG [~ [AG [EX [p8_1<=12]]]]]
normalized: EG [~ [E [true U ~ [E [true U ~ [EX [p8_1<=12]]]]]]]

abstracting: (p8_1<=12)
states: 92,677,131,972,792 (13)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m17.520sec

checking: EG [AX [EX [AG [DeliveryRequest_p12_5<=7]]]]
normalized: EG [~ [EX [~ [EX [~ [E [true U ~ [DeliveryRequest_p12_5<=7]]]]]]]]

abstracting: (DeliveryRequest_p12_5<=7)
states: 92,677,131,972,792 (13)
..
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.418sec

checking: ~ [AX [AF [EG [E [p6_6<=14 U 12<=p3_5]]]]]
normalized: EX [EG [~ [EG [E [p6_6<=14 U 12<=p3_5]]]]]

abstracting: (12<=p3_5)
states: 0
abstracting: (p6_6<=14)
states: 92,677,131,972,792 (13)
.
EG iterations: 1

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.445sec

checking: AG [EX [[AX [AG [p5_4<=Order_p22_10]] | 6<=PayReceipt_p21_15]]]
normalized: ~ [E [true U ~ [EX [[6<=PayReceipt_p21_15 | ~ [EX [E [true U ~ [p5_4<=Order_p22_10]]]]]]]]]

abstracting: (p5_4<=Order_p22_10)
states: 8,698,729,096,926 (12)
.abstracting: (6<=PayReceipt_p21_15)
states: 2,211,765,696 (9)
.-> the formula is FALSE

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

MC time: 0m 7.557sec

checking: AF [[~ [AF [17<=Status_p20_6]] & ~ [p7_1<=Organization_p20_2]]]
normalized: ~ [EG [~ [[~ [p7_1<=Organization_p20_2] & EG [~ [17<=Status_p20_6]]]]]]

abstracting: (17<=Status_p20_6)
states: 0

EG iterations: 0
abstracting: (p7_1<=Organization_p20_2)
states: 75,553,296,600,928 (13)
........................................................
before gc: list nodes free: 969943

after gc: idd nodes used:3841150, unused:60158850; list nodes free:315784327
..........................
before gc: list nodes free: 692540

after gc: idd nodes used:5307388, unused:58692612; list nodes free:312284836
..........
before gc: list nodes free: 3207215

after gc: idd nodes used:7336402, unused:56663598; list nodes free:302092040
.MC time: 4m49.543sec

checking: EG [~ [EX [[EG [Status_p22_13<=6] & [~ [2<=p10_0] | [Organization_p21_8<=14 | p11_0<=2]]]]]]
normalized: EG [~ [EX [[[[Organization_p21_8<=14 | p11_0<=2] | ~ [2<=p10_0]] & EG [Status_p22_13<=6]]]]]

abstracting: (Status_p22_13<=6)
states: 92,674,466,164,624 (13)
.
EG iterations: 1
abstracting: (2<=p10_0)
states: 0
abstracting: (p11_0<=2)
states: 92,677,131,972,792 (13)
abstracting: (Organization_p21_8<=14)
states: 92,677,131,972,792 (13)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m13.831sec

checking: A [Order_p22_10<=p11_3 U EX [p12_4<=Payment_p21_7]]
normalized: [~ [EG [~ [EX [p12_4<=Payment_p21_7]]]] & ~ [E [~ [EX [p12_4<=Payment_p21_7]] U [~ [Order_p22_10<=p11_3] & ~ [EX [p12_4<=Payment_p21_7]]]]]]

abstracting: (p12_4<=Payment_p21_7)
states: 37,836,444,971,580 (13)

before gc: list nodes free: 6139674

after gc: idd nodes used:3513600, unused:60486400; list nodes free:321877401
.abstracting: (Order_p22_10<=p11_3)
states: 81,274,632,316,112 (13)
abstracting: (p12_4<=Payment_p21_7)
states: 37,836,444,971,580 (13)
.abstracting: (p12_4<=Payment_p21_7)
states: 37,836,444,971,580 (13)
........................................
before gc: list nodes free: 22028848

after gc: idd nodes used:9419139, unused:54580861; list nodes free:293436569
..........
before gc: list nodes free: 27493310

after gc: idd nodes used:12163873, unused:51836127; list nodes free:280284768
MC time: 4m50.932sec

checking: AF [[EX [~ [AX [AX [10<=p11_11]]]] & AG [[EX [Organization_p21_8<=10] & ~ [[[1<=p11_7 | p6_7<=5] & E [p3_8<=8 U Payment_p21_1<=1]]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[~ [[E [p3_8<=8 U Payment_p21_1<=1] & [1<=p11_7 | p6_7<=5]]] & EX [Organization_p21_8<=10]]]]] & EX [EX [EX [~ [10<=p11_11]]]]]]]]

abstracting: (10<=p11_11)
states: 0
...abstracting: (Organization_p21_8<=10)
states: 92,677,131,972,792 (13)
.abstracting: (p6_7<=5)
states: 92,659,368,456,312 (13)
abstracting: (1<=p11_7)
states: 75,553,296,600,928 (13)
abstracting: (Payment_p21_1<=1)
states: 88,454,530,903,792 (13)
abstracting: (p3_8<=8)
states: 92,677,113,293,838 (13)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m28.685sec

checking: AG [AG [[A [~ [[Organization_p21_8<=4 & p11_4<=11]] U E [12<=p3_5 U p8_1<=15]] & E [AF [Organization_p21_4<=2] U EG [1<=MerchantDelivery_p4_6]]]]]
normalized: ~ [E [true U E [true U ~ [[E [~ [EG [~ [Organization_p21_4<=2]]] U EG [1<=MerchantDelivery_p4_6]] & [~ [EG [~ [E [12<=p3_5 U p8_1<=15]]]] & ~ [E [~ [E [12<=p3_5 U p8_1<=15]] U [[Organization_p21_8<=4 & p11_4<=11] & ~ [E [12<=p3_5 U p8_1<=15]]]]]]]]]]]

abstracting: (p8_1<=15)
states: 92,677,131,972,792 (13)
abstracting: (12<=p3_5)
states: 0
abstracting: (p11_4<=11)
states: 92,677,131,972,792 (13)
abstracting: (Organization_p21_8<=4)
states: 92,664,743,825,788 (13)
abstracting: (p8_1<=15)
states: 92,677,131,972,792 (13)
abstracting: (12<=p3_5)
states: 0
abstracting: (p8_1<=15)
states: 92,677,131,972,792 (13)
abstracting: (12<=p3_5)
states: 0
.
EG iterations: 1
abstracting: (1<=MerchantDelivery_p4_6)
states: 90,025,036,496,120 (13)
.
EG iterations: 1
abstracting: (Organization_p21_4<=2)
states: 89,943,862,935,144 (13)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 5.374sec

checking: ~ [E [EF [[AG [[Status_p21_14<=7 | DeliveryNote_p22_14<=10]] | EF [AX [17<=p12_4]]]] U AX [AG [~ [[p11_13<=ConsumerDelivery_p6_0 | Payment_p20_9<=10]]]]]]
normalized: ~ [E [E [true U [E [true U ~ [EX [~ [17<=p12_4]]]] | ~ [E [true U ~ [[Status_p21_14<=7 | DeliveryNote_p22_14<=10]]]]]] U ~ [EX [E [true U [p11_13<=ConsumerDelivery_p6_0 | Payment_p20_9<=10]]]]]]

abstracting: (Payment_p20_9<=10)
states: 92,677,131,972,792 (13)
abstracting: (p11_13<=ConsumerDelivery_p6_0)
states: 40,782,712,416,936 (13)
.abstracting: (DeliveryNote_p22_14<=10)
states: 92,677,131,846,568 (13)
abstracting: (Status_p21_14<=7)
states: 92,677,115,739,904 (13)
abstracting: (17<=p12_4)
states: 0
.-> the formula is TRUE

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

MC time: 0m 3.163sec

checking: [EG [EX [EX [17<=Organization_p21_2]]] | ~ [AG [[[EX [10<=Organization_p21_8] | A [PaymentNote_p21_13<=13 U Status_p21_9<=PaymentNote_p21_16]] | AF [AF [p12_0<=Payment_p21_7]]]]]]
normalized: [E [true U ~ [[~ [EG [EG [~ [p12_0<=Payment_p21_7]]]] | [[~ [EG [~ [Status_p21_9<=PaymentNote_p21_16]]] & ~ [E [~ [Status_p21_9<=PaymentNote_p21_16] U [~ [PaymentNote_p21_13<=13] & ~ [Status_p21_9<=PaymentNote_p21_16]]]]] | EX [10<=Organization_p21_8]]]]] | EG [EX [EX [17<=Organization_p21_2]]]]

abstracting: (17<=Organization_p21_2)
states: 0
...
EG iterations: 1
abstracting: (10<=Organization_p21_8)
states: 7,836 (3)
.abstracting: (Status_p21_9<=PaymentNote_p21_16)
states: 76,731,036,569,032 (13)
abstracting: (PaymentNote_p21_13<=13)
states: 92,677,131,972,792 (13)
abstracting: (Status_p21_9<=PaymentNote_p21_16)
states: 76,731,036,569,032 (13)
abstracting: (Status_p21_9<=PaymentNote_p21_16)
states: 76,731,036,569,032 (13)
..................................................................
EG iterations: 66
abstracting: (p12_0<=Payment_p21_7)
states: 33,114,613,168,304 (13)
.......................
before gc: list nodes free: 13548150

after gc: idd nodes used:7140973, unused:56859027; list nodes free:302661218
...................
before gc: list nodes free: 20217912

after gc: idd nodes used:11667907, unused:52332093; list nodes free:280996996
...
before gc: list nodes free: 21449362

after gc: idd nodes used:9003337, unused:54996663; list nodes free:293920978
MC time: 5m54.234sec

checking: AX [[A [[EG [~ [10<=p6_1]] | AG [[PayReceipt_p21_15<=17 & MerchantPayment_p4_0<=13]]] U ~ [E [[p12_7<=15 | 10<=p8_3] U [17<=Status_p21_9 | p5_2<=9]]]] & ~ [8<=Status_p20]]]
normalized: ~ [EX [~ [[~ [8<=Status_p20] & [~ [EG [E [[p12_7<=15 | 10<=p8_3] U [17<=Status_p21_9 | p5_2<=9]]]] & ~ [E [E [[p12_7<=15 | 10<=p8_3] U [17<=Status_p21_9 | p5_2<=9]] U [~ [[~ [E [true U ~ [[PayReceipt_p21_15<=17 & MerchantPayment_p4_0<=13]]]] | EG [~ [10<=p6_1]]]] & E [[p12_7<=15 | 10<=p8_3] U [17<=Status_p21_9 | p5_2<=9]]]]]]]]]]

abstracting: (p5_2<=9)
states: 92,677,131,964,956 (13)
abstracting: (17<=Status_p21_9)
states: 0
abstracting: (10<=p8_3)
states: 38,516,656,800,768 (13)
abstracting: (p12_7<=15)
states: 92,677,131,972,792 (13)
abstracting: (10<=p6_1)
states: 20,896 (4)
.
EG iterations: 1
abstracting: (MerchantPayment_p4_0<=13)
states: 92,677,131,972,792 (13)
abstracting: (PayReceipt_p21_15<=17)
states: 92,677,131,972,792 (13)
abstracting: (p5_2<=9)
states: 92,677,131,964,956 (13)
abstracting: (17<=Status_p21_9)
states: 0
abstracting: (10<=p8_3)
states: 38,516,656,800,768 (13)
abstracting: (p12_7<=15)
states: 92,677,131,972,792 (13)
abstracting: (p5_2<=9)
states: 92,677,131,964,956 (13)
abstracting: (17<=Status_p21_9)
states: 0
abstracting: (10<=p8_3)
states: 38,516,656,800,768 (13)
abstracting: (p12_7<=15)
states: 92,677,131,972,792 (13)

EG iterations: 0
abstracting: (8<=Status_p20)
states: 16,232,888 (7)
.-> the formula is FALSE

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

MC time: 0m32.703sec

checking: EF [[p6_2<=p12_0 & A [A [[[MerchantOffer_p2<=7 & Status_p21_9<=5] & 17<=MerchantOffer_p2] U AF [p3_6<=15]] U EF [[16<=Delivery_p22_1 | [DeliveryHandlerDelivery_p8_0<=5 & Order_p20<=Organization_p22_9]]]]]]
normalized: E [true U [p6_2<=p12_0 & [~ [EG [~ [E [true U [16<=Delivery_p22_1 | [DeliveryHandlerDelivery_p8_0<=5 & Order_p20<=Organization_p22_9]]]]]] & ~ [E [~ [E [true U [16<=Delivery_p22_1 | [DeliveryHandlerDelivery_p8_0<=5 & Order_p20<=Organization_p22_9]]]] U [~ [[~ [EG [EG [~ [p3_6<=15]]]] & ~ [E [EG [~ [p3_6<=15]] U [~ [[17<=MerchantOffer_p2 & [MerchantOffer_p2<=7 & Status_p21_9<=5]]] & EG [~ [p3_6<=15]]]]]]] & ~ [E [true U [16<=Delivery_p22_1 | [DeliveryHandlerDelivery_p8_0<=5 & Order_p20<=Organization_p22_9]]]]]]]]]]

abstracting: (Order_p20<=Organization_p22_9)
states: 77,091,902,318,568 (13)
abstracting: (DeliveryHandlerDelivery_p8_0<=5)

before gc: list nodes free: 21874080

after gc: idd nodes used:6764566, unused:57235434; list nodes free:304735985
states: 32,496,296,519,568 (13)
abstracting: (16<=Delivery_p22_1)
states: 0

before gc: list nodes free: 14612122

after gc: idd nodes used:10263718, unused:53736282; list nodes free:287177484
MC time: 5m48.381sec

checking: AF [[[EF [AG [[WhatDeliver_p12_1<=PaymentAmount_p11_6 & p1_1<=p3_2]]] & [AG [EF [p3_7<=Status_p22_11]] & [E [~ [2<=p6_7] U ~ [Organization_p21_2<=13]] & EF [E [17<=p6_5 U Organization_p20_2<=PaymentNote_p21_16]]]]] & 13<=Payment_p20_9]]
normalized: ~ [EG [~ [[13<=Payment_p20_9 & [[[E [true U E [17<=p6_5 U Organization_p20_2<=PaymentNote_p21_16]] & E [~ [2<=p6_7] U ~ [Organization_p21_2<=13]]] & ~ [E [true U ~ [E [true U p3_7<=Status_p22_11]]]]] & E [true U ~ [E [true U ~ [[WhatDeliver_p12_1<=PaymentAmount_p11_6 & p1_1<=p3_2]]]]]]]]]]

abstracting: (p1_1<=p3_2)
states: 76,868,263,982,992 (13)
abstracting: (WhatDeliver_p12_1<=PaymentAmount_p11_6)
states: 78,537,839,785,584 (13)
abstracting: (p3_7<=Status_p22_11)
states: 81,079,691,583,112 (13)
abstracting: (Organization_p21_2<=13)
states: 92,677,131,972,792 (13)
abstracting: (2<=p6_7)
states: 8,663,342,737,528 (12)
abstracting: (Organization_p20_2<=PaymentNote_p21_16)
states: 75,553,296,600,928 (13)
abstracting: (17<=p6_5)
states: 0
abstracting: (13<=Payment_p20_9)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 2m25.661sec

checking: [EG [A [E [Order_p20<=p3_9 U p11_0<=PaySchemeData_p11_10] U EF [[7<=p10_2 | ~ [13<=Status_p21_9]]]]] | ~ [AG [~ [[~ [AG [p7_1<=3]] & [[p3_6<=Organization_p20_2 | 2<=p2_1] & [p8_1<=17 | Status_p21_11<=OfferResponce_p10]]]]]]]
normalized: [E [true U [[[p8_1<=17 | Status_p21_11<=OfferResponce_p10] & [p3_6<=Organization_p20_2 | 2<=p2_1]] & E [true U ~ [p7_1<=3]]]] | EG [[~ [EG [~ [E [true U [7<=p10_2 | ~ [13<=Status_p21_9]]]]]] & ~ [E [~ [E [true U [7<=p10_2 | ~ [13<=Status_p21_9]]]] U [~ [E [Order_p20<=p3_9 U p11_0<=PaySchemeData_p11_10]] & ~ [E [true U [7<=p10_2 | ~ [13<=Status_p21_9]]]]]]]]]]

abstracting: (13<=Status_p21_9)
states: 0
abstracting: (7<=p10_2)
states: 0
abstracting: (p11_0<=PaySchemeData_p11_10)
states: 37,420,584,943,162 (13)
abstracting: (Order_p20<=p3_9)
states: 77,154,506,088,100 (13)
abstracting: (13<=Status_p21_9)
states: 0
abstracting: (7<=p10_2)
states: 0
abstracting: (13<=Status_p21_9)
states: 0
abstracting: (7<=p10_2)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (p7_1<=3)
states: 92,549,237,448,200 (13)
abstracting: (2<=p2_1)
states: 4,222,601,069,000 (12)
abstracting: (p3_6<=Organization_p20_2)
states: 75,553,296,600,928 (13)
abstracting: (Status_p21_11<=OfferResponce_p10)
states: 82,932,109,505,424 (13)
abstracting: (p8_1<=17)
states: 92,677,131,972,792 (13)
-> the formula is TRUE

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

MC time: 1m14.270sec

checking: AG [[AF [[[p2_1<=DeliveryResponse_p12_6 & AG [9<=p7_1]] | AX [[p3_10<=11 & p6_7<=10]]]] & A [~ [2<=p3_4] U [[AG [OfferRequest_p10<=p6_2] & [10<=PaymentHandlerPayment_p5_0 & [p8_3<=9 | 5<=p5_1]]] | [[p12_0<=10 & ~ [DeliveryNote_p22_12<=12]] & ~ [Organization_p21_4<=15]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[~ [Organization_p21_4<=15] & [p12_0<=10 & ~ [DeliveryNote_p22_12<=12]]] | [[10<=PaymentHandlerPayment_p5_0 & [p8_3<=9 | 5<=p5_1]] & ~ [E [true U ~ [OfferRequest_p10<=p6_2]]]]]]]] & ~ [E [~ [[[~ [Organization_p21_4<=15] & [p12_0<=10 & ~ [DeliveryNote_p22_12<=12]]] | [[10<=PaymentHandlerPayment_p5_0 & [p8_3<=9 | 5<=p5_1]] & ~ [E [true U ~ [OfferRequest_p10<=p6_2]]]]]] U [2<=p3_4 & ~ [[[~ [Organization_p21_4<=15] & [p12_0<=10 & ~ [DeliveryNote_p22_12<=12]]] | [[10<=PaymentHandlerPayment_p5_0 & [p8_3<=9 | 5<=p5_1]] & ~ [E [true U ~ [OfferRequest_p10<=p6_2]]]]]]]]]] & ~ [EG [~ [[~ [EX [~ [[p3_10<=11 & p6_7<=10]]]] | [p2_1<=DeliveryResponse_p12_6 & ~ [E [true U ~ [9<=p7_1]]]]]]]]]]]]

abstracting: (9<=p7_1)
states: 819,000 (5)
abstracting: (p2_1<=DeliveryResponse_p12_6)
states: 76,014,898,295,488 (13)
abstracting: (p6_7<=10)
states: 92,677,131,846,568 (13)
abstracting: (p3_10<=11)
states: 92,677,131,972,792 (13)
..
EG iterations: 1
abstracting: (OfferRequest_p10<=p6_2)
states: 83,928,734,305,848 (13)

before gc: list nodes free: 12099093

after gc: idd nodes used:12997805, unused:51002195; list nodes free:272467559
abstracting: (5<=p5_1)
states: 12,388,147,004 (10)
abstracting: (p8_3<=9)
states: 54,160,475,172,024 (13)
abstracting: (10<=PaymentHandlerPayment_p5_0)
states: 31,034,888,446,424 (13)
abstracting: (DeliveryNote_p22_12<=12)
states: 92,677,131,972,792 (13)
abstracting: (p12_0<=10)
states: 92,677,131,972,792 (13)
abstracting: (Organization_p21_4<=15)
states: 92,677,131,972,792 (13)
abstracting: (2<=p3_4)
states: 4,222,601,069,000 (12)
abstracting: (OfferRequest_p10<=p6_2)
states: 83,928,734,305,848 (13)
abstracting: (5<=p5_1)
states: 12,388,147,004 (10)
abstracting: (p8_3<=9)
states: 54,160,475,172,024 (13)
abstracting: (10<=PaymentHandlerPayment_p5_0)
states: 31,034,888,446,424 (13)
abstracting: (DeliveryNote_p22_12<=12)
states: 92,677,131,972,792 (13)
abstracting: (p12_0<=10)
states: 92,677,131,972,792 (13)
abstracting: (Organization_p21_4<=15)
states: 92,677,131,972,792 (13)
abstracting: (OfferRequest_p10<=p6_2)
states: 83,928,734,305,848 (13)
abstracting: (5<=p5_1)
states: 12,388,147,004 (10)
abstracting: (p8_3<=9)
states: 54,160,475,172,024 (13)
abstracting: (10<=PaymentHandlerPayment_p5_0)
states: 31,034,888,446,424 (13)
abstracting: (DeliveryNote_p22_12<=12)
states: 92,677,131,972,792 (13)
abstracting: (p12_0<=10)
states: 92,677,131,972,792 (13)
abstracting: (Organization_p21_4<=15)
states: 92,677,131,972,792 (13)

EG iterations: 0
-> the formula is FALSE

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

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393932 kB
MemFree: 5282236 kB
After kill :
MemTotal: 16393932 kB
MemFree: 16180148 kB

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


initing FirstDep: 0m 0.000sec


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

initing FirstDep: 0m 0.000sec


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

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

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

net_ddint.h:600: Timeout: after 287 sec


iterations count:188 (4), effective:27 (0)

net_ddint.h:600: Timeout: after 286 sec


iterations count:186 (4), effective:17 (0)

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

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

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

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

iterations count:214 (4), effective:31 (0)

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

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

net_ddint.h:600: Timeout: after 352 sec


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

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

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

sat_reach.icc:155: Timeout: after 347 sec


iterations count:201 (4), effective:37 (0)

iterations count:375 (8), effective:99 (2)

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

iterations count:470 (10), effective:120 (2)

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

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

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

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

iterations count:893 (19), effective:176 (3)

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

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

iterations count:191 (4), effective:43 (0)

iterations count:191 (4), effective:43 (0)

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

iterations count:191 (4), effective:43 (0)

iterations count:45 (1), effective:0 (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-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"
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-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 r225-tall-167856407200129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 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 ;