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 QuasiCertifProtocol-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300110
=====================================================================

--------------------
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-22-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1463705358876

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
UpperBounds @ QuasiCertifProtocol-PT-22
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-2 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-3 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-4 1 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-6 23 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-7 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-9 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-10 23 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-13 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-22-UpperBounds.task
lola: read: MAX(n3_22 + n3_21 + n3_20 + n3_14 + n3_15 + n3_12 + n3_13 + n3_18 + n3_19 + n3_16 + n3_17 + n3_6 + n3_7 + n3_4 + n3_5 + n3_10 + n3_11 + n3_8 + n3_9 + n3_1 + n3_0 + n3_3 + n3_2 - 0) : MAX(n9_2_0 + n9_1_0 + n9_0_0 + n9_13_0 + n9_14_0 + n9_11_0 + n9_12_0 + n9_17_0 + n9_18_0 + n9_15_0 + n9_16_0 + n9_5_0 + n9_6_0 + n9_3_0 + n9_4_0 + n9_9_0 + n9_10_0 + n9_7_0 + n9_8_0 + n9_9_1 + n9_8_1 + n9_11_1 + n9_10... (shortened)
lola: formula length: 12483
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n3_22 + n3_21 + n3_20 + n3_19 + n3_18 + n3_17 + n3_16 + n3_15 + n3_14 + n3_13 + n3_12 + n3_11 + n3_10 + n3_0 + n3_1 + n3_2 + n3_3 + n3_4 + n3_5 + n3_6 + n3_7 + n3_8 + n3_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_14_22 + n9_14_21 + n9_14_20 + n9_14_19 + n9_14_18 + n9_14_17 + n9_14_16 + n9_14_15 + n9_14_14 + n9_14_13 + n9_14_12 + n9_14_11 + n9_14_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_19_9 + n9_19_8 + n9_19_7 + n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopOK - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + n2_10 + n2_11 + n2_12 + n2_13 + n2_14 + n2_15 + n2_16 + n2_17 + n2_18 + n2_19 + n2_20 + n2_21 + n2_22 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 221 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 1420 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 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_9 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: 23
lola: The maximum value of the given expression is 23
lola: ========================================
lola: subprocess 7 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_9 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_9 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a4 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: 23
lola: The maximum value of the given expression is 23
lola: ========================================
lola: subprocess 11 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_14_22 + n9_14_21 + n9_14_20 + n9_14_19 + n9_14_18 + n9_14_17 + n9_14_16 + n9_14_15 + n9_14_14 + n9_14_13 + n9_14_12 + n9_14_11 + n9_14_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_19_9 + n9_19_8 + n9_19_7 + n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopOK - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a3 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopAbort - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_9 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: unknown unknown unknown unknown 1 unknown 23 unknown unknown unknown 23 unknown unknown unknown unknown

BK_STOP 1463708899025

--------------------
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="QuasiCertifProtocol-PT-22"
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/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 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 QuasiCertifProtocol-PT-22, 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 r098kn-smll-146369140300110"
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 ;