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 ERK-PT-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038kn-smll-146351480500102
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463520147092

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ ERK-PT-000100
FORMULA ERK-PT-000100-CTLCardinality-0 CANNOT_COMPUTE
FORMULA ERK-PT-000100-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-4 CANNOT_COMPUTE
FORMULA ERK-PT-000100-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-11 CANNOT_COMPUTE
FORMULA ERK-PT-000100-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ERK-PT-000100-CTLCardinality-14 CANNOT_COMPUTE
FORMULA ERK-PT-000100-CTLCardinality-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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-000100-CTLCardinality.task
lola: read: (AG (EF (Raf1Star <= MEKPP)) OR !(ERKPP <= MEKPP_ERK)) : !((!(!((Raf1Star_RKIP <= RKIP OR MEKPP <= RKIP))) AND AG ((1 <= RKIP AND RKIP <= RKIP)))) : AG (AG (3 <= RP)) : (E(RKIP <= RKIP U 1 <= Raf1Star) AND EF ((1 <= Raf1Star AND MEKPP <= MEKPP_ERK))) : AG (EX ((MEKPP_ERK <= Raf1Star OR ERKPP <= RP))) : AG (!(!(MEKPP_ERK <= RKIP))) : ((!(AG (Raf1Star_RKIP_ERKPP <= Raf1Star)) AND MEKPP <= RP) OR E((... (shortened)
lola: formula length: 1049
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF (-MEKPP + Raf1Star <= 0)) OR -MEKPP_ERK + ERKPP > 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-MEKPP + Raf1Star <= 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -MEKPP + Raf1Star <= 0))))
lola: processed formula length: 48
lola: 229 rewrites
lola: formula mentions 2 of 11 places; total mentions: 2
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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: ((Raf1Star_RKIP + -RKIP > 0 AND -RKIP + MEKPP > 0) OR EF (-RKIP > -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Raf1Star_RKIP + -RKIP > 0 AND -RKIP + MEKPP > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-RKIP > -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-RP <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-Raf1Star <= -1) AND EF ((-Raf1Star <= -1 AND -MEKPP_ERK + MEKPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Raf1Star <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Raf1Star <= -1 AND -MEKPP_ERK + MEKPP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX ((MEKPP_ERK + -Raf1Star <= 0 OR ERKPP + -RP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX((MEKPP_ERK + -Raf1Star <= 0 OR ERKPP + -RP <= 0)))))
lola: processed formula length: 68
lola: 229 rewrites
lola: formula mentions 4 of 11 places; total mentions: 4
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (MEKPP_ERK + -RKIP <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (Raf1Star_RKIP_ERKPP + -Raf1Star > 0) AND MEKPP + -RP <= 0) OR E((-RKIPP_RP <= -2 AND -ERK <= -1) U -Raf1Star > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Raf1Star_RKIP_ERKPP + -Raf1Star > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MEKPP + -RP <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: lola: ========================================
subprocess 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EG ((-ERK + Raf1Star_RKIP_ERKPP <= 0 OR -MEKPP_ERK + ERKPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !((-ERK + Raf1Star_RKIP_ERKPP <= 0 OR -MEKPP_ERK + ERKPP <= 0)))))))
lola: processed formula length: 92
lola: 229 rewrites
lola: formula mentions 4 of 11 places; total mentions: 4
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((-MEKPP_ERK + ERK <= 0 AND -RKIPP_RP + ERKPP <= 0)) AND -Raf1Star <= -3) OR EF ((Raf1Star_RKIP + -MEKPP > 0 AND -ERKPP > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MEKPP_ERK + ERK <= 0 AND -RKIPP_RP + ERKPP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Raf1Star <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(((MEKPP_ERK + -RKIP <= 0 AND MEKPP + -ERK <= 0) OR -MEKPP_ERK + RKIP > 0) U EX (RKIP + -RKIPP_RP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((MEKPP_ERK + -RKIP <= 0 AND MEKPP + -ERK <= 0) OR -MEKPP_ERK + RKIP > 0) U EX(RKIP + -RKIPP_RP <= 0))
lola: processed formula length: 104
lola: 229 rewrites
lola: formula mentions 5 of 11 places; total mentions: 8
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (MEKPP_ERK + -Raf1Star <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((RKIP + -RP > 0 OR AF (MEKPP + -Raf1Star_RKIP_ERKPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (RKIP + -RP > 0 OR A(TRUE U MEKPP + -Raf1Star_RKIP_ERKPP <= 0)))
lola: processed formula length: 73
lola: 229 rewrites
lola: formula mentions 4 of 11 places; total mentions: 4
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (A(-MEKPP <= -3 U -MEKPP_ERK + RKIP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(-MEKPP <= -3 U -MEKPP_ERK + RKIP <= 0))
lola: processed formula length: 50
lola: 229 rewrites
lola: formula mentions 3 of 11 places; total mentions: 3
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 956 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Raf1Star_RKIP + -ERK > 0 AND (RKIPP_RP + -RKIPP > 0 AND -RKIP > -3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 14 will run for 1434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AF (MEKPP_ERK + -RKIP <= 0) OR EX (-Raf1Star_RKIP <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U MEKPP_ERK + -RKIP <= 0) OR EX(-Raf1Star_RKIP <= -1)))))
lola: processed formula length: 78
lola: 230 rewrites
lola: formula mentions 3 of 11 places; total mentions: 3
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (Raf1Star_RKIP_ERKPP + -Raf1Star > 0))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(Raf1Star_RKIP_ERKPP + -Raf1Star > 0))))
lola: processed formula length: 61
lola: 229 rewrites
lola: formula mentions 2 of 11 places; total mentions: 2
lola: closed formula file ERK-PT-000100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown yes no yes unknown no yes no yes yes no unknown yes yes unknown unknown

BK_STOP 1463521276603

--------------------
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="ERK-PT-000100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/ERK-PT-000100.tgz
mv ERK-PT-000100 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 ERK-PT-000100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038kn-smll-146351480500102"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;