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 BridgeAndVehicles-PT-V10P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662300270
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463486121149

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ BridgeAndVehicles-PT-V10P10N10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V10P10N10-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: 336/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 48 places, 288 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 373 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability.task
lola: read: AG (((FIREABLE(liberation_B) OR !(((((((((((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2)) OR FIREABLE(autorisation_A_1_3)) OR FIREABLE(autorisation_A_1_4)) OR FIREABLE(autorisation_A_1_5)) OR FIREABLE(autorisation_A_1_6)) OR FIREABLE(autorisation_A_1_7)) OR FIREABLE(autorisation_A_1_8)) OR FIREABLE(autorisation_A_1_9)) OR FIREABLE(autorisation_A_1_10)) AND FIREABLE(liberation_A))))... (shortened)
lola: formula length: 46865
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(liberation_B) OR ((! FIREABLE(autorisation_A_1_1) AND (! FIREABLE(autorisation_A_1_2) AND (! FIREABLE(autorisation_A_1_3) AND (! FIREABLE(autorisation_A_1_4) AND (! FIREABLE(autorisation_A_1_5) AND (! FIREABLE(autorisation_A_1_6) AND (! FIREABLE(autorisation_A_1_7) AND (! FIREABLE(autorisation_A_1_8) AND (! FIREABLE(autorisation_A_1_9) AND ! FIREABLE(autorisation_A_1_10)))))))))) OR ... (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 164 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 90 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(timeout_A_1_0_0_1) OR (FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_1_2_0_1) OR (FIREABLE(timeout_A_1_3_0_1) OR (FIREABLE(timeout_A_1_4_0_1) OR (FIREABLE(timeout_A_1_5_0_1) OR (FIREABLE(timeout_A_1_6_0_1) OR (FIREABLE(timeout_A_1_7_0_1) OR (FIREABLE(timeout_A_1_8_0_1) OR (FIREABLE(timeout_A_1_9_0_1) OR (FIREABLE(timeout_A_1_10_0_1) OR (FIREABLE(timeout_A_1_0_0_2) OR (FIREABLE(... (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 164 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 583000 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(autorisation_B_2_1) OR (FIREABLE(autorisation_B_2_2) OR (FIREABLE(autorisation_B_2_3) OR (FIREABLE(autorisation_B_2_4) OR (FIREABLE(autorisation_B_2_5) OR (FIREABLE(autorisation_B_2_6) OR (FIREABLE(autorisation_B_2_7) OR (FIREABLE(autorisation_B_2_8) OR (FIREABLE(autorisation_B_2_9) OR FIREABLE(autorisation_B_2_10)))))))))) AND ((FIREABLE(enregistrement_A_0) OR (FIREABLE(enregistrem... (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 164 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 17118960 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(autorisation_A_1_1) AND (! FIREABLE(autorisation_A_1_2) AND (! FIREABLE(autorisation_A_1_3) AND (! FIREABLE(autorisation_A_1_4) AND (! FIREABLE(autorisation_A_1_5) AND (! FIREABLE(autorisation_A_1_6) AND (! FIREABLE(autorisation_A_1_7) AND (! FIREABLE(autorisation_A_1_8) AND (! FIREABLE(autorisation_A_1_9) AND ! FIREABLE(autorisation_A_1_10)))))))))) OR ((! FIREABLE(autorisation_... (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 164 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 11184988 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_10) OR FIREABLE(altern_cpt_2_10)))
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 164 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 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_10) OR FIREABLE(altern_cpt_2_10)))
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 164 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 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(liberation_B) AND (FIREABLE(enregistrement_B_0) OR (FIREABLE(enregistrement_B_1) OR (FIREABLE(enregistrement_B_2) OR (FIREABLE(enregistrement_B_3) OR (FIREABLE(enregistrement_B_4) OR (FIREABLE(enregistrement_B_5) OR (FIREABLE(enregistrement_B_6) OR (FIREABLE(enregistrement_B_7) OR (FIREABLE(enregistrement_B_8) OR (FIREABLE(enregistrement_B_9) OR FIREABLE(enregistrement_B_10)))))))... (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 164 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 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(altern_cpt_1_10) AND ! FIREABLE(altern_cpt_2_10)))
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 164 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 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(decision_1_0) OR (FIREABLE(decision_2_0) OR (FIREABLE(decision_1_1) OR (FIREABLE(decision_2_1) OR (FIREABLE(decision_1_2) OR (FIREABLE(decision_2_2) OR (FIREABLE(decision_1_3) OR (FIREABLE(decision_2_3) OR (FIREABLE(decision_1_4) OR (FIREABLE(decision_2_4) OR (FIREABLE(decision_1_5) OR (FIREABLE(decision_2_5) OR (FIREABLE(decision_1_6) OR (FIREABLE(decision_2_6) OR (FIREABLE(decisi... (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 164 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 130071371 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(altern_cpt_1_10) OR FIREABLE(altern_cpt_2_10)) AND FIREABLE(liberation_A)))
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 164 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 6 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(liberation_B) OR ! FIREABLE(liberation_B)))
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 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: sara: try reading problem file BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-9.sara.
using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(liberation_B) OR (FIREABLE(autorisation_A_1_1) OR (FIREABLE(autorisation_A_1_2) OR (FIREABLE(autorisation_A_1_3) OR (FIREABLE(autorisation_A_1_4) OR (FIREABLE(autorisation_A_1_5) OR (FIREABLE(autorisation_A_1_6) OR (FIREABLE(autorisation_A_1_7) OR (FIREABLE(autorisation_A_1_8) OR (FIREABLE(autorisation_A_1_9) OR (FIREABLE(autorisation_A_1_10) OR ((FIREABLE(altern_cpt_1_10) 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 164 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 805821382 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(timeout_A_1_0_0_1) OR (FIREABLE(timeout_A_1_1_0_1) OR (FIREABLE(timeout_A_1_2_0_1) OR (FIREABLE(timeout_A_1_3_0_1) OR (FIREABLE(timeout_A_1_4_0_1) OR (FIREABLE(timeout_A_1_5_0_1) OR (FIREABLE(timeout_A_1_6_0_1) OR (FIREABLE(timeout_A_1_7_0_1) OR (FIREABLE(timeout_A_1_8_0_1) OR (FIREABLE(timeout_A_1_9_0_1) OR (FIREABLE(timeout_A_1_10_0_1) OR (FIREABLE(timeout_A_1_0_0_2) OR (FIREABLE(... (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 164 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 262460 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(enregistrement_B_0) AND (! FIREABLE(enregistrement_B_1) AND (! FIREABLE(enregistrement_B_2) AND (! FIREABLE(enregistrement_B_3) AND (! FIREABLE(enregistrement_B_4) AND (! FIREABLE(enregistrement_B_5) AND (! FIREABLE(enregistrement_B_6) AND (! FIREABLE(enregistrement_B_7) AND (! FIREABLE(enregistrement_B_8) AND (! FIREABLE(enregistrement_B_9) AND (! FIREABLE(enregistrement_B_10) AN... (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 164 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 2776628988 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(timeout_B_2_0_1_0) AND (! FIREABLE(timeout_B_2_1_1_0) AND (! FIREABLE(timeout_B_2_2_1_0) AND (! FIREABLE(timeout_B_2_3_1_0) AND (! FIREABLE(timeout_B_2_4_1_0) AND (! FIREABLE(timeout_B_2_5_1_0) AND (! FIREABLE(timeout_B_2_6_1_0) AND (! FIREABLE(timeout_B_2_7_1_0) AND (! FIREABLE(timeout_B_2_8_1_0) AND (! FIREABLE(timeout_B_2_9_1_0) AND (! FIREABLE(timeout_B_2_10_1_0) AND (! FIREAB... (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 164 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 1750576679175062658625382438112962448404511990198699074490206614760243923526474906088767488 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(altern_cpt_1_10) OR FIREABLE(altern_cpt_2_10)))
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 164 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 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V10P10N10-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: yes no no yes yes yes no no yes yes yes yes no yes yes yes
lola: ========================================

BK_STOP 1463486154406

--------------------
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="BridgeAndVehicles-PT-V10P10N10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/BridgeAndVehicles-PT-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 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 BridgeAndVehicles-PT-V10P10N10, 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 r002kn-ebro-146347662300270"
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 ;