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_BridgeAndVehicles-PT-V04P05N02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074500441
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496347467777


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


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V04P05N02: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_BridgeAndVehicles-PT-V04P05N02 @ 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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(liberation_A) OR ((FIREABLE(basculement_1) OR FIREABLE(basculement_2) OR FIREABLE(liberation_A)) AND (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(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2))) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2))))) : A (G (())) : E (F (((FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)))) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)) AND ((NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4) AND NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)))))) : E (F (((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (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(basculement_1) OR FIREABLE(basculement_2))))) : E (F (((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)) AND FIREABLE(liberation_A)))))) : E (F ((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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4)))) : E (F ((NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0) AND (FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND (FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) 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(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)))))) : A (G ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)))) : E (F (((NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND ((NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR NOT FIREABLE(liberation_B))) OR ((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)))))) : E (F (((((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) 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(liberation_A) AND FIREABLE(liberation_B)) OR FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2))))) : E (F (((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND FIREABLE(liberation_A) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2))))) : A (G (((NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) AND NOT FIREABLE(timeout_B_2_2_4_0)) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4))))) : E (F ((((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2))) OR ((FIREABLE(basculement_1) OR FIREABLE(basculement_2)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4)) AND NOT FIREABLE(liberation_A) AND NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4) AND (FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4)) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))))) : A (G ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4)) OR (NOT FIREABLE(decision_0_1) AND NOT FIREABLE(decision_1_1) AND NOT FIREABLE(decision_0_2) AND NOT FIREABLE(decision_1_2)) OR (NOT FIREABLE(autorisation_B_2_1) AND NOT FIREABLE(autorisation_B_2_2) AND NOT FIREABLE(autorisation_B_2_3) AND NOT FIREABLE(autorisation_B_2_4) AND NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4))))) : E (F ((NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4) AND ((NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4))) AND (FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4))))) : A (G (((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2) AND NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND NOT FIREABLE(timeout_A_0_1_0_4) AND NOT FIREABLE(timeout_A_1_1_0_4) AND NOT FIREABLE(timeout_A_2_1_0_4)) OR (NOT FIREABLE(enregistrement_A_0) AND NOT FIREABLE(enregistrement_A_1) AND NOT FIREABLE(enregistrement_A_2) AND NOT FIREABLE(enregistrement_A_3) AND NOT FIREABLE(enregistrement_A_4) AND (FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0))) OR (NOT FIREABLE(liberation_A) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(basculement_1) OR FIREABLE(basculement_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 ((NOT FIREABLE(liberation_A) OR ((FIREABLE(basculement_1) OR FIREABLE(basculement_2) OR FIREABLE(liberation_A)) AND (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(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2))) OR (NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_3) OR FIREABLE(enregistrement_A_4) OR FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR ((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND (FIREABL... (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 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(timeout_B_0_2_1_0) OR FIREABLE(timeout_B_1_2_1_0) OR FIREABLE(timeout_B_2_2_1_0) OR FIREABLE(timeout_B_0_2_2_0) OR FIREABLE(timeout_B_1_2_2_0) OR FIREABLE(timeout_B_2_2_2_0) OR FIREABLE(timeout_B_0_2_3_0) OR FIREABLE(timeout_B_1_2_3_0) OR FIREABLE(timeout_B_2_2_3_0) OR FIREABLE(timeout_B_0_2_4_0) OR FIREABLE(timeout_B_1_2_4_0) OR FIREABLE(timeout_B_2_2_4_0)) AND (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 84 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 9792 literals and 864 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND (FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2) OR ((FIREABLE(altern_cpt_2_1) OR FIREABLE(altern_cpt_2_2)) AND (FIREABLE(enregistrement_A_0) OR FIREABLE(enregistrement_A_1) OR FIREABLE(enregistrement_A_2) OR FIREABLE(enregistrement_A_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 84 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 408 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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)) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4))))
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 84 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) 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 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(liberation_B) OR (NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4)) OR (NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2) AND NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout... (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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND NOT FIREABLE(enregistrement_B_0) AND NOT FIREABLE(enregistrement_B_1) AND NOT FIREABLE(enregistrement_B_2) AND NOT FIREABLE(enregistrement_B_3) AND NOT FIREABLE(enregistrement_B_4) AND ((NOT FIREABLE(timeout... (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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(autorisation_B_2_1) OR FIREABLE(autorisation_B_2_2) OR FIREABLE(autorisation_B_2_3) OR FIREABLE(autorisation_B_2_4)) 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(liberation_A) AND FIREABLE(liberation_B)) OR FIREABLE(timeout_B_0_2_1_0) OR F... (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 84 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 1416 literals and 198 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(autorisation_A_1_1) OR FIREABLE(autorisation_A_1_2) OR FIREABLE(autorisation_A_1_3) OR FIREABLE(autorisation_A_1_4)) AND (FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2)) AND FIREABLE(liberation_A) AND (FIREABLE(basculement_1) OR FIREABLE(basculement_2)))))
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 84 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 288 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(timeout_B_0_2_1_0) AND NOT FIREABLE(timeout_B_1_2_1_0) AND NOT FIREABLE(timeout_B_2_2_1_0) AND NOT FIREABLE(timeout_B_0_2_2_0) AND NOT FIREABLE(timeout_B_1_2_2_0) AND NOT FIREABLE(timeout_B_2_2_2_0) AND NOT FIREABLE(timeout_B_0_2_3_0) AND NOT FIREABLE(timeout_B_1_2_3_0) AND NOT FIREABLE(timeout_B_2_2_3_0) AND NOT FIREABLE(timeout_B_0_2_4_0) AND NOT FIREABLE(timeout_B_1_2_4_0) ... (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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(decision_0_1) OR FIREABLE(decision_1_1) OR FIREABLE(decision_0_2) OR FIREABLE(decision_1_2) OR FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3)... (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 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(timeout_A_0_1_0_1) OR FIREABLE(timeout_A_1_1_0_1) OR FIREABLE(timeout_A_2_1_0_1) OR FIREABLE(timeout_A_0_1_0_2) OR FIREABLE(timeout_A_1_1_0_2) OR FIREABLE(timeout_A_2_1_0_2) OR FIREABLE(timeout_A_0_1_0_3) OR FIREABLE(timeout_A_1_1_0_3) OR FIREABLE(timeout_A_2_1_0_3) OR FIREABLE(timeout_A_0_1_0_4) OR FIREABLE(timeout_A_1_1_0_4) OR FIREABLE(timeout_A_2_1_0_4) OR (NOT FIRE... (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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(autorisation_A_1_1) AND NOT FIREABLE(autorisation_A_1_2) AND NOT FIREABLE(autorisation_A_1_3) AND NOT FIREABLE(autorisation_A_1_4) AND ((NOT FIREABLE(basculement_1) AND NOT FIREABLE(basculement_2)) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) 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 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(altern_cpt_2_1) AND NOT FIREABLE(altern_cpt_2_2)) OR (NOT FIREABLE(timeout_A_0_1_0_1) AND NOT FIREABLE(timeout_A_1_1_0_1) AND NOT FIREABLE(timeout_A_2_1_0_1) AND NOT FIREABLE(timeout_A_0_1_0_2) AND NOT FIREABLE(timeout_A_1_1_0_2) AND NOT FIREABLE(timeout_A_2_1_0_2) AND NOT FIREABLE(timeout_A_0_1_0_3) AND NOT FIREABLE(timeout_A_1_1_0_3) AND NOT FIREABLE(timeout_A_2_1_0_3) AND ... (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 84 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: yes yes no no no no no yes yes no no yes no yes no yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496347468190

--------------------
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_BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="ReachabilityFireability"
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_BridgeAndVehicles-PT-V04P05N02.tgz
mv S_BridgeAndVehicles-PT-V04P05N02 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_BridgeAndVehicles-PT-V04P05N02, 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 r088-csrt-149441074500441"
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 ;