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 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 r108-blw3-149441612200219
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DrinkVendingMachine-PT-02: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_DrinkVendingMachine-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_DrinkVendingMachine-PT-02 @ 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: 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: E (F (((3 <= optionSlots_1 + optionSlots_2) AND (1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)))) : NOT(E (X (A (G ((2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)))))) : A (G (A (X (((1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) OR (theOptions_1 + theOptions_2 <= productSlots_2 + productSlots_1)))))) : E (F (E (F ((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= theOptions_1 + theOptions_2))))) : A (G (E (F ((3 <= theOptions_1 + theOptions_2))))) : E (F (())) : E (F (E (F (((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= theProducts_1 + theProducts_2) AND (3 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)))))) : A (G ((A (F ((theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) OR (theProducts_1 + theProducts_2 <= optionSlots_1 + optionSlots_2)))) : E ((((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (2 <= theOptions_1 + theOptions_2) OR (1 <= theOptions_1 + theOptions_2)) U (((1 <= theProducts_1 + theProducts_2) AND (3 <= optionSlots_1 + optionSlots_2))))) : A (G (A (F (((2 <= theProducts_1 + theProducts_2) OR (theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)))))) : (E ((() U ((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2)))) AND E (F (((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 + 1 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6))))) : NOT(E (F (((2 <= theOptions_1 + theOptions_2) AND (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2) AND (3 <= theOptions_1 + theOptions_2))))) : A (G (A (F ((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6))))) : (productSlots_2 + productSlots_1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) : NOT(A (F (((2 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= optionSlots_1 + optionSlots_2))))) : ((E (((productSlots_2 + productSlots_1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) U (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) OR (((theProducts_1 + theProducts_2 + 1 <= theOptions_1 + theOptions_2) OR (optionSlots_1 + optionSlots_2 <= 2)) OR A (X ((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= theProducts_1 + theProducts_2))))) AND ((A (G (TRUE)) AND A (X ((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= optionSlots_1 + optionSlots_2)))) AND ((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) AND (ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= theProducts_1 + theProducts_2) AND (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) AND (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= 1))))
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 (F (((3 <= optionSlots_1 + optionSlots_2) AND (1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6))))
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 48 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-02-CTLCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= 1)))
lola: processed formula length: 90
lola: 7 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (((1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) OR (theOptions_1 + theOptions_2 <= productSlots_2 + productSlots_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(((1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) OR (theOptions_1 + theOptions_2 <= productSlots_2 + productSlots_1))))))
lola: processed formula length: 171
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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: E (F (E (F ((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= theOptions_1 + theOptions_2)))))
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 48 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 DrinkVendingMachine-COL-02-CTLCardinality-3.sara
lola: The predicate is reachable.
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= theOptions_1 + theOptions_2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: ========================================
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= theOptions_1 + theOptions_2)))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 0 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= theProducts_1 + theProducts_2) AND (3 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6))))))
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 48 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to DrinkVendingMachine-COL-02-CTLCardinality-6.sara
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) OR (theProducts_1 + theProducts_2 <= optionSlots_1 + optionSlots_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) AND (optionSlots_1 + optionSlots_2 + 1 <= theProducts_1 + theProducts_2))))
lola: processed formula length: 207
lola: 4 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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).
sara: try reading problem file DrinkVendingMachine-COL-02-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: sara: place or transition ordering is non-deterministic
subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (2 <= theOptions_1 + theOptions_2) OR (1 <= theOptions_1 + theOptions_2)) U (((1 <= theProducts_1 + theProducts_2) AND (3 <= optionSlots_1 + optionSlots_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (2 <= theOptions_1 + theOptions_2) OR (1 <= theOptions_1 + theOptions_2)) U (((1 <= theProducts_1 + theProducts_2) AND (3 <= optionSlots_1 + optionSlots_2))))
lola: processed formula length: 229
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= theProducts_1 + theProducts_2) OR (theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= theProducts_1 + theProducts_2) OR (theOptions_1 + theOptions_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))))))
lola: processed formula length: 175
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((() U ((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2)))) AND E (F (((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 + 1 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((theProducts_1 + theProducts_2 <= theOptions_1 + theOptions_2) OR (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2))))
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 48 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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 + 1 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6))))
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 48 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-02-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-02-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: SUBRESULTlola:
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((2 <= theOptions_1 + theOptions_2) AND (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2) AND (3 <= theOptions_1 + theOptions_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 (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 DrinkVendingMachine-COL-02-CTLCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)))))
lola: processed formula length: 140
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (productSlots_2 + productSlots_1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (productSlots_2 + productSlots_1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-COL-02-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: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((2 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= optionSlots_1 + optionSlots_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= optionSlots_1 + optionSlots_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= optionSlots_1 + optionSlots_2))))
lola: processed formula length: 162
lola: 5 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((productSlots_2 + productSlots_1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) U (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) OR (((theProducts_1 + theProducts_2 + 1 <= theOptions_1 + theOptions_2) OR (optionSlots_1 + optionSlots_2 <= 2)) OR A (X ((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + read... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((productSlots_2 + productSlots_1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) U (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((productSlots_2 + productSlots_1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) U (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))
lola: processed formula length: 216
lola: 5 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
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: 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) AND (ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= theProducts_1 + theProducts_2) AND (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) AND (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) AND (ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= theProducts_1 + theProducts_2) AND (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) AND (theProducts_1 + theProducts_2 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 ... (shortened)
lola: processed formula length: 500
lola: 4 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file DrinkVendingMachine-COL-02-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes yes no yes no yes no yes yes no
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-02-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496359645006

--------------------
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="S_DrinkVendingMachine-PT-02"
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/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-3254"
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 r108-blw3-149441612200219"
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 ;