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 IBM319-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500072
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494618699292


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ IBM319-PT-none @ 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: 431/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 253 places, 178 transitions, 169 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from IBM319-PT-none-ReachabilityFireability.task
lola: E (F ((FIREABLE(callToTask_s00002667_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002964_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002966_inputCriterion_s00001053) OR FIREABLE(decision_s00003020_activate_s00001072)) AND FIREABLE(callToProcess_s00001108_inputCriterion_s00001053) AND (NOT FIREABLE(callToTask_s00002963_outputCriterion_s00001055) OR NOT FIREABLE(decision_s00001840_activate_s00001072) OR (FIREABLE(callToTask_s00002896_outputCriterion_s00001055) AND FIREABLE(callToTask_s00002932_inputCriterion_s00001053) AND FIREABLE(decision_s00002056_fire_s00001075) AND FIREABLE(decision_s00001126_activate_s00001072)))))) : E (F (((FIREABLE(merge_s00002239_fire_s00001069) OR FIREABLE(fork_s00001298_fire_s00001075)) AND (FIREABLE(callToTask_s00002950_inputCriterion_s00001053) OR (FIREABLE(callToTask_s00002896_outputCriterion_s00001055) AND (FIREABLE(decision_s00001840_fire_s00001073) OR FIREABLE(merge_s00001162_activate_s00001062))))))) : A (G ((((NOT FIREABLE(callToTask_s00002896_outputCriterion_s00001055) AND NOT FIREABLE(merge_s00001061_activate_s00001064)) OR (NOT FIREABLE(merge_s00002241_activate_s00001062) AND NOT FIREABLE(callToTask_s00002954_outputCriterion_s00001055))) AND NOT FIREABLE(callToTask_s00001406_outputCriterion_s00001055)))) : E (F ((FIREABLE(decision_s00001159_fire_s00001075) AND ((NOT FIREABLE(callToTask_s00002953_outputCriterion_s00001055) AND (FIREABLE(decision_s00002056_activate_s00001072) OR FIREABLE(decision_s00001840_fire_s00001078))) OR (FIREABLE(callToTask_s00002958_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002932_inputCriterion_s00001053)))))) : A (G (NOT FIREABLE(callToProcess_s00001108_inputCriterion_s00001053))) : A (G ((FIREABLE(decision_s00002948_fire_s00001075) OR NOT FIREABLE(callToTask_s00001168_inputCriterion_s00001053) OR (NOT FIREABLE(callToTask_s00001168_inputCriterion_s00001053) AND NOT FIREABLE(merge_s00002240_fire_s00001069) AND FIREABLE(merge_s00001061_activate_s00001062) AND FIREABLE(callToProcess_s00002943_outputCriterion_s00001055) AND (FIREABLE(merge_s00001161_activate_s00001062) OR FIREABLE(callToTask_s00001852_outputCriterion_s00001055)))))) : E (F (((FIREABLE(callToTask_s00002932_outputCriterion_s00001055) AND FIREABLE(decision_s00002055_fire_s00001073)) OR (FIREABLE(join_s00001163_activate_s00001062) AND FIREABLE(decision_s00001126_fire_s00001073))))) : E (F (FIREABLE(fork_s00001071_activate_s00001072))) : E (F ((FIREABLE(decision_s00001159_activate_s00001072) AND FIREABLE(callToProcess_s00002121_inputCriterion_s00001053) AND (NOT FIREABLE(callToProcess_s00002802_outputCriterion_s00001055) OR NOT FIREABLE(decision_s00001840_fire_s00001075) OR NOT FIREABLE(decision_s00001840_activate_s00001072) OR NOT FIREABLE(callToTask_s00002959_inputCriterion_s00001053))))) : E (F ((FIREABLE(callToTask_s00002953_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002957_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002896_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002254_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002063_inputCriterion_s00001053)) AND (NOT FIREABLE(decision_s00002056_fire_s00001073) OR NOT FIREABLE(decision_s00002762_fire_s00001073) OR (NOT FIREABLE(callToTask_s00002044_inputCriterion_s00001053) AND NOT FIREABLE(decision_s00002056_fire_s00001073)))))) : E (F (FIREABLE(decision_s00001126_fire_s00001073))) : E (F ((FIREABLE(merge_s00002239_activate_s00001064) OR FIREABLE(callToTask_s00002956_outputCriterion_s00001055) OR (FIREABLE(join_s00001163_activate_s00001064) AND FIREABLE(fork_s00001071_activate_s00001072)) OR ((FIREABLE(merge_s00002241_activate_s00001062) OR FIREABLE(callToProcess_s00002499_outputCriterion_s00001055)) AND FIREABLE(callToTask_s00002961_outputCriterion_s00001055)) OR FIREABLE(callToTask_s00002954_outputCriterion_s00001055)))) : E (F (((FIREABLE(callToTask_s00002959_outputCriterion_s00001055) OR FIREABLE(merge_s00001160_fire_s00001069) OR (FIREABLE(callToTask_s00002869_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002952_inputCriterion_s00001053))) AND (FIREABLE(merge_s00001160_activate_s00001062) OR NOT FIREABLE(callToTask_s00002932_inputCriterion_s00001053)) AND (NOT FIREABLE(process_s00000343__s00003019_outputCriterion_s00001055) OR (NOT FIREABLE(decision_s00002761_activate_s00001072) AND NOT FIREABLE(decision_s00001840_fire_s00001073)))))) : A (G ((((NOT FIREABLE(decision_s00002761_activate_s00001072) OR FIREABLE(merge_s00001162_fire_s00001069)) AND (FIREABLE(join_s00001163_activate_s00001062) OR FIREABLE(decision_s00001840_fire_s00001073) OR FIREABLE(callToProcess_s00002121_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002952_inputCriterion_s00001053))) OR NOT FIREABLE(callToTask_s00002963_inputCriterion_s00001053)))) : E (F (FIREABLE(decision_s00001126_activate_s00001072))) : A (G ((NOT FIREABLE(callToTask_s00002953_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002954_inputCriterion_s00001053) OR (((FIREABLE(decision_s00002760_fire_s00001073) AND FIREABLE(decision_s00001159_activate_s00001072)) OR FIREABLE(decision_s00002760_activate_s00001072)) AND (NOT FIREABLE(callToTask_s00002952_outputCriterion_s00001055) OR FIREABLE(callToProcess_s00002038_outputCriterion_s00001055))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002667_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002964_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002966_inputCriterion_s00001053) OR FIREABLE(decision_s00003020_activate_s00001072)) AND FIREABLE(callToProcess_s00001108_inputCriterion_s00001053) AND (NOT FIREABLE(callToTask_s00002963_outputCriterion_s00001055) OR NOT FIREABLE(decision_s000018... (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 676 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 66 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(merge_s00002239_fire_s00001069) OR FIREABLE(fork_s00001298_fire_s00001075)) AND (FIREABLE(callToTask_s00002950_inputCriterion_s00001053) OR (FIREABLE(callToTask_s00002896_outputCriterion_s00001055) AND (FIREABLE(decision_s00001840_fire_s00001073) OR FIREABLE(merge_s00001162_activate_s00001062)))))))
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 676 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 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(callToTask_s00002896_outputCriterion_s00001055) AND NOT FIREABLE(merge_s00001061_activate_s00001064)) OR (NOT FIREABLE(merge_s00002241_activate_s00001062) AND NOT FIREABLE(callToTask_s00002954_outputCriterion_s00001055))) AND NOT FIREABLE(callToTask_s00001406_outputCriterion_s00001055))))
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 676 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 11 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00001159_fire_s00001075) AND ((NOT FIREABLE(callToTask_s00002953_outputCriterion_s00001055) AND (FIREABLE(decision_s00002056_activate_s00001072) OR FIREABLE(decision_s00001840_fire_s00001078))) OR (FIREABLE(callToTask_s00002958_outputCriterion_s00001055) AND NOT FIREABLE(callToTask_s00002932_inputCriterion_s00001053))))))
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 676 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 13 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(callToProcess_s00001108_inputCriterion_s00001053)))
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 676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(decision_s00002948_fire_s00001075) OR NOT FIREABLE(callToTask_s00001168_inputCriterion_s00001053) OR (NOT FIREABLE(callToTask_s00001168_inputCriterion_s00001053) AND NOT FIREABLE(merge_s00002240_fire_s00001069) AND FIREABLE(merge_s00001061_activate_s00001062) AND FIREABLE(callToProcess_s00002943_outputCriterion_s00001055) AND (FIREABLE(merge_s00001161_activate_s00001062) OR 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 676 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 47 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask_s00002932_outputCriterion_s00001055) AND FIREABLE(decision_s00002055_fire_s00001073)) OR (FIREABLE(join_s00001163_activate_s00001062) AND FIREABLE(decision_s00001126_fire_s00001073)))))
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 676 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
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: E (F (FIREABLE(fork_s00001071_activate_s00001072)))
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 676 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00001159_activate_s00001072) AND FIREABLE(callToProcess_s00002121_inputCriterion_s00001053) AND (NOT FIREABLE(callToProcess_s00002802_outputCriterion_s00001055) OR NOT FIREABLE(decision_s00001840_fire_s00001075) OR NOT FIREABLE(decision_s00001840_activate_s00001072) OR NOT FIREABLE(callToTask_s00002959_inputCriterion_s00001053)))))
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 676 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002953_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002957_outputCriterion_s00001055) AND (FIREABLE(callToTask_s00002896_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002254_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002063_inputCriterion_s00001053)) AND (NOT FIREABLE(decision_s00002056_fire_s00001073) OR NOT FIREABLE(decision_s00002762_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 676 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 78 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(decision_s00001126_fire_s00001073)))
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 676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge_s00002239_activate_s00001064) OR FIREABLE(callToTask_s00002956_outputCriterion_s00001055) OR (FIREABLE(join_s00001163_activate_s00001064) AND FIREABLE(fork_s00001071_activate_s00001072)) OR ((FIREABLE(merge_s00002241_activate_s00001062) OR FIREABLE(callToProcess_s00002499_outputCriterion_s00001055)) AND FIREABLE(callToTask_s00002961_outputCriterion_s00001055)) OR 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 676 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask_s00002959_outputCriterion_s00001055) OR FIREABLE(merge_s00001160_fire_s00001069) OR (FIREABLE(callToTask_s00002869_inputCriterion_s00001053) AND FIREABLE(callToTask_s00002952_inputCriterion_s00001053))) AND (FIREABLE(merge_s00001160_activate_s00001062) OR NOT FIREABLE(callToTask_s00002932_inputCriterion_s00001053)) AND (NOT FIREABLE(process_s00000343__s00003019_outpu... (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 676 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 213 literals and 45 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(decision_s00002761_activate_s00001072) OR FIREABLE(merge_s00001162_fire_s00001069)) AND (FIREABLE(join_s00001163_activate_s00001062) OR FIREABLE(decision_s00001840_fire_s00001073) OR FIREABLE(callToProcess_s00002121_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002952_inputCriterion_s00001053))) OR NOT FIREABLE(callToTask_s00002963_inputCriterion_s00001053))))
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 676 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 53 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(decision_s00001126_activate_s00001072)))
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 676 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: sara: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)try reading problem file IBM319-PT-none-ReachabilityFireability-13.sara.

lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(callToTask_s00002953_inputCriterion_s00001053) OR FIREABLE(callToTask_s00002954_inputCriterion_s00001053) OR (((FIREABLE(decision_s00002760_fire_s00001073) AND FIREABLE(decision_s00001159_activate_s00001072)) OR FIREABLE(decision_s00002760_activate_s00001072)) AND (NOT FIREABLE(callToTask_s00002952_outputCriterion_s00001055) OR FIREABLE(callToProcess_s00002038_outputCriteri... (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 676 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 50 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to IBM319-PT-none-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes no no yes yes yes no yes no
sara: try reading problem file IBM319-PT-none-ReachabilityFireability-14.sara.
FORMULA IBM319-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM319-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494618699449

--------------------
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="IBM319-PT-none"
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/IBM319-PT-none.tgz
mv IBM319-PT-none 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 IBM319-PT-none, 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 r038-blw7-149440484500072"
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 ;