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 CircadianClock-PT-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014kn-qhx2-146347846200030
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463481446995

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ CircadianClock-PT-001000
FORMULA CircadianClock-PT-001000-CTLCardinality-0 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-3 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-6 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-7 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-9 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-11 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-001000-CTLCardinality-13 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-14 CANNOT_COMPUTE
FORMULA CircadianClock-PT-001000-CTLCardinality-15 CANNOT_COMPUTE
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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-001000-CTLCardinality.task
lola: read: !(EF (AF (2 <= da))) : (E(1 <= ma_cap U !(c_cap <= c_cap)) OR !((!((c_cap <= mr_cap OR r <= dr_a)) OR da_a <= mr_cap))) : AG (((2 <= dr OR !(r_cap <= c)) AND (dr_a <= r_cap OR a_cap <= dr_a))) : AX (EF ((a <= ma AND 2 <= da))) : EF (ma_cap <= dr) : (AG (AX (da_a <= r_cap)) AND AG (EF (a <= r))) : EF ((EX (2 <= da_a) AND ((mr <= a OR c_cap <= da_a) OR (da <= ma_cap AND dr_a <= c)))) : E(((3 <= c OR... (shortened)
lola: formula length: 1051
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 (EG (-da > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(-da > -2))))))
lola: processed formula length: 40
lola: 272 rewrites
lola: formula mentions 1 of 14 places; total mentions: 1
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((c_cap + -mr_cap <= 0 OR -dr_a + r <= 0) AND da_a + -mr_cap > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-dr <= -2 OR r_cap + -c > 0) AND (-r_cap + dr_a <= 0 OR a_cap + -dr_a <= 0)))
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 28 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: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF ((-ma + a <= 0 AND -da <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (-ma + a <= 0 AND -da <= -2)))
lola: processed formula length: 42
lola: 272 rewrites
lola: formula mentions 3 of 14 places; total mentions: 3
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 4 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (ma_cap + -dr <= 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 28 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 5 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AX (-r_cap + da_a <= 0) AND EF (-r + a <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((AX(-r_cap + da_a <= 0) AND E(TRUE U -r + a <= 0)))))
lola: processed formula length: 66
lola: 273 rewrites
lola: formula mentions 4 of 14 places; total mentions: 4
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EX (-da_a <= -2) AND (mr + -a <= 0 OR (-da_a + c_cap <= 0 OR (-ma_cap + da <= 0 AND dr_a + -c <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX(-da_a <= -2) AND (mr + -a <= 0 OR (-da_a + c_cap <= 0 OR (-ma_cap + da <= 0 AND dr_a + -c <= 0)))))
lola: processed formula length: 112
lola: 272 rewrites
lola: formula mentions 8 of 14 places; total mentions: 9
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 7 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-c_cap <= -2))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(-c_cap <= -2))))
lola: processed formula length: 38
lola: 272 rewrites
lola: formula mentions 1 of 14 places; total mentions: 1
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AF (-ma <= -1) AND -c_cap <= -1) OR (-ma_cap + dr_a > 0 OR EF (-mr_cap > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-ma <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -ma <= -1)
lola: processed formula length: 19
lola: 271 rewrites
lola: formula mentions 1 of 14 places; total mentions: 1
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 9 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ma_cap + dr_a > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-mr_cap > -3)
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 28 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 9 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-a_cap <= -1 AND -c <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((-a_cap <= -1 AND -c <= -3)))))
lola: processed formula length: 53
lola: 272 rewrites
lola: formula mentions 2 of 14 places; total mentions: 2
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 10 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-dr <= -1 AND -da_a <= -2) OR ((ma_cap + -mr_cap <= 0 AND -da_a <= -2) OR (-c <= -3 OR -ma_cap <= -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 28 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: subprocess 11 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-ma_cap > -2 OR r_cap + -r > 0) U AG (-r <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-ma_cap > -2 OR r_cap + -r > 0) U !(E(TRUE U !(-r <= -2))))
lola: processed formula length: 62
lola: 272 rewrites
lola: formula mentions 3 of 14 places; total mentions: 4
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 12 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-r_cap + mr_cap <= 0 OR ((-a_cap > -1 OR -a_cap + mr_cap > 0) AND AF (-c_cap <= -2))) AND (AG (r_cap + -r > 0) AND EF ((r_cap + -dr_a <= 0 OR -mr <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -r_cap + mr_cap <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (r_cap + -r > 0)
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 28 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 13 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-a_cap + r <= 0 AND -r_cap + c <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((-a_cap + r <= 0 AND -r_cap + c <= 0)))))
lola: processed formula length: 63
lola: 272 rewrites
lola: formula mentions 4 of 14 places; total mentions: 4
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 14 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((EF (-ma <= -2) AND EG (-a_cap + c <= 0)) OR EX (-ma <= -2)) AND AX (EF (-da_a <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-ma <= -2)
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 28 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 15 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-a_cap + c <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-a_cap + c <= 0)))
lola: processed formula length: 31
lola: 271 rewrites
lola: formula mentions 2 of 14 places; total mentions: 2
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF (-da_a <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U -da_a <= -2))
lola: processed formula length: 25
lola: 272 rewrites
lola: formula mentions 1 of 14 places; total mentions: 1
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (c_cap + -mr_cap > 0))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(c_cap + -mr_cap > 0))))
lola: processed formula length: 45
lola: 272 rewrites
lola: formula mentions 2 of 14 places; total mentions: 2
lola: closed formula file CircadianClock-PT-001000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: RESULT
lola: summary: unknown no no unknown yes no unknown unknown yes unknown no unknown no unknown unknown unknown

BK_STOP 1463483634105

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="CircadianClock-PT-001000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 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 CircadianClock-PT-001000, 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 r014kn-qhx2-146347846200030"
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 ;