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

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

=== Now, execution of the tool begins

BK_START 1463608627358

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ MAPK-PT-008
FORMULA MAPK-PT-008-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-008-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-008-CTLCardinality.task
lola: read: (((AX (ERK_MEKPP <= ERKP_MEKPP) AND (!(1 <= RafP_Phase1) AND (3 <= RasGTP AND 3 <= ERKP_Phase3))) AND ((Phase3 <= Raf_RasGTP OR (1 <= MEKP AND Raf <= MEKP_RafP)) AND ERKP <= ERKP)) OR AG ((1 <= ERK OR (RafP_Phase1 <= ERKP AND 3 <= ERKP_Phase3)))) : (1 <= MEK_RafP OR EF (AG (ERKP_Phase3 <= MEKP_Phase2))) : AG ((((Raf_RasGTP <= ERK_MEKPP AND 2 <= RafP) AND (Phase2 <= RafP_Phase1 AND 2 <= ERKP_MEKPP)... (shortened)
lola: formula length: 1293
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AX (ERK_MEKPP + -ERKP_MEKPP <= 0) AND (-RafP_Phase1 > -1 AND (-RasGTP <= -3 AND (-ERKP_Phase3 <= -3 AND (-Raf_RasGTP + Phase3 <= 0 OR (-MEKP <= -1 AND -MEKP_RafP + Raf <= 0)))))) OR AG ((-ERK <= -1 OR (RafP_Phase1 + -ERKP <= 0 AND -ERKP_Phase3 <= -3))))
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: AX (ERK_MEKPP + -ERKP_MEKPP <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(ERK_MEKPP + -ERKP_MEKPP <= 0)
lola: processed formula length: 32
lola: 254 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-008-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: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-RafP_Phase1 > -1 AND (-RasGTP <= -3 AND (-ERKP_Phase3 <= -3 AND (-Raf_RasGTP + Phase3 <= 0 OR (-MEKP <= -1 AND -MEKP_RafP + Raf <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 6 atomic propositions
lola: closed formula file MAPK-PT-008-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ERK <= -1 OR (RafP_Phase1 + -ERKP <= 0 AND -ERKP_Phase3 <= -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 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-MEK_RafP <= -1 OR EF (AG (ERKP_Phase3 + -MEKP_Phase2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -MEK_RafP <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-008-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (ERKP_Phase3 + -MEKP_Phase2 <= 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 !(ERKP_Phase3 + -MEKP_Phase2 <= 0))))
lola: processed formula length: 57
lola: 255 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-008-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Raf_RasGTP + -ERK_MEKPP <= 0 AND (-RafP <= -2 AND (Phase2 + -RafP_Phase1 <= 0 AND -ERKP_MEKPP <= -2))) OR EF (ERK_MEKPP + -MEKPP_Phase2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(((Raf_RasGTP + -ERK_MEKPP <= 0 AND (-RafP <= -2 AND (Phase2 + -RafP_Phase1 <= 0 AND -ERKP_MEKPP <= -2))) OR E(TRUE U ERK_MEKPP + -MEKPP_Phase2 <= 0)))))
lola: processed formula length: 165
lola: 255 rewrites
lola: formula mentions 7 of 22 places; total mentions: 8
lola: closed formula file MAPK-PT-008-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 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((MEKPP + -ERKPP <= 0 OR -RafP_Phase1 <= -1)))
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 !((MEKPP + -ERKPP <= 0 OR -RafP_Phase1 <= -1)))))
lola: processed formula length: 69
lola: 255 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-008-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 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-MEK + ERKP <= 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 !(-MEK + ERKP <= 0))))
lola: processed formula length: 42
lola: 255 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-008-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 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-Phase3 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -Phase3 > -2))
lola: processed formula length: 32
lola: 255 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-008-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 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX ((-RasGTP <= -3 AND -ERKP_Phase3 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((-RasGTP <= -3 AND -ERKP_Phase3 <= -3)))
lola: processed formula length: 52
lola: 255 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-008-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 7 will run for 346 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-008-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 390 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-008-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-Raf_RasGTP + RasGTP <= 0 AND -RafP <= -3)))
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 !((-Raf_RasGTP + RasGTP <= 0 AND -RafP <= -3)))))
lola: processed formula length: 69
lola: 255 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-008-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 10 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-Phase2 + MEKPP <= 0 U AX (-MEKP_RafP <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-Phase2 + MEKPP <= 0 U AX(-MEKP_RafP <= -3))
lola: processed formula length: 46
lola: 255 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-008-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 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((RafP_Phase1 + -ERKP_MEKPP <= 0 OR (-ERKPP_Phase3 + ERK > 0 OR -RafP <= -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 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 12 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-MEKP > -1 AND -ERKPP_Phase3 + MEKP > 0)) OR ((-RafP + MEKP_Phase2 <= 0 OR (-Phase3 <= -3 OR -MEK > -3)) AND (-Phase1 <= -3 AND (-MEKPP_Phase2 <= -3 AND ((-MEKP <= -1 OR MEK_RafP + -Raf <= 0) AND (RafP + -RasGTP <= 0 AND (ERKP + -Phase1 > 0 OR (MEK + -MEK_RafP <= 0 AND -ERKP + Raf <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MEKP > -1 AND -ERKPP_Phase3 + MEKP > 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1005 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-RafP + MEKP_Phase2 <= 0 OR (-Phase3 <= -3 OR -MEK > -3)) AND (-Phase1 <= -3 AND (-MEKPP_Phase2 <= -3 AND ((-MEKP <= -1 OR MEK_RafP + -Raf <= 0) AND (RafP + -RasGTP <= 0 AND (ERKP + -Phase1 > 0 OR (MEK + -MEK_RafP <= 0 AND -ERKP + Raf <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 11 atomic propositions
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1005 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AF (-MEKP_RafP <= -3) OR EG (-ERKP <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U -MEKP_RafP <= -3) OR !(A(TRUE U !(-ERKP <= -3)))))
lola: processed formula length: 69
lola: 256 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-008-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: subprocess 14 will run for 1417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Raf + MEKP <= 0 OR ((-ERK <= -3 AND -MEKP <= -1) OR -Raf_RasGTP + MEKP_RafP > 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: 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 15 will run for 2834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-MEKP_RafP + MEKPP <= 0 OR -MEK <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-MEKP_RafP + MEKPP <= 0 OR -MEK <= -2))))
lola: processed formula length: 55
lola: 254 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-008-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: RESULT
lola: summary: no no yes no no yes no no yes no yes no no yes no yes
lola: ========================================

BK_STOP 1463609434789

--------------------
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-008"
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-008.tgz
mv MAPK-PT-008 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-008, 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-146358897000300"
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 ;