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-2979
Executing tool lola
Input is LamportFastMutEx-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000279
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463604055363

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ LamportFastMutEx-PT-6
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 637/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 217 places, 420 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 597 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-6-ReachabilityFireability.task
lola: read: EF ((((((((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2)) OR FIREABLE(T-awaity_3)) OR FIREABLE(T-awaity_4)) OR FIREABLE(T-awaity_5)) OR FIREABLE(T-awaity_6)) OR FIREABLE(T-awaity_7)) OR (((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2)) OR FIREABLE(T-sety_9_3)) OR FIREABLE(T-sety_9_4)) OR FIREABLE(T-sety_9_5)) OR FIREABLE(T-sety_9_6)) OR FIREABLE(T-sety_9... (shortened)
lola: formula length: 29610
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-awaity_1) OR (FIREABLE(T-awaity_2) OR (FIREABLE(T-awaity_3) OR (FIREABLE(T-awaity_4) OR (FIREABLE(T-awaity_5) OR (FIREABLE(T-awaity_6) OR (FIREABLE(T-awaity_7) OR ((FIREABLE(T-sety_9_1) OR (FIREABLE(T-sety_9_2) OR (FIREABLE(T-sety_9_3) OR (FIREABLE(T-sety_9_4) OR (FIREABLE(T-sety_9_5) OR (FIREABLE(T-sety_9_6) OR (FIREABLE(T-sety_9_7) OR (FIREABLE(T-sety_9_8) OR (FIREABLE(T-sety_9_9... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 54307078319219552 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-setbi_5_1) OR (FIREABLE(T-setbi_5_2) OR (FIREABLE(T-setbi_5_3) OR (FIREABLE(T-setbi_5_4) OR (FIREABLE(T-setbi_5_5) OR (FIREABLE(T-setbi_5_6) OR (FIREABLE(T-setbi_5_7) OR (FIREABLE(T-setbi_5_8) OR (FIREABLE(T-setbi_5_9) OR (FIREABLE(T-setbi_5_10) OR (FIREABLE(T-setbi_5_11) OR (FIREABLE(T-setbi_5_12) OR (FIREABLE(T-setbi_5_13) OR (FIREABLE(T-setbi_5_14) OR (FIREABLE(T-ynei_15_2) OR (... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 112 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-await_13_1) OR (FIREABLE(T-await_13_2) OR (FIREABLE(T-await_13_3) OR (FIREABLE(T-await_13_4) OR (FIREABLE(T-await_13_5) OR (FIREABLE(T-await_13_6) OR (FIREABLE(T-await_13_7) OR (FIREABLE(T-await_13_8) OR (FIREABLE(T-await_13_9) OR (FIREABLE(T-await_13_10) OR (FIREABLE(T-await_13_11) OR (FIREABLE(T-await_13_12) OR (FIREABLE(T-await_13_13) OR (FIREABLE(T-await_13_14) OR (FIREABLE(T-a... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 147 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-forod_13_1) AND (! FIREABLE(T-forod_13_2) AND (! FIREABLE(T-forod_13_3) AND (! FIREABLE(T-forod_13_4) AND (! FIREABLE(T-forod_13_5) AND (! FIREABLE(T-forod_13_6) AND ! FIREABLE(T-forod_13_7))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 49 literals
lola: write sara problem file to LamportFastMutEx-COL-6-ReachabilityFireability-3.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-setbi_11_1) OR (FIREABLE(T-setbi_11_2) OR (FIREABLE(T-setbi_11_3) OR (FIREABLE(T-setbi_11_4) OR (FIREABLE(T-setbi_11_5) OR (FIREABLE(T-setbi_11_6) OR (FIREABLE(T-setbi_11_7) OR (FIREABLE(T-setbi_11_8) OR (FIREABLE(T-setbi_11_9) OR (FIREABLE(T-setbi_11_10) OR (FIREABLE(T-setbi_11_11) OR (FIREABLE(T-setbi_11_12) OR (FIREABLE(T-setbi_11_13) OR FIREABLE(T-setbi_11_14)))))))))))))) AND... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 12068239626470552 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-await_13_1) OR (FIREABLE(T-await_13_2) OR (FIREABLE(T-await_13_3) OR (FIREABLE(T-await_13_4) OR (FIREABLE(T-await_13_5) OR (FIREABLE(T-await_13_6) OR (FIREABLE(T-await_13_7) OR (FIREABLE(T-await_13_8) OR (FIREABLE(T-await_13_9) OR (FIREABLE(T-await_13_10) OR (FIREABLE(T-await_13_11) OR (FIREABLE(T-await_13_12) OR (FIREABLE(T-await_13_13) OR (FIREABLE(T-await_13_14) OR (FIREABLE(T-a... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 147 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(T-yne0_4_2) AND (! FIREABLE(T-yne0_4_3) AND (! FIREABLE(T-yne0_4_4) AND (! FIREABLE(T-yne0_4_5) AND (! FIREABLE(T-yne0_4_6) AND (! FIREABLE(T-yne0_4_7) AND (! FIREABLE(T-yne0_4_9) AND (! FIREABLE(T-yne0_4_10) AND (! FIREABLE(T-yne0_4_11) AND (! FIREABLE(T-yne0_4_12) AND (! FIREABLE(T-yne0_4_13) AND (! FIREABLE(T-yne0_4_14) AND (! FIREABLE(T-yne0_4_16) AND (! FIREABLE(T-yne0_4_17)... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6130279074541201995400556314624 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-forod_13_1) OR (FIREABLE(T-forod_13_2) OR (FIREABLE(T-forod_13_3) OR (FIREABLE(T-forod_13_4) OR (FIREABLE(T-forod_13_5) OR (FIREABLE(T-forod_13_6) OR FIREABLE(T-forod_13_7))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 49 literals
lola: write sara problem file to LamportFastMutEx-COL-6-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-ynei_15_2) OR (FIREABLE(T-ynei_15_3) OR (FIREABLE(T-ynei_15_4) OR (FIREABLE(T-ynei_15_5) OR (FIREABLE(T-ynei_15_6) OR (FIREABLE(T-ynei_15_7) OR (FIREABLE(T-ynei_15_8) OR (FIREABLE(T-ynei_15_10) OR (FIREABLE(T-ynei_15_11) OR (FIREABLE(T-ynei_15_12) OR (FIREABLE(T-ynei_15_13) OR (FIREABLE(T-ynei_15_14) OR (FIREABLE(T-ynei_15_15) OR (FIREABLE(T-ynei_15_16) OR (FIREABLE(T-ynei_15_18) O... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-setbi_5_1) OR (FIREABLE(T-setbi_5_2) OR (FIREABLE(T-setbi_5_3) OR (FIREABLE(T-setbi_5_4) OR (FIREABLE(T-setbi_5_5) OR (FIREABLE(T-setbi_5_6) OR (FIREABLE(T-setbi_5_7) OR (FIREABLE(T-setbi_5_8) OR (FIREABLE(T-setbi_5_9) OR (FIREABLE(T-setbi_5_10) OR (FIREABLE(T-setbi_5_11) OR (FIREABLE(T-setbi_5_12) OR (FIREABLE(T-setbi_5_13) OR FIREABLE(T-setbi_5_14)))))))))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 28 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-ynei_15_2) OR (FIREABLE(T-ynei_15_3) OR (FIREABLE(T-ynei_15_4) OR (FIREABLE(T-ynei_15_5) OR (FIREABLE(T-ynei_15_6) OR (FIREABLE(T-ynei_15_7) OR (FIREABLE(T-ynei_15_8) OR (FIREABLE(T-ynei_15_10) OR (FIREABLE(T-ynei_15_11) OR (FIREABLE(T-ynei_15_12) OR (FIREABLE(T-ynei_15_13) OR (FIREABLE(T-ynei_15_14) OR (FIREABLE(T-ynei_15_15) OR (FIREABLE(T-ynei_15_16) OR (FIREABLE(T-ynei_15_18) ... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 134874264 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-forod_13_1) AND (! FIREABLE(T-forod_13_2) AND (! FIREABLE(T-forod_13_3) AND (! FIREABLE(T-forod_13_4) AND (! FIREABLE(T-forod_13_5) AND (! FIREABLE(T-forod_13_6) AND ! FIREABLE(T-forod_13_7))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 49 literals
lola: write sara problem file to LamportFastMutEx-COL-6-ReachabilityFireability-11.sara
lola: lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-setbi_11_1) OR (FIREABLE(T-setbi_11_2) OR (FIREABLE(T-setbi_11_3) OR (FIREABLE(T-setbi_11_4) OR (FIREABLE(T-setbi_11_5) OR (FIREABLE(T-setbi_11_6) OR (FIREABLE(T-setbi_11_7) OR (FIREABLE(T-setbi_11_8) OR (FIREABLE(T-setbi_11_9) OR (FIREABLE(T-setbi_11_10) OR (FIREABLE(T-setbi_11_11) OR (FIREABLE(T-setbi_11_12) OR (FIREABLE(T-setbi_11_13) OR FIREABLE(T-setbi_11_14)))))))))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 28 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-awaity_1) AND (! FIREABLE(T-awaity_2) AND (! FIREABLE(T-awaity_3) AND (! FIREABLE(T-awaity_4) AND (! FIREABLE(T-awaity_5) AND (! FIREABLE(T-awaity_6) AND ! FIREABLE(T-awaity_7))))))))
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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 14 literals
lola: write sara problem file to LamportFastMutEx-COL-6-ReachabilityFireability-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(T-ynei_15_2) AND (! FIREABLE(T-ynei_15_3) AND (! FIREABLE(T-ynei_15_4) AND (! FIREABLE(T-ynei_15_5) AND (! FIREABLE(T-ynei_15_6) AND (! FIREABLE(T-ynei_15_7) AND (! FIREABLE(T-ynei_15_8) AND (! FIREABLE(T-ynei_15_10) AND (! FIREABLE(T-ynei_15_11) AND (! FIREABLE(T-ynei_15_12) AND (! FIREABLE(T-ynei_15_13) AND (! FIREABLE(T-ynei_15_14) AND (! FIREABLE(T-ynei_15_15) AND (! FIREABLE... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 21448 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T-ynei_15_2) AND (! FIREABLE(T-ynei_15_3) AND (! FIREABLE(T-ynei_15_4) AND (! FIREABLE(T-ynei_15_5) AND (! FIREABLE(T-ynei_15_6) AND (! FIREABLE(T-ynei_15_7) AND (! FIREABLE(T-ynei_15_8) AND (! FIREABLE(T-ynei_15_10) AND (! FIREABLE(T-ynei_15_11) AND (! FIREABLE(T-ynei_15_12) AND (! FIREABLE(T-ynei_15_13) AND (! FIREABLE(T-ynei_15_14) AND (! FIREABLE(T-ynei_15_15) AND (! FIREABLE(T... (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 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1536719031690742399020056969216 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes no yes yes no yes no yes yes no yes no no no

BK_STOP 1463604055878

--------------------
content from 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="LamportFastMutEx-PT-6"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/LamportFastMutEx-PT-6.tgz
mv LamportFastMutEx-PT-6 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is LamportFastMutEx-PT-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r062kn-blw3-146358897000279"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;