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 SwimmingPool-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368200435
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463808151820

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SwimmingPool-PT-09
FORMULA SwimmingPool-PT-09-CTLCardinality-0 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-09-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-6 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-09-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-9 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-09-CTLCardinality-10 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-09-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-CTLCardinality-13 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-09-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-09-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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-09-CTLCardinality.task
lola: read: AG (!((!(Out <= WaitBag) AND (1 <= Out AND Out <= WaitBag)))) : EF (!(AG (Undress <= Out))) : AX (AG ((Bags <= Out OR 3 <= Entered))) : EF ((!(InBath <= Out) AND 2 <= Cabins)) : AF (EX ((1 <= InBath OR Bags <= Dressed))) : !(((((2 <= Dressed OR 2 <= Out) AND (2 <= Out AND InBath <= Entered)) AND 1 <= Dress) OR EF (!(3 <= Bags)))) : (EG (AF (WaitBag <= Undress)) OR ((EG (Dress <= InBath) AND !(Ente... (shortened)
lola: formula length: 1144
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 ((Out + -WaitBag <= 0 OR (-Out > -1 OR Out + -WaitBag > 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 24 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: 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: EF (-Out + Undress > 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 24 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG ((-Out + Bags <= 0 OR -Entered <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !((-Out + Bags <= 0 OR -Entered <= -3)))))
lola: processed formula length: 56
lola: 273 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Out + InBath > 0 AND -Cabins <= -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 24 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX ((-InBath <= -1 OR -Dressed + Bags <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((-InBath <= -1 OR -Dressed + Bags <= 0)))
lola: processed formula length: 53
lola: 273 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-Dressed > -2 AND -Out > -2) OR (-Out > -2 OR (-Entered + InBath > 0 OR -Dress > -1))) AND AG (-Bags <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-Dressed > -2 AND -Out > -2) OR (-Out > -2 OR (-Entered + InBath > 0 OR -Dress > -1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Bags <= -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 24 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 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (AF (WaitBag + -Undress <= 0)) OR ((EG (Dress + -InBath <= 0) AND -WaitBag + Entered > 0) OR (Cabins + -Entered <= 0 AND -Entered + Dress > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (WaitBag + -Undress <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U WaitBag + -Undress <= 0))))
lola: processed formula length: 49
lola: 273 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (Cabins + -Undress > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(Cabins + -Undress > 0))))
lola: processed formula length: 41
lola: 273 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 8 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG ((-Dress <= -3 OR -Dressed + WaitBag <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !((-Dress <= -3 OR -Dressed + WaitBag <= 0)))))
lola: processed formula length: 61
lola: 273 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (Bags + -WaitBag <= 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U Bags + -WaitBag <= 0))))
lola: processed formula length: 46
lola: 273 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 10 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (-Bags + WaitBag > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(-Bags + WaitBag > 0))
lola: processed formula length: 33
lola: 273 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: subprocess 11 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-Cabins + InBath <= 0) AND AF (-InBath <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Cabins + InBath <= 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 24 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 12 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Undress <= -1 OR (((-Dressed + Bags <= 0 AND -Cabins + Dress > 0) OR EG (WaitBag + -InBath <= 0)) AND (AF (-Out + InBath <= 0) OR AF (Cabins + -WaitBag <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Undress <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Dressed + Bags <= 0 AND -Cabins + Dress > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (WaitBag + -InBath <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(WaitBag + -InBath <= 0)))
lola: processed formula length: 38
lola: 272 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-Undress > -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 !(-Undress > -3))))
lola: processed formula length: 39
lola: 273 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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 14 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Out + -Entered > 0 OR -Out + WaitBag > 0) AND -Out + Undress <= 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 24 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 15 will run for 1414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AX (-Dress + Undress > 0) OR EF (-Cabins + WaitBag > 0)) AND Out + -Undress > 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Dress + Undress > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Dress + Undress > 0)
lola: processed formula length: 24
lola: 272 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
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: Out + -Undress > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: unknown yes no yes yes no unknown no no unknown unknown no no unknown no unknown

BK_STOP 1463810277189

--------------------
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="SwimmingPool-PT-09"
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/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 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 SwimmingPool-PT-09, 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 r122kn-qhx2-146373368200435"
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 ;