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-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896700084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463590962368

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ IOTPpurchase-PT-C05M04P03D02
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-0 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-1 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-3 CANNOT_COMPUTE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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-C05M04P03D02-CTLCardinality.task
lola: read: E(EF (Organization_p21_8 <= Status_p21_14) U AG (3 <= p6_5)) : (AX ((p3_2 <= p4_2 AND (3 <= Delivery_p22_4 OR 1 <= p6_1))) OR (!(EG (p8_2 <= p10_0)) AND (EG (p7_2 <= p1_2) AND EF (3 <= Status_p20)))) : A(EF (3 <= ConsumerOffer_p1) U AG (3 <= PayReceipt_p21_15)) : !((AF ((PayReceipt_p21_12 <= PayReceipt_p21_15 AND 2 <= p7_2)) AND !(1 <= Status_p21_9))) : E(3 <= PaySchemeData_p21_6 U EG (p7_1 <= p5_... (shortened)
lola: formula length: 1494
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-Status_p21_14 + Organization_p21_8 <= 0) U AG (-p6_5 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -Status_p21_14 + Organization_p21_8 <= 0) U !(E(TRUE U !(-p6_5 <= -3))))
lola: processed formula length: 83
lola: 234 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 3 significant temporal operators and needs 13 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-p4_2 + p3_2 <= 0 AND (-Delivery_p22_4 <= -3 OR -p6_1 <= -1))) OR (AF (p8_2 + -p10_0 > 0) AND (EG (p7_2 + -p1_2 <= 0) AND EF (-Status_p20 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-p4_2 + p3_2 <= 0 AND (-Delivery_p22_4 <= -3 OR -p6_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-p4_2 + p3_2 <= 0 AND (-Delivery_p22_4 <= -3 OR -p6_1 <= -1)))
lola: processed formula length: 66
lola: 232 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (p8_2 + -p10_0 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U p8_2 + -p10_0 > 0)
lola: processed formula length: 27
lola: 232 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-ConsumerOffer_p1 <= -3) U AG (-PayReceipt_p21_15 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -ConsumerOffer_p1 <= -3) U !(E(TRUE U !(-PayReceipt_p21_15 <= -3))))
lola: processed formula length: 79
lola: 234 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 3 significant temporal operators and needs 13 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((-PayReceipt_p21_15 + PayReceipt_p21_12 > 0 OR -p7_2 > -2)) OR -Status_p21_9 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-PayReceipt_p21_15 + PayReceipt_p21_12 > 0 OR -p7_2 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-PayReceipt_p21_15 + PayReceipt_p21_12 > 0 OR -p7_2 > -2))))
lola: processed formula length: 74
lola: 232 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 4 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-PaySchemeData_p21_6 <= -3 U EG (p7_1 + -p5_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-PaySchemeData_p21_6 <= -3 U !(A(TRUE U !(p7_1 + -p5_1 <= 0))))
lola: processed formula length: 65
lola: 233 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG (Status_p21_14 + -Status_p20_6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(Status_p21_14 + -Status_p20_6 <= 0))))))
lola: processed formula length: 66
lola: 233 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Organization_p22_9 <= -3 AND (-Organization_p20_7 <= -1 AND (-Status_p22_13 <= -3 OR -p3_6 <= -1))) OR EX (PaidFor_p11_1 + -p5_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(((-Organization_p22_9 <= -3 AND (-Organization_p20_7 <= -1 AND (-Status_p22_13 <= -3 OR -p3_6 <= -1))) OR EX(PaidFor_p11_1 + -p5_2 <= 0)))))
lola: processed formula length: 153
lola: 233 rewrites
lola: formula mentions 6 of 111 places; total mentions: 6
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 7 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ConsumerDelivery_p6_0 > -1)
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 8 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p3_6 > -1 OR (-PaymentAmount_p11_6 > -3 OR (-Status_p20 + Status_p22_11 > 0 OR -p7_2 > -2))))
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: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((-p11_4 + OfferResponce_p10 <= 0 AND -Organization_p22_9 + Order_p22_6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (-p11_4 + OfferResponce_p10 <= 0 AND -Organization_p22_9 + Order_p22_6 <= 0)))))
lola: processed formula length: 102
lola: 233 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-p6_3 > -3 OR -p1_2 > -1) U (Payment_p20_9 + -p7_1 <= 0 AND (-Status_p22_13 <= -3 AND PaymentResponse_p11_12 + -WhatDeliver_p12_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-p6_3 > -3 OR -p1_2 > -1) U (Payment_p20_9 + -p7_1 <= 0 AND (-Status_p22_13 <= -3 AND PaymentResponse_p11_12 + -WhatDeliver_p12_1 <= 0)))
lola: processed formula length: 140
lola: 232 rewrites
lola: formula mentions 7 of 111 places; total mentions: 7
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 11 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-p3_8 <= -2) AND ((-HowDeliver_p12_2 + Status_p20_6 <= 0 OR (-Delivery_p20 + p1_1 <= 0 AND DeliveryNote_p22_14 + -p8_1 <= 0)) AND AX ((-p11_11 <= -1 OR -p8_1 <= -1)))) OR (EF ((-Order_p22_10 <= -1 OR -PaymentResponse_p11_12 <= -2)) AND EG ((BrandList_p11_2 + -p4_3 <= 0 OR Organization_p20_7 + -PaySchemeData_p21_10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p3_8 <= -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 12 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-HowDeliver_p12_2 + Status_p20_6 <= 0 OR (-Delivery_p20 + p1_1 <= 0 AND DeliveryNote_p22_14 + -p8_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-p11_11 <= -1 OR -p8_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-p11_11 <= -1 OR -p8_1 <= -1))
lola: processed formula length: 34
lola: 232 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (-p3_10 + p6_2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-p3_10 + p6_2 <= 0))))
lola: processed formula length: 38
lola: 233 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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 13 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-p10_0 + p3_1 <= 0 OR EF (-Status_p20_6 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-p10_0 + p3_1 <= 0 OR E(TRUE U -Status_p20_6 <= -3)))))
lola: processed formula length: 69
lola: 233 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-PaySchemeData_p21_10 > -3 OR (-p6_7 > -2 OR (-p4_4 > -1 OR -p5_2 > -3))))
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: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-p11_11 <= -2 OR (-p3_10 + p6_4 <= 0 OR -p12_4 <= -3))) AND EX (AG (Order_p22_10 + -BrandList_p11_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p11_11 <= -2 OR (-p3_10 + p6_4 <= 0 OR -p12_4 <= -3)))
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola: summary: unknown unknown unknown unknown yes no no no yes yes no yes yes yes yes no
lola: ========================================

BK_STOP 1463593005454

--------------------
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-C05M04P03D02"
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-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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-C05M04P03D02, 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-146358896700084"
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 ;