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

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

=== Now, execution of the tool begins

BK_START 1496502154884


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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-226: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ HexagonalGrid-PT-226 @ 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: 439/65536 symbol table entries, 9 collisions
lola: preprocessing...
lola: finding significant places
lola: 169 places, 270 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 337 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-226-CTLCardinality.task
lola: (NOT(E (X (((pbl_2_3 <= pi6_1_2) AND (2 <= pol4_3_1))))) AND E (X (A (F ((3 <= pi6_2_1)))))) : ((E (G (((3 <= pi2_2_2) OR (pol5_3_1 <= pi2_2_1)))) OR A (((pol4_2_1 <= pil3_2_1) U (1 <= po4_3_2)))) OR ((((pb6_1_2 <= pol2_1_1) OR ((1 <= pil2_3_1) AND (pbl_1_2 <= po6_1_2))) OR A (G ((pb1_1_1 <= pi6_2_1)))) OR A (G (((pi3_3_1 <= pb5_2_3) OR (pol2_2_2 <= pil3_1_1)))))) : NOT(E (F ((((2 <= pil6_1_2) AND (pi2_2_3 <= pb3_3_2)) OR ((pb5_2_1 <= pi6_1_2) AND (pb2_1_2 <= pil3_2_1)))))) : E (G ((E (F ((1 <= pil6_2_1))) OR A (X ((pol2_3_1 <= pi3_1_2)))))) : E ((A (F ((pb1_1_2 <= pb4_2_3))) U ((1 <= pb2_2_3) AND (pb2_2_2 + 1 <= po6_1_2)))) : A (G (NOT(A (G ((pol1_2_1 <= pil2_2_2)))))) : (NOT(E (G (((po6_1_2 <= pil3_2_2) AND (po3_3_1 <= pil3_3_1))))) OR A (X (A (F ((pb2_3_1 <= pb4_2_2)))))) : A (F (A (X (((2 <= po3_3_2) AND (pi3_3_1 <= pol6_1_1)))))) : ((((2 <= po2_2_3) AND (2 <= pil4_3_1)) AND NOT(A (G ((po1_2_3 <= pb5_2_2))))) OR A (G ((pi4_3_1 <= pb6_3_1)))) : E (F (NOT(E (F ((pb5_2_1 <= po6_1_1)))))) : ((pb4_2_3 <= pi2_1_1) OR NOT(E (G (((2 <= pb3_1_1) OR (1 <= pi3_3_2)))))) : A (G (E (G (((1 <= pb1_1_1) OR (po3_3_2 <= pil6_1_1)))))) : (E (F ((((1 <= pol5_1_1) AND (po4_2_1 <= pb2_3_2)) OR (pil2_1_2 <= pbl_2_2)))) AND A (F (((3 <= pbl_3_2) AND (3 <= po4_3_2) AND (2 <= pil4_3_1) AND (po3_2_3 <= pb2_2_2))))) : A (X (E (G ((po1_2_2 <= 1))))) : ((E (X (((pi1_1_2 <= pb6_1_2) OR (2 <= pb4_2_1)))) OR A (F ((po2_1_1 + 1 <= pil1_1_1)))) AND A (F (((1 <= po3_2_1) OR ((pi6_1_2 <= pil2_1_2) AND (pb2_3_1 <= pi2_3_2)))))) : E (G ((pil3_1_1 <= 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: (NOT(E (X (((pbl_2_3 <= pi6_1_2) AND (2 <= pol4_3_1))))) AND E (X (A (F ((3 <= pi6_2_1))))))
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 (X (((pi6_1_2 + 1 <= pbl_2_3) OR (pol4_3_1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((pi6_1_2 + 1 <= pbl_2_3) OR (pol4_3_1 <= 1)))
lola: processed formula length: 50
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= pi6_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= pi6_2_1)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: 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 (G (((3 <= pi2_2_2) OR (pol5_3_1 <= pi2_2_1)))) OR A (((pol4_2_1 <= pil3_2_1) U (1 <= po4_3_2)))) OR ((((pb6_1_2 <= pol2_1_1) OR ((1 <= pil2_3_1) AND (pbl_1_2 <= po6_1_2))) OR A (G ((pb1_1_1 <= pi6_2_1)))) OR A (G (((pi3_3_1 <= pb5_2_3) OR (pol2_2_2 <= pil3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= pi2_2_2) OR (pol5_3_1 <= pi2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pi2_2_2 <= 2) AND (pi2_2_1 + 1 <= pol5_3_1))))
lola: processed formula length: 61
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pol4_2_1 <= pil3_2_1) U (1 <= po4_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((pol4_2_1 <= pil3_2_1) U (1 <= po4_3_2))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb6_1_2 <= pol2_1_1) OR ((1 <= pil2_3_1) AND (pbl_1_2 <= po6_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb6_1_2 <= pol2_1_1) OR ((1 <= pil2_3_1) AND (pbl_1_2 <= po6_1_2)))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: processed formula with 3 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: A (G ((pb1_1_1 <= pi6_2_1)))
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 404 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi3_3_1 <= pb5_2_3) OR (pol2_2_2 <= pil3_1_1))))
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 404 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((2 <= pil6_1_2) AND (pi2_2_3 <= pb3_3_2)) OR ((pb5_2_1 <= pi6_1_2) AND (pb2_1_2 <= pil3_2_1))))))
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 404 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-226-CTLCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((1 <= pil6_2_1))) OR A (X ((pol2_3_1 <= pi3_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (1 <= pil6_2_1))) AND NOT(AX((pol2_3_1 <= pi3_1_2))))))
lola: processed formula length: 82
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((pb1_1_2 <= pb4_2_3))) U ((1 <= pb2_2_3) AND (pb2_2_2 + 1 <= po6_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (pb1_1_2 <= pb4_2_3)) U ((1 <= pb2_2_3) AND (pb2_2_2 + 1 <= po6_1_2)))
lola: processed formula length: 81
lola: 2 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 (NOT(A (G ((pol1_2_1 <= pil2_2_2))))))
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 (pil2_2_2 + 1 <= pol1_2_1)))))
lola: processed formula length: 56
lola: 5 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: (NOT(E (G (((po6_1_2 <= pil3_2_2) AND (po3_3_1 <= pil3_3_1))))) OR A (X (A (F ((pb2_3_1 <= pb4_2_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 (F (((pil3_2_2 + 1 <= po6_1_2) OR (pil3_3_1 + 1 <= po3_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pil3_2_2 + 1 <= po6_1_2) OR (pil3_3_1 + 1 <= po3_3_1)))
lola: processed formula length: 67
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((pb2_3_1 <= pb4_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (pb2_3_1 <= pb4_2_2)))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((2 <= po3_3_2) AND (pi3_3_1 <= pol6_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((2 <= po3_3_2) AND (pi3_3_1 <= pol6_1_1))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= po2_2_3) AND (2 <= pil4_3_1)) AND NOT(A (G ((po1_2_3 <= pb5_2_2))))) OR A (G ((pi4_3_1 <= pb6_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= po2_2_3) AND (2 <= pil4_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= po2_2_3) AND (2 <= pil4_3_1))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: processed formula with 2 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pi4_3_1 <= pb6_3_1)))
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 404 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-226-CTLCardinality-9.sara
lola: lola: SUBRESULT
========================================
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((pb5_2_1 <= po6_1_1))))))
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 (pb5_2_1 <= po6_1_1))))
lola: processed formula length: 45
lola: 6 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb4_2_3 <= pi2_1_1) OR NOT(E (G (((2 <= pb3_1_1) OR (1 <= pi3_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb4_2_3 <= pi2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb4_2_3 <= pi2_1_1)
lola: processed formula length: 20
lola: 3 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: processed formula with 1 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb3_1_1 <= 1) AND (pi3_3_2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pb3_1_1 <= 1) AND (pi3_3_2 <= 0)))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (((1 <= pb1_1_1) OR (po3_3_2 <= pil6_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U ((pb1_1_1 <= 0) AND (pil6_1_1 + 1 <= po3_3_2)))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= pol5_1_1) AND (po4_2_1 <= pb2_3_2)) OR (pil2_1_2 <= pbl_2_2)))) AND A (F (((3 <= pbl_3_2) AND (3 <= po4_3_2) AND (2 <= pil4_3_1) AND (po3_2_3 <= pb2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= pol5_1_1) AND (po4_2_1 <= pb2_3_2)) OR (pil2_1_2 <= pbl_2_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 404 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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= pbl_3_2) AND (3 <= po4_3_2) AND (2 <= pil4_3_1) AND (po3_2_3 <= pb2_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= pbl_3_2) AND (3 <= po4_3_2) AND (2 <= pil4_3_1) AND (po3_2_3 <= pb2_2_2)))
lola: processed formula length: 90
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((po1_2_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (2 <= po1_2_2))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X (((pi1_1_2 <= pb6_1_2) OR (2 <= pb4_2_1)))) OR A (F ((po2_1_1 + 1 <= pil1_1_1)))) AND A (F (((1 <= po3_2_1) OR ((pi6_1_2 <= pil2_1_2) AND (pb2_3_1 <= pi2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((pi1_1_2 <= pb6_1_2) OR (2 <= pb4_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((pi1_1_2 <= pb6_1_2) OR (2 <= pb4_2_1)))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= po3_2_1) OR ((pi6_1_2 <= pil2_1_2) AND (pb2_3_1 <= pi2_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= po3_2_1) OR ((pi6_1_2 <= pil2_1_2) AND (pb2_3_1 <= pi2_3_2))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pil3_1_1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= pil3_1_1)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: RESULT
lola:
SUMMARY: no no no yes yes no no no no yes no no no yes no yes
========================================
FORMULA HexagonalGrid-PT-226-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496502155142

--------------------
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-226"
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/HexagonalGrid-PT-226.tgz
mv HexagonalGrid-PT-226 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-226, 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 r188-blw3-149581034500201"
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 ;