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-2979
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 r062kn-blw3-146358896800165
=====================================================================

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

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Kanban-PT-1000
FORMULA Kanban-PT-1000-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-5 CANNOT_COMPUTE
FORMULA Kanban-PT-1000-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-12 CANNOT_COMPUTE
FORMULA Kanban-PT-1000-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Kanban-PT-1000-CTLCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: read: AG (EX (Pback1 <= Pout1)) : EF (A(Pm3 <= Pback3 U 3 <= Pback1)) : AG (EX ((Pm2 <= P1 AND Pback1 <= Pm1))) : EX (EF ((3 <= Pm1 AND Pm2 <= P4))) : (Pback2 <= P2 AND !(AG ((Pback3 <= Pm3 OR Pm4 <= P4)))) : EF (A(3 <= P2 U P4 <= Pm1)) : AG ((P2 <= P3 OR !(3 <= P4))) : (Pout2 <= Pback1 AND !(EF ((P4 <= Pm3 AND 2 <= Pout2)))) : EX (E(Pout4 <= Pm4 U 2 <= Pback1)) : !(EF (AX (3 <= Pout1))) : ((E(1 <= P2 U... (shortened)
lola: formula length: 831
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (Pback1 + -Pout1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(Pback1 + -Pout1 <= 0))))
lola: processed formula length: 40
lola: 231 rewrites
lola: formula mentions 2 of 16 places; total mentions: 2
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (A(-Pback3 + Pm3 <= 0 U -Pback1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(-Pback3 + Pm3 <= 0 U -Pback1 <= -3))
lola: processed formula length: 47
lola: 231 rewrites
lola: formula mentions 3 of 16 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX ((Pm2 + -P1 <= 0 AND Pback1 + -Pm1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX((Pm2 + -P1 <= 0 AND Pback1 + -Pm1 <= 0)))))
lola: processed formula length: 59
lola: 231 rewrites
lola: formula mentions 4 of 16 places; total mentions: 4
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EF ((-Pm1 <= -3 AND Pm2 + -P4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (-Pm1 <= -3 AND Pm2 + -P4 <= 0)))
lola: processed formula length: 45
lola: 231 rewrites
lola: formula mentions 3 of 16 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pback2 + -P2 <= 0 AND EF ((Pback3 + -Pm3 > 0 AND -P4 + Pm4 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: Pback2 + -P2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Pback3 + -Pm3 > 0 AND -P4 + Pm4 > 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (A(-P2 <= -3 U -Pm1 + P4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(-P2 <= -3 U -Pm1 + P4 <= 0))
lola: processed formula length: 39
lola: 231 rewrites
lola: formula mentions 3 of 16 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P3 + P2 <= 0 OR -P4 > -3))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Pback1 + Pout2 <= 0 AND AG ((-Pm3 + P4 > 0 OR -Pout2 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Pback1 + Pout2 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Pm3 + P4 > 0 OR -Pout2 > -2))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(Pout4 + -Pm4 <= 0 U -Pback1 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(Pout4 + -Pm4 <= 0 U -Pback1 <= -2))
lola: processed formula length: 40
lola: 231 rewrites
lola: formula mentions 3 of 16 places; total mentions: 3
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-Pout1 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-Pout1 > -3))))
lola: processed formula length: 31
lola: 231 rewrites
lola: formula mentions 1 of 16 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-P2 <= -1 U -Pback3 <= -3) AND (EF ((Pback1 + -Pout2 <= 0 AND -Pback1 + P1 <= 0)) AND E((-Pback3 + Pback1 <= 0 AND -P3 + Pout3 <= 0) U -Pback2 + Pm1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-P2 <= -1 U -Pback3 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-P2 <= -1 U -Pback3 <= -3)
lola: processed formula length: 28
lola: 230 rewrites
lola: formula mentions 2 of 16 places; total mentions: 2
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Pback1 + -Pout2 <= 0 AND -Pback1 + P1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-Pback3 + Pback1 <= 0 AND -P3 + Pout3 <= 0) U -Pback2 + Pm1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-Pback3 + Pback1 <= 0 AND -P3 + Pout3 <= 0) U -Pback2 + Pm1 <= 0)
lola: processed formula length: 68
lola: 230 rewrites
lola: formula mentions 6 of 16 places; total mentions: 6
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX (-Pout2 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX(-Pout2 > -3))))
lola: processed formula length: 31
lola: 231 rewrites
lola: formula mentions 1 of 16 places; total mentions: 1
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Pback2 + Pm3 > 0 OR -Pback3 + Pm1 > 0) R (-P4 > -1 OR -Pback3 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((-Pback2 + Pm3 > 0 OR -Pback3 + Pm1 > 0)) U !((-P4 > -1 OR -Pback3 > -2))))
lola: processed formula length: 81
lola: 230 rewrites
lola: formula mentions 5 of 16 places; total mentions: 6
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1034 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Pback3 + P1 > 0 AND -P4 > -2) R (-Pout1 > -3 OR Pback3 + -Pm2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((-Pback3 + P1 > 0 AND -P4 > -2)) U !((-Pout1 > -3 OR Pback3 + -Pm2 > 0))))
lola: processed formula length: 80
lola: 230 rewrites
lola: formula mentions 5 of 16 places; total mentions: 6
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-Pback2 + P4 <= 0) OR Pback1 + -Pm1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Pback2 + P4 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3091 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Kanban-PT-1000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: no yes no yes yes unknown yes no yes no yes no unknown no yes yes
lola: ========================================

BK_STOP 1463599089856

--------------------
content from 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="/home/hulinhub/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-2979"
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 r062kn-blw3-146358896800165"
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 ;