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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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.
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: 4064910 markings, 7505599 edges, 2933796090069123072 markings/sec, 0 secs
lola: 7993480 markings, 14962218 edges, 785714 markings/sec, 5 secs
lola: 11863826 markings, 22318805 edges, 774069 markings/sec, 10 secs
lola: 15833787 markings, 29946217 edges, 793992 markings/sec, 15 secs
lola: 19486501 markings, 36891514 edges, 730543 markings/sec, 20 secs
lola: 23267691 markings, 44118605 edges, 756238 markings/sec, 25 secs
lola: 27144935 markings, 51509461 edges, 775449 markings/sec, 30 secs
lola: 30604360 markings, 58143472 edges, 691885 markings/sec, 35 secs
lola: 34308841 markings, 65263599 edges, 740896 markings/sec, 40 secs
lola: 38086889 markings, 72564030 edges, 755610 markings/sec, 45 secs
lola: 41672882 markings, 79477650 edges, 717199 markings/sec, 50 secs
lola: 45281826 markings, 86475316 edges, 721789 markings/sec, 55 secs
lola: 48971094 markings, 93588424 edges, 737854 markings/sec, 60 secs
lola: 52622270 markings, 100693328 edges, 730235 markings/sec, 65 secs
lola: 56239154 markings, 107809184 edges, 723377 markings/sec, 70 secs
lola: 59785952 markings, 114737154 edges, 709360 markings/sec, 75 secs
lola: 63315337 markings, 121620621 edges, 705877 markings/sec, 80 secs
lola: 66566663 markings, 128007566 edges, 650265 markings/sec, 85 secs
lola: 69961057 markings, 134741492 edges, 678879 markings/sec, 90 secs
lola: 73197557 markings, 141117147 edges, 647300 markings/sec, 95 secs
lola: 76532639 markings, 147648901 edges, 667016 markings/sec, 100 secs
lola: 79767753 markings, 154041436 edges, 647023 markings/sec, 105 secs
lola: 83008398 markings, 160482411 edges, 648129 markings/sec, 110 secs
lola: 86469020 markings, 167311800 edges, 692124 markings/sec, 115 secs
lola: 90090354 markings, 174422174 edges, 724267 markings/sec, 120 secs
lola: 93292008 markings, 180733017 edges, 640331 markings/sec, 125 secs
lola: 96592388 markings, 187216735 edges, 660076 markings/sec, 130 secs
lola: 100185428 markings, 194325644 edges, 718608 markings/sec, 135 secs
lola: 103685081 markings, 201228459 edges, 699931 markings/sec, 140 secs
lola: 107260638 markings, 208331471 edges, 715111 markings/sec, 145 secs
lola: 110876646 markings, 215477992 edges, 723202 markings/sec, 150 secs
lola: 114482001 markings, 222589599 edges, 721071 markings/sec, 155 secs
lola: 118101619 markings, 229739489 edges, 723924 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 240 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 240 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 240 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: 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-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 3 will run for 259 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: ========================================
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: ========================================
Ignoring fairness constraints (--fair).
lola: 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: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
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 259 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 281 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: state equation: write sara problem file to Kanban-PT-1000-CTLCardinality-4.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 5 will run for 306 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 337 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: write sara problem file to Kanban-PT-1000-CTLCardinality-6.sara
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 281 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 281 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).
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 306 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 337 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 337 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 374 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: state equation: calling and running sara
sara: try reading problem file Kanban-PT-1000-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
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 374 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 374 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: 3661305 markings, 11044026 edges, 732261 markings/sec, 0 secs
lola: 7196153 markings, 21900476 edges, 706970 markings/sec, 5 secs
lola: 10379088 markings, 31695779 edges, 636587 markings/sec, 10 secs
lola: 13659208 markings, 41801327 edges, 656024 markings/sec, 15 secs
lola: 16819015 markings, 51542581 edges, 631961 markings/sec, 20 secs
lola: 19912060 markings, 61084135 edges, 618609 markings/sec, 25 secs
lola: 23168221 markings, 71122275 edges, 651232 markings/sec, 30 secs
lola: 26430976 markings, 81182642 edges, 652551 markings/sec, 35 secs
lola: 29507668 markings, 90712644 edges, 615338 markings/sec, 40 secs
lola: 32589472 markings, 100270346 edges, 616361 markings/sec, 45 secs
lola: 35644230 markings, 109751487 edges, 610952 markings/sec, 50 secs
lola: 38692668 markings, 119220759 edges, 609688 markings/sec, 55 secs
lola: 41718739 markings, 128617683 edges, 605214 markings/sec, 60 secs
lola: 44707476 markings, 137909784 edges, 597747 markings/sec, 65 secs
lola: 47685188 markings, 147171016 edges, 595542 markings/sec, 70 secs
lola: 50633512 markings, 156341787 edges, 589665 markings/sec, 75 secs
lola: 53548690 markings, 165419110 edges, 583036 markings/sec, 80 secs
lola: 56438851 markings, 174417022 edges, 578032 markings/sec, 85 secs
lola: 59226247 markings, 183099169 edges, 557479 markings/sec, 90 secs
lola: 61982487 markings, 191674815 edges, 551248 markings/sec, 95 secs
lola: 64751945 markings, 200310768 edges, 553892 markings/sec, 100 secs
lola: 67455230 markings, 208741902 edges, 540657 markings/sec, 105 secs
lola: 70182307 markings, 217240740 edges, 545415 markings/sec, 110 secs
lola: 72926125 markings, 225794490 edges, 548764 markings/sec, 115 secs
lola: 75696116 markings, 234427006 edges, 553998 markings/sec, 120 secs
lola: 78372969 markings, 242765897 edges, 535371 markings/sec, 125 secs
lola: 81130469 markings, 251366007 edges, 551500 markings/sec, 130 secs
lola: 83864284 markings, 259896332 edges, 546763 markings/sec, 135 secs
lola: 86674136 markings, 268658633 edges, 561970 markings/sec, 140 secs
lola: 89417256 markings, 277221596 edges, 548624 markings/sec, 145 secs
lola: 92214230 markings, 285949812 edges, 559395 markings/sec, 150 secs
lola: 94873873 markings, 294250331 edges, 531929 markings/sec, 155 secs
lola: 97647606 markings, 302912097 edges, 554747 markings/sec, 160 secs
lola: 100409042 markings, 311531648 edges, 552287 markings/sec, 165 secs
lola: 103076693 markings, 319858387 edges, 533530 markings/sec, 170 secs
lola: 105836718 markings, 328476839 edges, 552005 markings/sec, 175 secs
lola: 108609256 markings, 337134201 edges, 554508 markings/sec, 180 secs
lola: 111338497 markings, 345659267 edges, 545848 markings/sec, 185 secs
lola: 113999781 markings, 353976383 edges, 532257 markings/sec, 190 secs
lola: 116677448 markings, 362340567 edges, 535533 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 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: 1700860 markings, 6764650 edges, 340172 markings/sec, 0 secs
lola: 3522726 markings, 14141368 edges, 364373 markings/sec, 5 secs
lola: 5500103 markings, 22191898 edges, 395475 markings/sec, 10 secs
lola: 7496491 markings, 30315331 edges, 399278 markings/sec, 15 secs
lola: 9455855 markings, 38313600 edges, 391873 markings/sec, 20 secs
lola: 11422902 markings, 46333164 edges, 393409 markings/sec, 25 secs
lola: 13387775 markings, 54354678 edges, 392975 markings/sec, 30 secs
lola: 15329278 markings, 62274520 edges, 388301 markings/sec, 35 secs
lola: 17284671 markings, 70258397 edges, 391079 markings/sec, 40 secs
lola: 19127077 markings, 77787906 edges, 368481 markings/sec, 45 secs
lola: 21049545 markings, 85638455 edges, 384494 markings/sec, 50 secs
lola: 22955692 markings, 93423784 edges, 381229 markings/sec, 55 secs
lola: 24685559 markings, 100483532 edges, 345973 markings/sec, 60 secs
lola: 26548686 markings, 108096232 edges, 372625 markings/sec, 65 secs
lola: 28406909 markings, 115707982 edges, 371645 markings/sec, 70 secs
lola: 30093820 markings, 122623645 edges, 337382 markings/sec, 75 secs
lola: 31936786 markings, 130180360 edges, 368593 markings/sec, 80 secs
lola: 33722972 markings, 137511332 edges, 357237 markings/sec, 85 secs
lola: 35555867 markings, 145032949 edges, 366579 markings/sec, 90 secs
lola: 37383408 markings, 152537411 edges, 365508 markings/sec, 95 secs
lola: 39249328 markings, 160199559 edges, 373184 markings/sec, 100 secs
lola: 40974327 markings, 167284193 edges, 345000 markings/sec, 105 secs
lola: 42789235 markings, 174733903 edges, 362982 markings/sec, 110 secs
lola: 44596413 markings, 182160827 edges, 361436 markings/sec, 115 secs
lola: 46420023 markings, 189655736 edges, 364722 markings/sec, 120 secs
lola: 48239605 markings, 197135156 edges, 363916 markings/sec, 125 secs
lola: 50050676 markings, 204580058 edges, 362214 markings/sec, 130 secs
lola: 51812178 markings, 211820589 edges, 352300 markings/sec, 135 secs
lola: 53598090 markings, 219171111 edges, 357182 markings/sec, 140 secs
lola: 55404881 markings, 226604811 edges, 361358 markings/sec, 145 secs
lola: 57204299 markings, 234005122 edges, 359884 markings/sec, 150 secs
lola: 58994497 markings, 241371527 edges, 358040 markings/sec, 155 secs
lola: 60710488 markings, 248432309 edges, 343198 markings/sec, 160 secs
lola: 62508067 markings, 255822126 edges, 359516 markings/sec, 165 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 374 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 427 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 427 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: lola: ========================================The net violates the given property already in its initial state.

