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 640K
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K 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 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 151K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500450
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526605579072

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-04 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ CSRepetitions-PT-04 @ 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: 293/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3744
lola: finding significant places
lola: 117 places, 176 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-04-UpperBounds.task
lola: MAX(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) : MAX(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16) : MAX(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) : MAX(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) : MAX(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16) : MAX(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) : MAX(RequestBufferSlots) : MAX(Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) : MAX(Client_Waiting_5) : MAX(Server_Anwering_13_2) : MAX(Server_Waiting_3) : MAX(Server_Anwering_9_2) : MAX(RequestBuffer_5) : MAX(Client_Waiting_2) : MAX(Server_Anwering_15_1) : MAX(Client_Waiting_11)
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(RequestBufferSlots)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RequestBufferSlots)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-6 4 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(Client_Waiting_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Waiting_5)
lola: processed formula length: 21
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-8 1 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(Server_Anwering_13_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Anwering_13_2)
lola: processed formula length: 25
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-9 1 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(Server_Waiting_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Waiting_3)
lola: processed formula length: 21
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-10 1 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(Server_Anwering_9_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Anwering_9_2)
lola: processed formula length: 24
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-11 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(RequestBuffer_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RequestBuffer_5)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-12 4 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(Client_Waiting_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Waiting_2)
lola: processed formula length: 21
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-13 1 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(Server_Anwering_15_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Anwering_15_1)
lola: processed formula length: 25
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-14 1 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(Client_Waiting_11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Waiting_11)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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 CSRepetitions-PT-04-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)
lola: processed formula length: 78
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-2 4 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(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)
lola: processed formula length: 78
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-0 4 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(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16)
lola: processed formula length: 297
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-1 4 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(Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)
lola: processed formula length: 313
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 16
lola: SUBRESULT
lola: result: 16
lola: produced by: state space
lola: The maximum value of the given expression is 16
lola: 17 markings, 16 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-7 16 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(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)
lola: processed formula length: 313
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 16
lola: SUBRESULT
lola: result: 16
lola: produced by: state space
lola: The maximum value of the given expression is 16
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-3 16 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(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16)
lola: processed formula length: 297
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-4 4 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(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)
lola: processed formula length: 313
lola: 0 rewrites
lola: closed formula file CSRepetitions-PT-04-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: 16
lola: SUBRESULT
lola: result: 16
lola: produced by: state space
lola: The maximum value of the given expression is 16
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-UpperBounds-5 16 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 4 4 4 16 4 16 4 16 1 1 1 1 4 1 1 1
lola:
preliminary result: 4 4 4 16 4 16 4 16 1 1 1 1 4 1 1 1
lola: memory consumption: 18752 KB
lola: time consumption: 0 seconds

BK_STOP 1526605579749

--------------------
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="CSRepetitions-PT-04"
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/CSRepetitions-PT-04.tgz
mv CSRepetitions-PT-04 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 CSRepetitions-PT-04, 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-152646306500450"
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 ;