About the Execution of LoLA for BridgeAndVehicles-PT-V80P50N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
376.260 | 22800.00 | 24096.00 | 55.00 | 1 80 80 80 50 80 80 80 1 1 1 1 1 80 1 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 14M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 477K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 261K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 593K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V80P50N50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500387
=====================================================================
--------------------
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 BridgeAndVehicles-PT-V80P50N50-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526592198060
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V80P50N50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V80P50N50 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ BridgeAndVehicles-PT-V80P50N50 @ 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: 8816/65536 symbol table entries, 2413 collisions
lola: preprocessing...
lola: Size of bit vector: 7296
lola: finding significant places
lola: 228 places, 8588 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9173 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N50-UpperBounds.task
lola: MAX(CHOIX_1 + CHOIX_2) : MAX(ROUTE_B) : MAX(SORTI_B) : MAX(ROUTE_A) : MAX(SUR_PONT_B) : MAX(ROUTE_B) : MAX(ROUTE_B) : MAX(ROUTE_A) : MAX(NB_ATTENTE_A_67) : MAX(NB_ATTENTE_A_13) : MAX(NB_ATTENTE_A_28) : MAX(COMPTEUR_9) : MAX(NB_ATTENTE_A_16) : MAX(ROUTE_A) : MAX(NB_ATTENTE_A_23) : MAX(NB_ATTENTE_A_47)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_B)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-1 80 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(SORTI_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SORTI_B)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 329 markings, 328 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-2 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_A)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-3 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SUR_PONT_B)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 154 markings, 153 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-4 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_B)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola:
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-5 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_B)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-6 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_A)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-7 80 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(NB_ATTENTE_A_67)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_67)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 68 markings, 67 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_13)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_13)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 14 markings, 13 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_28)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_28)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 29 markings, 28 edges
lola:
========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-10 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(COMPTEUR_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(COMPTEUR_9)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 26 markings, 25 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-11 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(NB_ATTENTE_A_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_16)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 17 markings, 16 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ROUTE_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ROUTE_A)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-13 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_23)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_23)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 24 markings, 23 edges
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_47)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NB_ATTENTE_A_47)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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: 48 markings, 47 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V80P50N50-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CHOIX_1 + CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CHOIX_1 + CHOIX_2)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-PT-V80P50N50-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 BridgeAndVehicles-PT-V80P50N50-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 80 80 80 50 80 80 80 1 1 1 1 1 80 1 1
lola:
preliminary result: 1 80 80 80 50 80 80 80 1 1 1 1 1 80 1 1
lola: memory consumption: 170312 KB
lola: time consumption: 22 seconds
BK_STOP 1526592220860
--------------------
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="BridgeAndVehicles-PT-V80P50N50"
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/BridgeAndVehicles-PT-V80P50N50.tgz
mv BridgeAndVehicles-PT-V80P50N50 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 BridgeAndVehicles-PT-V80P50N50, 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 r028-ebro-152646306500387"
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 ;