lola: ========================================
lola: subprocess 10 will run for 499 seconds at most (--localtimelimit=-1)
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: 4052034 markings, 8469522 edges, 2272509390072315904 markings/sec, 0 secs
lola: 8133394 markings, 17148832 edges, 816272 markings/sec, 5 secs
lola: 12137937 markings, 25660353 edges, 800909 markings/sec, 10 secs
lola: 15996742 markings, 33908545 edges, 771761 markings/sec, 15 secs
lola: 19854469 markings, 42162003 edges, 771545 markings/sec, 20 secs
lola: 23722997 markings, 50440049 edges, 773706 markings/sec, 25 secs
lola: 27534495 markings, 58610982 edges, 762300 markings/sec, 30 secs
lola: 31192449 markings, 66449703 edges, 731591 markings/sec, 35 secs
lola: 35004219 markings, 74613883 edges, 762354 markings/sec, 40 secs
lola: 38732170 markings, 82634968 edges, 745590 markings/sec, 45 secs
lola: 42501443 markings, 90736573 edges, 753855 markings/sec, 50 secs
lola: 46245345 markings, 98779637 edges, 748780 markings/sec, 55 secs
lola: 50013851 markings, 106868067 edges, 753701 markings/sec, 60 secs
lola: 53745250 markings, 114885609 edges, 746280 markings/sec, 65 secs
lola: 57352938 markings, 122663640 edges, 721538 markings/sec, 70 secs
lola: 61041882 markings, 130600417 edges, 737789 markings/sec, 75 secs
lola: 64684483 markings, 138450935 edges, 728520 markings/sec, 80 secs
lola: 68344553 markings, 146323185 edges, 732014 markings/sec, 85 secs
lola: 71989590 markings, 154181899 edges, 729007 markings/sec, 90 secs
lola: 75684778 markings, 162125334 edges, 739038 markings/sec, 95 secs
lola: 79330367 markings, 169969976 edges, 729118 markings/sec, 100 secs
lola: 82821218 markings, 177501190 edges, 698170 markings/sec, 105 secs
lola: 86478375 markings, 185397574 edges, 731431 markings/sec, 110 secs
lola: 90135947 markings, 193284058 edges, 731514 markings/sec, 115 secs
lola: 93667884 markings, 200899658 edges, 706387 markings/sec, 120 secs
lola: 97298807 markings, 208734398 edges, 726185 markings/sec, 125 secs
lola: 100938420 markings, 216575283 edges, 727923 markings/sec, 130 secs
lola: 104457022 markings, 224152949 edges, 703720 markings/sec, 135 secs
lola: 108048520 markings, 231897448 edges, 718300 markings/sec, 140 secs
lola: 111662769 markings, 239714783 edges, 722850 markings/sec, 145 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 473 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 5679830 markings, 10602135 edges, 3095587851706826752 markings/sec, 0 secs
lola: 9962340 markings, 21121897 edges, 856502 markings/sec, 5 secs
lola: 14953521 markings, 31523341 edges, 998236 markings/sec, 10 secs
lola: 18800479 markings, 40934761 edges, 769392 markings/sec, 15 secs
lola: 23185229 markings, 51106535 edges, 876950 markings/sec, 20 secs
lola: 27493667 markings, 60971124 edges, 861688 markings/sec, 25 secs
lola: 32079897 markings, 71236264 edges, 917246 markings/sec, 30 secs
lola: 35397097 markings, 79755233 edges, 663440 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 559 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 559 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: ========================================
lola: subprocess 12 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Pback1 <= Pm1) U E (F ((P4 <= Pm1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
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 932 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: 4406772 markings, 8142991 edges, 3689348869717491712 markings/sec, 0 secs
lola: 8308417 markings, 15542390 edges, 780329 markings/sec, 5 secs
lola: 12118389 markings, 22806469 edges, 761994 markings/sec, 10 secs
lola: 16022124 markings, 30309618 edges, 780747 markings/sec, 15 secs
lola: 20182185 markings, 38218146 edges, 832012 markings/sec, 20 secs
lola: 23661730 markings, 44874634 edges, 695909 markings/sec, 25 secs
lola: 27468545 markings, 52129945 edges, 761363 markings/sec, 30 secs
lola: 31444953 markings, 59722540 edges, 795282 markings/sec, 35 secs
lola: 35376568 markings, 67323495 edges, 786323 markings/sec, 40 secs
lola: 39390469 markings, 75093380 edges, 802780 markings/sec, 45 secs
lola: 42977734 markings, 82005539 edges, 717453 markings/sec, 50 secs
lola: 46387736 markings, 88580935 edges, 682000 markings/sec, 55 secs
lola: 49881289 markings, 95338622 edges, 698711 markings/sec, 60 secs
lola: 53361272 markings, 102160601 edges, 695997 markings/sec, 65 secs
lola: 56715597 markings, 108716799 edges, 670865 markings/sec, 70 secs
lola: 59912982 markings, 114993382 edges, 639477 markings/sec, 75 secs
lola: 63390983 markings, 121770515 edges, 695600 markings/sec, 80 secs
lola: 66778356 markings, 128432122 edges, 677475 markings/sec, 85 secs
lola: 69961228 markings, 134741847 edges, 636574 markings/sec, 90 secs
lola: 73154433 markings, 141030157 edges, 638641 markings/sec, 95 secs
lola: 76864617 markings, 148307534 edges, 742037 markings/sec, 100 secs
lola: 80595544 markings, 155696378 edges, 746185 markings/sec, 105 secs
lola: 83979557 markings, 162421082 edges, 676803 markings/sec, 110 secs
lola: 87415435 markings, 169160103 edges, 687176 markings/sec, 115 secs
lola: 90916417 markings, 176056270 edges, 700196 markings/sec, 120 secs
lola: 94413266 markings, 182964952 edges, 699370 markings/sec, 125 secs
lola: 97999823 markings, 190007725 edges, 717311 markings/sec, 130 secs
lola: 101650301 markings, 197222353 edges, 730096 markings/sec, 135 secs
lola: 105111059 markings, 204070334 edges, 692152 markings/sec, 140 secs
lola: 108655838 markings, 211083721 edges, 708956 markings/sec, 145 secs
lola: 112318892 markings, 218343715 edges, 732611 markings/sec, 150 secs
lola: 115994058 markings, 225574001 edges, 735033 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1316 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 1316 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: subprocess 15 will run for 2631 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: 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: SUBRESULT
lola: lola: result: yes
lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2631 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 1494622377212

--------------------
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="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/Kanban-PT-1000.tgz
mv 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 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 r038-blw7-149440484600138"
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 ;