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 SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963200183
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494804141583


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SafeBus-COL-03 @ 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: 157/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 97 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 117 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-03-CTLCardinality.task
lola: A ((E (F ((2 <= p56 + p55 + p57))) U E (X ((1 <= p15))))) : E (G (E (F (((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= p58) AND (2 <= p56 + p55 + p57)))))) : (((E (G ((p12 + p13 + p14 <= p0 + p1 + p2))) AND ((1 <= p36 + p35 + p34) OR (3 <= p59) OR (p0 + p1 + p2 <= p36 + p35 + p34) OR (p26 + p27 + p28 <= p52 + p53 + p54))) AND A (X (((p23 + p24 + p25 <= p19) AND (p0 + p1 + p2 <= p36 + p35 + p34))))) OR (E (G ((p39 + p38 + p37 + 1 <= p16 + p17 + p18))) AND NOT(A (G ((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)))))) : A ((E (F ((p16 + p17 + p18 <= p32))) U A (X ((p19 <= p40 + p41 + p42))))) : A (F (E (G ((1 <= p19))))) : ((((p36 + p35 + p34 <= p12 + p13 + p14) OR ((p0 + p1 + p2 <= 1) AND (p29 + p30 + p31 <= 2))) AND (((p0 + p1 + p2 + 1 <= p59) AND (p16 + p17 + p18 <= 2)) AND E (G ((2 <= p33))))) OR A (G (((p26 + p27 + p28 <= 1) OR (p23 + p24 + p25 <= 2))))) : NOT(A (F (((3 <= p58) OR (3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) OR (3 <= p16 + p17 + p18))))) : NOT(E (G (((p0 + p1 + p2 <= 0) OR (p29 + p30 + p31 + 1 <= p39 + p38 + p37))))) : ((p15 <= p0 + p1 + p2) AND E (X (E (G ((1 <= p59)))))) : NOT(A (F (E (G ((p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51 <= p56 + p55 + p57)))))) : E (F (A (((1 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51) U (p39 + p38 + p37 <= p12 + p13 + p14))))) : (A (F (E (G ((3 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51))))) OR (3 <= p12 + p13 + p14)) : E (F (((p58 <= 1) AND (p33 <= 2) AND (2 <= p32)))) : E (G (((p36 + p35 + p34 + 1 <= p33) OR (1 <= p36 + p35 + p34) OR ((1 <= p26 + p27 + p28) AND ((p16 + p17 + p18 <= p12 + p13 + p14) OR (3 <= p26 + p27 + p28)))))) : NOT(NOT(A ((TRUE U (p26 + p27 + p28 <= p56 + p55 + p57))))) : E ((E (F ((3 <= p52 + p53 + p54))) U A (X ((3 <= p0 + p1 + p2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p56 + p55 + p57))) U E (X ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= p56 + p55 + p57)) U EX((1 <= p15)))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 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: E (G (E (F (((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= p58) AND (2 <= p56 + p55 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= p58) AND (2 <= p56 + p55 + p57))))))
lola: processed formula length: 112
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((p12 + p13 + p14 <= p0 + p1 + p2))) AND ((1 <= p36 + p35 + p34) OR (3 <= p59) OR (p0 + p1 + p2 <= p36 + p35 + p34) OR (p26 + p27 + p28 <= p52 + p53 + p54))) AND A (X (((p23 + p24 + p25 <= p19) AND (p0 + p1 + p2 <= p36 + p35 + p34))))) OR (E (G ((p39 + p38 + p37 + 1 <= p16 + p17 + p18))) AND NOT(A (G ((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11))))))
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: E (G ((p12 + p13 + p14 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p0 + p1 + p2 + 1 <= p12 + p13 + p14)))
lola: processed formula length: 52
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: ((1 <= p36 + p35 + p34) OR (3 <= p59) OR (p0 + p1 + p2 <= p36 + p35 + p34) OR (p26 + p27 + p28 <= p52 + p53 + p54))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36 + p35 + p34) OR (3 <= p59) OR (p0 + p1 + p2 <= p36 + p35 + p34) OR (p26 + p27 + p28 <= p52 + p53 + p54))
lola: processed formula length: 118
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: processed formula with 4 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p23 + p24 + p25 <= p19) AND (p0 + p1 + p2 <= p36 + p35 + p34))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p23 + p24 + p25 <= p19) AND (p0 + p1 + p2 <= p36 + p35 + p34)))
lola: processed formula length: 68
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p16 + p17 + p18 <= p32))) U A (X ((p19 <= p40 + p41 + p42)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p16 + p17 + p18 <= p32)) U AX((p19 <= p40 + p41 + p42)))
lola: processed formula length: 68
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p19 <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p36 + p35 + p34 <= p12 + p13 + p14) OR ((p0 + p1 + p2 <= 1) AND (p29 + p30 + p31 <= 2))) AND (((p0 + p1 + p2 + 1 <= p59) AND (p16 + p17 + p18 <= 2)) AND E (G ((2 <= p33))))) OR A (G (((p26 + p27 + p28 <= 1) OR (p23 + p24 + p25 <= 2)))))
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: ((p36 + p35 + p34 <= p12 + p13 + p14) OR ((p0 + p1 + p2 <= 1) AND (p29 + p30 + p31 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p36 + p35 + p34 <= p12 + p13 + p14) OR ((p0 + p1 + p2 <= 1) AND (p29 + p30 + p31 <= 2)))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + 1 <= p59) AND (p16 + p17 + p18 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + 1 <= p59) AND (p16 + p17 + p18 <= 2))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p26 + p27 + p28 <= 1) OR (p23 + p24 + p25 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((3 <= p58) OR (3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) OR (3 <= p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= p58) OR (3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11) OR (3 <= p16 + p17 + p18))))
lola: processed formula length: 110
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((p0 + p1 + p2 <= 0) OR (p29 + p30 + p31 + 1 <= p39 + p38 + p37)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= p0 + p1 + p2) AND (p39 + p38 + p37 <= p29 + p30 + p31)))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: ((p15 <= p0 + p1 + p2) AND E (X (E (G ((1 <= p59))))))
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: (p15 <= p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 <= p0 + p1 + p2)
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((1 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (p59 <= 0))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 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: NOT(A (F (E (G ((p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51 <= p56 + p55 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p56 + p55 + p57 + 1 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51)))))
lola: processed formula length: 106
lola: 7 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51) U (p39 + p38 + p37 <= p12 + p13 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51) U (p39 + p38 + p37 <= p12 + p13 + p14)))
lola: processed formula length: 110
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((3 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51))))) OR (3 <= p12 + p13 + p14))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((3 <= p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p50 + p49 + p47 + p46 + p44 + p43 + p45 + p48 + p51 <= 2))))
lola: processed formula length: 83
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: (3 <= p12 + p13 + p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p12 + p13 + p14)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p58 <= 1) AND (p33 <= 2) AND (2 <= p32))))
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 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-03-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-03-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p36 + p35 + p34 + 1 <= p33) OR (1 <= p36 + p35 + p34) OR ((1 <= p26 + p27 + p28) AND ((p16 + p17 + p18 <= p12 + p13 + p14) OR (3 <= p26 + p27 + p28))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p33 <= p36 + p35 + p34) AND (p36 + p35 + p34 <= 0) AND ((p26 + p27 + p28 <= 0) OR ((p12 + p13 + p14 + 1 <= p16 + p17 + p18) AND (p26 + p27 + p28 <= 2))))))
lola: processed formula length: 171
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A ((TRUE U (p26 + p27 + p28 <= p56 + p55 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p26 + p27 + p28 <= p56 + p55 + p57))
lola: processed formula length: 46
lola: 9 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((3 <= p52 + p53 + p54))) U A (X ((3 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (3 <= p52 + p53 + p54)) U AX((3 <= p0 + p1 + p2)))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes no yes yes no no no yes no no
FORMULA SafeBus-COL-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494804141895

--------------------
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="SafeBus-COL-03"
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/SafeBus-COL-03.tgz
mv SafeBus-COL-03 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 SafeBus-COL-03, 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 r068-csrt-149440963200183"
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 ;