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 MAPK-PT-320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000345
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463613668365

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ MAPK-PT-320
FORMULA MAPK-PT-320-CTLCardinality-0 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-1 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-6 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-10 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-11 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-12 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-320-CTLCardinality.task
lola: read: EF (EG (2 <= ERKPP_Phase3)) : EF (!(EF (MEKP_RafP <= RafP))) : E(EF (1 <= Raf_RasGTP) U Phase3 <= Phase2) : !(E(1 <= Phase3 U 3 <= ERK_MEKPP)) : EX (E(MEK_RafP <= MEKP_RafP U Raf <= MEK)) : AG (AG ((Phase3 <= MEKPP OR RasGTP <= RasGTP))) : EF ((!((MEKP_RafP <= MEKPP OR 3 <= Raf)) OR AX (Raf <= Phase3))) : EF ((((ERKPP <= RafP OR ERK_MEKPP <= Raf_RasGTP) AND !(Phase1 <= Raf)) AND (1 <= Phase1 OR !(... (shortened)
lola: formula length: 752
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 (EG (-ERKPP_Phase3 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(-ERKPP_Phase3 <= -2))))
lola: processed formula length: 45
lola: 154 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-RafP + MEKP_RafP > 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 !(-RafP + MEKP_RafP > 0))))
lola: processed formula length: 47
lola: 154 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 2 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-Raf_RasGTP <= -1) U -Phase2 + Phase3 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -Raf_RasGTP <= -1) U -Phase2 + Phase3 <= 0)
lola: processed formula length: 54
lola: 154 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-Phase3 > -1 R -ERK_MEKPP > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-Phase3 > -1) U !(-ERK_MEKPP > -3)))
lola: processed formula length: 42
lola: 153 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(-MEKP_RafP + MEK_RafP <= 0 U -MEK + Raf <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(-MEKP_RafP + MEK_RafP <= 0 U -MEK + Raf <= 0))
lola: processed formula length: 51
lola: 154 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((MEKP_RafP + -MEKPP > 0 AND -Raf > -3) OR AX (-Phase3 + Raf <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((MEKP_RafP + -MEKPP > 0 AND -Raf > -3) OR AX(-Phase3 + Raf <= 0)))
lola: processed formula length: 76
lola: 154 rewrites
lola: formula mentions 4 of 22 places; total mentions: 5
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 7 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-RafP + ERKPP <= 0 OR -Raf_RasGTP + ERK_MEKPP <= 0) AND (Phase1 + -Raf > 0 AND (-Phase1 <= -1 OR -ERKP_Phase3 > -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 60 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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (RasGTP + -ERK > 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 60 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: EF (-ERKP_MEKPP + Raf <= 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 60 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 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (-Phase2 <= -1) U EF (-MEKP_RafP + RasGTP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(-Phase2 <= -1))) U E(TRUE U -MEKP_RafP + RasGTP <= 0))
lola: processed formula length: 69
lola: 155 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 607 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Phase1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Phase1 > -3))))
lola: processed formula length: 38
lola: 154 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-RafP_Phase1 + ERKP_Phase3 <= 0) AND (E(-MEKP_RafP + ERKP_MEKPP <= 0 U -MEKPP <= -3) AND ERKP + -MEKP_Phase2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-RafP_Phase1 + ERKP_Phase3 <= 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 60 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 13 will run for 977 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-MEKP_RafP + ERKP_MEKPP <= 0 U -MEKPP <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-MEKP_RafP + ERKP_MEKPP <= 0 U -MEKPP <= -3)
lola: processed formula length: 46
lola: 153 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 14 will run for 1419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ERKP + -MEKP_Phase2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-320-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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-MEKPP_Phase2 <= -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 60 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 15 will run for 2838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Phase2 > -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Phase2 > -3))))
lola: processed formula length: 38
lola: 154 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 unknown yes no yes yes unknown yes yes yes unknown unknown unknown no yes unknown

BK_STOP 1463614583761

--------------------
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="MAPK-PT-320"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/MAPK-PT-320.tgz
mv MAPK-PT-320 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 MAPK-PT-320, 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 r062kn-blw3-146358897000345"
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 ;