fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749169700263
Last Updated
June 26, 2018

About the Execution of LoLA for EGFr-PT-10420

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
221.250 23566.00 24785.00 17.50 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 1 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 852K
-rw-r--r-- 1 mcc users 4.5K May 30 21:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 30 21:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 28 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.5K May 28 06:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.0K May 27 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw------- 1 mcc users 672K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is EGFr-PT-10420, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169700263
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527786406832

info: Time: 3600 - MCC
===========================================================================================
prep: translating EGFr-PT-10420 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating EGFr-PT-10420 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ EGFr-PT-10420 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 586/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 378 transitions, 76 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 731 transition conflict sets
lola: TASK
lola: reading formula from EGFr-PT-10420-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (erbb3_equals_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (pdk1_equals_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (nrg4_equals_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (btc_equals_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: MAX(shc_equals_1) : MAX(ip3_equals_1) : MAX(shp2_equals_1) : MAX(gab1_equals_1) : MAX(plcg_equals_0) : MAX(erbb14_equals_0) : MAX(pi34p2_equals_1) : MAX(erbb44_equals_1) : MAX(jnk_equals_0) : MAX(0) : MAX(0) : MAX(p90rsk_equals_1) : MAX(0) : MAX(rasgap_equals_0) : MAX(0) : MAX(ip3_equals_1)
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(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file EGFr-PT-10420-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges

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

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

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

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

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

FORMULA EGFr-PT-10420-UpperBounds-5 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(pi34p2_equals_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(pi34p2_equals_1)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file EGFr-PT-10420-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: 1
lola: 391569 markings, 1701907 edges, 78314 markings/sec, 0 secs
lola: 721582 markings, 3894078 edges, 66003 markings/sec, 5 secs
lola: 1034503 markings, 5728334 edges, 62584 markings/sec, 10 secs
lola: 1307951 markings, 7642142 edges, 54690 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 1474560 markings, 8747704 edges
lola: ========================================

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

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

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

FORMULA EGFr-PT-10420-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ip3_equals_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ip3_equals_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file EGFr-PT-10420-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================

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

FORMULA EGFr-PT-10420-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(shp2_equals_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(shp2_equals_1)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file EGFr-PT-10420-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================

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

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

FORMULA EGFr-PT-10420-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ip3_equals_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ip3_equals_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file EGFr-PT-10420-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================

FORMULA EGFr-PT-10420-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 1
lola:
preliminary result: 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 1
lola: memory consumption: 18484 KB
lola: time consumption: 23 seconds

BK_STOP 1527786430398

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory

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="EGFr-PT-10420"
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/EGFr-PT-10420.tgz
mv EGFr-PT-10420 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 EGFr-PT-10420, 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 r280-csrt-152749169700263"
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 ;