Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is CSRepetitions-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600531
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463507743209

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ CSRepetitions-PT-07
FORMULA CSRepetitions-COL-07-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-07-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-07-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-07-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-07-ReachabilityFireability-15 CANNOT_COMPUTE
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: 1331/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 498 places, 833 transitions, 442 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1275 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-07-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Send_Request_45) OR FIREABLE(Send_Request_14)) OR FIREABLE(Send_Request_3)) OR FIREABLE(Send_Request_25)) OR FIREABLE(Send_Request_42)) OR FIREABLE(Send_Request_20)) OR FIREABLE(Send_Request_28)) OR FIREABLE(Send_Request_17)) OR FIREABLE(Send_Request_31)) OR FIREABLE(Send_Request_46)) OR FIREABLE(Send_Request_4)) OR FIREABLE(Send_Req... (shortened)
lola: formula length: 449711
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Request_45) OR (FIREABLE(Send_Request_14) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_25) OR (FIREABLE(Send_Request_42) OR (FIREABLE(Send_Request_20) OR (FIREABLE(Send_Request_28) OR (FIREABLE(Send_Request_17) OR (FIREABLE(Send_Request_31) OR (FIREABLE(Send_Request_46) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_22) 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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Send_Answer_31_6) AND (! FIREABLE(Send_Answer_10_2) AND (! FIREABLE(Send_Answer_39_6) AND (! FIREABLE(Send_Answer_37_3) AND (! FIREABLE(Send_Answer_24_7) AND (! FIREABLE(Send_Answer_31_1) AND (! FIREABLE(Send_Answer_45_1) AND (! FIREABLE(Send_Answer_15_2) AND (! FIREABLE(Send_Answer_1_1) AND (! FIREABLE(Send_Answer_5_7) AND (! FIREABLE(Send_Answer_26_6) AND (! FIREABLE(Send_Answer... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_3) AND (! FIREABLE(Prepare_Request_46) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_33) AND (! FIREABLE(Prepare_Request_16) AND (! FIREABLE(Prepare_Request_4) AND (! FIREABLE(Prepare_Request_44) AND (! FIREABLE(Prepare_Request_32) AND (! FIREABLE(Prepare_Request_19) AND (! FIREABLE(Prepare_Request_35) AND (! ... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_46) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_33) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_44) OR (FIREABLE(Prepare_Request_32) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_35) OR (FIREABLE(Prepare_Request_7) OR (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(Send_Answer_31_6) AND (! FIREABLE(Send_Answer_10_2) AND (! FIREABLE(Send_Answer_39_6) AND (! FIREABLE(Send_Answer_37_3) AND (! FIREABLE(Send_Answer_24_7) AND (! FIREABLE(Send_Answer_31_1) AND (! FIREABLE(Send_Answer_45_1) AND (! FIREABLE(Send_Answer_15_2) AND (! FIREABLE(Send_Answer_1_1) AND (! FIREABLE(Send_Answer_5_7) AND (! FIREABLE(Send_Answer_26_6) AND (! FIREABLE(Send_Answ... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Request_45) OR (FIREABLE(Send_Request_14) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_25) OR (FIREABLE(Send_Request_42) OR (FIREABLE(Send_Request_20) OR (FIREABLE(Send_Request_28) OR (FIREABLE(Send_Request_17) OR (FIREABLE(Send_Request_31) OR (FIREABLE(Send_Request_46) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_22) 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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_37) OR (FIREABLE(Lose_Request_20) OR (FIREABLE(Lose_Request_46) OR (FIREABLE(Lose_Request_28) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_47) OR (FIREABLE(Lose_Request_9) OR (FIREABLE(Lose_Request_21) OR (FIREABLE(Lose_Request_14) OR (FIREABLE(Lose_Request_48) OR (FIREABLE(Lose_Request_41) OR (FIREABLE(Lose_Request_34) 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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9526054615722739427916822047667771046618489867483619968813180971921804707385602129957631644115052355618322452381302058601415219842006745183463923783584930034935205172062589634087149762386935227261087536550744831415023004341501952 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Request_45) OR (FIREABLE(Send_Request_14) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_25) OR (FIREABLE(Send_Request_42) OR (FIREABLE(Send_Request_20) OR (FIREABLE(Send_Request_28) OR (FIREABLE(Send_Request_17) OR (FIREABLE(Send_Request_31) OR (FIREABLE(Send_Request_46) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_22) 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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Send_Answer_31_6) AND (! FIREABLE(Send_Answer_10_2) AND (! FIREABLE(Send_Answer_39_6) AND (! FIREABLE(Send_Answer_37_3) AND (! FIREABLE(Send_Answer_24_7) AND (! FIREABLE(Send_Answer_31_1) AND (! FIREABLE(Send_Answer_45_1) AND (! FIREABLE(Send_Answer_15_2) AND (! FIREABLE(Send_Answer_1_1) AND (! FIREABLE(Send_Answer_5_7) AND (! FIREABLE(Send_Answer_26_6) AND (! FIREABLE(Send_Answer_... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1544213944075002251029278868698964934379626584027123718186977931771166699654963582151357434708454888678380011520 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_46) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_33) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_44) OR (FIREABLE(Prepare_Request_32) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_35) OR (FIREABLE(Prepare_Request_7) 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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_31_6) OR (FIREABLE(Send_Answer_10_2) OR (FIREABLE(Send_Answer_39_6) OR (FIREABLE(Send_Answer_37_3) OR (FIREABLE(Send_Answer_24_7) OR (FIREABLE(Send_Answer_31_1) OR (FIREABLE(Send_Answer_45_1) OR (FIREABLE(Send_Answer_15_2) OR (FIREABLE(Send_Answer_1_1) OR (FIREABLE(Send_Answer_5_7) OR (FIREABLE(Send_Answer_26_6) OR (FIREABLE(Send_Answer_29_3) OR (FIREABLE(Send_Answer_2_6... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Send_Request_45) AND (! FIREABLE(Send_Request_14) AND (! FIREABLE(Send_Request_3) AND (! FIREABLE(Send_Request_25) AND (! FIREABLE(Send_Request_42) AND (! FIREABLE(Send_Request_20) AND (! FIREABLE(Send_Request_28) AND (! FIREABLE(Send_Request_17) AND (! FIREABLE(Send_Request_31) AND (! FIREABLE(Send_Request_46) AND (! FIREABLE(Send_Request_4) AND (! FIREABLE(Send_Request_9) AND (! ... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(Send_Answer_31_6) OR (FIREABLE(Send_Answer_10_2) OR (FIREABLE(Send_Answer_39_6) OR (FIREABLE(Send_Answer_37_3) OR (FIREABLE(Send_Answer_24_7) OR (FIREABLE(Send_Answer_31_1) OR (FIREABLE(Send_Answer_45_1) OR (FIREABLE(Send_Answer_15_2) OR (FIREABLE(Send_Answer_1_1) OR (FIREABLE(Send_Answer_5_7) OR (FIREABLE(Send_Answer_26_6) OR (FIREABLE(Send_Answer_29_3) OR (FIREABLE(Send_Answer_2... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 880970026480025299794702740888524552449191504489285334768206493511206796135711850067426886599283025741871658116414586319562141136098616802616156174937934803734487045840833718699715668984374474312895762828099584 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_46) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_33) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_44) OR (FIREABLE(Prepare_Request_32) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_35) OR (FIREABLE(Prepare_Request_7) OR (FIR... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1036 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_46) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_33) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_44) OR (FIREABLE(Prepare_Request_32) OR (FIREABLE(Prepare_Request_19) OR (FIREABLE(Prepare_Request_35) OR (FIREABLE(Prepare_Request_7) OR (FIR... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 49 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Read_Request_8_3) OR (FIREABLE(Read_Request_22_2) OR (FIREABLE(Read_Request_48_2) OR (FIREABLE(Read_Request_20_5) OR (FIREABLE(Read_Request_13_5) OR (FIREABLE(Read_Request_41_4) OR (FIREABLE(Read_Request_15_3) OR (FIREABLE(Read_Request_43_4) OR (FIREABLE(Read_Request_15_2) OR (FIREABLE(Read_Request_33_7) OR (FIREABLE(Read_Request_33_1) OR (FIREABLE(Read_Request_43_6) OR (FIREABLE(Rea... (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 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 35424431098035875144878154960781348752850200970140538518124880126235909241760929579760538034221174736625465991228002551725423112274037800676488175121859291873311294206831798482064980380976795130220173758393596763660462587904 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes no yes no no yes unknown yes unknown yes yes yes unknown no no unknown

BK_STOP 1463509741112

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-07"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-07.tgz
mv CSRepetitions-PT-07 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is CSRepetitions-PT-07, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002kn-ebro-146347662600531"
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 ;