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 MAPK-PT-008, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700201
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ MAPK-PT-008 @ 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-008-CTLCardinality.task
lola: NOT(A (G ((((ERKPP_Phase3 <= ERKP_Phase3)) OR (ERKP_MEKPP + 1 <= ERK))))) : (E ((((2 <= ERK) OR (2 <= MEK)) U (Phase1 <= 1))) OR ((3 <= RafP_Phase1) OR (2 <= RafP))) : A (G (((ERKP_MEKPP <= 1) OR ((RafP <= 0) AND (Raf_RasGTP + 1 <= RafP))))) : A (G ((E (X ((ERKP_MEKPP <= Phase2))) AND A (F ((2 <= Phase3)))))) : (NOT((A (G ((1 <= ERK))) AND ((MEK_RafP <= 2) OR (MEK + 1 <= MEKPP)))) AND ((1 <= RafP) OR E (F (((Raf <= Phase2) OR (3 <= MEKPP_Phase2)))))) : A (G (A (F (TRUE)))) : E ((E (F ((2 <= ERKP_MEKPP))) U (1 <= MEKP))) : NOT(A (G (E (G ((1 <= ERK)))))) : NOT(E (F (A (G ((ERK_MEKPP <= Raf)))))) : E ((((MEK + 1 <= Phase3) AND (MEK_RafP <= 0)) U ((ERK_MEKPP <= MEKPP) AND (1 <= MEKPP_Phase2) AND (1 <= ERK_MEKPP) AND (Phase3 <= RasGTP)))) : E (F (((ERK <= Phase2) AND (ERKPP_Phase3 + 1 <= Raf_RasGTP) AND (3 <= MEKPP)))) : E ((((ERKPP_Phase3 <= ERK_MEKPP) OR (1 <= MEKPP_Phase2)) U A (G ((1 <= MEKP))))) : E (G (E (F ((Phase3 + 1 <= ERKP_Phase3))))) : A (G ((ERKP_Phase3 <= Phase1))) : E (G (A (G (())))) : NOT(E (X (A (G ((1 <= ERK))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((ERKPP_Phase3 <= ERKP_Phase3)) OR (ERKP_MEKPP + 1 <= ERK)))))
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-008-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= ERK) OR (2 <= MEK)) U (Phase1 <= 1))) OR ((3 <= RafP_Phase1) OR (2 <= RafP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= ERK) OR (2 <= MEK)) U (Phase1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= ERK) OR (2 <= MEK)) U (Phase1 <= 1))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ERKP_MEKPP <= 1) OR ((RafP <= 0) AND (Raf_RasGTP + 1 <= RafP)))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((ERKP_MEKPP <= Phase2))) AND A (F ((2 <= Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ERKP_MEKPP <= Phase2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((ERKP_MEKPP <= Phase2)))))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: 1739713 markings, 4889526 edges, 347943 markings/sec, 0 secs
lola: 3125531 markings, 9596158 edges, 277164 markings/sec, 5 secs
lola: 4411142 markings, 14164825 edges, 257122 markings/sec, 10 secs
lola: 5590948 markings, 18561921 edges, 235961 markings/sec, 15 secs
lola: 6102986 markings, 23056924 edges, 102408 markings/sec, 20 secs
lola: 6105644 markings, 28195927 edges, 532 markings/sec, 25 secs
lola: 6107014 markings, 33403060 edges, 274 markings/sec, 30 secs
lola: 6107896 markings, 38553259 edges, 176 markings/sec, 35 secs
lola: 6108662 markings, 43893789 edges, 153 markings/sec, 40 secs
lola: 6109319 markings, 49317429 edges, 131 markings/sec, 45 secs
lola: 6109933 markings, 54908286 edges, 123 markings/sec, 50 secs
lola: 6110343 markings, 60495271 edges, 82 markings/sec, 55 secs
lola: 6110500 markings, 66164483 edges, 31 markings/sec, 60 secs
lola: 6110615 markings, 72217943 edges, 23 markings/sec, 65 secs
lola: 6110643 markings, 78934423 edges, 6 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= Phase3)))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((A (G ((1 <= ERK))) AND ((MEK_RafP <= 2) OR (MEK + 1 <= MEKPP)))) AND ((1 <= RafP) OR E (F (((Raf <= Phase2) OR (3 <= MEKPP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ERK <= 0)))
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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= RafP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= RafP)
lola: processed formula length: 11
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: nolola:
lola: ========================================
produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Raf <= Phase2) OR (3 <= MEKPP_Phase2))))
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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 0 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 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= ERKP_MEKPP))) U (1 <= MEKP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= ERKP_MEKPP)) U (1 <= MEKP))
lola: processed formula length: 44
lola: 2 rewrites
lola: lola: formula mentions 0 of 22 places; total mentions: 0
========================================
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((1 <= ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (ERK <= 0)))
lola: processed formula length: 30
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((ERK_MEKPP <= Raf))))))
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 (Raf + 1 <= ERK_MEKPP)))))
lola: processed formula length: 52
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: 1615561 markings, 7897773 edges, 323112 markings/sec, 0 secs
lola: 2850718 markings, 14470182 edges, 247031 markings/sec, 5 secs
lola: 4001499 markings, 20766582 edges, 230156 markings/sec, 10 secs
lola: 5065925 markings, 26700767 edges, 212885 markings/sec, 15 secs
lola: 6015950 markings, 32283044 edges, 190005 markings/sec, 20 secs
lola: 6104556 markings, 37540057 edges, 17721 markings/sec, 25 secs
lola: 6106401 markings, 42933783 edges, 369 markings/sec, 30 secs
lola: 6107525 markings, 48354576 edges, 225 markings/sec, 35 secs
lola: 6108339 markings, 53868303 edges, 163 markings/sec, 40 secs
lola: 6109084 markings, 59465338 edges, 149 markings/sec, 45 secs
lola: 6109730 markings, 65107925 edges, 129 markings/sec, 50 secs
lola: 6110233 markings, 70923587 edges, 101 markings/sec, 55 secs
lola: 6110457 markings, 76771025 edges, 45 markings/sec, 60 secs
lola: 6110588 markings, 82969474 edges, 26 markings/sec, 65 secs
lola: 6110643 markings, 89665568 edges, 11 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((MEK + 1 <= Phase3) AND (MEK_RafP <= 0)) U ((ERK_MEKPP <= MEKPP) AND (1 <= MEKPP_Phase2) AND (1 <= ERK_MEKPP) AND (Phase3 <= RasGTP))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((MEK + 1 <= Phase3) AND (MEK_RafP <= 0)) U ((ERK_MEKPP <= MEKPP) AND (1 <= MEKPP_Phase2) AND (1 <= ERK_MEKPP) AND (Phase3 <= RasGTP)))
lola: processed formula length: 137
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ERK <= Phase2) AND (ERKPP_Phase3 + 1 <= Raf_RasGTP) AND (3 <= MEKPP))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-008-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 677 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((ERKPP_Phase3 <= ERK_MEKPP) OR (1 <= MEKPP_Phase2)) U A (G ((1 <= MEKP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((ERKPP_Phase3 <= ERK_MEKPP) OR (1 <= MEKPP_Phase2)) U NOT(E(TRUE U (MEKP <= 0))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: 1768995 markings, 7173911 edges, 3224733188970512384 markings/sec, 0 secs
lola: 2705827 markings, 13154536 edges, 187366 markings/sec, 5 secs
lola: 3200886 markings, 19063762 edges, 99012 markings/sec, 10 secs
lola: 3634976 markings, 25308094 edges, 86818 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((Phase3 + 1 <= ERKP_Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (Phase3 + 1 <= ERKP_Phase3)))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1122 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKP_Phase3 <= Phase1)))
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: state equation: write sara problem file to MAPK-PT-008-CTLCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-008-CTLCardinality.task
lola: processed formula with 0 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 15 will run for 3366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((1 <= ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (ERK <= 0)))
lola: processed formula length: 24
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: 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: RESULT
lola:
SUMMARY: yes yes no no yes yes yes yes yes no yes no yes no yes yes
lola: ========================================
FORMULA MAPK-PT-008-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-008-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494630073552

--------------------
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="MAPK-PT-008"
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/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-3254"
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 r038-blw7-149440484700201"
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 ;