Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-2979
Executing tool 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 r062kn-blw3-146358896800093
=====================================================================

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

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ IOTPpurchase-PT-C12M10P15D17
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-1 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-3 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-4 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-6 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-15 CANNOT_COMPUTE
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: read: A(((MerchantDelivery_p4_6 <= Delivery_p22_1 OR p6_3 <= Payment_p21_3) OR (2 <= p11_13 OR 2 <= p4_1)) U (1 <= p2_1 AND (Delivery_p20_10 <= Status_p22_13 AND 3 <= p4_1))) : AF (2 <= Payment_p20) : A(AX (Delivery_p22_4 <= PaySchemeData_p21_6) U 2 <= PaymentNote_p21_16) : AG (!(EG (2 <= Delivery_p22_1))) : ((1 <= p3_5 OR 3 <= OfferRequest_p10) OR EG ((DeliveryResponse_p12_6 <= Delivery_p20_10 AND (p10... (shortened)
lola: formula length: 1630
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Delivery_p22_1 + MerchantDelivery_p4_6 <= 0 OR (p6_3 + -Payment_p21_3 <= 0 OR (-p11_13 <= -2 OR -p4_1 <= -2))) U (-p2_1 <= -1 AND (Delivery_p20_10 + -Status_p22_13 <= 0 AND -p4_1 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-Delivery_p22_1 + MerchantDelivery_p4_6 <= 0 OR (p6_3 + -Payment_p21_3 <= 0 OR (-p11_13 <= -2 OR -p4_1 <= -2))) U (-p2_1 <= -1 AND (Delivery_p20_10 + -Status_p22_13 <= 0 AND -p4_1 <= -3)))
lola: processed formula length: 191
lola: 273 rewrites
lola: formula mentions 9 of 111 places; total mentions: 10
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Payment_p20 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Payment_p20 <= -2)
lola: processed formula length: 28
lola: 273 rewrites
lola: formula mentions 1 of 111 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AX (Delivery_p22_4 + -PaySchemeData_p21_6 <= 0) U -PaymentNote_p21_16 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX(Delivery_p22_4 + -PaySchemeData_p21_6 <= 0) U -PaymentNote_p21_16 <= -2)
lola: processed formula length: 77
lola: 274 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-Delivery_p22_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -Delivery_p22_1 > -2))))
lola: processed formula length: 46
lola: 274 rewrites
lola: formula mentions 1 of 111 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p3_5 <= -1 OR (-OfferRequest_p10 <= -3 OR EG ((-Delivery_p20_10 + DeliveryResponse_p12_6 <= 0 AND (-p3_7 + p10_2 <= 0 OR Delivery_p22_8 + -p3_7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p3_5 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -OfferRequest_p10 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Delivery_p20_10 + DeliveryResponse_p12_6 <= 0 AND (-p3_7 + p10_2 <= 0 OR Delivery_p22_8 + -p3_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Delivery_p20_10 + DeliveryResponse_p12_6 <= 0 AND (-p3_7 + p10_2 <= 0 OR Delivery_p22_8 + -p3_7 <= 0)))))
lola: processed formula length: 120
lola: 273 rewrites
lola: formula mentions 5 of 111 places; total mentions: 6
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX ((-PaymentHandlerPayment_p5_0 > -2 AND -p5_4 + p11_0 > 0)) OR (-p4_1 <= -3 OR EF (-PaymentHandlerPayment_p5_0 > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-PaymentHandlerPayment_p5_0 > -2 AND -p5_4 + p11_0 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-PaymentHandlerPayment_p5_0 > -2 AND -p5_4 + p11_0 > 0))
lola: processed formula length: 60
lola: 273 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p4_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-PaymentHandlerPayment_p5_0 > -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-PaidFor_p11_1 <= -3) OR ((-OfferRequest_p10 + p11_3 <= 0 OR -DeliveryNote_p22_14 + p5_2 <= 0) AND -Organization_p22_9 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-PaidFor_p11_1 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -PaidFor_p11_1 <= -3)
lola: processed formula length: 30
lola: 273 rewrites
lola: formula mentions 1 of 111 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-p6_6 + p5_1 <= 0 U -p3_6 <= -1) AND (-ConsumerDelivery_p6_0 + p10_2 > 0 OR (-p8_3 > -2 OR (((-DeliveryRequest_p12_5 <= -1 OR p1_3 + -PayReceipt_p21_15 <= 0) AND (-PaySchemeData_p11_10 <= -2 OR -OfferRequest_p10 <= -2)) OR A(-PaymentRequest_p11_9 <= -1 U -Status_p22_11 <= -1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-p6_6 + p5_1 <= 0 U -p3_6 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-p6_6 + p5_1 <= 0 U -p3_6 <= -1)
lola: processed formula length: 34
lola: 273 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ConsumerDelivery_p6_0 + p10_2 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p8_3 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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 8 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Status_p21_9 <= -2 OR -PaidFor_p11_1 + PaySchemeData_p11_10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(Organization_p22_9 + -p6_4 <= 0 U ((-Payment_p21_7 <= -3 OR -p3_6 <= -2) AND (-BrandList_p11_2 + Status_p21_9 <= 0 AND -WhatDeliver_p12_1 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(Organization_p22_9 + -p6_4 <= 0 U ((-Payment_p21_7 <= -3 OR -p3_6 <= -2) AND (-BrandList_p11_2 + Status_p21_9 <= 0 AND -WhatDeliver_p12_1 <= -3)))
lola: processed formula length: 148
lola: 273 rewrites
lola: formula mentions 7 of 111 places; total mentions: 7
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((-Order_p22_10 <= -3 AND -p2_2 <= -2)) OR AX (-p5_1 <= -2)) AND (AX (p3_5 + -p2_2 > 0) OR MerchantOffer_p2 + -p7_2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Order_p22_10 <= -3 AND -p2_2 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (p3_5 + -p2_2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(p3_5 + -p2_2 > 0)
lola: processed formula length: 20
lola: 273 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
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: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MerchantOffer_p2 + -p7_2 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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 11 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (Organization_p21_8 + -Organization_p20_7 <= 0) OR -ConsumerPayment_p3 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Organization_p21_8 + -Organization_p20_7 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ConsumerPayment_p3 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Order_p22_10 <= -1 OR DeliveryNote_p22_14 + -DeliveryResponse_p12_6 <= 0) U (-MerchantOffer_p2 > -1 AND -p3_8 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-Order_p22_10 <= -1 OR DeliveryNote_p22_14 + -DeliveryResponse_p12_6 <= 0) U (-MerchantOffer_p2 > -1 AND -p3_8 > -1))
lola: processed formula length: 120
lola: 273 rewrites
lola: formula mentions 5 of 111 places; total mentions: 5
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Status_p22_13 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX (-p6_7 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX(-p6_7 > -1))))
lola: processed formula length: 30
lola: 274 rewrites
lola: formula mentions 1 of 111 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-PaymentNote_p21_13 + p6_3 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -PaymentNote_p21_13 + p6_3 > 0))))
lola: processed formula length: 56
lola: 274 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown no unknown unknown yes unknown yes no no yes no no yes no unknown

BK_STOP 1463592937483

--------------------
content from 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="/home/hulinhub/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool 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 r062kn-blw3-146358896800093"
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 ;