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_Kanban-PT-1000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649900138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496354301129


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


checking for too many tokens
===========================================================================================
S_Kanban-PT-1000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_Kanban-PT-1000 @ 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: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-1000-CTLCardinality.task
lola: E (F (((2 <= Pback1) AND (P2 + 1 <= Pback4) AND (Pm2 <= Pback2)))) : (E (((Pout4 <= P4) U (P4 <= 0))) AND E (X ((((Pout2 <= Pout4) AND (1 <= P1)) OR (Pm1 <= Pback3))))) : ((NOT(E (F ((3 <= Pback1)))) OR A (X ((1 <= Pout3)))) AND (((1 <= Pback3) AND (Pout1 <= Pback4)) OR (Pm2 <= 1))) : (NOT(((3 <= Pm2) OR A (G ((Pm1 <= P4))))) AND (((Pback1 + 1 <= Pm3) OR ((Pm3 + 1 <= Pout1) AND (P3 <= 2))) OR E (F ((Pm4 <= 0))))) : (A (F (E (F ((3 <= Pout2))))) OR ((3 <= Pback3) AND A (G ((Pout3 <= Pout4))))) : E (F ((P2 <= Pm1))) : (NOT(E (X (((1 <= Pback2) AND (P2 <= Pm2))))) AND NOT(E (F (((Pm1 <= Pm4) AND (3 <= Pback1)))))) : A (G ((E (F ((P2 <= P3))) AND E (G ((3 <= P3)))))) : E (X (A (G ((Pback1 + 1 <= P3))))) : ((2 <= Pout4) OR E (((Pout4 + 1 <= P1) U (P1 <= Pback3)))) : A (G (E (X ((Pback1 <= P2))))) : (A (G (((3 <= P3) OR (Pm4 + 1 <= P1)))) AND (E (((3 <= P2) U (1 <= Pm4))) AND ((Pback3 <= P1) OR A (G (TRUE))))) : A (((Pback1 <= Pm1) U E (F ((P4 <= Pm1))))) : (E (G (A (G ((3 <= P4))))) AND E (X (E (F (TRUE))))) : ((A (F (((3 <= Pm4) OR (1 <= P1)))) AND E (((Pout4 <= P4) U (3 <= Pm1)))) OR (3 <= Pm3)) : E (F (A (F (((1 <= Pm1) AND (3 <= Pout3))))))
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 (((2 <= Pback1) AND (P2 + 1 <= Pback4) AND (Pm2 <= Pback2))))
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 44 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 Kanban-PT-1000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-1000-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
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 (((Pout4 <= P4) U (P4 <= 0))) AND E (X ((((Pout2 <= Pout4) AND (1 <= P1)) OR (Pm1 <= Pback3)))))
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 (((Pout4 <= P4) U (P4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Pout4 <= P4) U (P4 <= 0))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 4742500 markings, 8773487 edges, 3225861287900610560 markings/sec, 0 secs
lola: 9158146 markings, 17146050 edges, 883129 markings/sec, 5 secs
lola: 13302800 markings, 25075105 edges, 828931 markings/sec, 10 secs
lola: 17403098 markings, 32926579 edges, 820060 markings/sec, 15 secs
lola: 21240724 markings, 40248944 edges, 767525 markings/sec, 20 secs
lola: 25263444 markings, 47947813 edges, 804544 markings/sec, 25 secs
lola: 29295361 markings, 55631867 edges, 806383 markings/sec, 30 secs
lola: 33316445 markings, 63345171 edges, 804217 markings/sec, 35 secs
lola: 37281352 markings, 70993141 edges, 792981 markings/sec, 40 secs
lola: 41163122 markings, 78503099 edges, 776354 markings/sec, 45 secs
lola: 45044806 markings, 86013388 edges, 776337 markings/sec, 50 secs
lola: 48982389 markings, 93610712 edges, 787517 markings/sec, 55 secs
lola: 52926276 markings, 101304010 edges, 788777 markings/sec, 60 secs
lola: 56780697 markings, 108846598 edges, 770884 markings/sec, 65 secs
lola: 60696502 markings, 116501229 edges, 783161 markings/sec, 70 secs
lola: 64553276 markings, 124044973 edges, 771355 markings/sec, 75 secs
lola: 68371226 markings, 131617653 edges, 763590 markings/sec, 80 secs
lola: 72196070 markings, 139147440 edges, 764969 markings/sec, 85 secs
lola: 75980555 markings, 146550081 edges, 756897 markings/sec, 90 secs
lola: 79709627 markings, 153929419 edges, 745814 markings/sec, 95 secs
lola: 83435715 markings, 161342591 edges, 745218 markings/sec, 100 secs
lola: 87219659 markings, 168772958 edges, 756789 markings/sec, 105 secs
lola: 91000993 markings, 176222180 edges, 756267 markings/sec, 110 secs
lola: 94731691 markings, 183592900 edges, 746140 markings/sec, 115 secs
lola: 98488703 markings, 190960348 edges, 751402 markings/sec, 120 secs
lola: 102213860 markings, 198323263 edges, 745031 markings/sec, 125 secs
lola: 105889324 markings, 205598901 edges, 735093 markings/sec, 130 secs
lola: 109552955 markings, 212837270 edges, 732726 markings/sec, 135 secs
lola: 113167697 markings, 220024173 edges, 722948 markings/sec, 140 secs
lola: 116845681 markings, 227254875 edges, 735597 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((Pout2 <= Pout4) AND (1 <= P1)) OR (Pm1 <= Pback3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((Pout2 <= Pout4) AND (1 <= P1)) OR (Pm1 <= Pback3)))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 0 significant temporal operators and needs 0 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((3 <= Pback1)))) OR A (X ((1 <= Pout3)))) AND (((1 <= Pback3) AND (Pout1 <= Pback4)) OR (Pm2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pback1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: ========================================
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: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= Pout3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((1 <= Pout3))
lola: processed formula length: 16
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 0 significant temporal operators and needs 0 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT(((3 <= Pm2) OR A (G ((Pm1 <= P4))))) AND (((Pback1 + 1 <= Pm3) OR ((Pm3 + 1 <= Pout1) AND (P3 <= 2))) OR E (F ((Pm4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Pm2 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm2 <= 2)
lola: processed formula length: 10
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-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 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P4 + 1 <= Pm1)))
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 44 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: state equation: write sara problem file to Kanban-PT-1000-CTLCardinality-4.sara
lola: lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: ((Pback1 + 1 <= Pm3) OR ((Pm3 + 1 <= Pout1) AND (P3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback1 + 1 <= Pm3) OR ((Pm3 + 1 <= Pout1) AND (P3 <= 2)))
lola: processed formula length: 60
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: processed formula with 3 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 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Pm4 <= 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 44 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: state equation: write sara problem file to Kanban-PT-1000-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (F ((3 <= Pout2))))) OR ((3 <= Pback3) AND A (G ((Pout3 <= Pout4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((3 <= Pout2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (3 <= Pout2)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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).
sara: try reading problem file Kanban-PT-1000-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

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 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 <= Pm1)))
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 44 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 Kanban-PT-1000-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (X (((1 <= Pback2) AND (P2 <= Pm2))))) AND NOT(E (F (((Pm1 <= Pm4) AND (3 <= Pback1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((Pback2 <= 0) OR (Pm2 + 1 <= P2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((Pback2 <= 0) OR (Pm2 + 1 <= P2)))
lola: processed formula length: 39
lola: 7 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 0 significant temporal operators and needs 0 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 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Pm4 + 1 <= Pm1) OR (Pback1 <= 2))))
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 44 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 Kanban-PT-1000-CTLCardinality-7.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 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((P2 <= P3))) AND E (G ((3 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((P2 <= P3)))))
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 (P2 <= P3)))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 3954161 markings, 11939375 edges, 790832 markings/sec, 0 secs
lola: 7571165 markings, 23049256 edges, 723401 markings/sec, 5 secs
lola: 11059333 markings, 33788737 edges, 697634 markings/sec, 10 secs
lola: 14475742 markings, 44319185 edges, 683282 markings/sec, 15 secs
lola: 17888166 markings, 54831461 edges, 682485 markings/sec, 20 secs
lola: 21198373 markings, 65046930 edges, 662041 markings/sec, 25 secs
lola: 24564811 markings, 75425970 edges, 673288 markings/sec, 30 secs
lola: 27844824 markings, 85561115 edges, 656003 markings/sec, 35 secs
lola: 30996968 markings, 95331678 edges, 630429 markings/sec, 40 secs
lola: 34101754 markings, 104963925 edges, 620957 markings/sec, 45 secs
lola: 37186585 markings, 114542615 edges, 616966 markings/sec, 50 secs
lola: 40269073 markings, 124118657 edges, 616498 markings/sec, 55 secs
lola: 43315068 markings, 133578450 edges, 609199 markings/sec, 60 secs
lola: 46324026 markings, 142937104 edges, 601792 markings/sec, 65 secs
lola: 49323326 markings, 152266799 edges, 599860 markings/sec, 70 secs
lola: 52302626 markings, 161536600 edges, 595860 markings/sec, 75 secs
lola: 55258527 markings, 170743435 edges, 591180 markings/sec, 80 secs
lola: 58186546 markings, 179863489 edges, 585604 markings/sec, 85 secs
lola: 61106896 markings, 188956289 edges, 584070 markings/sec, 90 secs
lola: 64022829 markings, 198037825 edges, 583187 markings/sec, 95 secs
lola: 66906991 markings, 207030341 edges, 576832 markings/sec, 100 secs
lola: 69809938 markings, 216078784 edges, 580589 markings/sec, 105 secs
lola: 72692194 markings, 225065125 edges, 576451 markings/sec, 110 secs
lola: 75553601 markings, 233981043 edges, 572281 markings/sec, 115 secs
lola: 78434803 markings, 242958613 edges, 576240 markings/sec, 120 secs
lola: 81291876 markings, 251870954 edges, 571415 markings/sec, 125 secs
lola: 84121133 markings, 260698149 edges, 565851 markings/sec, 130 secs
lola: 86954767 markings, 269535728 edges, 566727 markings/sec, 135 secs
lola: 89774459 markings, 278336676 edges, 563938 markings/sec, 140 secs
lola: 92596843 markings, 287143912 edges, 564477 markings/sec, 145 secs
lola: 95400855 markings, 295897008 edges, 560802 markings/sec, 150 secs
lola: 98172004 markings, 304551134 edges, 554230 markings/sec, 155 secs
lola: 100961399 markings, 313252884 edges, 557879 markings/sec, 160 secs
lola: 103750786 markings, 321962721 edges, 557877 markings/sec, 165 secs
lola: 106528673 markings, 330638962 edges, 555577 markings/sec, 170 secs
lola: 109319274 markings, 339351591 edges, 558120 markings/sec, 175 secs
lola: 112089801 markings, 348006798 edges, 554105 markings/sec, 180 secs
lola: 114870218 markings, 356692543 edges, 556083 markings/sec, 185 secs
lola: 117653315 markings, 365387367 edges, 556619 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((3 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (P3 <= 2))))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 1908886 markings, 7600443 edges, 381777 markings/sec, 0 secs
lola: 3981362 markings, 16004654 edges, 414495 markings/sec, 5 secs
lola: 5909018 markings, 23854425 edges, 385531 markings/sec, 10 secs
lola: 7887893 markings, 31910110 edges, 395775 markings/sec, 15 secs
lola: 9865128 markings, 39981762 edges, 395447 markings/sec, 20 secs
lola: 11849981 markings, 48077328 edges, 396971 markings/sec, 25 secs
lola: 13642004 markings, 55391561 edges, 358405 markings/sec, 30 secs
lola: 15571215 markings, 63265358 edges, 385842 markings/sec, 35 secs
lola: 17540545 markings, 71302867 edges, 393866 markings/sec, 40 secs
lola: 19487835 markings, 79261599 edges, 389458 markings/sec, 45 secs
lola: 21391910 markings, 87033189 edges, 380815 markings/sec, 50 secs
lola: 23343292 markings, 95002488 edges, 390276 markings/sec, 55 secs
lola: 25284270 markings, 102933936 edges, 388196 markings/sec, 60 secs
lola: 27221499 markings, 110851103 edges, 387446 markings/sec, 65 secs
lola: 29114345 markings, 118608116 edges, 378569 markings/sec, 70 secs
lola: 30992667 markings, 126311002 edges, 375664 markings/sec, 75 secs
lola: 32865711 markings, 133993747 edges, 374609 markings/sec, 80 secs
lola: 34732939 markings, 141654677 edges, 373446 markings/sec, 85 secs
lola: 36577253 markings, 149225255 edges, 368863 markings/sec, 90 secs
lola: 38457858 markings, 156949235 edges, 376121 markings/sec, 95 secs
lola: 40303569 markings, 164529124 edges, 369142 markings/sec, 100 secs
lola: 42120839 markings, 171989694 edges, 363454 markings/sec, 105 secs
lola: 43972251 markings, 179595121 edges, 370282 markings/sec, 110 secs
lola: 45753259 markings, 186915839 edges, 356202 markings/sec, 115 secs
lola: 47595688 markings, 194488284 edges, 368486 markings/sec, 120 secs
lola: 49421116 markings, 201991813 edges, 365086 markings/sec, 125 secs
lola: 51156807 markings, 209126343 edges, 347138 markings/sec, 130 secs
lola: 52916888 markings, 216367268 edges, 352016 markings/sec, 135 secs
lola: 54669344 markings, 223578083 edges, 350491 markings/sec, 140 secs
lola: 56417397 markings, 230767563 edges, 349611 markings/sec, 145 secs
lola: 58210323 markings, 238147897 edges, 358585 markings/sec, 150 secs
lola: 60006007 markings, 245535564 edges, 359137 markings/sec, 155 secs
lola: 61811456 markings, 252954753 edges, 361090 markings/sec, 160 secs
lola: 63592591 markings, 260289789 edges, 356227 markings/sec, 165 secs
lola: 65377548 markings, 267639968 edges, 356991 markings/sec, 170 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((Pback1 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (P3 <= Pback1))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= Pout4) OR E (((Pout4 + 1 <= P1) U (P1 <= Pback3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Pout4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Pout4)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-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: subprocess 10 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((Pout4 + 1 <= P1) U (P1 <= Pback3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Pout4 + 1 <= P1) U (P1 <= Pback3))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 4424234 markings, 9256576 edges, 3223388211371835392 markings/sec, 0 secs
lola: 8461004 markings, 17840901 edges, 807354 markings/sec, 5 secs
lola: 12468666 markings, 26366382 edges, 801532 markings/sec, 10 secs
lola: 16065088 markings, 34056338 edges, 719284 markings/sec, 15 secs
lola: 19834633 markings, 42118579 edges, 753909 markings/sec, 20 secs
lola: 23629919 markings, 50240891 edges, 759057 markings/sec, 25 secs
lola: 26824169 markings, 57089226 edges, 638850 markings/sec, 30 secs
lola: 30485907 markings, 64933043 edges, 732348 markings/sec, 35 secs
lola: 34084557 markings, 72642850 edges, 719730 markings/sec, 40 secs
lola: 37820523 markings, 80677938 edges, 747193 markings/sec, 45 secs
lola: 41390466 markings, 88340184 edges, 713989 markings/sec, 50 secs
lola: 45048156 markings, 96208967 edges, 731538 markings/sec, 55 secs
lola: 48684843 markings, 104013923 edges, 727337 markings/sec, 60 secs
lola: 52431274 markings, 112066463 edges, 749286 markings/sec, 65 secs
lola: 56147492 markings, 120061711 edges, 743244 markings/sec, 70 secs
lola: 59839122 markings, 128015032 edges, 738326 markings/sec, 75 secs
lola: 63549964 markings, 135992278 edges, 742168 markings/sec, 80 secs
lola: 67259506 markings, 143976182 edges, 741908 markings/sec, 85 secs
lola: 70923813 markings, 151893161 edges, 732861 markings/sec, 90 secs
lola: 74631038 markings, 159859837 edges, 741445 markings/sec, 95 secs
lola: 78325988 markings, 167806462 edges, 738990 markings/sec, 100 secs
lola: 81994380 markings, 175713776 edges, 733678 markings/sec, 105 secs
lola: 85653673 markings, 183616905 edges, 731859 markings/sec, 110 secs
lola: 89303681 markings, 191489657 edges, 730002 markings/sec, 115 secs
lola: 92943380 markings, 199342287 edges, 727940 markings/sec, 120 secs
lola: 96583272 markings, 207192813 edges, 727978 markings/sec, 125 secs
lola: 100254088 markings, 215100079 edges, 734163 markings/sec, 130 secs
lola: 103931415 markings, 223013778 edges, 735465 markings/sec, 135 secs
lola: 107567188 markings, 230853935 edges, 727155 markings/sec, 140 secs
lola: 111182740 markings, 238678287 edges, 723110 markings/sec, 145 secs
lola: 113162106 markings, 242963392 edges, 395873 markings/sec, 150 secs
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: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((Pback1 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((Pback1 <= P2)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: ========================================
lola: 5815346 markings, 10872930 edges, 2952100759648337920 markings/sec, 0 secs
lola: 10238613 markings, 21737847 edges, 884653 markings/sec, 5 secs
lola: 15440944 markings, 32498849 edges, 1040466 markings/sec, 10 secs
lola: 19735596 markings, 43215896 edges, 858930 markings/sec, 15 secs
lola: 24189189 markings, 53405355 edges, 890719 markings/sec, 20 secs
lola: 28721670 markings, 63780005 edges, 906496 markings/sec, 25 secs
lola: 33351943 markings, 74505842 edges, 926055 markings/sec, 30 secs
lola: 35397097 markings, 79755233 edges, 409031 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= P3) OR (Pm4 + 1 <= P1)))) AND (E (((3 <= P2) U (1 <= Pm4))) AND ((Pback3 <= P1) OR A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P3) OR (Pm4 + 1 <= P1))))
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 44 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Pback1 <= Pm1) U E (F ((P4 <= Pm1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A((Pback1 <= Pm1) U E(TRUE U (P4 <= Pm1)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 13 will run for 935 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (A (G ((3 <= P4))))) AND E (X (E (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (P4 <= 2))))
lola: processed formula length: 34
lola: 10 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 4783607 markings, 8845870 edges, 3689348869717491712 markings/sec, 0 secs
lola: 9214531 markings, 17265086 edges, 886185 markings/sec, 5 secs
lola: 13442633 markings, 25347709 edges, 845620 markings/sec, 10 secs
lola: 17577775 markings, 33252449 edges, 827028 markings/sec, 15 secs
lola: 21726719 markings, 41184752 edges, 829789 markings/sec, 20 secs
lola: 25826886 markings, 49014651 edges, 820033 markings/sec, 25 secs
lola: 29922620 markings, 56831077 edges, 819147 markings/sec, 30 secs
lola: 34007854 markings, 64680307 edges, 817047 markings/sec, 35 secs
lola: 38018285 markings, 72431125 edges, 802086 markings/sec, 40 secs
lola: 42015913 markings, 80130242 edges, 799526 markings/sec, 45 secs
lola: 45940637 markings, 87731614 edges, 784945 markings/sec, 50 secs
lola: 49947882 markings, 95465144 edges, 801449 markings/sec, 55 secs
lola: 53893062 markings, 103193492 edges, 789036 markings/sec, 60 secs
lola: 57788460 markings, 110828132 edges, 779080 markings/sec, 65 secs
lola: 61703418 markings, 118463862 edges, 782992 markings/sec, 70 secs
lola: 65575522 markings, 126062747 edges, 774421 markings/sec, 75 secs
lola: 69422873 markings, 133686716 edges, 769470 markings/sec, 80 secs
lola: 73249112 markings, 141220447 edges, 765248 markings/sec, 85 secs
lola: 77060637 markings, 148693568 edges, 762305 markings/sec, 90 secs
lola: 80823824 markings, 156140877 edges, 752637 markings/sec, 95 secs
lola: 84569418 markings, 163579238 edges, 749119 markings/sec, 100 secs
lola: 88364547 markings, 171024929 edges, 759026 markings/sec, 105 secs
lola: 92121523 markings, 178419775 edges, 751395 markings/sec, 110 secs
lola: 95876980 markings, 185832819 edges, 751091 markings/sec, 115 secs
lola: 99629549 markings, 193235598 edges, 750514 markings/sec, 120 secs
lola: 103362868 markings, 200593585 edges, 746664 markings/sec, 125 secs
lola: 107077200 markings, 207963294 edges, 742866 markings/sec, 130 secs
lola: 110794464 markings, 215313119 edges, 743453 markings/sec, 135 secs
lola: 114527232 markings, 222677665 edges, 746554 markings/sec, 140 secs
lola: 118182401 markings, 229902624 edges, 731034 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (((3 <= Pm4) OR (1 <= P1)))) AND E (((Pout4 <= P4) U (3 <= Pm1)))) OR (3 <= Pm3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= Pm4) OR (1 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= Pm4) OR (1 <= P1)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 15 will run for 2651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Pout4 <= P4) U (3 <= Pm1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Pout4 <= P4) U (3 <= Pm1))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 15 will run for 2651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (((1 <= Pm1) AND (3 <= Pout3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((1 <= Pm1) AND (3 <= Pout3))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: RESULT
lola:
SUMMARY: yes unknown no yes yes yes no unknown no unknown no no yes unknown yes yes
lola: ========================================
FORMULA Kanban-PT-1000-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Kanban-PT-1000-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496355190500

--------------------
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_Kanban-PT-1000"
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_Kanban-PT-1000.tgz
mv S_Kanban-PT-1000 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_Kanban-PT-1000, 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-149441649900138"
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 ;