About the Execution of LoLa for Solitaire-PT-SqrCT5x5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
115.300 | 350.00 | 70.00 | 0.00 | TFFFTFFFFTFTFTFF | normal |
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 Solitaire-PT-SqrCT5x5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368000302
=====================================================================
--------------------
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 Solitaire-PT-SqrCT5x5-LTLCardinality-0
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-1
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-10
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-11
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-12
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-13
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-14
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-15
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-2
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-3
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-4
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-5
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-6
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-7
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-8
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463787798049
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ Solitaire-PT-SqrCT5x5
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Solitaire-PT-SqrCT5x5-LTLCardinality-15 FALSE 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: 135/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 51 places, 84 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-SqrCT5x5-LTLCardinality.task
lola: read: AT25 <= T24 : AF (X (X (X (1 <= T55)))) : AF (F ((1 <= F23 U 3 <= F44))) : AF25 <= F55 : AG (F26 <= F52) : AX (F62 <= F24) : A(X (1 <= F55) U F (F (T52 <= F46))) : AF (X ((T34 <= T43 U T24 <= T62))) : AG ((G (F44 <= F35) U G (1 <= T52))) : AX (F (F (T22 <= T32))) : A(G (3 <= F35) U 3 <= F23) : A((1 <= F36 U T65 <= F56) U X (X (1 <= T25))) : AX (T52 <= counter) : AX (F ((F42 <= F32 U T24 <= F62))) ... (shortened)
lola: formula length: 455
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: T25 + -T24 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Solitaire-PT-SqrCT5x5-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (X (X (-T55 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-F23 <= -1 U -F44 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -F55 + F25 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Solitaire-PT-SqrCT5x5-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-F52 + F26 <= 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 104 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F62 + -F24 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(F62 + -F24 <= 0)
lola: processed formula length: 19
lola: 97 rewrites
lola: formula mentions 2 of 51 places; total mentions: 2
lola: closed formula file Solitaire-PT-SqrCT5x5-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (-F55 <= -1) U F (-F46 + T52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X ((-T43 + T34 <= 0 U -T62 + T24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((G (F44 + -F35 <= 0) U G (-T52 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (-T32 + T22 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (-F35 <= -3) U -F23 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-F36 <= -1 U -F56 + T65 <= 0) U X (X (-T25 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-counter + T52 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-counter + T52 <= 0)
lola: processed formula length: 23
lola: 97 rewrites
lola: formula mentions 2 of 51 places; total mentions: 2
lola: closed formula file Solitaire-PT-SqrCT5x5-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F ((F42 + -F32 <= 0 U -F62 + T24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (G (X (-F66 <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-F23 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola: summary: yes no no yes no yes no yes no no no no yes no no no
BK_STOP 1463787798399
--------------------
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="Solitaire-PT-SqrCT5x5"
export BK_EXAMINATION="LTLCardinality"
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/Solitaire-PT-SqrCT5x5.tgz
mv Solitaire-PT-SqrCT5x5 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 Solitaire-PT-SqrCT5x5, examination is LTLCardinality"
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-146373368000302"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;