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

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

=== Now, execution of the tool begins

BK_START 1496320515362


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


checking for too many tokens
===========================================================================================
Referendum-PT-0015: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ Referendum-PT-0015 @ 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: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-015-CTLCardinality.task
lola: (((2 <= ready) OR A (F (FALSE))) AND (ready <= 2)) : ((((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) OR (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) AND (E (X ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) AND A (F (TRUE)))) AND (NOT(E (G (TRUE))) AND (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))) : ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR E (G (A (F ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))) : NOT(E (F (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= ready) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))))) : NOT(A (X (A (G ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))))) : (((E (X ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))) OR (2 <= ready)) OR (((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 + 1 <= ready)) OR E (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))))) OR FALSE) : (E (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= 0) U ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))) AND (E (G (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= ready) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))) OR (A (F ((2 <= ready))) AND A (X ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))) : A (F (((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))) : A (G (A (F ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) : (E (F (((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))) AND ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) OR (3 <= ready) OR (ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) OR ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= ready))) : (E (G (((ready <= 2) OR ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (2 <= ready))))) AND E (F (E (F ((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))) : A (F (A (G (TRUE)))) : A (G (E (F (((2 <= ready)))))) : NOT(E (G (A (F ((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))) : E ((A (F ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) U E (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) : E (G (TRUE))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= ready) OR A (F (FALSE))) AND (ready <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= ready) AND (ready <= 2))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (2 <= voted_no_1 + voted_no_2 + vote... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR E (G (A (F ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))
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: (ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: processed formula length: 179
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula length: 205
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 658155 markings, 5871788 edges, 3225242262854172672 markings/sec, 0 secs
lola: 1243217 markings, 11532397 edges, 117012 markings/sec, 5 secs
lola: 1755872 markings, 16801459 edges, 102531 markings/sec, 10 secs
lola: 2325745 markings, 22370443 edges, 113975 markings/sec, 15 secs
lola: 2820499 markings, 27539324 edges, 98951 markings/sec, 20 secs
lola: 3314737 markings, 32701311 edges, 98848 markings/sec, 25 secs
lola: 3789012 markings, 37761404 edges, 94855 markings/sec, 30 secs
lola: 4221778 markings, 42590766 edges, 86553 markings/sec, 35 secs
lola: 4613231 markings, 47169855 edges, 78291 markings/sec, 40 secs
lola: 5099688 markings, 52301075 edges, 97291 markings/sec, 45 secs
lola: 5653794 markings, 57840186 edges, 110821 markings/sec, 50 secs
lola: 6171961 markings, 63182004 edges, 103633 markings/sec, 55 secs
lola: 6656752 markings, 68338799 edges, 96958 markings/sec, 60 secs
lola: 7124271 markings, 73396783 edges, 93504 markings/sec, 65 secs
lola: 7547243 markings, 78183823 edges, 84594 markings/sec, 70 secs
lola: 7921514 markings, 82685552 edges, 74854 markings/sec, 75 secs
lola: 8437443 markings, 88002835 edges, 103186 markings/sec, 80 secs
lola: 8922482 markings, 93168524 edges, 97008 markings/sec, 85 secs
lola: 9376825 markings, 98160891 edges, 90869 markings/sec, 90 secs
lola: 9791953 markings, 102918069 edges, 83026 markings/sec, 95 secs
lola: 10167296 markings, 107464092 edges, 75069 markings/sec, 100 secs
lola: 10644079 markings, 112592926 edges, 95357 markings/sec, 105 secs
lola: 11077318 markings, 117451325 edges, 86648 markings/sec, 110 secs
lola: 11451800 markings, 121978677 edges, 74896 markings/sec, 115 secs
lola: 11876005 markings, 126809688 edges, 84841 markings/sec, 120 secs
lola: 12274251 markings, 131487626 edges, 79649 markings/sec, 125 secs
lola: 12649850 markings, 136004174 edges, 75120 markings/sec, 130 secs
lola: 13021904 markings, 140486983 edges, 74411 markings/sec, 135 secs
lola: 13382703 markings, 144947181 edges, 72160 markings/sec, 140 secs
lola: 13722835 markings, 149229209 edges, 68026 markings/sec, 145 secs
lola: 14037500 markings, 153372396 edges, 62933 markings/sec, 150 secs
lola: 14322087 markings, 157359655 edges, 56917 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 +... (shortened)
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 124 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 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (G ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + 1 <= ready)))
lola: processed formula length: 227
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 725952 markings, 5757972 edges, 3228173285975916544 markings/sec, 0 secs
lola: 1312585 markings, 10948700 edges, 117327 markings/sec, 5 secs
lola: 1866474 markings, 15971578 edges, 110778 markings/sec, 10 secs
lola: 2435473 markings, 21072261 edges, 113800 markings/sec, 15 secs
lola: 2958190 markings, 25963976 edges, 104543 markings/sec, 20 secs
lola: 3452479 markings, 30726503 edges, 98858 markings/sec, 25 secs
lola: 3933065 markings, 35418383 edges, 96117 markings/sec, 30 secs
lola: 4361902 markings, 39861874 edges, 85767 markings/sec, 35 secs
lola: 4742125 markings, 44055511 edges, 76045 markings/sec, 40 secs
lola: 5364708 markings, 49531539 edges, 124517 markings/sec, 45 secs
lola: 5912163 markings, 54712623 edges, 109491 markings/sec, 50 secs
lola: 6484352 markings, 60017840 edges, 114438 markings/sec, 55 secs
lola: 6999192 markings, 65034221 edges, 102968 markings/sec, 60 secs
lola: 7480626 markings, 69889982 edges, 96287 markings/sec, 65 secs
lola: 7888060 markings, 74352303 edges, 81487 markings/sec, 70 secs
lola: 8429773 markings, 79489401 edges, 108343 markings/sec, 75 secs
lola: 8955563 markings, 84577593 edges, 105158 markings/sec, 80 secs
lola: 9438605 markings, 89428164 edges, 96608 markings/sec, 85 secs
lola: 9877744 markings, 94071655 edges, 87828 markings/sec, 90 secs
lola: 10322468 markings, 98729198 edges, 88945 markings/sec, 95 secs
lola: 10816990 markings, 103660342 edges, 98904 markings/sec, 100 secs
lola: 11255639 markings, 108297303 edges, 87730 markings/sec, 105 secs
lola: 11670049 markings, 112801949 edges, 82882 markings/sec, 110 secs
lola: 12124340 markings, 117530235 edges, 90858 markings/sec, 115 secs
lola: 12506883 markings, 121870256 edges, 76509 markings/sec, 120 secs
lola: 12931298 markings, 126420234 edges, 84883 markings/sec, 125 secs
lola: 13312263 markings, 130745521 edges, 76193 markings/sec, 130 secs
lola: 13678698 markings, 134988848 edges, 73287 markings/sec, 135 secs
lola: 14015969 markings, 139052313 edges, 67454 markings/sec, 140 secs
lola: 14313122 markings, 142899465 edges, 59431 markings/sec, 145 secs
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 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (X ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))) OR (2 <= ready)) OR (((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))
lola: processed formula length: 209
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= ready)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ready)
lola: processed formula length: 12
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 + 1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 + 1 ... (shortened)
lola: processed formula length: 410
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + vot... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 + 1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_... (shortened)
lola: processed formula length: 436
lola: 8 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= 0) U ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))) AND (E (G (((voted_no_1 + voted_no_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= 0) U ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= 0) U ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: processed formula length: 358
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= ready) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((ready + 1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no... (shortened)
lola: processed formula length: 611
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + vote... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + v... (shortened)
lola: processed formula length: 427
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula length: 205
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15) AND (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_1... (shortened)
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 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Referendum-COL-015-CTLCardinality-9.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: lola: ========================================state equation: calling and running sara

lola: ...considering subproblem: ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 ... (shortened)
lola: processed formula length: 1810
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: processed formula with 8 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 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((ready <= 2) OR ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((ready <= 2) OR ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= ready) AND ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + v... (shortened)
lola: processed formula length: 474
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))
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 124 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 Referendum-COL-015-CTLCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file Referendum-COL-015-CTLCardinality-9.sara.
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (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 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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 12 will run for 807 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= ready))))))
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 ((2 <= ready))))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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).
sara: place or transition ordering is non-deterministic

