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-155246598300067.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-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 7 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.6K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 110K 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-PT-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552779014843

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-4 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-PT-4 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ LamportFastMutEx-PT-4 @ 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: 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-PT-4-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (y_0 + y_1 + y_2 + y_3 + y_4 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (x_0 + x_1 + x_2 + x_3 + x_4 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (P-b_0_false <= 0)
lola: LP says that atomic proposition is always true: (P-done_0_3 <= 0)
lola: LP says that atomic proposition is always true: (P-done_0_1 <= 0)
lola: LP says that atomic proposition is always true: (P-b_0_true <= 0)
lola: MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4) : MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4) : MAX(0) : MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) : MAX(P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) : MAX(0) : MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) : MAX(P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) : MAX(P-wait_3_2) : MAX(x_4) : MAX(P-b_0_false) : MAX(P-done_0_3) : MAX(P-done_0_1) : MAX(P-b_2_true) : MAX(P-wait_2_2) : MAX(P-b_0_true)
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-PT-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-PT-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-PT-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-PT-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(P-b_0_false)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-b_0_false)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-10 0 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(P-done_0_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-done_0_3)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-11 0 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(P-done_0_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-done_0_1)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-12 0 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(P-b_0_true)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-b_0_true)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-15 0 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(P-wait_3_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-wait_3_2)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 10 markings, 9 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-8 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(P-b_2_true)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-b_2_true)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 2 markings, 1 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-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(P-wait_2_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-wait_2_2)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 10 markings, 9 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-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(x_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(x_4)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 3 markings, 2 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-9 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(P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 317622 markings, 958680 edges, 63524 markings/sec, 0 secs
lola: 635136 markings, 2233161 edges, 63503 markings/sec, 5 secs
lola: 932363 markings, 3646271 edges, 59445 markings/sec, 10 secs
lola: 1220275 markings, 5123181 edges, 57582 markings/sec, 15 secs
lola: 1525563 markings, 6463369 edges, 61058 markings/sec, 20 secs
lola: 1806469 markings, 7784814 edges, 56181 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1847597 markings, 8054021 edges

FORMULA LamportFastMutEx-PT-4-UpperBounds-4 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4)
lola: processed formula length: 77
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 370085 markings, 892410 edges, 74017 markings/sec, 0 secs
lola: 699158 markings, 2182004 edges, 65815 markings/sec, 5 secs
lola: 1000929 markings, 3503340 edges, 60354 markings/sec, 10 secs
lola: 1309841 markings, 4851649 edges, 61782 markings/sec, 15 secs
lola: 1624667 markings, 6091108 edges, 62965 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: 1837036 markings, 7333936 edges

FORMULA LamportFastMutEx-PT-4-UpperBounds-1 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)
lola: processed formula length: 67
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 335365 markings, 1035682 edges, 67073 markings/sec, 0 secs
lola: 656234 markings, 2287762 edges, 64174 markings/sec, 5 secs
lola: 937248 markings, 3597773 edges, 56203 markings/sec, 10 secs
lola: 1221861 markings, 5057836 edges, 56923 markings/sec, 15 secs
lola: 1518314 markings, 6395420 edges, 59291 markings/sec, 20 secs
lola: 1818561 markings, 7558188 edges, 60049 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1894500 markings, 8449691 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-6 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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-PT-4-UpperBounds-7 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 14 will run for 1738 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4)
lola: processed formula length: 77
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 377976 markings, 916594 edges, 75595 markings/sec, 0 secs
lola: 700035 markings, 2185180 edges, 64412 markings/sec, 5 secs
lola: 1008067 markings, 3537849 edges, 61606 markings/sec, 10 secs
lola: 1310600 markings, 4854314 edges, 60507 markings/sec, 15 secs
lola: 1619293 markings, 6050094 edges, 61739 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: 1837036 markings, 7333936 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-0 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)
lola: processed formula length: 67
lola: 0 rewrites
lola: closed formula file LamportFastMutEx-PT-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: 341888 markings, 1058780 edges, 68378 markings/sec, 0 secs
lola: 653497 markings, 2275449 edges, 62322 markings/sec, 5 secs
lola: 943735 markings, 3632500 edges, 58048 markings/sec, 10 secs
lola: 1220980 markings, 5054502 edges, 55449 markings/sec, 15 secs
lola: 1509358 markings, 6362577 edges, 57676 markings/sec, 20 secs
lola: 1811116 markings, 7527483 edges, 60352 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 1894500 markings, 8449691 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-4-UpperBounds-3 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 1 1 0 0 0 1 1 0
lola:
preliminary result: 3 3 1 3 3 1 3 4 1 1 0 0 0 1 1 0
lola: memory consumption: 18012 KB
lola: time consumption: 154 seconds

BK_STOP 1552779169880

--------------------
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-PT-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-PT-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-155246598300067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-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 ;