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 lola
Input is IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484600111
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ IOTPpurchase-PT-C12M10P15D17 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 156/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: (E (G (((1 <= p3_1) OR (p3_8 <= Organization_p21_4)))) OR (((p5_2 + 1 <= Order_p22_3) OR (p12_0 <= Payment_p20_9)) AND A (F ((MerchantDelivery_p4_6 <= Status_p21_14))))) : (NOT((((OfferRequest_p10 + 1 <= p6_4) OR (3 <= PaymentResponse_p11_12)) OR A (G ((p3_8 <= p3_9))))) OR E (G (E (X ((1 <= p5_1)))))) : E (X (E (F (((2 <= p10_2) OR (3 <= Delivery_p22_1)))))) : A (G (A (F ((p1_2 + 1 <= WhatDeliver_p12_1))))) : (((2 <= p7_3) OR (2 <= p11_11) OR (PaySchemeData_p21_6 <= Organization_p21_8)) AND (((p3_2 <= Status_p21_5) OR (p12_3 <= Order_p22_10) OR (2 <= ConsumerOffer_p1) OR (1 <= DeliveryRequest_p12_5) OR (p1_2 <= p11_11)) AND E (G (((WhatDeliver_p12_1 <= p4_4) OR (p6_4 <= DeliveryNote_p22_14)))))) : NOT(A (F ((((p3_1 <= Delivery_p22_1) AND (1 <= PaymentNote_p21_16)) OR (Organization_p22_9 + 1 <= p5_2))))) : E (((p4_2 <= ConsumerDelivery_p6_0) U ((3 <= Delivery_p22_1) AND (p11_0 <= p1_1) AND ((Delivery_p22_8 <= Payment_p21_3) OR (PaymentNote_p21_16 <= MerchantOffer_p2))))) : A ((((Status_p21_5 <= 0) AND (1 <= Organization_p20_7)) U E (G ((Status_p21_5 <= p12_3))))) : (A (X (A (F ((1 <= Status_p20_6))))) AND E ((((3 <= PaymentNote_p21_16) OR (1 <= p4_3)) U (DeliveryRequest_p12_5 <= Payment_p21_3)))) : (E (F (((Status_p21_11 <= Delivery_p22_8) AND (2 <= p4_5) AND (p5_4 <= OfferRequest_p10)))) AND (DeliveryResponse_p12_6 <= DeliveryNote_p22_14)) : NOT((A (G ((p3_9 <= Delivery_p20_10))) AND ((3 <= Status_p21_11) OR (PayReceipt_p21_12 <= p4_2) OR (3 <= Order_p22_10) OR (p8_3 <= PaymentRequest_p11_9)))) : E (G (A (F ((p4_1 <= p6_6))))) : A ((((Organization_p22_5 <= 0) AND (WhatDeliver_p12_1 <= 0)) U E (G ((p7_1 <= Delivery_p20))))) : E (F (E (((3 <= BrandSelection_p11_5) U (2 <= p5_2))))) : ((2 <= Organization_p22_9) OR E (((Organization_p21_8 <= 2) U ((p7_1 <= PaymentAmount_p11_6) AND (3 <= p11_8))))) : A (G (A (F (((p11_7 <= PaySchemeData_p11_10) AND (p10_0 <= Delivery_p20_10))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p3_1) OR (p3_8 <= Organization_p21_4)))) OR (((p5_2 + 1 <= Order_p22_3) OR (p12_0 <= Payment_p20_9)) AND A (F ((MerchantDelivery_p4_6 <= Status_p21_14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p3_1) OR (p3_8 <= Organization_p21_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p3_1 <= 0) AND (Organization_p21_4 + 1 <= p3_8))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((OfferRequest_p10 + 1 <= p6_4) OR (3 <= PaymentResponse_p11_12)) OR A (G ((p3_8 <= p3_9))))) OR E (G (E (X ((1 <= p5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p6_4 <= OfferRequest_p10) AND (PaymentResponse_p11_12 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p6_4 <= OfferRequest_p10) AND (PaymentResponse_p11_12 <= 2))
lola: processed formula length: 62
lola: 5 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p3_9 + 1 <= p3_8)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((2 <= p10_2) OR (3 <= Delivery_p22_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((2 <= p10_2) OR (3 <= Delivery_p22_1))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p1_2 + 1 <= WhatDeliver_p12_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p1_2 + 1 <= WhatDeliver_p12_1)))))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p7_3) OR (2 <= p11_11) OR (PaySchemeData_p21_6 <= Organization_p21_8)) AND (((p3_2 <= Status_p21_5) OR (p12_3 <= Order_p22_10) OR (2 <= ConsumerOffer_p1) OR (1 <= DeliveryRequest_p12_5) OR (p1_2 <= p11_11)) AND E (G (((WhatDeliver_p12_1 <= p4_4) OR (p6_4 <= DeliveryNote_p22_14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p7_3) OR (2 <= p11_11) OR (PaySchemeData_p21_6 <= Organization_p21_8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p7_3) OR (2 <= p11_11) OR (PaySchemeData_p21_6 <= Organization_p21_8))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3_2 <= Status_p21_5) OR (p12_3 <= Order_p22_10) OR (2 <= ConsumerOffer_p1) OR (1 <= DeliveryRequest_p12_5) OR (p1_2 <= p11_11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3_2 <= Status_p21_5) OR (p12_3 <= Order_p22_10) OR (2 <= ConsumerOffer_p1) OR (1 <= DeliveryRequest_p12_5) OR (p1_2 <= p11_11))
lola: processed formula length: 134
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((WhatDeliver_p12_1 <= p4_4) OR (p6_4 <= DeliveryNote_p22_14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p4_4 + 1 <= WhatDeliver_p12_1) AND (DeliveryNote_p22_14 + 1 <= p6_4))))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((((p3_1 <= Delivery_p22_1) AND (1 <= PaymentNote_p21_16)) OR (Organization_p22_9 + 1 <= p5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p3_1 <= Delivery_p22_1) AND (1 <= PaymentNote_p21_16)) OR (Organization_p22_9 + 1 <= p5_2))))
lola: processed formula length: 110
lola: 5 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p4_2 <= ConsumerDelivery_p6_0) U ((3 <= Delivery_p22_1) AND (p11_0 <= p1_1) AND ((Delivery_p22_8 <= Payment_p21_3) OR (PaymentNote_p21_16 <= MerchantOffer_p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p4_2 <= ConsumerDelivery_p6_0) U ((3 <= Delivery_p22_1) AND (p11_0 <= p1_1) AND ((Delivery_p22_8 <= Payment_p21_3) OR (PaymentNote_p21_16 <= MerchantOffer_p2))))
lola: processed formula length: 165
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Status_p21_5 <= 0) AND (1 <= Organization_p20_7)) U E (G ((Status_p21_5 <= p12_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((Status_p21_5 <= 0) AND (1 <= Organization_p20_7)) U NOT(A(TRUE U (p12_3 + 1 <= Status_p21_5))))
lola: processed formula length: 99
lola: 3 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= Status_p20_6))))) AND E ((((3 <= PaymentNote_p21_16) OR (1 <= p4_3)) U (DeliveryRequest_p12_5 <= Payment_p21_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= Status_p20_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= Status_p20_6)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= PaymentNote_p21_16) OR (1 <= p4_3)) U (DeliveryRequest_p12_5 <= Payment_p21_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= PaymentNote_p21_16) OR (1 <= p4_3)) U (DeliveryRequest_p12_5 <= Payment_p21_3))
lola: processed formula length: 89
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: lola: The Boolean predicate is true.
========================================
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((Status_p21_11 <= Delivery_p22_8) AND (2 <= p4_5) AND (p5_4 <= OfferRequest_p10)))) AND (DeliveryResponse_p12_6 <= DeliveryNote_p22_14))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Status_p21_11 <= Delivery_p22_8) AND (2 <= p4_5) AND (p5_4 <= OfferRequest_p10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (DeliveryResponse_p12_6 <= DeliveryNote_p22_14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DeliveryResponse_p12_6 <= DeliveryNote_p22_14)
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G ((p3_9 <= Delivery_p20_10))) AND ((3 <= Status_p21_11) OR (PayReceipt_p21_12 <= p4_2) OR (3 <= Order_p22_10) OR (p8_3 <= PaymentRequest_p11_9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Delivery_p20_10 + 1 <= p3_9)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10.sara
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p4_1 <= p6_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p4_1 <= p6_6)))))
lola: processed formula length: 44========================================

