Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_SharedMemory-COL-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443433000273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496448227725


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SharedMemory-COL-000005: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_SharedMemory-COL-000005: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_SharedMemory-COL-000005 @ 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: 106/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 60 transitions, 35 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000005-CTLCardinality.task
lola: NOT(NOT(E (((p16 + p17 + p18 + p19 + p20 <= p11 + p12 + p13 + p14 + p15) U (3 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))))) : E (F ((p11 + p12 + p13 + p14 + p15 <= p6 + p7 + p8 + p9 + p10))) : E (F ((p11 + p12 + p13 + p14 + p15 <= p0))) : A (G (E (X (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) OR (2 <= p1 + p2 + p3 + p4 + p5)))))) : E (F (((((p6 + p7 + p8 + p9 + p10 <= p1 + p2 + p3 + p4 + p5) AND (3 <= p0)) OR (3 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))))) : (A (G (E (F ((3 <= p6 + p7 + p8 + p9 + p10))))) AND ((E (F ((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p0))) AND A (F ((2 <= p16 + p17 + p18 + p19 + p20)))) OR (E (F ((p1 + p2 + p3 + p4 + p5 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))) AND ((p16 + p17 + p18 + p19 + p20 <= 0) OR (p0 <= 0))))) : E (F (A (G ((2 <= p1 + p2 + p3 + p4 + p5))))) : A (G ((E (G ((p0 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))) OR (3 <= p11 + p12 + p13 + p14 + p15)))) : (E (G ((p0 <= p6 + p7 + p8 + p9 + p10))) OR E (F ((2 <= p0)))) : A (G (NOT(A (G ((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p1 + p2 + p3 + p4 + p5)))))) : E (((3 <= p16 + p17 + p18 + p19 + p20) U ())) : E (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) U A (G ((1 <= p11 + p12 + p13 + p14 + p15))))) : E (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p11 + p12 + p13 + p14 + p15) U (p11 + p12 + p13 + p14 + p15 <= p6 + p7 + p8 + p9 + p10))) : A (F (E ((TRUE U (2 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))))) : E (F (FALSE)) : E (F (NOT(E (F ((1 <= p16 + p17 + p18 + p19 + p20))))))
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 (((p16 + p17 + p18 + p19 + p20 <= p11 + p12 + p13 + p14 + p15) U (3 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p16 + p17 + p18 + p19 + p20 <= p11 + p12 + p13 + p14 + p15) U (3 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))
lola: processed formula length: 220
lola: 9 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: E (F ((p11 + p12 + p13 + p14 + p15 <= p6 + p7 + p8 + p9 + p10)))
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 140 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: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality.sara
lola: lola: SUBRESULT
lola: state equation: calling and running sara result: yes

lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p11 + p12 + p13 + p14 + p15 <= p0)))
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 140 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 unreachable.
lola: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality-2.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) OR (2 <= p1 + p2 + p3 + p4 + p5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) OR (2 <= p1 + p2 + p3 + p4 + p5))))))
lola: processed formula length: 240
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: ========================================
sara: try reading problem file SharedMemory-COL-000005-CTLCardinality-2.sara.
sara: try reading problem file SharedMemory-COL-000005-CTLCardinality.sara.
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((p6 + p7 + p8 + p9 + p10 <= p1 + p2 + p3 + p4 + p5) AND (3 <= p0)) OR (3 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45)))))
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 140 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file SharedMemory-COL-000005-CTLCardinality-4.sara.

sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((3 <= p6 + p7 + p8 + p9 + p10))))) AND ((E (F ((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p0))) AND A (F ((2 <= p16 + p17 + p18 + p19 + p20)))) OR (E (F ((p1 + p2 + p3 + p4 + p5 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p... (shortened)
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: A (G (E (F ((3 <= p6 + p7 + p8 + p9 + p10)))))
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 (3 <= p6 + p7 + p8 + p9 + p10)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p0)))
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 140 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p16 + p17 + p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p16 + p17 + p18 + p19 + p20))
lola: processed formula length: 44
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 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: E (F (A (G ((2 <= p1 + p2 + p3 + p4 + p5)))))
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 (p1 + p2 + p3 + p4 + p5 <= 1))))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((p0 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45))) OR (3 <= p11 + p12 + p13 + p14 + p15))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 + 1 <= p0)) AND (p11 + p12 + p13 + p14 + p15 <= 2))))
lola: processed formula length: 225
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p0 <= p6 + p7 + p8 + p9 + p10))) OR E (F ((2 <= p0))))
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: E (G ((p0 <= p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p6 + p7 + p8 + p9 + p10 + 1 <= p0)))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p0)))
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 140 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: state equation: write sara problem file to SharedMemory-COL-000005-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p1 + p2 + p3 + p4 + p5))))))
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 (p1 + p2 + p3 + p4 + p5 + 1 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45)))))
lola: processed formula length: 209
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 (((3 <= p16 + p17 + p18 + p19 + p20) U ()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) U A (G ((1 <= p11 + p12 + p13 + p14 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p16 + p17 + p18 + p19 + p20) U NOT(E(TRUE U (p11 + p12 + p13 + p14 + p15 <= 0))))
lola: processed formula length: 235
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p11 + p12 + p13 + p14 + p15) U (p11 + p12 + p13 + p14 + p15 <= p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45 <= p11 + p12 + p13 + p14 + p15) U (p11 + p12 + p13 + p14 + p15 <= p6 + p7 + p8 + p9 + p10))
lola: processed formula length: 242
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E ((TRUE U (2 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (2 <= p39 + p38 + p21 + p22 + p23 + p24 + p37 + p26 + p27 + p28 + p29 + p36 + p31 + p32 + p33 + p34 + p35 + p30 + p25 + p40 + p41 + p42 + p43 + p44 + p45)))
lola: processed formula length: 174
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FALSE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((1 <= p16 + p17 + p18 + p19 + p20))))))
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 (1 <= p16 + p17 + p18 + p19 + p20))))
lola: processed formula length: 59
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: RESULT
lola:
SUMMARY: no yes no no no yes no yes no yes no yes yes no no no
FORMULA SharedMemory-COL-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496448228024

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_SharedMemory-COL-000005"
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/S_SharedMemory-COL-000005.tgz
mv S_SharedMemory-COL-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_SharedMemory-COL-000005, 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 r148-csrt-149443433000273"
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 ;