Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r099-smll-155246598300046.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r099-smll-155246598300046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.3K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 40K Mar 10 17:31 model.pnml

--------------------
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 1552763738793

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-4 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
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: 4320
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: (p30 + p31 + p32 + p33 + p34 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p15 + p16 + p17 + p18 + p19 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p15 + p16 + p17 + p18 + p19 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(p100 + p101 + p102 + p103 + p104) : MAX(p100 + p101 + p102 + p103 + p104) : MAX(0) : MAX(p5 + p6 + p7 + p8 + p9) : MAX(p69 + p68 + p67 + p66 + p65) : MAX(0) : MAX(p5 + p6 + p7 + p8 + p9) : MAX(p10 + p11 + p12 + p13 + p14) : MAX(p105 + p106 + p107 + p108 + p109) : MAX(p125 + p126 + p127 + p128 + p129) : MAX(p115 + p116 + p117 + p118 + p119) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(0) : MAX(p69 + p68 + p67 + p66 + p65) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p5 + p6 + p7 + p8 + p9)
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: 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-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(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-5 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(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-12 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(p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8 + p9)
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: 355765 markings, 1165812 edges, 71153 markings/sec, 0 secs
lola: 695270 markings, 2638816 edges, 67901 markings/sec, 5 secs
lola: 1006586 markings, 4223724 edges, 62263 markings/sec, 10 secs
lola: 1321997 markings, 5743762 edges, 63082 markings/sec, 15 secs
lola: 1666459 markings, 6984097 edges, 68892 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1891232 markings, 8328948 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-3 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p69 + p68 + p67 + p66 + p65)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p69 + p68 + p67 + p66 + p65)
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: 370621 markings, 1145318 edges, 74124 markings/sec, 0 secs
lola: 702530 markings, 2542833 edges, 66382 markings/sec, 5 secs
lola: 1016592 markings, 4082543 edges, 62812 markings/sec, 10 secs
lola: 1330976 markings, 5599872 edges, 62877 markings/sec, 15 secs
lola: 1656846 markings, 6955561 edges, 65174 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1861116 markings, 8093500 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-4 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 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: 413976 markings, 1024349 edges, 82795 markings/sec, 0 secs
lola: 765071 markings, 2396739 edges, 70219 markings/sec, 5 secs
lola: 1095618 markings, 3915154 edges, 66109 markings/sec, 10 secs
lola: 1442390 markings, 5202906 edges, 69354 markings/sec, 15 secs
lola: 1760658 markings, 6588263 edges, 63654 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1830333 markings, 7257231 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-1 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8 + p9)
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: 371930 markings, 1225412 edges, 74386 markings/sec, 0 secs
lola: 708769 markings, 2713775 edges, 67368 markings/sec, 5 secs
lola: 1019810 markings, 4293953 edges, 62208 markings/sec, 10 secs
lola: 1337297 markings, 5795670 edges, 63497 markings/sec, 15 secs
lola: 1680338 markings, 7036336 edges, 68608 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1891232 markings, 8328948 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-6 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11 + p12 + p13 + p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11 + p12 + p13 + p14)
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: 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 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p105 + p106 + p107 + p108 + p109)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p105 + p106 + p107 + p108 + p109)
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: 417665 markings, 1029339 edges, 83533 markings/sec, 0 secs
lola: 800531 markings, 2393569 edges, 76573 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 1081517 markings, 3491806 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 9 will run for 491 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: 437250 markings, 958989 edges, 87450 markings/sec, 0 secs
lola: 825964 markings, 2152312 edges, 77743 markings/sec, 5 secs
lola: 1177667 markings, 3565844 edges, 70341 markings/sec, 10 secs
lola: 1521289 markings, 4984045 edges, 68724 markings/sec, 15 secs
lola: 1831921 markings, 6511947 edges, 62126 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1869000 markings, 7514800 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-9 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 569 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: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 25 markings, 24 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 683 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: 424621 markings, 1087322 edges, 84924 markings/sec, 0 secs
lola: 790862 markings, 2539963 edges, 73248 markings/sec, 5 secs
lola: 1134643 markings, 4030405 edges, 68756 markings/sec, 10 secs
lola: 1497504 markings, 5392273 edges, 72572 markings/sec, 15 secs
lola: 1808963 markings, 6904255 edges, 62292 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1818561 markings, 7041925 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-UpperBounds-11 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 847 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: 413649 markings, 1023507 edges, 82730 markings/sec, 0 secs
lola: 764610 markings, 2394301 edges, 70192 markings/sec, 5 secs
lola: 1095069 markings, 3912279 edges, 66092 markings/sec, 10 secs
lola: 1441404 markings, 5200109 edges, 69267 markings/sec, 15 secs
lola: 1759511 markings, 6583454 edges, 63621 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1830333 markings, 7257231 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 13 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p69 + p68 + p67 + p66 + p65)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p69 + p68 + p67 + p66 + p65)
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: 356723 markings, 1095809 edges, 71345 markings/sec, 0 secs
lola: 691427 markings, 2487478 edges, 66941 markings/sec, 5 secs
lola: 1006764 markings, 4033507 edges, 63067 markings/sec, 10 secs
lola: 1321690 markings, 5559197 edges, 62985 markings/sec, 15 secs
lola: 1648400 markings, 6924409 edges, 65342 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1861116 markings, 8093500 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-13 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1667 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: 424621 markings, 1087319 edges, 84924 markings/sec, 0 secs
lola: 790944 markings, 2540381 edges, 73265 markings/sec, 5 secs
lola: 1134877 markings, 4031684 edges, 68787 markings/sec, 10 secs
lola: 1498190 markings, 5395093 edges, 72663 markings/sec, 15 secs
lola: 1809656 markings, 6916823 edges, 62293 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1818561 markings, 7041925 edges

FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8 + p9)
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: 346764 markings, 1132173 edges, 69353 markings/sec, 0 secs
lola: 686167 markings, 2590214 edges, 67881 markings/sec, 5 secs
lola: 995897 markings, 4169036 edges, 61946 markings/sec, 10 secs
lola: 1308126 markings, 5691991 edges, 62446 markings/sec, 15 secs
lola: 1650183 markings, 6925234 edges, 68411 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1891232 markings, 8328948 edges

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

BK_STOP 1552764029569

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory

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="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r099-smll-155246598300046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;