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_QuasiCertifProtocol-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182kn-smll-146444115100083
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1464455972047

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


in benchkit_head lolaszeit 3540
UpperBounds @ S_QuasiCertifProtocol-PT-06
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-0 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-1 49 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-2 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-3 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 1 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-5 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-6 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 1 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-8 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-9 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 49 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 7 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-UpperBounds.task
lola: read: MAX(n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 - 0) : MAX(n9_2_0 + n9_1_0 + n9_0_0 + n9_0_1 + n9_1_1 + n9_2_1 + n9_3_1 + n9_3_0 + n9_4_0 + n9_5_0 + n9_6_0 + n9_1_2 + n9_2_2 + n9_3_2 + n9_4_2 + n9_4_1 + n9_5_1 + n9_6_1 + n9_0_2 + n9_3_3 + n9_2_3 + n9_5_3 + n9_4_3 + n9_6_2 + n9_5_2 + n9_1_3 + n9_0_3 + n9_4_4 + n9_3_4 + n9_6_4 + n9_5_4 + n9_0_4 + n9_6_3 + n9_2_4 + n9_1_4 + n9_6_5 + n9_0_6 + n9_4_... (shortened)
lola: formula length: 1691
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_6_6 + n9_6_5 + n9_6_4 + n9_6_3 + n9_6_2 + n9_6_1 + n9_6_0 + n9_5_6 + n9_5_5 + n9_5_4 + n9_5_3 + n9_5_2 + n9_5_1 + n9_5_0 + n9_1_0 + n9_1_1 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_1_2 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_6 + n9_1_5 + n9_1_4 + n9_1_3 + n9_0_6 + n9_0_5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 49
lola: The maximum value of the given expression is 49
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_6 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n4_6 + n4_5 + n4_4 + n4_3 + n4_2 + n4_1 + n4_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a5 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s5_6 + s5_5 + s5_4 + s5_3 + s5_2 + s5_1 + s5_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_6 + s4_5 + s4_4 + s4_3 + s4_2 + s4_1 + s4_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s2_0 + s2_1 + s2_2 + s2_3 + s2_4 + s2_5 + s2_6 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_3_6 + n7_3_5 + n7_3_4 + n7_3_3 + n7_3_2 + n7_3_1 + n7_2_6 + n7_2_5 + n7_2_4 + n7_2_3 + n7_2_2 + n7_2_1 + n7_1_6 + n7_1_5 + n7_1_4 + n7_1_3 + n7_1_2 + n7_1_1 + n7_0_6 + n7_0_5 + n7_0_4 + n7_0_3 + n7_0_2 + n7_0_1 + n7_0_0 + n7_1_0 + n7_2_0 + n7_3_0 + n7_4_0 + n7_5_0 + n7_6_6 + n7_6_5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 49
lola: The maximum value of the given expression is 49
lola: ========================================
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopOK_6 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 15 will run for 3517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 7
lola: The maximum value of the given expression is 7
lola: RESULT
lola: summary: 7 49 7 7 1 7 7 1 7 7 7 7 7 49 7 7
lola: ========================================

BK_STOP 1464455995169

--------------------
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_QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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_QuasiCertifProtocol-PT-06.tgz
mv S_QuasiCertifProtocol-PT-06 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_QuasiCertifProtocol-PT-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182kn-smll-146444115100083"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;