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 212K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000072
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010800086

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-4 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-COL-4 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ LamportFastMutEx-COL-4 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-4-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (p10 + p12 + p14 + p16 + p18 + p19 + p17 + p15 + p13 + p11 <= 0)
lola: after: (4 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p98 + p97 + p96 + p95 + p99 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(p0 + p1 + p2 + p3 + p4) : MAX(p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p89 + p88 + p87 + p86 + p85) : MAX(p110 + p111 + p112 + p113 + p114) : MAX(p125 + p126 + p127 + p128 + p129) : MAX(p100 + p101 + p102 + p103 + p104) : MAX(0) : MAX(p125 + p126 + p127 + p128 + p129) : MAX(p20 + p21 + p22 + p23 + p24) : MAX(0) : MAX(p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54) : MAX(p115 + p116 + p117 + p118 + p119) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p25 + p26 + p27 + p28 + p29) : MAX(p89 + p88 + p87 + p86 + p85)
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(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-7 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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 LamportFastMutEx-COL-4-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p89 + p88 + p87 + p86 + p85)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p89 + p88 + p87 + p86 + p85)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 39 markings, 38 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-3 4 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(p110 + p111 + p112 + p113 + p114)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110 + p111 + p112 + p113 + p114)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 571271 markings, 1436988 edges, 114254 markings/sec, 0 secs
lola: 1113002 markings, 3620723 edges, 108346 markings/sec, 5 secs
lola: 1673678 markings, 5588483 edges, 112135 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1822491 markings, 7289029 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-4 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p125 + p126 + p127 + p128 + p129)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p125 + p126 + p127 + p128 + p129)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola:
FORMULA LamportFastMutEx-COL-4-UpperBounds-5 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 9 markings, 8 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-6 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 633408 markings, 1608882 edges, 126682 markings/sec, 0 secs
lola: 1177996 markings, 3771134 edges, 108918 markings/sec, 5 secs
lola: 1734537 markings, 5763644 edges, 111308 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1820284 markings, 7242836 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-0 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p125 + p126 + p127 + p128 + p129)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p125 + p126 + p127 + p128 + p129)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-8 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p21 + p22 + p23 + p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p21 + p22 + p23 + p24)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 638126 markings, 1793203 edges, 127625 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 932745 markings, 2955990 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-9 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 674011 markings, 1784843 edges, 134802 markings/sec, 0 secs
lola: 1251059 markings, 4062738 edges, 115410 markings/sec, 5 secs
lola: 1791516 markings, 6241855 edges, 108091 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1820284 markings, 7242836 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-2 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p115 + p116 + p117 + p118 + p119)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p115 + p116 + p117 + p118 + p119)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 577415 markings, 2097791 edges, 115483 markings/sec, 0 secs
lola: 1105133 markings, 4615219 edges, 105544 markings/sec, 5 secs
lola: 1647936 markings, 7007921 edges, 108561 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1892512 markings, 8420147 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-12 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 663777 markings, 1741848 edges, 132755 markings/sec, 0 secs
lola: 1209307 markings, 3897890 edges, 109106 markings/sec, 5 secs
lola: 1758307 markings, 5934285 edges, 109800 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1820284 markings, 7242836 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-13 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p25 + p26 + p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 678927 markings, 1715615 edges, 135785 markings/sec, 0 secs
lola: 1238454 markings, 3933730 edges, 111905 markings/sec, 5 secs
lola: 1783742 markings, 6083610 edges, 109058 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1818971 markings, 7221072 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p89 + p88 + p87 + p86 + p85)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p89 + p88 + p87 + p86 + p85)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 39 markings, 38 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55)
lola: processed formula length: 152
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: ========================================
lola: Structural Bound: 16
lola: 678176 markings, 1833682 edges, 135635 markings/sec, 0 secs
lola: 1244540 markings, 4131852 edges, 113273 markings/sec, 5 secs
lola: 1788695 markings, 6268873 edges, 108831 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: 1822491 markings, 7289029 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-1 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54)
lola: processed formula length: 152
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-COL-4-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 16
lola: 581179 markings, 2083038 edges, 116236 markings/sec, 0 secs
lola: 1076278 markings, 4571921 edges, 99020 markings/sec, 5 secs
lola: 1564653 markings, 6953719 edges, 97675 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: 1863720 markings, 8495977 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-11 12 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 3 12 3 4 3 4 4 4 4 4 1 12 3 3 3 4
lola:
preliminary result: 3 12 3 4 3 4 4 4 4 4 1 12 3 3 3 4
lola: ========================================
lola: memory consumption: 18572 KB
lola: time consumption: 145 seconds

BK_STOP 1527010945631

--------------------
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="LamportFastMutEx-COL-4"
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/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 LamportFastMutEx-COL-4, 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 r112-csrt-152666469000072"
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 ;