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 S_DrinkVendingMachine-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146kn-smll-146416249200417
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464336730567

bkconf 3600
===========================================================================================
===========================================================================================
S_DrinkVendingMachine-PT-02: translating Petri net model.pnml into LoLA format
S_DrinkVendingMachine-PT-02: translating formula CTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3540
CTLCardinality @ S_DrinkVendingMachine-PT-02
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-14 CANNOT_COMPUTE
FORMULA DrinkVendingMachine-COL-02-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: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-02-CTLCardinality.task
lola: read: AG (AF ((productSlots_1 + productSlots_2 <= productSlots_1 + productSlots_2 OR 3 <= theOptions_1 + theOptions_2))) : EX (E(productSlots_1 + productSlots_2 <= productSlots_1 + productSlots_2 U 3 <= theOptions_1 + theOptions_2)) : (optionSlots_1 + optionSlots_2 <= optionSlots_1 + optionSlots_2 AND AG (EF (2 <= ready_1 + ready_3 + ready_2 + ready_5 + ready_4 + ready_7 + ready_6 + ready_8))) : E(((3 <... (shortened)
lola: formula length: 4106
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EF (-theOptions_2 + -theOptions_1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U -theOptions_2 + -theOptions_1 <= -3))
lola: processed formula length: 49
lola: 2138 rewrites
lola: formula mentions 2 of 24 places; total mentions: 2
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= -2))))
lola: processed formula length: 117
lola: 2138 rewrites
lola: formula mentions 8 of 24 places; total mentions: 8
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-productSlots_1 + -productSlots_2 + theProducts_2 + theProducts_1 <= 0 OR (ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + -optionSlots_2 + -optionSlots_1 + ready_7 + ready_8 <= 0 OR -ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= -1))) OR -productSlots_1 + -productSlots_2 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-productSlots_1 + -productSlots_2 + theProducts_2 + theProducts_1 <= 0 OR (ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + -optionSlots_2 + -optionSlots_1 + ready_7 + ready_8 <= 0 OR -ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= -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 48 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-optionSlots_2 + -optionSlots_1 > -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 48 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EG (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -productSlots_1 + -productSlots_2 <= 0) OR EG (-optionSlots_2 + -optionSlots_1 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(A(TRUE U !(wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -productSlots_1 + -productSlots_2 <= 0))) OR !(A(TRUE U !(-optionSlots_2 + -optionSlots_1 <= -3)))))
lola: processed formula length: 195
lola: 2139 rewrites
lola: formula mentions 12 of 24 places; total mentions: 12
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AX (-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 <= -3) U wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theProducts_2 + -theProducts_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX(-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 <= -3) U wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theProducts_2 + -theProducts_1 <= 0)
lola: processed formula length: 201
lola: 2138 rewrites
lola: formula mentions 10 of 24 places; total mentions: 18
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AF (productSlots_1 + productSlots_2 + -ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= 0) OR EX (-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U productSlots_1 + productSlots_2 + -ready_6 + -ready_5 + -ready_4 + -ready_3 + -ready_2 + -ready_1 + -ready_7 + -ready_8 <= 0) OR EX(-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 <= -2)))))
lola: processed formula length: 243
lola: 2139 rewrites
lola: formula mentions 18 of 24 places; total mentions: 18
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((theOptions_2 + theOptions_1 + -productSlots_1 + -productSlots_2 > 0 AND -productSlots_1 + -productSlots_2 + optionSlots_2 + optionSlots_1 > 0) R (-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 > -3 OR -theProducts_2 + -theProducts_1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((theOptions_2 + theOptions_1 + -productSlots_1 + -productSlots_2 > 0 AND -productSlots_1 + -productSlots_2 + optionSlots_2 + optionSlots_1 > 0)) U !((-wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 > -3 OR -theProducts_2 + -theProducts_1 > -3))))
lola: processed formula length: 282
lola: 2137 rewrites
lola: formula mentions 16 of 24 places; total mentions: 18
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0))))
lola: processed formula length: 132
lola: 2138 rewrites
lola: formula mentions 10 of 24 places; total mentions: 10
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A((theOptions_2 + theOptions_1 + -optionSlots_2 + -optionSlots_1 <= 0 AND -productSlots_1 + -productSlots_2 + optionSlots_2 + optionSlots_1 <= 0) U -theOptions_2 + -theOptions_1 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_7 + ready_8 <= 0) AND EF (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((theOptions_2 + theOptions_1 + -optionSlots_2 + -optionSlots_1 <= 0 AND -productSlots_1 + -productSlots_2 + optionSlots_2 + optionSlots_1 <= 0) U -theOptions_2 + -theOptions_1 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_7 + ready_8 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((theOptions_2 + theOptions_1 + -optionSlots_2 + -optionSlots_1 <= 0 AND -productSlots_1 + -productSlots_2 + optionSlots_2 + optionSlots_1 <= 0) U -theOptions_2 + -theOptions_1 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_7 + ready_8 <= 0)
lola: processed formula length: 263
lola: 2137 rewrites
lola: formula mentions 14 of 24 places; total mentions: 18
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0)
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 48 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_7 + ready_8 + -theProducts_2 + -theProducts_1 <= 0 AND -optionSlots_2 + -optionSlots_1 <= -3) OR -optionSlots_2 + -optionSlots_1 > -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 48 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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0)) AND productSlots_1 + productSlots_2 + -theProducts_2 + -theProducts_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theOptions_2 + -theOptions_1 <= 0))))
lola: processed formula length: 132
lola: 2138 rewrites
lola: formula mentions 10 of 24 places; total mentions: 10
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: productSlots_1 + productSlots_2 + -theProducts_2 + -theProducts_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file DrinkVendingMachine-COL-02-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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((-theProducts_2 + -theProducts_1 <= -3 OR -optionSlots_2 + -optionSlots_1 <= -2)) AND ((-theOptions_2 + -theOptions_1 <= -1 OR -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + theOptions_2 + theOptions_1 <= 0) AND (-productSlots_1 + -productSlots_2 <= -3 AND -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + ready_6 + ready_5 + read... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-theProducts_2 + -theProducts_1 <= -3 OR -optionSlots_2 + -optionSlots_1 <= -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 48 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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-theOptions_2 + -theOptions_1 <= -1 OR -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + theOptions_2 + theOptions_1 <= 0) AND (-productSlots_1 + -productSlots_2 <= -3 AND -wait_8 + -wait_7 + -wait_6 + -wait_5 + -wait_4 + -wait_3 + -wait_2 + -wait_1 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_7 + ready_8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AG (-theProducts_2 + -theProducts_1 <= -3) AND ((-optionSlots_2 + -optionSlots_1 <= -3 AND wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theProducts_2 + -theProducts_1 <= 0) OR -productSlots_1 + -productSlots_2 + theProducts_2 + theProducts_1 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(E(TRUE U !(-theProducts_2 + -theProducts_1 <= -3))) AND ((-optionSlots_2 + -optionSlots_1 <= -3 AND wait_8 + wait_7 + wait_6 + wait_5 + wait_4 + wait_3 + wait_2 + wait_1 + -theProducts_2 + -theProducts_1 <= 0) OR -productSlots_1 + -productSlots_2 + theProducts_2 + theProducts_1 > 0)))
lola: processed formula length: 297
lola: 2138 rewrites
lola: formula mentions 14 of 24 places; total mentions: 18
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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: RESULT
lola: summary: yes no yes yes yes yes no no yes yes yes yes yes yes unknown no

BK_STOP 1464336731115

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

parsing of model.pnml complete

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="S_DrinkVendingMachine-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/S_DrinkVendingMachine-PT-02.tgz
mv S_DrinkVendingMachine-PT-02 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 S_DrinkVendingMachine-PT-02, 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 r146kn-smll-146416249200417"
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 ;