lola: 2 rewrites
lola: lola: formula mentions 0 of 111 places; total mentions: 0
lola: state equation: calling and running sara
closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Organization_p22_5 <= 0) AND (WhatDeliver_p12_1 <= 0)) U E (G ((p7_1 <= Delivery_p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((Organization_p22_5 <= 0) AND (WhatDeliver_p12_1 <= 0)) U NOT(A(TRUE U (Delivery_p20 + 1 <= p7_1))))
lola: processed formula length: 103
lola: 3 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: sara: try reading problem file IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10.sara.
CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (((3 <= BrandSelection_p11_5) U (2 <= p5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: ========================================
processed formula: E(TRUE U E((3 <= BrandSelection_p11_5) U (2 <= p5_2)))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= Organization_p22_9) OR E (((Organization_p21_8 <= 2) U ((p7_1 <= PaymentAmount_p11_6) AND (3 <= p11_8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Organization_p22_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Organization_p22_9)
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Organization_p21_8 <= 2) U ((p7_1 <= PaymentAmount_p11_6) AND (3 <= p11_8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Organization_p21_8 <= 2) U ((p7_1 <= PaymentAmount_p11_6) AND (3 <= p11_8)))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p11_7 <= PaySchemeData_p11_10) AND (p10_0 <= Delivery_p20_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((p11_7 <= PaySchemeData_p11_10) AND (p10_0 <= Delivery_p20_10))))))
lola: processed formula length: 94
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1894119 markings, 6663549 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3607512 markings, 12687684 edges, 342679 markings/sec, 5 secs
lola: 5178084 markings, 18613206 edges, 314114 markings/sec, 10 secs
lola: 6558452 markings, 24789079 edges, 276074 markings/sec, 15 secs
lola: 7370110 markings, 30636901 edges, 162332 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no no yes yes yes yes no yes yes no no
lola: ========================================
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494620330079

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

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="lola"
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 lola"
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 4"
echo " Run identifier is r038-blw7-149440484600111"
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 ;