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_Kanban-PT-0005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649900121
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496353750931


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


checking for too many tokens
===========================================================================================
S_Kanban-PT-0005: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_Kanban-PT-0005 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-0005-CTLFireability.task
lola: (A (X (())) AND (NOT(E (F ((FIREABLE(tout1) AND FIREABLE(tback1))))) OR E (X ((FIREABLE(tback1) AND FIREABLE(tback4) AND (FIREABLE(tback2) OR FIREABLE(tout1))))))) : E ((((FIREABLE(tredo4) OR FIREABLE(tback2) OR NOT FIREABLE(tok4))) U A (G ((FIREABLE(tout1) OR FIREABLE(tback4)))))) : A (F (E (F (A (G (FIREABLE(tredo2))))))) : ((((FIREABLE(tback3) OR FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND FIREABLE(tsynch4_23)) OR FIREABLE(tredo3)) OR E (G (FIREABLE(tsynch4_23)))) AND (A (X ((FIREABLE(tok4) OR FIREABLE(tredo1)))) OR NOT(A (F (FIREABLE(tback1)))))) OR (E (F (A (G (FIREABLE(tsynch4_23))))) OR (E ((FIREABLE(tok3) U FIREABLE(tin4))) AND (E (G (FIREABLE(tsynch4_23))) AND A (F (FIREABLE(tsynch4_23))))))) : A (G (E (F (FIREABLE(tin4))))) : A (G ((A (G (NOT FIREABLE(tredo1))) OR ((NOT FIREABLE(tback1) OR NOT FIREABLE(tback4)) OR E (F (FIREABLE(tredo2))))))) : (A (G (((NOT FIREABLE(tback4) OR NOT FIREABLE(tredo1)) AND E (F (FIREABLE(tok3)))))) AND E (G (FIREABLE(tok3)))) : A ((NOT FIREABLE(tback2) U (FIREABLE(tsynch1_23) OR FIREABLE(tsynch4_23)))) : A (G (NOT FIREABLE(tredo1))) : E (((E (X (FIREABLE(tredo3))) OR (NOT FIREABLE(tredo4) OR FIREABLE(tok3))) U ((NOT FIREABLE(tredo2) AND NOT FIREABLE(tin4)) OR NOT FIREABLE(tredo2)))) : A (F (E (F ((FIREABLE(tredo2) OR FIREABLE(tsynch1_23) OR (FIREABLE(tin4) AND FIREABLE(tok4))))))) : FIREABLE(tok4) : FIREABLE(tredo2) : (A (X (A ((FIREABLE(tredo1) U FIREABLE(tsynch4_23))))) OR (A (((FIREABLE(tredo4) AND FIREABLE(tback3)) U FIREABLE(tback1))) OR E (F ((FIREABLE(tredo2) OR FIREABLE(tout1) OR FIREABLE(tback4)))))) : E (F (E (F (E (G (FIREABLE(tredo4))))))) : E (G (A (X (NOT FIREABLE(tback1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (())) AND (NOT(E (F ((FIREABLE(tout1) AND FIREABLE(tback1))))) OR E (X ((FIREABLE(tback1) AND FIREABLE(tback4) AND (FIREABLE(tback2) OR FIREABLE(tout1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tout1) OR NOT FIREABLE(tback1))))
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 44 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(tback1) AND FIREABLE(tback4) AND (FIREABLE(tback2) OR FIREABLE(tout1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(tback1) AND FIREABLE(tback4) AND (FIREABLE(tback2) OR FIREABLE(tout1))))
lola: processed formula length: 86
lola: 8 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 0 significant temporal operators and needs 0 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((FIREABLE(tredo4) OR FIREABLE(tback2) OR NOT FIREABLE(tok4))) U A (G ((FIREABLE(tout1) OR FIREABLE(tback4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((FIREABLE(tredo4) OR FIREABLE(tback2) OR NOT FIREABLE(tok4))) U NOT(E(TRUE U (NOT FIREABLE(tout1) AND NOT FIREABLE(tback4)))))
lola: processed formula length: 131
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (A (G (FIREABLE(tredo2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U NOT(E(TRUE U NOT FIREABLE(tredo2)))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 3 significant temporal operators and needs 13 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(tback3) OR FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND FIREABLE(tsynch4_23)) OR FIREABLE(tredo3)) OR E (G (FIREABLE(tsynch4_23)))) AND (A (X ((FIREABLE(tok4) OR FIREABLE(tredo1)))) OR NOT(A (F (FIREABLE(tback1)))))) OR (E (F (A (G (FIREABLE(tsynch4_23))))) OR (E ((FIREABLE(tok3) U FIREABLE(tin4))) AND (E (G (FIREABLE(tsynch4_23))) AND A (F (FIREABLE(tsynch4_23)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(tback3) OR FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND FIREABLE(tsynch4_23)) OR FIREABLE(tredo3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(tback3) OR FIREABLE(tsynch1_23) OR (FIREABLE(tok4) AND FIREABLE(tsynch4_23)) OR FIREABLE(tredo3))
lola: processed formula length: 110
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(tsynch4_23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(tsynch4_23)))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(tsynch4_23)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT FIREABLE(tsynch4_23))))
lola: processed formula length: 49
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(tok3) U FIREABLE(tin4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(tok3) U FIREABLE(tin4))
lola: processed formula length: 34
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(tsynch4_23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(tsynch4_23)))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(tin4)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U FIREABLE(tin4)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G (NOT FIREABLE(tredo1))) OR ((NOT FIREABLE(tback1) OR NOT FIREABLE(tback4)) OR E (F (FIREABLE(tredo2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U FIREABLE(tredo1)) AND ((FIREABLE(tback1) AND FIREABLE(tback4)) AND NOT(E(TRUE U FIREABLE(tredo2)))))))
lola: processed formula length: 125
lola: 8 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 3 significant temporal operators and needs 13 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(tback4) OR NOT FIREABLE(tredo1)) AND E (F (FIREABLE(tok3)))))) AND E (G (FIREABLE(tok3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tback4) OR NOT FIREABLE(tredo1))))
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 44 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(tback2) U (FIREABLE(tsynch1_23) OR FIREABLE(tsynch4_23))))
lola: ========================================
lola: lola: SUBTASK========================================

