fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r040-smll-152646357300163
Last Updated
June 26, 2018

About the Execution of LoLA for ClientsAndServers-PT-N0500P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
148.270 725.00 90.00 0.00 1500 4000 1000 1000 4000 1000 1000 4000 2000 1000 2000 1000 2000 2000 1000 1000 normal

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 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0500P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300163
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526559853340

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0500P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0500P0 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ ClientsAndServers-PT-N0500P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0500P0-UpperBounds.task
lola: LP says that atomic proposition is always false: (Mi <= 0)
lola: MAX(Mi) : MAX(Ci) : MAX(SR) : MAX(MwU) : MAX(Ci) : MAX(SR) : MAX(StR) : MAX(Ci) : MAX(Uf) : MAX(MtF) : MAX(CG) : MAX(SF) : MAX(Uf) : MAX(CF) : MAX(SpA) : MAX(MpG)
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(Mi)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Mi)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1500
lola: SUBRESULT
lola: result: 1500
lola: produced by: state space
lola: The maximum value of the given expression is 1500
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-0 1500 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(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 4000
lola: SUBRESULT
lola: result: 4000
lola: produced by: state space
lola: The maximum value of the given expression is 4000
lola: 0 markings, 0 edges

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-1 4000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SR)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 3001 markings, 3000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-2 1000 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(MwU)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MwU)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 4001 markings, 4000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-3 1000 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(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 4000
lola: SUBRESULT
lola: result: 4000
lola: produced by: state space
lola: The maximum value of the given expression is 4000
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-4 4000 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(SR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SR)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 3001 markings, 3000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-5 1000 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(StR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(StR)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 2001 markings, 2000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-6 1000 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(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 4000
lola: SUBRESULT
lola: result: 4000
lola: produced by: state space
lola: The maximum value of the given expression is 4000
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-7 4000 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(Uf)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Uf)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2000
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-8 2000 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(MtF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MtF)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 64135 markings, 64196 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-9 1000 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(CG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CG)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2000
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 16001 markings, 16000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-10 2000 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(SF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SF)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 63069 markings, 63087 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-11 1000 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(Uf)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Uf)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2000
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 0 markings, 0 edges

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-12 2000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CF)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2000
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 20001 markings, 20000 edges

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-13 2000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SpA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SpA)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 67016 markings, 67023 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-14 1000 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(MpG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MpG)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1000
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 5001 markings, 5000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-UpperBounds-15 1000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1500 4000 1000 1000 4000 1000 1000 4000 2000 1000 2000 1000 2000 2000 1000 1000
lola:
preliminary result: 1500 4000 1000 1000 4000 1000 1000 4000 2000 1000 2000 1000 2000 2000 1000 1000
lola: memory consumption: 17644 KB
lola: time consumption: 1 seconds

BK_STOP 1526559854065

--------------------
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="ClientsAndServers-PT-N0500P0"
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/ClientsAndServers-PT-N0500P0.tgz
mv ClientsAndServers-PT-N0500P0 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 ClientsAndServers-PT-N0500P0, 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 r040-smll-152646357300163"
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 ;