lola: 764782 markings, 6073635 edges, 3225175742400692224 markings/sec, 0 secs
lola: 1371484 markings, 11494075 edges, 121340 markings/sec, 5 secs
lola: 1951125 markings, 16783831 edges, 115928 markings/sec, 10 secs
lola: 2541035 markings, 22103253 edges, 117982 markings/sec, 15 secs
lola: 3105184 markings, 27315113 edges, 112830 markings/sec, 20 secs
lola: 3622296 markings, 32316492 edges, 103422 markings/sec, 25 secs
lola: 4106450 markings, 37152562 edges, 96831 markings/sec, 30 secs
lola: 4540787 markings, 41748465 edges, 86867 markings/sec, 35 secs
lola: 5027301 markings, 46557072 edges, 97303 markings/sec, 40 secs
lola: 5634847 markings, 52021198 edges, 121509 markings/sec, 45 secs
lola: 6203879 markings, 57297875 edges, 113806 markings/sec, 50 secs
lola: 6731085 markings, 62392250 edges, 105441 markings/sec, 55 secs
lola: 7234856 markings, 67349811 edges, 100754 markings/sec, 60 secs
lola: 7672299 markings, 71939983 edges, 87489 markings/sec, 65 secs
lola: 8097703 markings, 76473671 edges, 85081 markings/sec, 70 secs
lola: 8643669 markings, 81622627 edges, 109193 markings/sec, 75 secs
lola: 9151454 markings, 86624662 edges, 101557 markings/sec, 80 secs
lola: 9637327 markings, 91466926 edges, 97175 markings/sec, 85 secs
lola: 10037966 markings, 95916611 edges, 80128 markings/sec, 90 secs
lola: 10526824 markings, 100762638 edges, 97772 markings/sec, 95 secs
lola: 11007337 markings, 105626904 edges, 96103 markings/sec, 100 secs
lola: 11417463 markings, 110102439 edges, 82025 markings/sec, 105 secs
lola: 11850651 markings, 114698702 edges, 86638 markings/sec, 110 secs
lola: 12279580 markings, 119258895 edges, 85786 markings/sec, 115 secs
lola: 12679858 markings, 123702142 edges, 80056 markings/sec, 120 secs
lola: 13064346 markings, 127999796 edges, 76898 markings/sec, 125 secs
lola: 13450776 markings, 132338171 edges, 77286 markings/sec, 130 secs
lola: 13797415 markings, 136466014 edges, 69328 markings/sec, 135 secs
lola: 14134131 markings, 140518269 edges, 67343 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + vot... (shortened)
lola: processed formula length: 412
lola: 8 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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: 857648 markings, 5806640 edges, 3225196633121619968 markings/sec, 0 secs
lola: 1575081 markings, 11125700 edges, 143487 markings/sec, 5 secs
lola: 2233916 markings, 16231127 edges, 131767 markings/sec, 10 secs
lola: 2834110 markings, 21117325 edges, 120039 markings/sec, 15 secs
lola: 3346404 markings, 25660077 edges, 102459 markings/sec, 20 secs
lola: 4064869 markings, 31023933 edges, 143693 markings/sec, 25 secs
lola: 4730466 markings, 36192965 edges, 133119 markings/sec, 30 secs
lola: 5277540 markings, 40892823 edges, 109415 markings/sec, 35 secs
lola: 5874616 markings, 45767617 edges, 119415 markings/sec, 40 secs
lola: 6478114 markings, 50710554 edges, 120700 markings/sec, 45 secs
lola: 6987595 markings, 55258707 edges, 101896 markings/sec, 50 secs
lola: 7575780 markings, 60130962 edges, 117637 markings/sec, 55 secs
lola: 8079456 markings, 64662777 edges, 100735 markings/sec, 60 secs
lola: 8575611 markings, 69157005 edges, 99231 markings/sec, 65 secs
lola: 9050815 markings, 73566785 edges, 95041 markings/sec, 70 secs
lola: 9488622 markings, 77819940 edges, 87561 markings/sec, 75 secs
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 1497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) U E (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= v... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) U NOT(A(TRUE U (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_no_1 + voted_n... (shortened)
lola: processed formula length: 582
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 849532 markings, 5346387 edges, 3225175742400692224 markings/sec, 0 secs
lola: 1576404 markings, 10625334 edges, 145374 markings/sec, 5 secs
lola: 2294268 markings, 15823007 edges, 143573 markings/sec, 10 secs
lola: 2856424 markings, 20699101 edges, 112431 markings/sec, 15 secs
lola: 3284875 markings, 25293113 edges, 85690 markings/sec, 20 secs
lola: 4083569 markings, 30716489 edges, 159739 markings/sec, 25 secs
lola: 4755572 markings, 35856981 edges, 134401 markings/sec, 30 secs
lola: 5301347 markings, 40665576 edges, 109155 markings/sec, 35 secs
lola: 5783289 markings, 45298098 edges, 96388 markings/sec, 40 secs
lola: 6450243 markings, 50386025 edges, 133391 markings/sec, 45 secs
lola: 6982720 markings, 55096572 edges, 106495 markings/sec, 50 secs
lola: 7419091 markings, 59534040 edges, 87274 markings/sec, 55 secs
lola: 8005290 markings, 64378491 edges, 117240 markings/sec, 60 secs
lola: 8477599 markings, 68911296 edges, 94462 markings/sec, 65 secs
lola: 8975099 markings, 73489679 edges, 99500 markings/sec, 70 secs
lola: 9400117 markings, 77922386 edges, 85004 markings/sec, 75 secs
lola: 9857767 markings, 82351343 edges, 91530 markings/sec, 80 secs
lola: 10263807 markings, 86671011 edges, 81208 markings/sec, 85 secs
lola: 10641976 markings, 90895382 edges, 75634 markings/sec, 90 secs
lola: 10984573 markings, 94997987 edges, 68519 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2895 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: RESULT
lola:
SUMMARY: no no no no no yes yes no no yes yes yes no no yes yes
lola: ========================================
FORMULA Referendum-COL-015-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496321160444

--------------------
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-PT-0015"
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-PT-0015.tgz
mv Referendum-PT-0015 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-PT-0015, 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-149581172500129"
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 ;