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-3254
Executing tool lola
Input is S_MAPK-PT-320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000210
=====================================================================

--------------------
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 1496361635278


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_MAPK-PT-320: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_MAPK-PT-320: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_MAPK-PT-320 @ 3540 seconds
----- Start make result stdout -----
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: E (F (((RasGTP <= MEKP_Phase2) AND E (X ((ERKPP_Phase3 <= Phase1)))))) : A (G (((1 <= MEKPP_Phase2) OR (1 <= Raf)))) : (((ERKPP <= Raf_RasGTP) AND E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))) OR A (F (A (F ((1 <= ERKP_MEKPP)))))) : A (G ((E (F ((MEKP_RafP <= MEKP))) AND (ERKP <= RasGTP)))) : A (G ((((ERKPP_Phase3 <= 2) OR (Phase2 + 1 <= Raf)) AND ((Phase2 <= RafP_Phase1) OR (1 <= RasGTP) OR (MEKP_RafP <= Phase3))))) : A (G ((((2 <= ERK) AND (2 <= ERK) AND (RafP_Phase1 + 1 <= RasGTP)) OR (RafP_Phase1 <= MEKPP_Phase2)))) : (NOT(A (((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))) OR ((((Raf_RasGTP + 1 <= ERKPP_Phase3)) OR A (G ((2 <= MEK)))) AND E (F (((MEKP <= ERKPP) OR (2 <= MEKPP_Phase2)))))) : E (F (NOT(A (X ((3 <= Phase3)))))) : E (F (E (F (FALSE)))) : A (G ((1 <= Phase2))) : NOT(NOT(E (F (((Phase2 <= RafP_Phase1) AND (2 <= MEKP)))))) : A (G (E (F ((ERKP_MEKPP + 1 <= RasGTP))))) : E ((((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3)))) : A (G (E (X ((ERKPP_Phase3 <= 1))))) : E (F (A (X ((Raf <= MEKP))))) : A (G ((E (F ((MEKPP_Phase2 <= RafP_Phase1))) OR ((2 <= MEKP_RafP) AND (3 <= MEKPP) AND (3 <= Raf_RasGTP)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((RasGTP <= MEKP_Phase2) AND E (X ((ERKPP_Phase3 <= Phase1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((RasGTP <= MEKP_Phase2) AND EX((ERKPP_Phase3 <= Phase1))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= MEKPP_Phase2) OR (1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ERKPP <= Raf_RasGTP) AND E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))) OR A (F (A (F ((1 <= ERKP_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (ERKPP <= Raf_RasGTP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP <= Raf_RasGTP)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((ERKP <= MEKPP) U (Phase1 <= MEK_RafP))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4644458 markings, 8542790 edges, 3224733188970512384 markings/sec, 0 secs
lola: 9828522 markings, 17559175 edges, 1036813 markings/sec, 5 secs
lola: 14960144 markings, 26624388 edges, 1026324 markings/sec, 10 secs
lola: 19920129 markings, 35369244 edges, 991997 markings/sec, 15 secs
lola: 24705769 markings, 44107201 edges, 957128 markings/sec, 20 secs
lola: 29817100 markings, 53045141 edges, 1022266 markings/sec, 25 secs
lola: 34315265 markings, 61106682 edges, 899633 markings/sec, 30 secs
lola: 39039385 markings, 69639910 edges, 944824 markings/sec, 35 secs
lola: 43428519 markings, 77611422 edges, 877827 markings/sec, 40 secs
lola: 47856074 markings, 85667303 edges, 885511 markings/sec, 45 secs
lola: 52585456 markings, 94030898 edges, 945876 markings/sec, 50 secs
lola: 57104615 markings, 102110859 edges, 903832 markings/sec, 55 secs
lola: 61518120 markings, 110006059 edges, 882701 markings/sec, 60 secs
lola: 65722889 markings, 117716017 edges, 840954 markings/sec, 65 secs
lola: 69780450 markings, 125256910 edges, 811512 markings/sec, 70 secs
lola: 73819030 markings, 132820725 edges, 807716 markings/sec, 75 secs
lola: 78317928 markings, 140872835 edges, 899780 markings/sec, 80 secs
lola: 82721450 markings, 148834719 edges, 880704 markings/sec, 85 secs
lola: 87057368 markings, 156618033 edges, 867184 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= ERKP_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= ERKP_MEKPP))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: A (G ((E (F ((MEKP_RafP <= MEKP))) AND (ERKP <= RasGTP))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((MEKP_RafP <= MEKP)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (MEKP_RafP <= MEKP)))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3019965 markings, 11136921 edges, 3096159597753270272 markings/sec, 0 secs
lola: 5914451 markings, 21825714 edges, 578897 markings/sec, 5 secs
lola: 9122267 markings, 33128939 edges, 641563 markings/sec, 10 secs
lola: 12106138 markings, 44275597 edges, 596774 markings/sec, 15 secs
lola: 14670580 markings, 54243978 edges, 512888 markings/sec, 20 secs
lola: 17630596 markings, 64871142 edges, 592003 markings/sec, 25 secs
lola: 20613404 markings, 75866753 edges, 596562 markings/sec, 30 secs
lola: 23450469 markings, 86355115 edges, 567413 markings/sec, 35 secs
lola: 26439885 markings, 97373604 edges, 597883 markings/sec, 40 secs
lola: 29525204 markings, 108296521 edges, 617064 markings/sec, 45 secs
lola: 32225072 markings, 118737260 edges, 539974 markings/sec, 50 secs
lola: 34937307 markings, 129220091 edges, 542447 markings/sec, 55 secs
lola: 37818856 markings, 139453349 edges, 576310 markings/sec, 60 secs
lola: 40542306 markings, 149833538 edges, 544690 markings/sec, 65 secs
lola: 42997343 markings, 159823389 edges, 491007 markings/sec, 70 secs
lola: 45609459 markings, 169928699 edges, 522423 markings/sec, 75 secs
lola: 48194397 markings, 179837972 edges, 516988 markings/sec, 80 secs
lola: 50829992 markings, 189623083 edges, 527119 markings/sec, 85 secs
lola: 53524887 markings, 199698914 edges, 538979 markings/sec, 90 secs
lola: 56529152 markings, 210193817 edges, 600853 markings/sec, 95 secs
lola: 59417460 markings, 220859980 edges, 577662 markings/sec, 100 secs
lola: 62506335 markings, 232224615 edges, 617775 markings/sec, 105 secs
lola: 65425394 markings, 242996821 edges, 583812 markings/sec, 110 secs
lola: 68500689 markings, 253941102 edges, 615059 markings/sec, 115 secs
lola: 71521930 markings, 265072860 edges, 604248 markings/sec, 120 secs
lola: 74513375 markings, 276096921 edges, 598289 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKP <= RasGTP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((ERKPP_Phase3 <= 2) OR (Phase2 + 1 <= Raf)) AND ((Phase2 <= RafP_Phase1) OR (1 <= RasGTP) OR (MEKP_RafP <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= ERK) AND (2 <= ERK) AND (RafP_Phase1 + 1 <= RasGTP)) OR (RafP_Phase1 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))) OR ((((Raf_RasGTP + 1 <= ERKPP_Phase3)) OR A (G ((2 <= MEK)))) AND E (F (((MEKP <= ERKPP) OR (2 <= MEKPP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Phase1 <= 1) R (RasGTP + 1 <= ERKPP_Phase3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Raf_RasGTP + 1 <= ERKPP_Phase3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Raf_RasGTP + 1 <= ERKPP_Phase3))
lola: processed formula length: 34
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= MEK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((3 <= Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((Phase3 <= 2)))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F (((Phase2 <= RafP_Phase1) AND (2 <= MEKP))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((ERKP_MEKPP + 1 <= RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (ERKP_MEKPP + 1 <= RasGTP)))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3377569 markings, 11831338 edges, 675514 markings/sec, 0 secs
lola: 6646867 markings, 23262296 edges, 653860 markings/sec, 5 secs
lola: 9770402 markings, 34194816 edges, 624707 markings/sec, 10 secs
lola: 12862124 markings, 45072183 edges, 618344 markings/sec, 15 secs
lola: 16107917 markings, 56420799 edges, 649159 markings/sec, 20 secs
lola: 19142864 markings, 67022217 edges, 606989 markings/sec, 25 secs
lola: 22024045 markings, 77086438 edges, 576236 markings/sec, 30 secs
lola: 24973661 markings, 87391558 edges, 589923 markings/sec, 35 secs
lola: 27900048 markings, 97614970 edges, 585277 markings/sec, 40 secs
lola: 30815393 markings, 107811268 edges, 583069 markings/sec, 45 secs
lola: 33603015 markings, 117552225 edges, 557524 markings/sec, 50 secs
lola: 36370931 markings, 127221033 edges, 553583 markings/sec, 55 secs
lola: 39383920 markings, 137753386 edges, 602598 markings/sec, 60 secs
lola: 42502110 markings, 148656635 edges, 623638 markings/sec, 65 secs
lola: 45490103 markings, 159092074 edges, 597599 markings/sec, 70 secs
lola: 48206277 markings, 168578197 edges, 543235 markings/sec, 75 secs
lola: 50957736 markings, 178187327 edges, 550292 markings/sec, 80 secs
lola: 53885357 markings, 188412078 edges, 585524 markings/sec, 85 secs
lola: 56638635 markings, 198027837 edges, 550656 markings/sec, 90 secs
lola: 59302215 markings, 207333053 edges, 532716 markings/sec, 95 secs
lola: 61909415 markings, 216437813 edges, 521440 markings/sec, 100 secs
lola: 64907130 markings, 226920844 edges, 599543 markings/sec, 105 secs
lola: 67718560 markings, 236767632 edges, 562286 markings/sec, 110 secs
lola: 70445352 markings, 246345318 edges, 545358 markings/sec, 115 secs
lola: 73355572 markings, 256544928 edges, 582044 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 794 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3)))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 13 will run for 1059 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ERKPP_Phase3 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((ERKPP_Phase3 <= 1)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3815196 markings, 9545533 edges, 763039 markings/sec, 0 secs
lola: 7397385 markings, 18485742 edges, 716438 markings/sec, 5 secs
lola: 10817532 markings, 27048860 edges, 684029 markings/sec, 10 secs
lola: 14271465 markings, 35721769 edges, 690787 markings/sec, 15 secs
lola: 17636656 markings, 44124280 edges, 673038 markings/sec, 20 secs
lola: 20969784 markings, 52434464 edges, 666626 markings/sec, 25 secs
lola: 24248101 markings, 60609683 edges, 655663 markings/sec, 30 secs
lola: 27443650 markings, 68576174 edges, 639110 markings/sec, 35 secs
lola: 30675062 markings, 76645841 edges, 646282 markings/sec, 40 secs
lola: 33773681 markings, 84374950 edges, 619724 markings/sec, 45 secs
lola: 36982645 markings, 92373915 edges, 641793 markings/sec, 50 secs
lola: 40418394 markings, 100961185 edges, 687150 markings/sec, 55 secs
lola: 43840088 markings, 109489198 edges, 684339 markings/sec, 60 secs
lola: 47050939 markings, 117490760 edges, 642170 markings/sec, 65 secs
lola: 50058968 markings, 124989312 edges, 601606 markings/sec, 70 secs
lola: 53274433 markings, 133004450 edges, 643093 markings/sec, 75 secs
lola: 56365987 markings, 140710176 edges, 618311 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((Raf <= MEKP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Raf <= MEKP)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3853457 markings, 9640593 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7368510 markings, 18413730 edges, 703011 markings/sec, 5 secs
lola: 10819672 markings, 27054189 edges, 690232 markings/sec, 10 secs
lola: 14430197 markings, 36117874 edges, 722105 markings/sec, 15 secs
lola: 18046300 markings, 45144635 edges, 723221 markings/sec, 20 secs
lola: 21343203 markings, 53366926 edges, 659381 markings/sec, 25 secs
lola: 24662971 markings, 61644441 edges, 663954 markings/sec, 30 secs
lola: 27965033 markings, 69876482 edges, 660412 markings/sec, 35 secs
lola: 31216618 markings, 77996482 edges, 650317 markings/sec, 40 secs
lola: 34355868 markings, 85827334 edges, 627850 markings/sec, 45 secs
lola: 37590343 markings, 93887134 edges, 646895 markings/sec, 50 secs
lola: 41119656 markings, 102708965 edges, 705863 markings/sec, 55 secs
lola: 44532685 markings, 111215360 edges, 682606 markings/sec, 60 secs
lola: 47749796 markings, 119234239 edges, 643422 markings/sec, 65 secs
lola: 50834935 markings, 126923173 edges, 617028 markings/sec, 70 secs
lola: 54103380 markings, 135070222 edges, 653689 markings/sec, 75 secs
lola: 56999856 markings, 142290109 edges, 579295 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3002 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((MEKPP_Phase2 <= RafP_Phase1))) OR ((2 <= MEKP_RafP) AND (3 <= MEKPP) AND (3 <= Raf_RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (MEKPP_Phase2 <= RafP_Phase1))) AND ((MEKP_RafP <= 1) OR (MEKPP <= 2) OR (Raf_RasGTP <= 2)))))
lola: processed formula length: 123
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3294935 markings, 11546364 edges, 3224733188970512384 markings/sec, 0 secs
lola: 6518087 markings, 22818052 edges, 644630 markings/sec, 5 secs
lola: 9611534 markings, 33792900 edges, 618689 markings/sec, 10 secs
lola: 12595887 markings, 44414155 edges, 596871 markings/sec, 15 secs
lola: 15838946 markings, 55755270 edges, 648612 markings/sec, 20 secs
lola: 18834526 markings, 66478429 edges, 599116 markings/sec, 25 secs
lola: 21715183 markings, 76543284 edges, 576131 markings/sec, 30 secs
lola: 24655724 markings, 86818597 edges, 588108 markings/sec, 35 secs
lola: 27514228 markings, 96949570 edges, 571701 markings/sec, 40 secs
lola: 30377929 markings, 107228470 edges, 572740 markings/sec, 45 secs
lola: 33103602 markings, 116931187 edges, 545135 markings/sec, 50 secs
lola: 35613421 markings, 126519978 edges, 501964 markings/sec, 55 secs
lola: 38400083 markings, 136871089 edges, 557332 markings/sec, 60 secs
lola: 41549124 markings, 147896126 edges, 629808 markings/sec, 65 secs
lola: 44481863 markings, 158545766 edges, 586548 markings/sec, 70 secs
lola: 47116261 markings, 168151676 edges, 526880 markings/sec, 75 secs
lola: 49628670 markings, 177333531 edges, 502482 markings/sec, 80 secs
lola: 52418273 markings, 187481989 edges, 557921 markings/sec, 85 secs
lola: 55115337 markings, 196903849 edges, 539413 markings/sec, 90 secs
lola: 57734059 markings, 206053336 edges, 523744 markings/sec, 95 secs
lola: 60408826 markings, 215656652 edges, 534953 markings/sec, 100 secs
lola: 63048917 markings, 225167379 edges, 528018 markings/sec, 105 secs
lola: 65941398 markings, 236122784 edges, 578496 markings/sec, 110 secs
lola: 68578093 markings, 245503453 edges, 527339 markings/sec, 115 secs
lola: 71092341 markings, 255178116 edges, 502850 markings/sec, 120 secs
lola: 74120055 markings, 265816665 edges, 605543 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no yes no no yes unknown yes unknown unknown unknown
FORMULA MAPK-PT-320-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496362305488

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_MAPK-PT-320"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/S_MAPK-PT-320.tgz
mv S_MAPK-PT-320 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_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 r118-blw7-149441650000210"
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 ;