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 CircularTrains-PT-012, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500615
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494622223585


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ CircularTrains-PT-012 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 12 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-012-CTLCardinality.task
lola: NOT(NOT(E (G (((3 <= F7) AND (Section_4 <= Section_7)))))) : (Section_9 <= F9) : NOT((((F10 <= Section_1) AND ((1 <= F3) OR (F6 <= Section_7) OR ((3 <= F6) AND (F6 <= F3)))) OR (A (X ((Section_10 <= F12))) OR ((F9 <= Section_10) OR (3 <= F3) OR ((F5 <= F10) AND (3 <= F5)))))) : A (G ((2 <= F9))) : E (((((F4 <= F8) OR (F3 <= Section_6)) AND (3 <= F5)) U E (X ((F4 <= F3))))) : A (X (((F7 <= Section_4) OR (1 <= Section_8)))) : A (F (A (X ((1 <= F12))))) : ((NOT(A (F ((F4 <= Section_4)))) OR E (F (((F11 <= Section_4) OR (3 <= Section_11))))) OR (A (F (((2 <= F9) OR (F11 <= Section_2)))) OR (Section_10 <= 1))) : NOT(((F1 <= Section_10) AND E (F (((F5 <= Section_1) OR (F9 <= Section_6)))))) : ((((Section_7 <= Section_4) AND (3 <= Section_5)) OR NOT(E (F ((1 <= F8))))) AND ((Section_12 <= F10) AND ((Section_3 + 1 <= Section_12) OR (Section_2 <= 1)) AND (Section_7 <= Section_8))) : ((((F12 <= F8) OR (F9 <= Section_11)) AND (F9 <= Section_2)) OR NOT(A (G ((2 <= Section_3))))) : A (G (A (F ((F5 + 1 <= Section_7))))) : (F9 <= F11) : E (G (((Section_10 <= F7) AND (F2 <= Section_2) AND (F12 <= 1) AND (Section_2 + 1 <= Section_9)))) : A (G ((E (X ((2 <= Section_2))) AND ((Section_5 <= F7) AND (Section_10 + 1 <= Section_7))))) : E (G ((((F5 + 1 <= F4) AND (F12 + 1 <= Section_5)) AND E (X ((F5 <= F8))))))
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(NOT(E (G (((3 <= F7) AND (Section_4 <= Section_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((F7 <= 2) OR (Section_7 + 1 <= Section_4))))
lola: processed formula length: 59
lola: 8 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Section_9 <= F9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Section_9 <= F9)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((F10 <= Section_1) AND ((1 <= F3) OR (F6 <= Section_7) OR ((3 <= F6) AND (F6 <= F3)))) OR (A (X ((Section_10 <= F12))) OR ((F9 <= Section_10) OR (3 <= F3) OR ((F5 <= F10) AND (3 <= F5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Section_1 + 1 <= F10) OR ((F3 <= 0) AND (Section_7 + 1 <= F6) AND ((F6 <= 2) OR (F3 + 1 <= F6))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Section_1 + 1 <= F10) OR ((F3 <= 0) AND (Section_7 + 1 <= F6) AND ((F6 <= 2) OR (F3 + 1 <= F6))))
lola: processed formula length: 101
lola: 7 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: processed formula with 5 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((F12 + 1 <= Section_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((F12 + 1 <= Section_10))
lola: processed formula length: 27
lola: 8 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Section_10 + 1 <= F9) AND (F3 <= 2) AND ((F10 + 1 <= F5) OR (F5 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Section_10 + 1 <= F9) AND (F3 <= 2) AND ((F10 + 1 <= F5) OR (F5 <= 2)))
lola: processed formula length: 74
lola: 7 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= F9)))
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 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: 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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((F4 <= F8) OR (F3 <= Section_6)) AND (3 <= F5)) U E (X ((F4 <= F3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((F4 <= F8) OR (F3 <= Section_6)) AND (3 <= F5)) U EX((F4 <= F3)))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((F7 <= Section_4) OR (1 <= Section_8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((F7 <= Section_4) OR (1 <= Section_8)))
lola: processed formula length: 44
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((1 <= F12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((1 <= F12)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((F4 <= Section_4)))) OR E (F (((F11 <= Section_4) OR (3 <= Section_11))))) OR (A (F (((2 <= F9) OR (F11 <= Section_2)))) OR (Section_10 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Section_4 + 1 <= F4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (F4 <= Section_4)))
lola: processed formula length: 32
lola: 6 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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: E (F (((F11 <= Section_4) OR (3 <= Section_11))))
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 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to CircularTrains-PT-012-CTLCardinality-8.sara
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: NOT(((F1 <= Section_10) AND E (F (((F5 <= Section_1) OR (F9 <= Section_6))))))========================================

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: (Section_10 + 1 <= F1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Section_10 + 1 <= F1)
lola: processed formula length: 22
lola: 5 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((Section_7 <= Section_4) AND (3 <= Section_5)) OR NOT(E (F ((1 <= F8))))) AND ((Section_12 <= F10) AND ((Section_3 + 1 <= Section_12) OR (Section_2 <= 1)) AND (Section_7 <= Section_8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Section_7 <= Section_4) AND (3 <= Section_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Section_7 <= Section_4) AND (3 <= Section_5))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F8 <= 0)))
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 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: 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 CircularTrains-PT-012-CTLCardinality-10.sara
lola: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((F12 <= F8) OR (F9 <= Section_11)) AND (F9 <= Section_2)) OR NOT(A (G ((2 <= Section_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((F12 <= F8) OR (F9 <= Section_11)) AND (F9 <= Section_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((F12 <= F8) OR (F9 <= Section_11)) AND (F9 <= Section_2))
lola: processed formula length: 60
lola: 3 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((F5 + 1 <= Section_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (F5 + 1 <= Section_7)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (F9 <= F11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (F9 <= F11)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((Section_10 <= F7) AND (F2 <= Section_2) AND (F12 <= 1) AND (Section_2 + 1 <= Section_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((F7 + 1 <= Section_10) OR (Section_2 + 1 <= F2) OR (2 <= F12) OR (Section_9 <= Section_2))))
lola: processed formula length: 109
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((2 <= Section_2))) AND ((Section_5 <= F7) AND (Section_10 + 1 <= Section_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= Section_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((2 <= Section_2)))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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: ======================================== SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((F5 + 1 <= F4) AND (F12 + 1 <= Section_5)) AND E (X ((F5 <= F8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((F4 <= F5) OR (Section_5 <= F12)) OR NOT(EX((F5 <= F8))))))
lola: processed formula length: 75
lola: 4 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no yes no yes no no no
FORMULA CircularTrains-PT-012-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622223748

--------------------
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="CircularTrains-PT-012"
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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 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 CircularTrains-PT-012, 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 r008-csrt-149436126500615"
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 ;