Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_LamportFastMutEx-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000174
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496357768269


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


checking for too many tokens
===========================================================================================
S_LamportFastMutEx-PT-2: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_LamportFastMutEx-PT-2 @ 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: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-2-CTLCardinality.task
lola: A (G (TRUE)) : (1 <= P-await_13_0 + P-await_13_1 + P-await_13_2) : (((((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= 2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 + 1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)) OR A (X (((x_0 + x_1 + x_2 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-awaity_0 + P-awaity_1 + P-awaity_2 <= 0))))) : A (G ((2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2))) : NOT((A (X (((3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))) AND (((2 <= P-await_13_0 + P-await_13_1 + P-await_13_2) OR (2 <= y_0 + y_1 + y_2) OR (y_0 + y_1 + y_2 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) OR (P-CS_21_2 + P-CS_21_1 + P-CS_21_0 + 1 <= y_0 + y_1 + y_2))))) : E (F (A (X ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))) : A ((((P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2) AND (y_0 + y_1 + y_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) AND ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2))) U (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2))) : (A (X (((1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))) AND E (F (E (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2)))))) : (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= y_0 + y_1 + y_2) : (A (X (((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)))) OR A (((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) U ((3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2) OR (y_0 + y_1 + y_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2))))) : E (((((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= x_0 + x_1 + x_2)) AND (y_0 + y_1 + y_2 <= 2)) U ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) OR (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)))) : E (G ((((P-awaity_0 + P-awaity_1 + P-awaity_2 <= 1) OR (P-start_1_0 + P-start_1_1 + P-start_1_2 + 1 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)) AND E (G ((2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))))) : NOT(((2 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2) OR E (X (((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 <= x_0 + x_1 + x_2)))))) : (3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2) : E (((2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) U ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))) : (3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (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 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= P-await_13_0 + P-await_13_1 + P-await_13_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-await_13_0 + P-await_13_1 + P-await_13_2)
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= 2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 + 1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)) OR A (X (((x_0 + x_1 + x_2 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-... (shortened)
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: ((((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= 2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 + 1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= 2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 + 1 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2))
lola: processed formula length: 313
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((x_0 + x_1 + x_2 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-awaity_0 + P-awaity_1 + P-awaity_2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((x_0 + x_1 + x_2 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-awaity_0 + P-awaity_1 + P-awaity_2 <= 0)))
lola: processed formula length: 121
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)))) AND (((2 <= P-await_13_0 + P-await_13_1 + P-await_13_2) OR (2 <= y_0 + y_1 + y_2) OR (y_0 + y_1 + y_2 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)) AND ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) OR (P-CS_21_2 + P-CS_21_1 + P-CS_21_0 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= 2) AND (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 <= 2) AND (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= 2)))
lola: processed formula length: 106
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((P-await_13_0 + P-await_13_1 + P-await_13_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2) AND (y_0 + y_1 + y_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) AND ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= P-await_13_0 + P-await_13_1 + P-await_13_2) AND (y_0 + y_1 + y_2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) AND ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (1 <= ... (shortened)
lola: processed formula length: 521
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 (X (((1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))) AND E (F (E (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)))
lola: processed formula length: 225
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= y_0 + y_1 + y_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= y_0 + y_1 + y_2)
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)))) OR A (((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) U ((3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2) OR (y_0 + y_1 + y_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + 1 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)))
lola: processed formula length: 186
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) U ((3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2) OR (y_0 + y_1 + y_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2) U ((3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2) OR (y_0 + y_1 + y_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)))
lola: processed formula length: 171
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= x_0 + x_1 + x_2)) AND (y_0 + y_1 + y_2 <= 2)) U ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) OR (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= x_0 + x_1 + x_2)) AND (y_0 + y_1 + y_2 <= 2)) U ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) OR (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2) OR (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2... (shortened)
lola: processed formula length: 453
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: E (G ((((P-awaity_0 + P-awaity_1 + P-awaity_2 <= 1) OR (P-start_1_0 + P-start_1_1 + P-start_1_2 + 1 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2)) AND E (G ((2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((2 <= P-awaity_0 + P-awaity_1 + P-awaity_2) AND (P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2)) OR A(TRUE U (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 <= 1)))))
lola: processed formula length: 286
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((2 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2) OR E (X (((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 <= x_0 + x_1 + x_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 <= 1)
lola: processed formula length: 43
lola: 5 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 2) OR (x_0 + x_1 + x_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 2) OR (x_0 + x_1 + x_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2)))
lola: processed formula length: 196
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2)
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) U ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) U ((1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (1 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)))
lola: processed formula length: 190
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2)
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no yes no yes no yes no no no
FORMULA LamportFastMutEx-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496357768492

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_LamportFastMutEx-PT-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_LamportFastMutEx-PT-2.tgz
mv S_LamportFastMutEx-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_LamportFastMutEx-PT-2, 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 r118-blw7-149441650000174"
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 ;