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 HexagonalGrid-PT-316, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034500211
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496503346903


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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-316: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ HexagonalGrid-PT-316 @ 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: 1135/65536 symbol table entries, 147 collisions
lola: preprocessing...
lola: finding significant places
lola: 421 places, 714 transitions, 257 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 877 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-316-CTLFireability.task
lola: E (X (A (X (FIREABLE(to4_5_3))))) : E (F (E (F ((FIREABLE(ti1_4_4_4) AND FIREABLE(ti3_2_4_4) AND NOT FIREABLE(ti2_6_2_3)))))) : E (G ((FIREABLE(ti5_3_2_2) OR (NOT FIREABLE(ti1_4_3_3) AND NOT FIREABLE(ti5_3_5_1)) OR FIREABLE(ti3_6_3_1)))) : (A (F ((A (G (FIREABLE(to2_2_1))) OR FIREABLE(ti4_6_3_1)))) OR (E (X (E (X (FIREABLE(ti1_5_5_2))))) AND (E (F (NOT FIREABLE(ti2_3_3_1))) AND A (G ((FIREABLE(ti5_2_3_3) AND FIREABLE(ti3_6_3_3))))))) : NOT((E (G ((NOT FIREABLE(ti6_2_2_1) OR NOT FIREABLE(ti5_4_1_3)))) OR FIREABLE(ti4_1_1_1))) : (FIREABLE(to3_4_4) AND E (G (E (F ((FIREABLE(ti4_2_1_1) OR FIREABLE(ti1_6_2_4))))))) : NOT(((E (X ((FIREABLE(ti6_4_4_1) AND FIREABLE(ti2_4_5_1)))) OR NOT(A (X (FIREABLE(ti4_2_3_5))))) AND (E ((FIREABLE(to4_4_2) U FIREABLE(ti6_4_2_1))) AND E (F ((FIREABLE(to6_3_2) OR FIREABLE(ti2_3_3_2))))))) : A (G (E (F (E (F (FIREABLE(ti2_3_2_3))))))) : E (G (E (F (FIREABLE(ti5_6_2_2))))) : E (F (A (F (E (G (FIREABLE(ti6_4_2_3))))))) : A (F (E (G ((FIREABLE(ti6_3_1_2) AND FIREABLE(ti5_6_5_2) AND (FIREABLE(ti3_6_1_1) OR FIREABLE(to5_2_1))))))) : E (G (NOT(E ((FIREABLE(ti3_5_4_4) U FIREABLE(ti4_5_4_3)))))) : A (G (NOT(E (F ((FIREABLE(ti1_6_3_4) AND FIREABLE(ti5_6_1_2))))))) : A (X (E (F (NOT FIREABLE(ti5_6_1_2))))) : (E (X (A (G (NOT FIREABLE(ti4_5_1_2))))) AND A (F (FIREABLE(ti1_5_2_4)))) : ((A (F (FIREABLE(ti3_2_2_1))) OR A (X (FIREABLE(to2_1_2)))) AND NOT FIREABLE(ti2_4_3_3))
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 (X (A (X (FIREABLE(to4_5_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(FIREABLE(to4_5_3)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((FIREABLE(ti1_4_4_4) AND FIREABLE(ti3_2_4_4) AND NOT FIREABLE(ti2_6_2_3))))))
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 1028 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(ti5_3_2_2) OR (NOT FIREABLE(ti1_4_3_3) AND NOT FIREABLE(ti5_3_5_1)) OR FIREABLE(ti3_6_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(ti5_3_2_2) AND (FIREABLE(ti1_4_3_3) OR FIREABLE(ti5_3_5_1)) AND NOT FIREABLE(ti3_6_3_1))))
lola: processed formula length: 118
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((A (G (FIREABLE(to2_2_1))) OR FIREABLE(ti4_6_3_1)))) OR (E (X (E (X (FIREABLE(ti1_5_5_2))))) AND (E (F (NOT FIREABLE(ti2_3_3_1))) AND A (G ((FIREABLE(ti5_2_3_3) AND FIREABLE(ti3_6_3_3)))))))
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: A (F ((A (G (FIREABLE(to2_2_1))) OR FIREABLE(ti4_6_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U NOT FIREABLE(to2_2_1))) OR FIREABLE(ti4_6_3_1)))
lola: processed formula length: 71
lola: 3 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (FIREABLE(ti1_5_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX(FIREABLE(ti1_5_5_2)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: 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: E (F (NOT FIREABLE(ti2_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti5_2_3_3) AND FIREABLE(ti3_6_3_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 1028 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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((NOT FIREABLE(ti6_2_2_1) OR NOT FIREABLE(ti5_4_1_3)))) OR FIREABLE(ti4_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(ti6_2_2_1) AND FIREABLE(ti5_4_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(ti6_2_2_1) AND FIREABLE(ti5_4_1_3)))
lola: processed formula length: 55
lola: 6 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to3_4_4) AND E (G (E (F ((FIREABLE(ti4_2_1_1) OR FIREABLE(ti1_6_2_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to3_4_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to3_4_4)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: processed formula with 0 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(ti4_2_1_1) OR FIREABLE(ti1_6_2_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(ti4_2_1_1) OR FIREABLE(ti1_6_2_4))))))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: SUBRESULTlola:
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (X ((FIREABLE(ti6_4_4_1) AND FIREABLE(ti2_4_5_1)))) OR NOT(A (X (FIREABLE(ti4_2_3_5))))) AND (E ((FIREABLE(to4_4_2) U FIREABLE(ti6_4_2_1))) AND E (F ((FIREABLE(to6_3_2) OR FIREABLE(ti2_3_3_2)))))))
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 (X ((NOT FIREABLE(ti6_4_4_1) OR NOT FIREABLE(ti2_4_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((NOT FIREABLE(ti6_4_4_1) OR NOT FIREABLE(ti2_4_5_1)))
lola: processed formula length: 57
lola: 20 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: 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: A (X (FIREABLE(ti4_2_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(FIREABLE(ti4_2_3_5))
lola: processed formula length: 23
lola: 20 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(to4_4_2) R NOT FIREABLE(ti6_4_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(FIREABLE(to4_4_2) U FIREABLE(ti6_4_2_1)))
lola: processed formula length: 47
lola: 22 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 ((NOT FIREABLE(to6_3_2) AND NOT FIREABLE(ti2_3_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (E (F (FIREABLE(ti2_3_2_3)))))))
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(ti2_3_2_3)))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (FIREABLE(ti5_6_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U FIREABLE(ti5_6_2_2)))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (E (G (FIREABLE(ti6_4_2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U NOT(A(TRUE U NOT FIREABLE(ti6_4_2_3)))))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((FIREABLE(ti6_3_1_2) AND FIREABLE(ti5_6_5_2) AND (FIREABLE(ti3_6_1_1) OR FIREABLE(to5_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(ti6_3_1_2) OR NOT FIREABLE(ti5_6_5_2) OR (NOT FIREABLE(ti3_6_1_1) AND NOT FIREABLE(to5_2_1))))))
lola: processed formula length: 134
lola: 3 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E ((FIREABLE(ti3_5_4_4) U FIREABLE(ti4_5_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(FIREABLE(ti3_5_4_4) U FIREABLE(ti4_5_4_3))))
lola: processed formula length: 59
lola: 9 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((FIREABLE(ti1_6_3_4) AND FIREABLE(ti5_6_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (NOT FIREABLE(ti5_6_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U NOT FIREABLE(ti5_6_1_2)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 14 will run for 1766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (NOT FIREABLE(ti4_5_1_2))))) AND A (F (FIREABLE(ti1_5_2_4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (NOT FIREABLE(ti4_5_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U FIREABLE(ti4_5_1_2))))
lola: processed formula length: 38
lola: 3 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(ti3_2_2_1))) OR A (X (FIREABLE(to2_1_2)))) AND NOT FIREABLE(ti2_4_3_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti3_2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(ti3_2_2_1))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: 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: NOT FIREABLE(ti2_4_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(ti2_4_3_3)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLFireability.task
lola: processed formula with 0 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: lola:
SUMMARY: no yes yes no no yes no no yes yes no yes no yes no unknown
========================================
FORMULA HexagonalGrid-PT-316-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496503353190

--------------------
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="HexagonalGrid-PT-316"
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/HexagonalGrid-PT-316.tgz
mv HexagonalGrid-PT-316 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 HexagonalGrid-PT-316, 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 r188-blw3-149581034500211"
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 ;