lola: checking CTL
lola: processed formula: A(NOT FIREABLE(tback2) U (FIREABLE(tsynch1_23) OR FIREABLE(tsynch4_23)))
lola: processed formula length: 73
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tredo1)))
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 44 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((E (X (FIREABLE(tredo3))) OR (NOT FIREABLE(tredo4) OR FIREABLE(tok3))) U ((NOT FIREABLE(tredo2) AND NOT FIREABLE(tin4)) OR NOT FIREABLE(tredo2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((EX(FIREABLE(tredo3)) OR (NOT FIREABLE(tredo4) OR FIREABLE(tok3))) U ((NOT FIREABLE(tredo2) AND NOT FIREABLE(tin4)) OR NOT FIREABLE(tredo2)))
lola: processed formula length: 145
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((FIREABLE(tredo2) OR FIREABLE(tsynch1_23) OR (FIREABLE(tin4) AND FIREABLE(tok4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (FIREABLE(tredo2) OR FIREABLE(tsynch1_23) OR (FIREABLE(tin4) AND FIREABLE(tok4)))))
lola: processed formula length: 103
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(tok4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tok4)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(tredo2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tredo2)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A ((FIREABLE(tredo1) U FIREABLE(tsynch4_23))))) OR (A (((FIREABLE(tredo4) AND FIREABLE(tback3)) U FIREABLE(tback1))) OR E (F ((FIREABLE(tredo2) OR FIREABLE(tout1) OR FIREABLE(tback4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A ((FIREABLE(tredo1) U FIREABLE(tsynch4_23)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(FIREABLE(tredo1) U FIREABLE(tsynch4_23)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(tredo4) AND FIREABLE(tback3)) U FIREABLE(tback1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(tredo4) AND FIREABLE(tback3)) U FIREABLE(tback1))
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tredo2) OR FIREABLE(tout1) OR FIREABLE(tback4))))
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 44 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (E (G (FIREABLE(tredo4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(tredo4))))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (NOT FIREABLE(tback1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(NOT FIREABLE(tback1)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-0005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: RESULT
lola:
SUMMARY: no no no no yes yes no no no yes yes no no yes yes yes
lola: ========================================
FORMULA Kanban-PT-0005-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-0005-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496353753624

--------------------
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_Kanban-PT-0005"
export BK_EXAMINATION="CTLFireability"
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_Kanban-PT-0005.tgz
mv S_Kanban-PT-0005 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_Kanban-PT-0005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649900121"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;