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 SimpleLoadBal-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373367800081
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463742409799

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SimpleLoadBal-PT-15
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-15-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: 1429/65536 symbol table entries, 126 collisions
lola: preprocessing...
lola: finding significant places
lola: 149 places, 1280 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2081 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-15-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T-lb_route_to_2_17) OR FIREABLE(T-lb_route_to_2_34)) OR FIREABLE(T-lb_route_to_2_51)) OR FIREABLE(T-lb_route_to_2_68)) OR FIREABLE(T-lb_route_to_2_85)) OR FIREABLE... (shortened)
lola: formula length: 274108
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_route_to_2_17) OR (FIREABLE(T-lb_route_to_2_34) OR (FIREABLE(T-lb_route_to_2_51) OR (FIREABLE(T-lb_route_to_2_68) OR (FIREABLE(T-lb_route_to_2_85) OR (FIREABLE(T-lb_route_to_2_102) OR (FIREABLE(T-lb_route_to_2_119) OR (FIREABLE(T-lb_route_to_2_136) OR (FIREABLE(T-lb_route_to_2_153) OR (FIREABLE(T-lb_route_to_2_170) OR (FIREABLE(T-lb_route_to_2_187) OR (FIREABLE(T-lb_route_to_2_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 16 bytes per marking, with 18 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-client_send_1) OR (FIREABLE(T-client_send_2) OR (FIREABLE(T-client_send_3) OR (FIREABLE(T-client_send_4) OR (FIREABLE(T-client_send_5) OR (FIREABLE(T-client_send_6) OR (FIREABLE(T-client_send_7) OR (FIREABLE(T-client_send_8) OR (FIREABLE(T-client_send_9) OR (FIREABLE(T-client_send_10) OR (FIREABLE(T-client_send_11) OR (FIREABLE(T-client_send_12) OR (FIREABLE(T-client_send_13) OR (F... (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 16 bytes per marking, with 18 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 50070087 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 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_7) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_receive... (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 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 90 literals
lola: write sara problem file to SimpleLoadBal-COL-15-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_idle_receive_notification_2) OR (FIREABLE(T-lb_idle_receive_notification_3) OR (FIREABLE(T-lb_idle_receive_notification_4) OR (FIREABLE(T-lb_idle_receive_notification_5) OR (FIREABLE(T-lb_idle_receive_notification_6) OR (FIREABLE(T-lb_idle_receive_notification_7) OR (FIREABLE(T-lb_idle_receive_notification_8) OR (FIREABLE(T-lb_idle_receive_notification_9) OR (FIREABLE(T-lb_idle... (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 16 bytes per marking, with 18 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 96093157273555698151149740393622102840593805737502679889854588261495719703918560556893011826878375636104330625207750198919700298746664048752601333760 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 4 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-lb_balance_to_2_481) OR (FIREABLE(T-lb_balance_to_2_482) OR (FIREABLE(T-lb_balance_to_2_483) OR (FIREABLE(T-lb_balance_to_2_484) OR (FIREABLE(T-lb_balance_to_2_485) OR (FIREABLE(T-lb_balance_to_2_486) OR (FIREABLE(T-lb_balance_to_2_487) OR (FIREABLE(T-lb_balance_to_2_488) OR (FIREABLE(T-lb_balance_to_2_489) OR (FIREABLE(T-lb_balance_to_2_490) OR (FIREABLE(T-lb_balance_to_2_491) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_7) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_receiv... (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 16 bytes per marking, with 18 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 1800 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(T-lb_route_to_1_1) AND (! FIREABLE(T-lb_route_to_1_2) AND (! FIREABLE(T-lb_route_to_1_18) AND (! FIREABLE(T-lb_route_to_1_19) AND (! FIREABLE(T-lb_route_to_1_35) AND (! FIREABLE(T-lb_route_to_1_36) AND (! FIREABLE(T-lb_route_to_1_52) AND (! FIREABLE(T-lb_route_to_1_53) AND (! FIREABLE(T-lb_route_to_1_69) AND (! FIREABLE(T-lb_route_to_1_70) AND (! FIREABLE(T-lb_route_to_1_86) 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 16 bytes per marking, with 18 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 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-lb_balance_to_1_31) OR (FIREABLE(T-lb_balance_to_1_32) OR (FIREABLE(T-lb_balance_to_1_33) OR (FIREABLE(T-lb_balance_to_1_34) OR (FIREABLE(T-lb_balance_to_1_35) OR (FIREABLE(T-lb_balance_to_1_36) OR (FIREABLE(T-lb_balance_to_1_37) OR (FIREABLE(T-lb_balance_to_1_38) OR (FIREABLE(T-lb_balance_to_1_39) OR (FIREABLE(T-lb_balance_to_1_40) OR (FIREABLE(T-lb_balance_to_1_41) OR (FIREABLE... (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 16 bytes per marking, with 18 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 8 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T-lb_no_balance_1) OR (FIREABLE(T-lb_no_balance_2) OR (FIREABLE(T-lb_no_balance_17) OR (FIREABLE(T-lb_no_balance_18) OR (FIREABLE(T-lb_no_balance_19) OR (FIREABLE(T-lb_no_balance_34) OR (FIREABLE(T-lb_no_balance_35) OR (FIREABLE(T-lb_no_balance_36) OR (FIREABLE(T-lb_no_balance_51) OR (FIREABLE(T-lb_no_balance_52) OR (FIREABLE(T-lb_no_balance_53) OR (FIREABLE(T-lb_no_balance_68) OR ... (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 16 bytes per marking, with 18 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 9 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balance_to_1_31) OR (FIREABLE(T-lb_balance_to_1_32) OR (FIREABLE(T-lb_balance_to_1_33) OR (FIREABLE(T-lb_balance_to_1_34) OR (FIREABLE(T-lb_balance_to_1_35) OR (FIREABLE(T-lb_balance_to_1_36) OR (FIREABLE(T-lb_balance_to_1_37) OR (FIREABLE(T-lb_balance_to_1_38) OR (FIREABLE(T-lb_balance_to_1_39) OR (FIREABLE(T-lb_balance_to_1_40) OR (FIREABLE(T-lb_balance_to_1_41) OR (FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 14603605285609964838431559346599605901382620851030136574983962300624515267157218262953313566941592175318210183168 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 10 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-lb_no_balance_1) AND (! FIREABLE(T-lb_no_balance_2) AND (! FIREABLE(T-lb_no_balance_17) AND (! FIREABLE(T-lb_no_balance_18) AND (! FIREABLE(T-lb_no_balance_19) AND (! FIREABLE(T-lb_no_balance_34) AND (! FIREABLE(T-lb_no_balance_35) AND (! FIREABLE(T-lb_no_balance_36) AND (! FIREABLE(T-lb_no_balance_51) AND (! FIREABLE(T-lb_no_balance_52) AND (! FIREABLE(T-lb_no_balance_53) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 272366 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(T-server_process_1) AND (! FIREABLE(T-server_process_2) AND (! FIREABLE(T-server_process_3) AND (! FIREABLE(T-server_process_4) AND (! FIREABLE(T-server_process_5) AND (! FIREABLE(T-server_process_6) AND (! FIREABLE(T-server_process_7) AND (! FIREABLE(T-server_process_8) AND (! FIREABLE(T-server_process_9) AND (! FIREABLE(T-server_process_10) AND (! FIREABLE(T-server_process_11) ... (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 16 bytes per marking, with 18 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 12 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-server_endloop_1) OR (FIREABLE(T-server_endloop_2) OR (! FIREABLE(T-client_send_1) AND (! FIREABLE(T-client_send_2) AND (! FIREABLE(T-client_send_3) AND (! FIREABLE(T-client_send_4) AND (! FIREABLE(T-client_send_5) AND (! FIREABLE(T-client_send_6) AND (! FIREABLE(T-client_send_7) AND (! FIREABLE(T-client_send_8) AND (! FIREABLE(T-client_send_9) AND (! FIREABLE(T-client_send_10) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 13 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balance_to_1_31) OR (FIREABLE(T-lb_balance_to_1_32) OR (FIREABLE(T-lb_balance_to_1_33) OR (FIREABLE(T-lb_balance_to_1_34) OR (FIREABLE(T-lb_balance_to_1_35) OR (FIREABLE(T-lb_balance_to_1_36) OR (FIREABLE(T-lb_balance_to_1_37) OR (FIREABLE(T-lb_balance_to_1_38) OR (FIREABLE(T-lb_balance_to_1_39) OR (FIREABLE(T-lb_balance_to_1_40) OR (FIREABLE(T-lb_balance_to_1_41) OR (FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 63840 literals
lola: write sara problem file to SimpleLoadBal-COL-15-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-15-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_7) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_receive... (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 16 bytes per marking, with 18 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 15 will run for 2509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-client_receive_1) OR (FIREABLE(T-client_receive_2) OR (FIREABLE(T-client_receive_3) OR (FIREABLE(T-client_receive_4) OR (FIREABLE(T-client_receive_5) OR (FIREABLE(T-client_receive_6) OR (FIREABLE(T-client_receive_7) OR (FIREABLE(T-client_receive_8) OR (FIREABLE(T-client_receive_9) OR (FIREABLE(T-client_receive_10) OR (FIREABLE(T-client_receive_11) OR (FIREABLE(T-client_receive_12... (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 16 bytes per marking, with 18 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 216925843 literals
lola: DNF formula is too big, sara cannot be used
lola: time limit reached - aborting
lola: preliminary result: yes unknown yes unknown no yes yes no yes unknown no no yes yes yes
lola: local time limit reached - aborting

BK_STOP 1463745950571

--------------------
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="SimpleLoadBal-PT-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 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 SimpleLoadBal-PT-15, 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 r122kn-qhx2-146373367800081"
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 ;