Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r022-csrt-155225094600121.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is BridgeAndVehicles-COL-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094600121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.0K Feb 9 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 9 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 5 04:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 5 04:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 2 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 2 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Jan 29 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Jan 29 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 39K 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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552404036723

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ BridgeAndVehicles-COL-V20P20N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N10-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p64 + p63 + p62 + p61 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p66 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p64 + p63 + p62 + p61 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p66 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p64 + p63 + p62 + p61 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p66 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(p24) : MAX(p45) : MAX(p24) : MAX(p24) : MAX(p1) : MAX(p25 + p26) : MAX(0) : MAX(p29) : MAX(0) : MAX(0) : MAX(0) : MAX(p44) : MAX(0) : MAX(p0) : MAX(p1) : MAX(p0)
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 BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-6 1 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 BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-8 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(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 BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-9 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(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 BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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 BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 86 markings, 85 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-0 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p29)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p29)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-7 20 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(p45)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p45)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: 177465 markings, 376937 edges, 35493 markings/sec, 0 secs
lola: 337381 markings, 714136 edges, 31983 markings/sec, 5 secs
lola: 494565 markings, 1045400 edges, 31437 markings/sec, 10 secs
lola: 651543 markings, 1376657 edges, 31396 markings/sec, 15 secs
lola: 804509 markings, 1695494 edges, 30593 markings/sec, 20 secs
lola: 959790 markings, 2018530 edges, 31056 markings/sec, 25 secs
lola: 1118718 markings, 2347961 edges, 31786 markings/sec, 30 secs
lola: 1274568 markings, 2670892 edges, 31170 markings/sec, 35 secs
lola: 1425992 markings, 2985072 edges, 30285 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 1550737 markings, 3239615 edges

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 86 markings, 85 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-2 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p24)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 86 markings, 85 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-3 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p44)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p44)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 98902 markings, 189597 edges, 19780 markings/sec, 30 secs
lola: 185845 markings, 368249 edges, 17389 markings/sec, 35 secs
lola: 269040 markings, 543057 edges, 16639 markings/sec, 40 secs
lola: 352680 markings, 717036 edges, 16728 markings/sec, 45 secs
lola: 443911 markings, 909142 edges, 18246 markings/sec, 50 secs
lola: 539569 markings, 1106130 edges, 19132 markings/sec, 55 secs
lola: 633893 markings, 1300754 edges, 18865 markings/sec, 60 secs
lola: 723821 markings, 1483851 edges, 17986 markings/sec, 65 secs
lola: 806501 markings, 1657692 edges, 16536 markings/sec, 70 secs
lola: 890270 markings, 1834390 edges, 16754 markings/sec, 75 secs
lola: 978733 markings, 2013702 edges, 17693 markings/sec, 80 secs
lola: 1058390 markings, 2186377 edges, 15931 markings/sec, 85 secs
lola: 1142105 markings, 2358510 edges, 16743 markings/sec, 90 secs
lola: 1222878 markings, 2530128 edges, 16155 markings/sec, 95 secs
lola: 1304664 markings, 2702069 edges, 16357 markings/sec, 100 secs
lola: 1385590 markings, 2872054 edges, 16185 markings/sec, 105 secs
lola: 1471672 markings, 3056232 edges, 17216 markings/sec, 110 secs
lola: 1560025 markings, 3239168 edges, 17671 markings/sec, 115 secs
lola: 1645420 markings, 3425955 edges, 17079 markings/sec, 120 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 1685073 markings, 3507938 edges

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-4 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-13 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 96122 markings, 183810 edges, 19224 markings/sec, 30 secs
lola: 186844 markings, 370593 edges, 18144 markings/sec, 35 secs
lola: 279557 markings, 564341 edges, 18543 markings/sec, 40 secs
lola: 370385 markings, 755435 edges, 18166 markings/sec, 45 secs
lola: 466872 markings, 954383 edges, 19297 markings/sec, 50 secs
lola: 556910 markings, 1140483 edges, 18008 markings/sec, 55 secs
lola: 642840 markings, 1320397 edges, 17186 markings/sec, 60 secs
lola: 730751 markings, 1499759 edges, 17582 markings/sec, 65 secs
lola: 815554 markings, 1675873 edges, 16961 markings/sec, 70 secs
lola: 898884 markings, 1852993 edges, 16666 markings/sec, 75 secs
lola: 985110 markings, 2028611 edges, 17245 markings/sec, 80 secs
lola: 1067843 markings, 2205053 edges, 16547 markings/sec, 85 secs
lola: 1152287 markings, 2380686 edges, 16889 markings/sec, 90 secs
lola: 1235363 markings, 2555106 edges, 16615 markings/sec, 95 secs
lola: 1322358 markings, 2741507 edges, 17399 markings/sec, 100 secs
lola: 1410803 markings, 2922513 edges, 17689 markings/sec, 105 secs
lola: 1496832 markings, 3111432 edges, 17206 markings/sec, 110 secs
lola: 1584200 markings, 3288567 edges, 17474 markings/sec, 115 secs
lola: 1664019 markings, 3465735 edges, 15964 markings/sec, 120 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 1685073 markings, 3507938 edges

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-14 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-15 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p25 + p26)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 BridgeAndVehicles-COL-V20P20N10-UpperBounds-5 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 10 20 20 20 1 1 20 1 1 1 20 1 20 20 20
lola:
preliminary result: 20 10 20 20 20 1 1 20 1 1 1 20 1 20 20 20
lola: memory consumption: 18772 KB
lola: time consumption: 303 seconds

BK_STOP 1552404339513

--------------------
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="BridgeAndVehicles-COL-V20P20N10"
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-3954"
echo " Executing tool win2018"
echo " Input is BridgeAndVehicles-COL-V20P20N10, 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 r022-csrt-155225094600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 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 ;