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 205M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13M May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 464K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M 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 46K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.5M May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 134M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937200373
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526727624784

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-PT-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ DrinkVendingMachine-PT-10 @ 3565 seconds
lola: LoLA will run for 3565 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 111280/65536 symbol table entries, 66439 collisions
lola: preprocessing...
lola: Size of bit vector: 120
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-PT-10-UpperBounds.task
lola: MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) : MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) : MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) : MAX(theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) : MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) : MAX(productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1) : MAX(ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40) : MAX(theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) : MAX(optionSlots_2) : MAX(wait_7) : MAX(wait_36) : MAX(ready_24) : MAX(optionSlots_10) : MAX(ready_7) : MAX(wait_25) : MAX(ready_33)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(optionSlots_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(optionSlots_2)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 1 markings, 0 edges, 0 markings/sec, 0 secs
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 DrinkVendingMachine-PT-10-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_7)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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 DrinkVendingMachine-PT-10-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_36)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_36)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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 DrinkVendingMachine-PT-10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ready_24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready_24)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 1 markings, 0 edges, 0 markings/sec, 0 secs
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 DrinkVendingMachine-PT-10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(optionSlots_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(optionSlots_10)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 1 markings, 0 edges, 0 markings/sec, 0 secs
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 DrinkVendingMachine-PT-10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ready_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready_7)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 1 markings, 0 edges, 0 markings/sec, 0 secs
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 DrinkVendingMachine-PT-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_25)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_25)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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 DrinkVendingMachine-PT-10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ready_33)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready_33)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 1 markings, 0 edges, 0 markings/sec, 0 secs
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 DrinkVendingMachine-PT-10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)
lola: processed formula length: 173
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 11 markings, 10 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-5 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10)
lola: processed formula length: 163
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges

FORMULA DrinkVendingMachine-PT-10-UpperBounds-7 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: processed formula length: 163
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)
lola: processed formula length: 153
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: processed formula length: 163
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 10
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 5 markings, 4 edges

FORMULA DrinkVendingMachine-PT-10-UpperBounds-4 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)
lola: processed formula length: 393
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-2 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)
lola: processed formula length: 393
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-0 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 ... (shortened)
lola: processed formula length: 433
lola: 0 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-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: 40
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 125 markings, 124 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-UpperBounds-6 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 40 10 40 10 10 10 40 10 1 1 1 1 1 1 1 1
lola:
preliminary result: 40 10 40 10 10 10 40 10 1 1 1 1 1 1 1 1
lola: memory consumption: 7006600 KB
lola: time consumption: 191 seconds

BK_STOP 1526727820660

--------------------
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="DrinkVendingMachine-PT-10"
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/DrinkVendingMachine-PT-10.tgz
mv DrinkVendingMachine-PT-10 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 DrinkVendingMachine-PT-10, 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 r076-blw3-152649937200373"
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 ;