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 Referendum-COL-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172200048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496300423432


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
Referendum-COL-0010: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
Referendum-COL-0010: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ Referendum-COL-0010 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 31 places, 21 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 13 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-010-CTLCardinality.task
lola: E ((A (X ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U FALSE)) : (E (G (E (F ((p0 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))) AND NOT(((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR A (G ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : NOT(NOT(A (G (())))) : A (G (E (F (TRUE)))) : A (F ((2 <= p0))) : ((((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) OR NOT(A (F ((2 <= p0))))) AND A (((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 1) U (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)))) : E (F (A (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0))))) : E (F (A (X ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))) : E (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) U A (G (TRUE)))) : ((A (G (TRUE)) OR E (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0)))) OR (2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) : (((E (G (TRUE)) AND A (F ((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) OR (E (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 0) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND A (X (E (F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : (A (X (A (F ((1 <= p0))))) OR NOT((A (F ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) : A (X (NOT(A (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))) : (E (G (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (3 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)))) OR (A (X (())) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))) : E (G (NOT(E (G (TRUE))))) : NOT(NOT(E (G (()))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U 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 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p0 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))) AND NOT(((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR A (G ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p0 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p0 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))))
lola: processed formula length: 95
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= 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 84 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 Referendum-COL-010-CTLCardinality-3.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p0))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) OR NOT(A (F ((2 <= p0))))) AND A (((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 1) U (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1))))
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: ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (p0 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: processed formula length: 200
lola: 3 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p0)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: A (((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 1) U (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 1) U (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 1))
lola: processed formula length: 134
lola: 4 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p0)))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) U A (G (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (TRUE)) OR E (X ((p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 0)))) OR (2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G (TRUE)) AND A (F ((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) OR (E (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p0))) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 0) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) AND A (X (E (F ((p0 <= p11 + p12 + p13 + p14 + p15 +... (shortened)
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: A (F ((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
lola: processed formula length: 79
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
...considering subproblem: (A (X (A (F ((1 <= p0))))) OR NOT((A (F ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
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 (X (A (F ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= p0)))
lola: processed formula length: 23
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: processed formula length: 70
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: processed formula length: 74
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (3 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2)))) OR (A (X (())) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) OR (3 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0) AND (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 2) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))))
lola: processed formula length: 210
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: lola: result: yes
lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-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: NOT(NOT(E (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file Referendum-COL-010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes yes yes yes yes yes yes yes no yes
FORMULA Referendum-COL-010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496300423654

--------------------
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="Referendum-COL-0010"
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/Referendum-COL-0010.tgz
mv Referendum-COL-0010 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 Referendum-COL-0010, 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 r208-smll-149581172200048"
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 ;