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 S_SwimmingPool-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194kn-qhx2-146444258300579
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465120856167

bkconf 3600
===========================================================================================
===========================================================================================
S_SwimmingPool-PT-02: translating Petri net model.pnml into LoLA format
S_SwimmingPool-PT-02: translating formula CTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3540
CTLCardinality @ S_SwimmingPool-PT-02
FORMULA SwimmingPool-PT-02-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-02-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: 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-02-CTLCardinality.task
lola: read: AG (EF (!(3 <= Bags))) : E(1 <= Dress U AG (Bags <= Bags)) : !(AG (AG (Dressed <= Bags))) : E(EF (1 <= Out) U EG (Out <= Undress)) : !(!(!(AG (WaitBag <= WaitBag)))) : AG (!((!(3 <= WaitBag) AND (1 <= WaitBag AND Out <= Cabins)))) : (A((1 <= Out AND 1 <= Out) U 2 <= InBath) OR AF (AG (2 <= Cabins))) : (EF (AX (Bags <= Entered)) AND (Dress <= Undress OR (1 <= Cabins OR EX (Entered <= Out)))) : AG (... (shortened)
lola: formula length: 946
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 (EF (-Bags > -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Bags > -3))))
lola: processed formula length: 36
lola: 215 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-02-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 233 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 SwimmingPool-PT-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Dressed + -Bags > 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 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-Out <= -1) U EG (Out + -Undress <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -Out <= -1) U !(A(TRUE U !(Out + -Undress <= 0))))
lola: processed formula length: 61
lola: 216 rewrites
lola: formula mentions 2 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-02-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 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SwimmingPool-PT-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-WaitBag <= -3 OR (-WaitBag > -1 OR Out + -Cabins > 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 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A((-Out <= -1 AND -Out <= -1) U -InBath <= -2) OR AF (AG (-Cabins <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Out <= -1 AND -Out <= -1) U -InBath <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-Out <= -1 AND -Out <= -1) U -InBath <= -2)
lola: processed formula length: 46
lola: 214 rewrites
lola: formula mentions 2 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-02-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 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-Cabins <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-Cabins <= -2))))
lola: processed formula length: 39
lola: 215 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-02-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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AX (Bags + -Entered <= 0)) AND (Dress + -Undress <= 0 OR (-Cabins <= -1 OR EX (-Out + Entered <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (Bags + -Entered <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(Bags + -Entered <= 0))
lola: processed formula length: 34
lola: 215 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-02-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 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: Dress + -Undress <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-02-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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX ((Dressed + -Bags <= 0 OR -Undress <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX((Dressed + -Bags <= 0 OR -Undress <= -2)))))
lola: processed formula length: 60
lola: 215 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-02-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 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Entered + Dress <= 0 OR (-Bags <= -3 OR (-WaitBag <= -2 OR -Dressed + Dress <= 0))) U (-WaitBag <= -1 AND (-Dress + Undress <= 0 AND (Out + -WaitBag <= 0 OR -Bags <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-Entered + Dress <= 0 OR (-Bags <= -3 OR (-WaitBag <= -2 OR -Dressed + Dress <= 0))) U (-WaitBag <= -1 AND (-Dress + Undress <= 0 AND (Out + -WaitBag <= 0 OR -Bags <= -1))))
lola: processed formula length: 176
lola: 214 rewrites
lola: formula mentions 7 of 9 places; total mentions: 12
lola: closed formula file SwimmingPool-PT-02-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 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Bags > -2 OR (-Bags + Entered > 0 AND -Out > -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 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 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((AG (-Cabins <= -2) OR -Dressed + Out <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((!(E(TRUE U !(-Cabins <= -2))) OR -Dressed + Out <= 0))
lola: processed formula length: 58
lola: 215 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-02-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 12 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-Out + Dress <= 0 OR (Entered + -InBath <= 0 AND -Bags <= -1)) U (-Entered <= -3 AND (Dressed + -Out <= 0 AND Out + -InBath <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-Out + Dress <= 0 OR (Entered + -InBath <= 0 AND -Bags <= -1)) U (-Entered <= -3 AND (Dressed + -Out <= 0 AND Out + -InBath <= 0)))
lola: processed formula length: 134
lola: 214 rewrites
lola: formula mentions 6 of 9 places; total mentions: 10
lola: closed formula file SwimmingPool-PT-02-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 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(-Bags + WaitBag <= 0 U Cabins + -Entered <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(-Bags + WaitBag <= 0 U Cabins + -Entered <= 0))))
lola: processed formula length: 64
lola: 215 rewrites
lola: formula mentions 4 of 9 places; total mentions: 4
lola: closed formula file SwimmingPool-PT-02-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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: subprocess 14 will run for 1696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EG ((-Dressed + Dress <= 0 OR -Dressed <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(A(TRUE U !((-Dressed + Dress <= 0 OR -Dressed <= -3)))))))
lola: processed formula length: 73
lola: 215 rewrites
lola: formula mentions 2 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-02-CTLCardinality.task
lola: 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Dressed <= -1))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Dressed <= -1))))
lola: processed formula length: 40
lola: 215 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-02-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: RESULT
lola: summary: yes yes yes yes no no no yes no yes yes no yes no no yes
lola: ========================================

BK_STOP 1465121033890

--------------------
content from stderr:

parsing of model.pnml complete

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_SwimmingPool-PT-02"
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/S_SwimmingPool-PT-02.tgz
mv S_SwimmingPool-PT-02 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 S_SwimmingPool-PT-02, 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 r194kn-qhx2-146444258300579"
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 ;