About the Execution of LoLA for GlobalResAllocation-COL-06
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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400373
=====================================================================
--------------------
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 GlobalResAllocation-COL-06-UpperBounds-00
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-01
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-02
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-03
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-04
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-05
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-06
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-07
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-08
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-09
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-10
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-11
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-12
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-13
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-14
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526770712727
info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-COL-06 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ GlobalResAllocation-COL-06 @ 2658 seconds
lola: LoLA will run for 2658 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 136764/65536 symbol table entries, 111398 collisions
lola: preprocessing...
lola: Size of bit vector: 3264
lola: finding significant places
lola: 102 places, 136662 transitions, 78 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5250 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-06-UpperBounds.task
lola: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 160 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
check_solution: Constraint R1 = 0 is below its lower bound 1
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
Seriously low accuracy found ||*|| = 1 (rel. error 1)
FORMULA GlobalResAllocation-COL-06-UpperBounds-1 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 12
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-2 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: processed formula length: 40
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 24
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 24
lola: produced by: state space
lola: The maximum value of the given expression is 24
lola: 22 markings, 21 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-3 24 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-5 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: processed formula length: 40
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 24
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 24
lola: produced by: state space
lola: The maximum value of the given expression is 24
lola: 22 markings, 21 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-6 24 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-7 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: processed formula length: 40
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 24
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 24
lola: produced by: state space
lola: The maximum value of the given expression is 24
lola: 22 markings, 21 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-8 24 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 12
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-10 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 12
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-11 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p96 + p97 + p98 + p99)
lola: processed formula length: 40
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 24
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 24
lola: produced by: state space
lola: The maximum value of the given expression is 24
lola: 22 markings, 21 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-12 24 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p18 + p19 + p20 + p23 + p22 + p21)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 12
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-13 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: processed formula length: 70
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 12
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-4 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: processed formula length: 434
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 12
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-0 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: processed formula length: 434
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 12
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-9 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: processed formula length: 434
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 12
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-14 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: processed formula length: 434
lola: 0 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 12
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 2 markings, 1 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 12
lola: produced by: state space
lola: The maximum value of the given expression is 12
lola: 4 markings, 3 edges
lola: ========================================
FORMULA GlobalResAllocation-COL-06-UpperBounds-15 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 12 6 12 24 12 6 24 6 24 12 12 12 24 12 12 12
lola:
preliminary result: 12 6 12 24 12 6 24 6 24 12 12 12 24 12 12 12
lola: memory consumption: 3255756 KB
lola: time consumption: 237 seconds
BK_STOP 1526771862093
--------------------
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="GlobalResAllocation-COL-06"
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/GlobalResAllocation-COL-06.tgz
mv GlobalResAllocation-COL-06 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 GlobalResAllocation-COL-06, 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 r088-blw7-152649998400373"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;