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-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600513
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463505328456

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ CSRepetitions-PT-04
FORMULA CSRepetitions-COL-04-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-04-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-04-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-04-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 293/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 117 places, 176 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-04-ReachabilityFireability.task
lola: read: EF (!(((!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Read_Request_9_3) OR FIREABLE(Read_Request_16_4)) OR FIREABLE(Read_Request_11_3)) OR FIREABLE(Read_Request_2_4)) OR FIREABLE(Read_Request_4_1)) OR FIREABLE(Read_Request_9_4)) OR FIREABLE(Read_Request_4_3)) OR FIREABLE(Read_Request_6_2)) OR FIREABLE(Read_Request_13_2)) OR FIREABLE(Read_Request_13_1)) OR FIREABLE(Read_... (shortened)
lola: formula length: 109370
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Read_Request_9_3) OR (FIREABLE(Read_Request_16_4) OR (FIREABLE(Read_Request_11_3) OR (FIREABLE(Read_Request_2_4) OR (FIREABLE(Read_Request_4_1) OR (FIREABLE(Read_Request_9_4) OR (FIREABLE(Read_Request_4_3) OR (FIREABLE(Read_Request_6_2) OR (FIREABLE(Read_Request_13_2) OR (FIREABLE(Read_Request_13_1) OR (FIREABLE(Read_Request_12_3) OR (FIREABLE(Read_Request_14_2) OR (FIREABLE(Read_Re... (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 388 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 105312291668557537458310987100370801203254947308473828678121291776 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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_15) AND (! FIREABLE(Prepare_Request_6) AND (! FIREABLE(Prepare_Request_2) AND (! FIREABLE(Prepare_Request_9) AND (! FIREABLE(Prepare_Request_3) AND (! FIREABLE(Prepare_Request_16) AND (! FIREABLE(Prepare_Request_8) AND (! FIREABLE(Prepare_Request_11) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_1) AND (! 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 388 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: Transformation into DNF: expect 1180591620717411172352 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Read_Request_9_3) AND (! FIREABLE(Read_Request_16_4) AND (! FIREABLE(Read_Request_11_3) AND (! FIREABLE(Read_Request_2_4) AND (! FIREABLE(Read_Request_4_1) AND (! FIREABLE(Read_Request_9_4) AND (! FIREABLE(Read_Request_4_3) AND (! FIREABLE(Read_Request_6_2) AND (! FIREABLE(Read_Request_13_2) AND (! FIREABLE(Read_Request_13_1) AND (! FIREABLE(Read_Request_12_3) AND (! FIREABLE(Read_... (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 388 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: Transformation into DNF: expect 368934881474191032320 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Send_Request_3) AND (! FIREABLE(Send_Request_11) AND (! FIREABLE(Send_Request_4) AND (! FIREABLE(Send_Request_5) AND (! FIREABLE(Send_Request_6) AND (! FIREABLE(Send_Request_10) AND (! FIREABLE(Send_Request_16) AND (! FIREABLE(Send_Request_9) AND (! FIREABLE(Send_Request_7) AND (! FIREABLE(Send_Request_8) AND (! FIREABLE(Send_Request_14) AND (! FIREABLE(Send_Request_15) AND (! 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 388 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 34359777760 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 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Read_Request_9_3) OR (FIREABLE(Read_Request_16_4) OR (FIREABLE(Read_Request_11_3) OR (FIREABLE(Read_Request_2_4) OR (FIREABLE(Read_Request_4_1) OR (FIREABLE(Read_Request_9_4) OR (FIREABLE(Read_Request_4_3) OR (FIREABLE(Read_Request_6_2) OR (FIREABLE(Read_Request_13_2) OR (FIREABLE(Read_Request_13_1) OR (FIREABLE(Read_Request_12_3) OR (FIREABLE(Read_Request_14_2) OR (FIREABLE(Read_Re... (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 388 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 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_15) OR (FIREABLE(Prepare_Request_6) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_12) OR (FIREAB... (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 388 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: Transformation into DNF: expect 25000052 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_15) OR (FIREABLE(Prepare_Request_6) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_12) OR (FIREA... (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 388 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 7 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Lose_Request_12) OR (FIREABLE(Lose_Request_11) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_6) OR (FIREABLE(Lose_Request_10) OR (FIREABLE(Lose_Request_9) OR (FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_15) OR (FIREABLE(Lose_Request_16) OR (FIREABLE(Lose_Request_14) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lo... (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 388 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 78324580189065576808710144 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(Send_Request_3) AND (! FIREABLE(Send_Request_11) AND (! FIREABLE(Send_Request_4) AND (! FIREABLE(Send_Request_5) AND (! FIREABLE(Send_Request_6) AND (! FIREABLE(Send_Request_10) AND (! FIREABLE(Send_Request_16) AND (! FIREABLE(Send_Request_9) AND (! FIREABLE(Send_Request_7) AND (! FIREABLE(Send_Request_8) AND (! FIREABLE(Send_Request_14) AND (! FIREABLE(Send_Request_15) AND (! FI... (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 388 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: Transformation into DNF: expect 85002596691653932613632 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(Lose_Request_12) OR (FIREABLE(Lose_Request_11) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_6) OR (FIREABLE(Lose_Request_10) OR (FIREABLE(Lose_Request_9) OR (FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_15) OR (FIREABLE(Lose_Request_16) OR (FIREABLE(Lose_Request_14) OR (FIREABLE(Lose_Request_1) 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 388 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 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Read_Request_9_3) OR (FIREABLE(Read_Request_16_4) OR (FIREABLE(Read_Request_11_3) OR (FIREABLE(Read_Request_2_4) OR (FIREABLE(Read_Request_4_1) OR (FIREABLE(Read_Request_9_4) OR (FIREABLE(Read_Request_4_3) OR (FIREABLE(Read_Request_6_2) OR (FIREABLE(Read_Request_13_2) OR (FIREABLE(Read_Request_13_1) OR (FIREABLE(Read_Request_12_3) OR (FIREABLE(Read_Request_14_2) OR (FIREABLE(Read_R... (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 388 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 11 will run for 612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_15) AND (! FIREABLE(Prepare_Request_6) AND (! FIREABLE(Prepare_Request_2) AND (! FIREABLE(Prepare_Request_9) AND (! FIREABLE(Prepare_Request_3) AND (! FIREABLE(Prepare_Request_16) AND (! FIREABLE(Prepare_Request_8) AND (! FIREABLE(Prepare_Request_11) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_1) AND (! 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 388 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: Transformation into DNF: expect 64 literals
lola: ========================================
lola: subprocess 12 will run for 765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((((FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_11) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_5) OR (FIREABLE(Send_Request_6) OR (FIREABLE(Send_Request_10) OR (FIREABLE(Send_Request_16) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_7) OR (FIREABLE(Send_Request_8) OR (FIREABLE(Send_Request_14) OR (FIREABLE(Send_Request_15) OR (FIREABLE(Send_Request_1) 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 388 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 13 will run for 1021 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_15) OR (FIREABLE(Prepare_Request_6) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_12) OR (FIREAB... (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 388 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 16 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to CSRepetitions-COL-04-ReachabilityFireability-13.sara
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Prepare_Request_5) OR (FIREABLE(Prepare_Request_15) OR (FIREABLE(Prepare_Request_6) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_16) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_11) OR (FIREABLE(Prepare_Request_10) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_12) OR (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: lola: calling and running sara========================================

lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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: Transformation into DNF: expect 217061520896 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
sara: try reading problem file CSRepetitions-COL-04-ReachabilityFireability-13.sara.
lola: subprocess 15 will run for 3063 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(Prepare_Request_5) AND (! FIREABLE(Prepare_Request_15) AND (! FIREABLE(Prepare_Request_6) AND (! FIREABLE(Prepare_Request_2) AND (! FIREABLE(Prepare_Request_9) AND (! FIREABLE(Prepare_Request_3) AND (! FIREABLE(Prepare_Request_16) AND (! FIREABLE(Prepare_Request_8) AND (! FIREABLE(Prepare_Request_11) AND (! FIREABLE(Prepare_Request_10) AND (! FIREABLE(Prepare_Request_1) AND (! 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 388 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: RESULT
lola: summary: unknown yes yes unknown yes no yes yes yes yes no yes no no yes no
lola: ========================================
sara: place or transition ordering is non-deterministic


BK_STOP 1463505805474

--------------------
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-04"
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-04.tgz
mv CSRepetitions-PT-04 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-04, 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-146347662600513"
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 ;