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

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

=== Now, execution of the tool begins

BK_START 1463489026973

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3539
CTLCardinality @ CircularTrains-PT-012
FORMULA CircularTrains-PT-012-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 12 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-012-CTLCardinality.task
lola: read: Section_5 <= Section_12 : EF ((2 <= F12 OR EG (1 <= Section_12))) : AG (A(F10 <= Section_2 U 2 <= Section_2)) : ((!(EX (F2 <= Section_1)) AND EG (!(F9 <= F11))) AND EF (EG (2 <= F10))) : ((AG ((F7 <= F5 AND F1 <= F12)) OR AG ((2 <= F5 AND 1 <= F5))) AND AG (((2 <= Section_10 AND 2 <= F8) OR !(Section_1 <= F3)))) : F9 <= F11 : (AF (AF (1 <= Section_2)) OR !(((!(3 <= Section_5) AND !(2 <= F12)) OR !... (shortened)
lola: formula length: 697
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Section_12 + Section_5 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLCardinality.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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-F12 <= -2 OR EG (-Section_12 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (-F12 <= -2 OR !(A(TRUE U !(-Section_12 <= -1)))))
lola: processed formula length: 59
lola: 157 rewrites
lola: formula mentions 2 of 24 places; total mentions: 2
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (A(-Section_2 + F10 <= 0 U -Section_2 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(-Section_2 + F10 <= 0 U -Section_2 <= -2))))
lola: processed formula length: 59
lola: 157 rewrites
lola: formula mentions 2 of 24 places; total mentions: 3
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (-Section_1 + F2 > 0) AND (EG (-F11 + F9 > 0) AND EF (EG (-F10 <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Section_1 + F2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Section_1 + F2 > 0)
lola: processed formula length: 23
lola: 156 rewrites
lola: formula mentions 2 of 24 places; total mentions: 2
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG ((F7 + -F5 <= 0 AND -F12 + F1 <= 0)) OR AG ((-F5 <= -2 AND -F5 <= -1))) AND AG (((-Section_10 <= -2 AND -F8 <= -2) OR Section_1 + -F3 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((F7 + -F5 <= 0 AND -F12 + F1 <= 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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-F5 <= -2 AND -F5 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -F11 + F9 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-Section_2 <= -1) OR ((-Section_5 <= -3 OR -F12 <= -2) AND (-Section_7 <= -1 AND -Section_3 + F6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Section_2 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Section_2 <= -1)
lola: processed formula length: 26
lola: 156 rewrites
lola: formula mentions 1 of 24 places; total mentions: 1
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(Section_10 + -Section_1 <= 0 U (-F11 + F8 > 0 OR -Section_4 + F8 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(Section_10 + -Section_1 <= 0 U (-F11 + F8 > 0 OR -Section_4 + F8 > 0))
lola: processed formula length: 72
lola: 156 rewrites
lola: formula mentions 5 of 24 places; total mentions: 6
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-F12 + F10 <= 0 OR -F6 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Section_5 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-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 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-F4 > -3 OR (-F6 > -1 OR -Section_2 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-F4 > -3 OR (-F6 > -1 OR -Section_2 > -3)))
lola: processed formula length: 53
lola: 156 rewrites
lola: formula mentions 3 of 24 places; total mentions: 3
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (Section_2 + -F9 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U Section_2 + -F9 > 0))
lola: processed formula length: 39
lola: 157 rewrites
lola: formula mentions 2 of 24 places; total mentions: 2
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Section_11 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-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 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Section_1 > -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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -F2 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -F8 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: RESULT
lola: summary: yes no no no no yes yes yes no no yes yes no yes no no

BK_STOP 1463489027248

--------------------
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="CircularTrains-PT-012"
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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 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 CircularTrains-PT-012, 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-146347846200057"
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 ;