About the Execution of LoLa for MAPK-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15952.440 | 713266.00 | 714478.00 | 320.40 | ?TF??FFT??TT?TFF | normal |
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-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000309
=====================================================================
--------------------
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-020-CTLCardinality-0
FORMULA_NAME MAPK-PT-020-CTLCardinality-1
FORMULA_NAME MAPK-PT-020-CTLCardinality-10
FORMULA_NAME MAPK-PT-020-CTLCardinality-11
FORMULA_NAME MAPK-PT-020-CTLCardinality-12
FORMULA_NAME MAPK-PT-020-CTLCardinality-13
FORMULA_NAME MAPK-PT-020-CTLCardinality-14
FORMULA_NAME MAPK-PT-020-CTLCardinality-15
FORMULA_NAME MAPK-PT-020-CTLCardinality-2
FORMULA_NAME MAPK-PT-020-CTLCardinality-3
FORMULA_NAME MAPK-PT-020-CTLCardinality-4
FORMULA_NAME MAPK-PT-020-CTLCardinality-5
FORMULA_NAME MAPK-PT-020-CTLCardinality-6
FORMULA_NAME MAPK-PT-020-CTLCardinality-7
FORMULA_NAME MAPK-PT-020-CTLCardinality-8
FORMULA_NAME MAPK-PT-020-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463609449072
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ MAPK-PT-020
FORMULA MAPK-PT-020-CTLCardinality-0 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-2 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-3 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-6 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-11 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-12 CANNOT_COMPUTE
FORMULA MAPK-PT-020-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-020-CTLCardinality-15 TRUE 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: 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-020-CTLCardinality.task
lola: read: E((!(2 <= RafP) AND 1 <= Phase3) U AF (2 <= ERKP_MEKPP)) : (EF ((3 <= MEKPP_Phase2 AND (MEKPP <= MEKP_RafP OR 1 <= Phase2))) AND (((RafP_Phase1 <= MEKP_RafP AND 2 <= Raf_RasGTP) OR AX (MEKP_RafP <= ERK_MEKPP)) OR ((ERKP_MEKPP <= Raf AND 2 <= MEKP_Phase2) OR MEK_RafP <= MEKP))) : AG (EF ((ERKPP_Phase3 <= Phase1 OR 2 <= Phase1))) : EF (AX (!(MEKPP_Phase2 <= Phase1))) : E(EX (1 <= RasGTP) U AX (3 <= ... (shortened)
lola: formula length: 1470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-RafP > -2 AND -Phase3 <= -1) U AF (-ERKP_MEKPP <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-RafP > -2 AND -Phase3 <= -1) U A(TRUE U -ERKP_MEKPP <= -2))
lola: processed formula length: 63
lola: 287 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-020-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 ((-MEKPP_Phase2 <= -3 AND (-MEKP_RafP + MEKPP <= 0 OR -Phase2 <= -1))) AND ((RafP_Phase1 + -MEKP_RafP <= 0 AND -Raf_RasGTP <= -2) OR (AX (-ERK_MEKPP + MEKP_RafP <= 0) OR ((ERKP_MEKPP + -Raf <= 0 AND -MEKP_Phase2 <= -2) OR MEK_RafP + -MEKP <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MEKPP_Phase2 <= -3 AND (-MEKP_RafP + MEKPP <= 0 OR -Phase2 <= -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 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 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (RafP_Phase1 + -MEKP_RafP <= 0 AND -Raf_RasGTP <= -2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-ERK_MEKPP + MEKP_RafP <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-ERK_MEKPP + MEKP_RafP <= 0)
lola: processed formula length: 31
lola: 286 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-020-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 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((ERKPP_Phase3 + -Phase1 <= 0 OR -Phase1 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (ERKPP_Phase3 + -Phase1 <= 0 OR -Phase1 <= -2)))))
lola: processed formula length: 72
lola: 287 rewrites
lola: formula mentions 2 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-020-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 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (-Phase1 + MEKPP_Phase2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(-Phase1 + MEKPP_Phase2 > 0))
lola: processed formula length: 40
lola: 287 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-020-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 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (-RasGTP <= -1) U AX (-ERKP_Phase3 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(-RasGTP <= -1) U AX(-ERKP_Phase3 <= -3))
lola: processed formula length: 45
lola: 288 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-020-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 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF ((-MEKP_RafP + Phase3 <= 0 OR -ERKPP_Phase3 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (-MEKP_RafP + Phase3 <= 0 OR -ERKPP_Phase3 <= -2)))
lola: processed formula length: 63
lola: 287 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-020-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 6 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-ERK_MEKPP > -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -ERK_MEKPP > -2))))
lola: processed formula length: 41
lola: 287 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-020-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 7 will run for 335 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-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-MEK + MEKPP_Phase2 <= 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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-ERKP_Phase3 > -2) OR (AF (-ERK_MEKPP + RasGTP > 0) AND (-MEKP_Phase2 <= -3 OR -ERK > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ERKP_Phase3 > -2)
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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-ERK_MEKPP + RasGTP > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -ERK_MEKPP + RasGTP > 0)
lola: processed formula length: 33
lola: 286 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-020-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 11 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-MEKP_Phase2 <= -3 OR -ERK > -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Raf_RasGTP + MEKP_Phase2 <= 0 AND (AG ((-ERKP_MEKPP <= -3 OR MEK + -Raf <= 0)) AND (ERK + -MEKP_Phase2 > 0 OR ((-MEK > -3 OR -ERKP_Phase3 > -1) AND RasGTP + -MEKPP_Phase2 > 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Raf_RasGTP + MEKP_Phase2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ERKP_MEKPP <= -3 OR MEK + -Raf <= 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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(-Phase2 + MEKPP_Phase2 <= 0 U -MEK_RafP + ERKP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(-Phase2 + MEKPP_Phase2 <= 0 U -MEK_RafP + ERKP <= 0))))
lola: processed formula length: 70
lola: 287 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-020-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 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-RafP > -3 AND (-MEK + Raf > 0 AND ((-RafP_Phase1 > -1 OR -MEKPP > -1) AND AG ((-RafP <= -1 OR -ERK <= -1))))) OR AG ((RafP + -ERKP > 0 AND -ERK > -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -RafP > -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -MEK + Raf > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-RafP_Phase1 > -1 OR -MEKPP > -1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-RafP <= -1 OR -ERK <= -1))
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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-MEKPP <= -2 OR (-ERKP_MEKPP + ERKPP > 0 OR AG ((-RafP + MEKP_Phase2 <= 0 OR -Phase1 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -MEKPP <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-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 1414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ERKP_MEKPP + ERKPP > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-RafP + MEKP_Phase2 <= 0 OR -Phase1 <= -1))
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 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG (-RafP_Phase1 + Raf > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(-RafP_Phase1 + Raf > 0))))))
lola: processed formula length: 54
lola: 287 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-020-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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-MEK_RafP + MEKPP <= 0 AND ((EG (RasGTP + -Phase3 <= 0) AND (-ERKPP_Phase3 > -2 AND (-RasGTP <= -2 AND Phase2 + -MEKP <= 0))) OR ((-ERK_MEKPP + ERKP_Phase3 <= 0 OR (Raf_RasGTP + -MEKPP_Phase2 <= 0 AND -RafP <= -2)) AND EF (-ERKP_Phase3 <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -MEK_RafP + MEKPP <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-ERKPP_Phase3 > -2 AND (-RasGTP <= -2 AND Phase2 + -MEKP <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-ERK_MEKPP + ERKP_Phase3 <= 0 OR (Raf_RasGTP + -MEKPP_Phase2 <= 0 AND -RafP <= -2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-ERKP_Phase3 <= -2)
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola: summary: unknown yes unknown unknown yes yes unknown yes no no no unknown unknown no no yes
BK_STOP 1463610162338
--------------------
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-020"
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-020.tgz
mv MAPK-PT-020 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-020, 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-146358897000309"
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 '
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 ;