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 IBM703-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-149440484500081
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494618736340


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ IBM703-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: 546/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 262 places, 284 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 261 transition conflict sets
lola: TASK
lola: reading formula from IBM703-PT-none-ReachabilityFireability.task
lola: E (F (FIREABLE(decision_s00000804_fire_s00000272))) : E (F ((FIREABLE(decision_s00000792_fire_s00000272) AND (FIREABLE(merge_s00000320_activate_s00000286) OR FIREABLE(merge_s00000451_activate_s00000286))))) : A (G ((NOT FIREABLE(decision_s00000777_fire_s00000274) OR NOT FIREABLE(merge_s00000456_activate_s00000289) OR FIREABLE(merge_s00000462_activate_s00000286) OR FIREABLE(decision_s00000768_fire_s00000272)))) : A (G ((NOT FIREABLE(merge_s00000446_activate_s00000289) OR NOT FIREABLE(task_s00000704_outputCriterion_s00000258)))) : E (F ((FIREABLE(merge_s00000457_activate_s00000284) AND FIREABLE(decision_s00000777_activate_s00000271) AND (NOT FIREABLE(task_s00000729_inputCriterion_s00000257) OR NOT FIREABLE(task_s00000723_inputCriterion_s00000257) OR (NOT FIREABLE(decision_s00000792_fire_s00000272) AND NOT FIREABLE(task_s00000746_outputCriterion_s00000258)))))) : A (G ((NOT FIREABLE(task_s00000762_inputCriterion_s00000257) AND (NOT FIREABLE(task_s00000724_outputCriterion_s00000258) OR FIREABLE(decision_s00000788_activate_s00000271))))) : E (F ((FIREABLE(decision_s00000783_fire_s00000274) AND FIREABLE(task_s00000741_outputCriterion_s00000258) AND (NOT FIREABLE(fork_s00000464_fire_s00000272) OR (NOT FIREABLE(decision_s00000783_activate_s00000271) AND NOT FIREABLE(task_s00000739_inputCriterion_s00000257)))))) : A (G ((FIREABLE(task_s00000730_outputCriterion_s00000258) OR NOT FIREABLE(decision_s00000784_activate_s00000271) OR (NOT FIREABLE(decision_s00000788_fire_s00000274) AND NOT FIREABLE(task_s00000757_inputCriterion_s00000257) AND (NOT FIREABLE(fork_s00000464_activate_s00000271) OR NOT FIREABLE(decision_s00000804_activate_s00000271)))))) : E (F ((FIREABLE(merge_s00000446_activate_s00000286) AND FIREABLE(merge_s00000453_fire_s00000287) AND FIREABLE(task_s00000759_inputCriterion_s00000257)))) : E (F (((FIREABLE(merge_s00000283_fire_s00000287) OR FIREABLE(decision_s00000778_activate_s00000271) OR FIREABLE(task_s00000721_outputCriterion_s00000258)) AND (FIREABLE(decision_s00000768_activate_s00000271) OR FIREABLE(task_s00000760_inputCriterion_s00000257) OR FIREABLE(task_s00000738_outputCriterion_s00000258) OR FIREABLE(merge_s00000456_activate_s00000284)) AND (FIREABLE(merge_s00000455_activate_s00000284) OR FIREABLE(decision_s00000799_fire_s00000272))))) : E (F ((FIREABLE(merge_s00000462_activate_s00000286) AND FIREABLE(merge_s00000449_activate_s00000286)))) : E (F (FIREABLE(merge_s00000288_activate_s00000284))) : E (F ((FIREABLE(task_s00000710_outputCriterion_s00000258) AND FIREABLE(callToProcess_s00000808_outputCriterion_s00000258) AND NOT FIREABLE(task_s00000710_inputCriterion_s00000257)))) : E (F ((FIREABLE(merge_s00000453_activate_s00000284) AND FIREABLE(merge_s00000455_activate_s00000289) AND FIREABLE(decision_s00000787_fire_s00000274) AND FIREABLE(merge_s00000450_activate_s00000286) AND (FIREABLE(decision_s00000796_activate_s00000271) OR FIREABLE(decision_s00000799_fire_s00000274)) AND (FIREABLE(decision_s00000805_fire_s00000274) OR FIREABLE(task_s00000715_inputCriterion_s00000257)) AND (NOT FIREABLE(decision_s00000772_fire_s00000274) OR NOT FIREABLE(decision_s00000764_activate_s00000271) OR NOT FIREABLE(merge_s00000457_fire_s00000287))))) : E (F (((NOT FIREABLE(task_s00000722_outputCriterion_s00000258) OR (FIREABLE(task_s00000726_inputCriterion_s00000257) AND FIREABLE(decision_s00000803_fire_s00000274))) AND FIREABLE(decision_s00000774_fire_s00000272) AND (FIREABLE(task_s00000748_outputCriterion_s00000258) OR FIREABLE(merge_s00000454_activate_s00000284))))) : A (G ((NOT FIREABLE(merge_s00000456_activate_s00000289) OR NOT FIREABLE(decision_s00000784_activate_s00000271) OR (FIREABLE(merge_s00000320_activate_s00000284) AND FIREABLE(decision_s00000768_fire_s00000274)) OR (FIREABLE(task_s00000754_inputCriterion_s00000257) AND FIREABLE(task_s00000710_outputCriterion_s00000258)) OR FIREABLE(task_s00000756_inputCriterion_s00000257))))
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(decision_s00000804_fire_s00000272)))
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 1044 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 IBM703-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00000792_fire_s00000272) AND (FIREABLE(merge_s00000320_activate_s00000286) OR FIREABLE(merge_s00000451_activate_s00000286)))))
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 1044 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-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(decision_s00000777_fire_s00000274) OR NOT FIREABLE(merge_s00000456_activate_s00000289) OR FIREABLE(merge_s00000462_activate_s00000286) OR FIREABLE(decision_s00000768_fire_s00000272))))
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 1044 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(merge_s00000446_activate_s00000289) OR NOT FIREABLE(task_s00000704_outputCriterion_s00000258))))
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 1044 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 IBM703-PT-none-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge_s00000457_activate_s00000284) AND FIREABLE(decision_s00000777_activate_s00000271) AND (NOT FIREABLE(task_s00000729_inputCriterion_s00000257) OR NOT FIREABLE(task_s00000723_inputCriterion_s00000257) OR (NOT FIREABLE(decision_s00000792_fire_s00000272) AND NOT FIREABLE(task_s00000746_outputCriterion_s00000258))))))
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 1044 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 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-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: A (G ((NOT FIREABLE(task_s00000762_inputCriterion_s00000257) AND (NOT FIREABLE(task_s00000724_outputCriterion_s00000258) OR FIREABLE(decision_s00000788_activate_s00000271)))))
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 1044 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision_s00000783_fire_s00000274) AND FIREABLE(task_s00000741_outputCriterion_s00000258) AND (NOT FIREABLE(fork_s00000464_fire_s00000272) OR (NOT FIREABLE(decision_s00000783_activate_s00000271) AND NOT FIREABLE(task_s00000739_inputCriterion_s00000257))))))
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 1044 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-6.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: A (G ((FIREABLE(task_s00000730_outputCriterion_s00000258) OR NOT FIREABLE(decision_s00000784_activate_s00000271) OR (NOT FIREABLE(decision_s00000788_fire_s00000274) AND NOT FIREABLE(task_s00000757_inputCriterion_s00000257) AND (NOT FIREABLE(fork_s00000464_activate_s00000271) OR NOT FIREABLE(decision_s00000804_activate_s00000271))))))
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 1044 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 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-7.sara
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 ((FIREABLE(merge_s00000446_activate_s00000286) AND FIREABLE(merge_s00000453_fire_s00000287) AND FIREABLE(task_s00000759_inputCriterion_s00000257))))
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 1044 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-8.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(merge_s00000283_fire_s00000287) OR FIREABLE(decision_s00000778_activate_s00000271) OR FIREABLE(task_s00000721_outputCriterion_s00000258)) AND (FIREABLE(decision_s00000768_activate_s00000271) OR FIREABLE(task_s00000760_inputCriterion_s00000257) OR FIREABLE(task_s00000738_outputCriterion_s00000258) OR FIREABLE(merge_s00000456_activate_s00000284)) AND (FIREABLE(merge_s00000455_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 1044 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 72 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-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 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge_s00000462_activate_s00000286) AND FIREABLE(merge_s00000449_activate_s00000286))))
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 1044 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 IBM703-PT-none-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 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(merge_s00000288_activate_s00000284)))
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 1044 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 IBM703-PT-none-ReachabilityFireability-11.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: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(task_s00000710_outputCriterion_s00000258) AND FIREABLE(callToProcess_s00000808_outputCriterion_s00000258) AND NOT FIREABLE(task_s00000710_inputCriterion_s00000257))))
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 1044 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 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge_s00000453_activate_s00000284) AND FIREABLE(merge_s00000455_activate_s00000289) AND FIREABLE(decision_s00000787_fire_s00000274) AND FIREABLE(merge_s00000450_activate_s00000286) AND (FIREABLE(decision_s00000796_activate_s00000271) OR FIREABLE(decision_s00000799_fire_s00000274)) AND (FIREABLE(decision_s00000805_fire_s00000274) OR FIREABLE(task_s00000715_inputCriterion_s0000025... (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 1044 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 84 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(task_s00000722_outputCriterion_s00000258) OR (FIREABLE(task_s00000726_inputCriterion_s00000257) AND FIREABLE(decision_s00000803_fire_s00000274))) AND FIREABLE(decision_s00000774_fire_s00000272) AND (FIREABLE(task_s00000748_outputCriterion_s00000258) OR FIREABLE(merge_s00000454_activate_s00000284)))))
lola: ========================================
lola: SUBTASK
lola: checking reachabilitysara:
try reading problem file IBM703-PT-none-ReachabilityFireability-11.sara.
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(merge_s00000456_activate_s00000289) OR NOT FIREABLE(decision_s00000784_activate_s00000271) OR (FIREABLE(merge_s00000320_activate_s00000284) AND FIREABLE(decision_s00000768_fire_s00000274)) OR (FIREABLE(task_s00000754_inputCriterion_s00000257) AND FIREABLE(task_s00000710_outputCriterion_s00000258)) OR FIREABLE(task_s00000756_inputCriterion_s00000257))))
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 1044 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 4 conjunctive subformulas
lola: state equation: write sara problem file to IBM703-PT-none-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no yes no no no yes no no yes yes
lola: state equation: calling and running sara
sara: try reading problem file IBM703-PT-none-ReachabilityFireability-15.sara.
FORMULA IBM703-PT-none-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494618736520

--------------------
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="IBM703-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/IBM703-PT-none.tgz
mv IBM703-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 IBM703-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-149440484500081"
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 ;