About the Execution of LoLA for RobotManipulation-PT-00050
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-3254
Executing tool lola
Input is RobotManipulation-PT-00050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172700236
=====================================================================
--------------------
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 RobotManipulation-PT-00050-UpperBounds-0
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-1
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-15
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-2
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-3
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-4
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-5
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-6
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-7
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-8
FORMULA_NAME RobotManipulation-PT-00050-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1496340561767
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
RobotManipulation-PT-00050: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
RobotManipulation-PT-00050: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ RobotManipulation-PT-00050 @ 3540 seconds
----- Start make result stdout -----
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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00050-UpperBounds.task
lola: MAX(moved) : MAX(p_rdy) : MAX(p_rdy) : MAX(r_moving) : MAX(access) : MAX(moved) : MAX(initialized) : MAX(initialize) : MAX(r_active) : MAX(r_active) : MAX(r_active) : MAX(p_rel) : MAX(initialized) : MAX(moved) : MAX(initialize) : MAX(p_rel)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(moved)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rdy)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rdy)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_moving)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(access)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(moved)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 101
lola: produced by: state space
lola: The maximum value of the given expression is 101
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_active)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3381070 markings, 7507491 edges, 676214 markings/sec, 0 secs
lola: 6508838 markings, 14465809 edges, 625554 markings/sec, 5 secs
lola: 9562395 markings, 21278221 edges, 610711 markings/sec, 10 secs
lola: 12516498 markings, 27906334 edges, 590821 markings/sec, 15 secs
lola: 15335743 markings, 34631808 edges, 563849 markings/sec, 20 secs
lola: 16014320 markings, 38982490 edges, 135715 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_active)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3350955 markings, 7442099 edges, 670191 markings/sec, 0 secs
lola: 6604057 markings, 14675997 edges, 650620 markings/sec, 5 secs
lola: 9723974 markings, 21637558 edges, 623983 markings/sec, 10 secs
lola: 12682042 markings, 28273361 edges, 591614 markings/sec, 15 secs
lola: 15381827 markings, 34874360 edges, 539957 markings/sec, 20 secs
lola: 16019412 markings, 39026737 edges, 127517 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_active)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3363799 markings, 7469884 edges, 672760 markings/sec, 0 secs
lola: 6490804 markings, 14426269 edges, 625401 markings/sec, 5 secs
lola: 9449836 markings, 21032854 edges, 591806 markings/sec, 10 secs
lola: 12553542 markings, 27987710 edges, 620741 markings/sec, 15 secs
lola: 15411217 markings, 34982926 edges, 571535 markings/sec, 20 secs
lola: 16029848 markings, 39282643 edges, 123726 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rel)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(moved)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: ========================================
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 101
lola: produced by: state space
lola: The maximum value of the given expression is 101
lola: ========================================
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rel)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: RESULT
lola:
SUMMARY: 100 100 100 100 100 100 100 101 100 100 100 100 100 100 101 100
lola: ========================================
FORMULA RobotManipulation-PT-00050-UpperBounds-0 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-1 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-2 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-3 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-4 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-5 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-6 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-7 101 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-8 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-9 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-10 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-11 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-12 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-13 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-14 101 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00050-UpperBounds-15 100 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496340665804
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="RobotManipulation-PT-00050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is RobotManipulation-PT-00050, 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 r208-smll-149581172700236"
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 '
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 ;