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_ERK-PT-100000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612400381
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496372125321


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


checking for too many tokens
===========================================================================================
S_ERK-PT-100000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_ERK-PT-100000 @ 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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-100000-CTLCardinality.task
lola: (A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK)))) OR (2 <= MEKPP_ERK)) : (E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2)))) OR (A (G (((MEKPP <= RKIP) AND (Raf1Star <= MEKPP)))) AND (((RP <= 2) OR (Raf1Star_RKIP_ERKPP <= 1)) AND ((RKIPP <= 2) OR (MEKPP_ERK <= 1))))) : A (G (TRUE)) : A ((((1 <= Raf1Star_RKIP_ERKPP) AND (RKIP <= Raf1Star_RKIP)) U A (G (TRUE)))) : A (G ((RKIPP_RP <= RP))) : A (F (E (F ((ERK + 1 <= MEKPP_ERK))))) : A (G ((E (X (TRUE)) OR E (G ((ERK <= MEKPP_ERK)))))) : A (G ((A (G ((1 <= MEKPP))) OR E (G ((ERK <= RKIP)))))) : E (((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP)))) : NOT((A (F ((1 <= RKIPP))) OR NOT(E (F ((RKIP <= ERKPP)))))) : A (G (NOT(A (G ((2 <= MEKPP)))))) : NOT(E (F (((RP <= RKIPP_RP) AND (ERK <= ERKPP) AND (RKIPP + 1 <= MEKPP_ERK))))) : A (G ((1 <= ERK))) : A (G (E (F (((2 <= RKIP) AND (2 <= RKIP)))))) : (E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP)))) AND E (F ((Raf1Star <= RKIPP)))) : (A (F (A (F ((RKIPP_RP <= Raf1Star_RKIP))))) AND E ((((2 <= RKIP) AND (2 <= RP)) U (ERK <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK)))) OR (2 <= MEKPP_ERK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK))))
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 24 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 ERK-PT-100000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= MEKPP_ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MEKPP_ERK)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2)))) OR (A (G (((MEKPP <= RKIP) AND (Raf1Star <= MEKPP)))) AND (((RP <= 2) OR (Raf1Star_RKIP_ERKPP <= 1)) AND ((RKIPP <= 2) OR (MEKPP_ERK <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2))))
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 24 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 ERK-PT-100000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Raf1Star_RKIP_ERKPP) AND (RKIP <= Raf1Star_RKIP)) U A (G (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 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((RKIPP_RP <= RP)))
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 24 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 ERK-PT-100000-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((ERK + 1 <= MEKPP_ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U E(TRUE U (ERK + 1 <= MEKPP_ERK)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (TRUE)) OR E (G ((ERK <= MEKPP_ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((1 <= MEKPP))) OR E (G ((ERK <= RKIP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (MEKPP <= 0)) AND A(TRUE U (RKIP + 1 <= ERK)))))
lola: processed formula length: 71
lola: 8 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5410472 markings, 12569969 edges, 2505789473602666496 markings/sec, 0 secs
lola: 10181476 markings, 24493808 edges, 954201 markings/sec, 5 secs
lola: 14894447 markings, 36273464 edges, 942594 markings/sec, 10 secs
lola: 19725501 markings, 48350861 edges, 966211 markings/sec, 15 secs
lola: 24335571 markings, 59874354 edges, 922014 markings/sec, 20 secs
lola: 28975704 markings, 71472065 edges, 928027 markings/sec, 25 secs
lola: 33654179 markings, 83165970 edges, 935695 markings/sec, 30 secs
lola: 38232407 markings, 94610998 edges, 915646 markings/sec, 35 secs
lola: 42416983 markings, 105071647 edges, 836915 markings/sec, 40 secs
lola: 46964364 markings, 116440368 edges, 909476 markings/sec, 45 secs
lola: 51528314 markings, 127847363 edges, 912790 markings/sec, 50 secs
lola: 56149969 markings, 139399579 edges, 924331 markings/sec, 55 secs
lola: 60474814 markings, 150213838 edges, 864969 markings/sec, 60 secs
lola: 65011720 markings, 161551676 edges, 907381 markings/sec, 65 secs
lola: 69583348 markings, 172982551 edges, 914326 markings/sec, 70 secs
lola: 74031090 markings, 184100040 edges, 889548 markings/sec, 75 secs
lola: 78240546 markings, 194624394 edges, 841891 markings/sec, 80 secs
lola: 82708014 markings, 205791723 edges, 893494 markings/sec, 85 secs
lola: 87099553 markings, 216768281 edges, 878308 markings/sec, 90 secs
lola: 91544182 markings, 227880125 edges, 888926 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((1 <= RKIPP))) OR NOT(E (F ((RKIP <= ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((RKIPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(A(TRUE U (1 <= RKIPP)))
lola: processed formula length: 27
lola: 12 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((RKIP <= ERKPP)))
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 24 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 ERK-PT-100000-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((2 <= MEKPP))))))
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 (MEKPP <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 4304605 markings, 9000879 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7506651 markings, 17000291 edges, 640409 markings/sec, 5 secs
lola: 10653570 markings, 24863750 edges, 629384 markings/sec, 10 secs
lola: 13777459 markings, 32670169 edges, 624778 markings/sec, 15 secs
lola: 16915351 markings, 40511848 edges, 627578 markings/sec, 20 secs
lola: 19987591 markings, 48189500 edges, 614448 markings/sec, 25 secs
lola: 23070436 markings, 55895246 edges, 616569 markings/sec, 30 secs
lola: 26184946 markings, 63679107 edges, 622902 markings/sec, 35 secs
lola: 29263667 markings, 71374484 edges, 615744 markings/sec, 40 secs
lola: 32372388 markings, 79143527 edges, 621744 markings/sec, 45 secs
lola: 35552844 markings, 87092459 edges, 636091 markings/sec, 50 secs
lola: 38588655 markings, 94679797 edges, 607162 markings/sec, 55 secs
lola: 41612747 markings, 102238666 edges, 604818 markings/sec, 60 secs
lola: 44576704 markings, 109649024 edges, 592791 markings/sec, 65 secs
lola: 47553776 markings, 117087371 edges, 595414 markings/sec, 70 secs
lola: 50488951 markings, 124426392 edges, 587035 markings/sec, 75 secs
lola: 53493058 markings, 131934041 edges, 600821 markings/sec, 80 secs
lola: 56558624 markings, 139595955 edges, 613113 markings/sec, 85 secs
lola: 59661099 markings, 147351624 edges, 620495 markings/sec, 90 secs
lola: 62717904 markings, 154990922 edges, 611361 markings/sec, 95 secs
lola: 65768510 markings, 162617027 edges, 610121 markings/sec, 100 secs
lola: 68821579 markings, 170248912 edges, 610614 markings/sec, 105 secs
lola: 71898155 markings, 177937320 edges, 615315 markings/sec, 110 secs
lola: 74934370 markings, 185527855 edges, 607243 markings/sec, 115 secs
lola: 78062778 markings, 193346521 edges, 625682 markings/sec, 120 secs
lola: 81210838 markings, 201218163 edges, 629612 markings/sec, 125 secs
lola: 84289452 markings, 208913467 edges, 615723 markings/sec, 130 secs
lola: 87407585 markings, 216707350 edges, 623627 markings/sec, 135 secs
lola: 90464200 markings, 224344808 edges, 611323 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((RP <= RKIPP_RP) AND (ERK <= ERKPP) AND (RKIPP + 1 <= MEKPP_ERK)))))
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 24 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 ERK-PT-100000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ERK)))
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 24 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 ERK-PT-100000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= RKIP) AND (2 <= RKIP))))))
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 ((2 <= RKIP) AND (2 <= RKIP))))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 4448683 markings, 12887518 edges, 3689348869717491712 markings/sec, 0 secs
lola: 8656422 markings, 24977370 edges, 841548 markings/sec, 5 secs
lola: 12304662 markings, 36348118 edges, 729648 markings/sec, 10 secs
lola: 16014146 markings, 47870117 edges, 741897 markings/sec, 15 secs
lola: 19727554 markings, 59382820 edges, 742682 markings/sec, 20 secs
lola: 23253014 markings, 70486283 edges, 705092 markings/sec, 25 secs
lola: 26847863 markings, 81521869 edges, 718970 markings/sec, 30 secs
lola: 30397132 markings, 92657480 edges, 709854 markings/sec, 35 secs
lola: 34121268 markings, 103958907 edges, 744827 markings/sec, 40 secs
lola: 37543824 markings, 114721936 edges, 684511 markings/sec, 45 secs
lola: 40989287 markings, 125366381 edges, 689093 markings/sec, 50 secs
lola: 44767108 markings, 136909487 edges, 755564 markings/sec, 55 secs
lola: 48119345 markings, 147561571 edges, 670447 markings/sec, 60 secs
lola: 51716020 markings, 158757755 edges, 719335 markings/sec, 65 secs
lola: 55213823 markings, 169547945 edges, 699561 markings/sec, 70 secs
lola: 58791229 markings, 180523482 edges, 715481 markings/sec, 75 secs
lola: 62517351 markings, 191963917 edges, 745224 markings/sec, 80 secs
lola: 66136323 markings, 203199557 edges, 723794 markings/sec, 85 secs
lola: 69698548 markings, 214028509 edges, 712445 markings/sec, 90 secs
lola: 73204960 markings, 224954016 edges, 701282 markings/sec, 95 secs
lola: 76985655 markings, 236485996 edges, 756139 markings/sec, 100 secs
lola: 80551256 markings, 247593298 edges, 713120 markings/sec, 105 secs
lola: 84125209 markings, 258465666 edges, 714791 markings/sec, 110 secs
lola: 87677638 markings, 269359672 edges, 710486 markings/sec, 115 secs
lola: 91008885 markings, 279840777 edges, 666249 markings/sec, 120 secs
lola: 94674817 markings, 290965031 edges, 733186 markings/sec, 125 secs
lola: 97894301 markings, 301001561 edges, 643897 markings/sec, 130 secs
lola: 101401086 markings, 311725604 edges, 701357 markings/sec, 135 secs
lola: 104854829 markings, 322475527 edges, 690749 markings/sec, 140 secs
lola: 108200256 markings, 332796240 edges, 669085 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP)))) AND E (F ((Raf1Star <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP))))
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 24 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 ERK-PT-100000-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-14.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Raf1Star <= RKIPP)))
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 24 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 ERK-PT-100000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((RKIPP_RP <= Raf1Star_RKIP))))) AND E ((((2 <= RKIP) AND (2 <= RP)) U (ERK <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((RKIPP_RP <= Raf1Star_RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (RKIPP_RP <= Raf1Star_RKIP))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes unknown yes yes unknown no no unknown yes unknown
FORMULA ERK-PT-100000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496372532592

--------------------
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_ERK-PT-100000"
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_ERK-PT-100000.tgz
mv S_ERK-PT-100000 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_ERK-PT-100000, 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 r108-blw3-149441612400381"
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 ;