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 PermAdmissibility-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811200324
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463705696997

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PermAdmissibility-PT-05
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-ReachabilityFireability-15 TRUE 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-05-ReachabilityFireability.task
lola: read: AG (!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(switch9_1_0) OR FIREABLE(switch9_2_0)) OR FIREABLE(switch9_3_0)) OR FIREABLE(switch9_4_0)) OR FIREABLE(switch9_0_0)) OR FIREABLE(switch9_3_5)) OR FIREABLE(switch9_4_5)) OR FIREABLE(switch9_1_5)) OR FIREABLE(switch9_2_5)) OR FIREABLE(switch9_7_4)) OR FIREABLE(switch9_0_5)) OR FIREABLE(switch9_5_4)) OR FIREABLE(switch9_6_4... (shortened)
lola: formula length: 73127
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(switch9_1_0) AND (! FIREABLE(switch9_2_0) AND (! FIREABLE(switch9_3_0) AND (! FIREABLE(switch9_4_0) AND (! FIREABLE(switch9_0_0) AND (! FIREABLE(switch9_3_5) AND (! FIREABLE(switch9_4_5) AND (! FIREABLE(switch9_1_5) AND (! FIREABLE(switch9_2_5) AND (! FIREABLE(switch9_7_4) AND (! FIREABLE(switch9_0_5) AND (! FIREABLE(switch9_5_4) AND (! FIREABLE(switch9_6_4) AND (! FIREABLE(switch9... (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 544 bytes per marking, with 0 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(switch7_0_2) OR (FIREABLE(switch7_1_2) OR (FIREABLE(switch7_4_2) OR (FIREABLE(switch7_5_2) OR (FIREABLE(switch7_0_3) OR (FIREABLE(switch7_5_7) OR (FIREABLE(switch7_4_7) OR (FIREABLE(switch7_1_7) OR (FIREABLE(switch7_0_7) OR (FIREABLE(switch7_5_6) OR (FIREABLE(switch7_4_6) OR (FIREABLE(switch7_1_6) OR (FIREABLE(switch7_0_6) OR (FIREABLE(switch7_5_3) OR (FIREABLE(switch7_4_3) OR (FIRE... (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 544 bytes per marking, with 0 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: 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(switch9_1_0) OR (FIREABLE(switch9_2_0) OR (FIREABLE(switch9_3_0) OR (FIREABLE(switch9_4_0) OR (FIREABLE(switch9_0_0) OR (FIREABLE(switch9_3_5) OR (FIREABLE(switch9_4_5) OR (FIREABLE(switch9_1_5) OR (FIREABLE(switch9_2_5) OR (FIREABLE(switch9_7_4) OR (FIREABLE(switch9_0_5) OR (FIREABLE(switch9_5_4) OR (FIREABLE(switch9_6_4) OR (FIREABLE(switch9_3_6) OR (FIREABLE(switch9_4_6) OR (FIREA... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: Transformation into DNF: expect 192 literals
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(switch7_0_2) OR (FIREABLE(switch7_1_2) OR (FIREABLE(switch7_4_2) OR (FIREABLE(switch7_5_2) OR (FIREABLE(switch7_0_3) OR (FIREABLE(switch7_5_7) OR (FIREABLE(switch7_4_7) OR (FIREABLE(switch7_1_7) OR (FIREABLE(switch7_0_7) OR (FIREABLE(switch7_5_6) OR (FIREABLE(switch7_4_6) OR (FIREABLE(switch7_1_6) OR (FIREABLE(switch7_0_6) OR (FIREABLE(switch7_5_3) OR (FIREABLE(switch7_4_3) OR FIREAB... (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 544 bytes per marking, with 0 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 48 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(switch8_1_7) OR (FIREABLE(switch8_4_7) OR (FIREABLE(switch8_5_7) OR (FIREABLE(switch8_1_3) OR (FIREABLE(switch8_4_3) OR (FIREABLE(switch8_5_3) OR (FIREABLE(switch8_0_6) OR (FIREABLE(switch8_1_6) OR (FIREABLE(switch8_4_6) OR (FIREABLE(switch8_5_6) OR (FIREABLE(switch8_0_7) OR (FIREABLE(switch8_0_2) OR (FIREABLE(switch8_4_2) OR (FIREABLE(switch8_1_2) OR (FIREABLE(switch8_0_3) OR (FIREA... (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 544 bytes per marking, with 0 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: 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(display3_4_0) OR (FIREABLE(display3_3_0) OR (FIREABLE(display3_2_0) OR (FIREABLE(display3_1_0) OR (FIREABLE(display3_0_0) OR (FIREABLE(display3_3_2) OR (FIREABLE(display3_4_2) OR (FIREABLE(display3_1_2) OR (FIREABLE(display3_2_2) OR (FIREABLE(display3_7_1) OR (FIREABLE(display3_0_2) OR (FIREABLE(display3_5_1) OR (FIREABLE(display3_6_1) OR (FIREABLE(display3_3_1) OR (FIREABLE(display... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(display3_4_0) OR (FIREABLE(display3_3_0) OR (FIREABLE(display3_2_0) OR (FIREABLE(display3_1_0) OR (FIREABLE(display3_0_0) OR (FIREABLE(display3_3_2) OR (FIREABLE(display3_4_2) OR (FIREABLE(display3_1_2) OR (FIREABLE(display3_2_2) OR (FIREABLE(display3_7_1) OR (FIREABLE(display3_0_2) OR (FIREABLE(display3_5_1) OR (FIREABLE(display3_6_1) OR (FIREABLE(display3_3_1) OR (FIREABLE(display3... (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 544 bytes per marking, with 0 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 192 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(display4_0_0) AND (! FIREABLE(display4_4_0) AND (! FIREABLE(display4_3_0) AND (! FIREABLE(display4_2_0) AND (! FIREABLE(display4_1_0) AND (! FIREABLE(display4_7_1) AND (! FIREABLE(display4_0_2) AND (! FIREABLE(display4_5_1) AND (! FIREABLE(display4_6_1) AND (! FIREABLE(display4_3_2) AND (! FIREABLE(display4_4_2) AND (! FIREABLE(display4_1_2) AND (! FIREABLE(display4_2_2) AND (! FI... (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 544 bytes per marking, with 0 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 1004352 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(switch3_3_6) OR (FIREABLE(switch3_2_7) OR (FIREABLE(switch3_3_7) OR FIREABLE(switch3_2_6)))) AND ((FIREABLE(switch9_1_0) OR (FIREABLE(switch9_2_0) OR (FIREABLE(switch9_3_0) OR (FIREABLE(switch9_4_0) OR (FIREABLE(switch9_0_0) OR (FIREABLE(switch9_3_5) OR (FIREABLE(switch9_4_5) OR (FIREABLE(switch9_1_5) OR (FIREABLE(switch9_2_5) OR (FIREABLE(switch9_7_4) OR (FIREABLE(switch9_0_5) 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 544 bytes per marking, with 0 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 3080592 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(switch10_4_0) OR (FIREABLE(switch10_3_0) OR (FIREABLE(switch10_2_0) OR (FIREABLE(switch10_1_0) OR (FIREABLE(switch10_0_0) OR (FIREABLE(switch10_7_4) OR (FIREABLE(switch10_0_5) OR (FIREABLE(switch10_5_4) OR (FIREABLE(switch10_6_4) OR (FIREABLE(switch10_3_5) OR (FIREABLE(switch10_4_5) OR (FIREABLE(switch10_1_5) OR (FIREABLE(switch10_2_5) OR (FIREABLE(switch10_7_5) OR (FIREABLE(switch10... (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 544 bytes per marking, with 0 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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(display2_6_0) OR (FIREABLE(display2_5_0) OR (FIREABLE(display2_0_1) OR (FIREABLE(display2_7_0) OR (FIREABLE(display2_2_1) OR (FIREABLE(display2_1_1) OR (FIREABLE(display2_4_1) OR (FIREABLE(display2_3_1) OR (FIREABLE(display2_6_1) OR (FIREABLE(display2_5_1) OR (FIREABLE(display2_0_2) OR (FIREABLE(display2_7_1) OR (FIREABLE(display2_2_2) OR (FIREABLE(display2_1_2) OR (FIREABLE(display... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(switch11_0_0) OR (FIREABLE(switch11_4_0) OR (FIREABLE(switch11_3_0) OR (FIREABLE(switch11_2_0) OR (FIREABLE(switch11_1_0) OR (FIREABLE(switch11_4_6) OR (FIREABLE(switch11_3_6) OR (FIREABLE(switch11_2_6) OR (FIREABLE(switch11_1_6) OR (FIREABLE(switch11_0_6) OR (FIREABLE(switch11_7_5) OR (FIREABLE(switch11_6_5) OR (FIREABLE(switch11_5_5) OR (FIREABLE(switch11_4_5) OR (FIREABLE(switch11... (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 544 bytes per marking, with 0 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 192 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(display2_6_0) OR (FIREABLE(display2_5_0) OR (FIREABLE(display2_0_1) OR (FIREABLE(display2_7_0) OR (FIREABLE(display2_2_1) OR (FIREABLE(display2_1_1) OR (FIREABLE(display2_4_1) OR (FIREABLE(display2_3_1) OR (FIREABLE(display2_6_1) OR (FIREABLE(display2_5_1) OR (FIREABLE(display2_0_2) OR (FIREABLE(display2_7_1) OR (FIREABLE(display2_2_2) OR (FIREABLE(display2_1_2) OR (FIREABLE(displa... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(display1_2_1) AND (! FIREABLE(display1_1_1) AND (! FIREABLE(display1_4_1) AND (! FIREABLE(display1_3_1) AND (! FIREABLE(display1_6_0) AND (! FIREABLE(display1_5_0) AND (! FIREABLE(display1_0_1) AND (! FIREABLE(display1_7_0) AND (! FIREABLE(display1_2_2) AND (! FIREABLE(display1_1_2) AND (! FIREABLE(display1_4_2) AND (! FIREABLE(display1_3_2) AND (! FIREABLE(display1_6_1) AND (! FI... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(display3_4_0) OR (FIREABLE(display3_3_0) OR (FIREABLE(display3_2_0) OR (FIREABLE(display3_1_0) OR (FIREABLE(display3_0_0) OR (FIREABLE(display3_3_2) OR (FIREABLE(display3_4_2) OR (FIREABLE(display3_1_2) OR (FIREABLE(display3_2_2) OR (FIREABLE(display3_7_1) OR (FIREABLE(display3_0_2) OR (FIREABLE(display3_5_1) OR (FIREABLE(display3_6_1) OR (FIREABLE(display3_3_1) OR (FIREABLE(display... (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 544 bytes per marking, with 0 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(switch7_0_2) OR (FIREABLE(switch7_1_2) OR (FIREABLE(switch7_4_2) OR (FIREABLE(switch7_5_2) OR (FIREABLE(switch7_0_3) OR (FIREABLE(switch7_5_7) OR (FIREABLE(switch7_4_7) OR (FIREABLE(switch7_1_7) OR (FIREABLE(switch7_0_7) OR (FIREABLE(switch7_5_6) OR (FIREABLE(switch7_4_6) OR (FIREABLE(switch7_1_6) OR (FIREABLE(switch7_0_6) OR (FIREABLE(switch7_5_3) OR (FIREABLE(switch7_4_3) OR (FIRE... (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 544 bytes per marking, with 0 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 31871520 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: no yes yes yes yes yes yes no yes no yes yes yes yes yes yes
lola: ========================================

BK_STOP 1463705701464

--------------------
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="PermAdmissibility-PT-05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 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 PermAdmissibility-PT-05, 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 r074kn-smll-146363811200324"
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 ;