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)
................
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 31K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000835
=====================================================================

--------------------
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 PhilosophersDyn-COL-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527062104503

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-03 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ PhilosophersDyn-COL-03 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-UpperBounds.task
lola: MAX(p0 + p1 + p2) : MAX(p24 + p25 + p26) : MAX(p20 + p19 + p18) : MAX(p0 + p1 + p2) : MAX(p15 + p16 + p17) : MAX(p14 + p13 + p12) : MAX(p24 + p25 + p26) : MAX(p24 + p25 + p26) : MAX(p24 + p25 + p26) : MAX(p27 + p28 + p29) : MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) : MAX(p24 + p25 + p26) : MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) : MAX(p0 + p1 + p2) : MAX(p14 + p13 + p12) : MAX(p20 + p19 + p18)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 752 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-0 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24 + p25 + p26)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-1 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p19 + p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p19 + p18)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 699 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-2 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 752 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-3 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p15 + p16 + p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p15 + p16 + p17)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 3 markings, 2 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-4 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14 + p13 + p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14 + p13 + p12)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-5 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24 + p25 + p26)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-6 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24 + p25 + p26)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-7 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24 + p25 + p26)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-8 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p27 + p28 + p29)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 699 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-9 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24 + p25 + p26)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-11 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 752 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14 + p13 + p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14 + p13 + p12)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-14 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p19 + p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p19 + p18)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 325 markings, 699 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: processed formula length: 49
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 3 markings, 2 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-12 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: processed formula length: 49
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-COL-03-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: Structural Bound: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 3 markings, 2 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 2 3 2 2 3 3 3 3 3 2 3 3 3 2 3 2
lola:
preliminary result: 2 3 2 2 3 3 3 3 3 2 3 3 3 2 3 2
lola: memory consumption: 18568 KB
lola: time consumption: 0 seconds

BK_STOP 1527062104777

--------------------
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="PhilosophersDyn-COL-03"
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/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-COL-03, 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 r112-csrt-152666470000835"
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 ;