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 548K
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 51K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Referendum-PT-0050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579000282
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526988882506

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-PT-0050 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 Referendum-PT-0050 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ Referendum-PT-0050 @ 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: 252/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 151
lola: finding significant places
lola: 151 places, 101 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 53 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0050-UpperBounds.task
lola: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(ready) : MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50) : MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50) : MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(ready) : MAX(voted_yes_3) : MAX(voted_yes_42) : MAX(voted_no_11) : MAX(voted_yes_18) : MAX(voted_no_39) : MAX(voted_no_18) : MAX(voted_yes_31) : MAX(voting_29)
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(ready)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-2 1 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(ready)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-7 1 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(voted_yes_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_3)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-8 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(voted_yes_42)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_42)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-9 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(voted_no_11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_11)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-10 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(voted_yes_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_18)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_39)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-12 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(voted_no_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_18)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-13 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(voted_yes_31)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_31)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voting_29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_29)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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 Referendum-PT-0050-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 +... (shortened)
lola: processed formula length: 693
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-4 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: processed formula length: 743
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-5 50 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(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: processed formula length: 743
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-6 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: processed formula length: 743
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-1 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_... (shortened)
lola: processed formula length: 743
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-0 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 +... (shortened)
lola: processed formula length: 693
lola: 0 rewrites
lola: closed formula file Referendum-PT-0050-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: 52 markings, 51 edges
lola: ========================================

FORMULA Referendum-PT-0050-UpperBounds-3 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 50 50 1 50 50 50 50 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 50 50 1 50 50 50 50 1 1 1 1 1 1 1 1 1
lola: memory consumption: 18404 KB
lola: time consumption: 0 seconds

BK_STOP 1526988903632

--------------------
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="Referendum-PT-0050"
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/Referendum-PT-0050.tgz
mv Referendum-PT-0050 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 Referendum-PT-0050, 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 r136-qhx2-152673579000282"
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 ;