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-155225094500112.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-V20P10N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094500112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 9 07:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 04:38 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.9K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-V20P10N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552404011673

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ BridgeAndVehicles-COL-V20P10N10 @ 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-V20P10N10-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p65 + p64 + p63 + p62 + p61 + p57 + p58 + p59 + p60 + p67 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(p33) : MAX(p10 + p11) : MAX(p10 + p11) : MAX(p6) : MAX(p33) : MAX(p6) : MAX(p9) : MAX(p7) : MAX(p1) : MAX(p9) : MAX(p3) : MAX(p10 + p11) : MAX(p34 + p35) : MAX(0) : MAX(0) : MAX(0)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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-V20P10N10-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-V20P10N10-UpperBounds-13 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 BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-14 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 BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: Structural Bound: 4294967295
lola: 11 markings, 11 edges, 2 markings/sec, 25 secs
lola: 100030 markings, 205349 edges, 20004 markings/sec, 30 secs
lola: 192697 markings, 401630 edges, 18533 markings/sec, 35 secs
lola: 286052 markings, 602561 edges, 18671 markings/sec, 40 secs
lola: 380179 markings, 801301 edges, 18825 markings/sec, 45 secs
lola: 473181 markings, 998171 edges, 18600 markings/sec, 50 secs
lola: 562635 markings, 1188865 edges, 17891 markings/sec, 55 secs
lola: 651386 markings, 1379770 edges, 17750 markings/sec, 60 secs
lola: 739980 markings, 1569210 edges, 17719 markings/sec, 65 secs
lola: 834581 markings, 1766570 edges, 18920 markings/sec, 70 secs
lola: 926452 markings, 1961166 edges, 18374 markings/sec, 75 secs
lola: 1014041 markings, 2152423 edges, 17518 markings/sec, 80 secs
lola: 1101042 markings, 2331006 edges, 17400 markings/sec, 85 secs
lola: 1188433 markings, 2520607 edges, 17478 markings/sec, 90 secs
lola: 1275830 markings, 2705821 edges, 17479 markings/sec, 95 secs
lola: 1362776 markings, 2889972 edges, 17389 markings/sec, 100 secs
lola: 1449918 markings, 3077739 edges, 17428 markings/sec, 105 secs
lola: 1536558 markings, 3259128 edges, 17328 markings/sec, 110 secs
lola: 1626860 markings, 3454289 edges, 18060 markings/sec, 115 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 1680202 markings, 3567898 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-5 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 89 markings, 88 edges
lola: ========================================

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

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-7 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 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-V20P10N10-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

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-8 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 89 markings, 88 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-9 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-10 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p33)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p33)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-0 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: Structural Bound: 4294967295
lola: 114 markings, 113 edges, 23 markings/sec, 25 secs
lola: 98793 markings, 202497 edges, 19736 markings/sec, 30 secs
lola: 191620 markings, 399095 edges, 18565 markings/sec, 35 secs
lola: 282365 markings, 595907 edges, 18149 markings/sec, 40 secs
lola: 373304 markings, 787272 edges, 18188 markings/sec, 45 secs
lola: 463807 markings, 979026 edges, 18101 markings/sec, 50 secs
lola: 559908 markings, 1183403 edges, 19220 markings/sec, 55 secs
lola: 657552 markings, 1391713 edges, 19529 markings/sec, 60 secs
lola: 754311 markings, 1599692 edges, 19352 markings/sec, 65 secs
lola: 844787 markings, 1789275 edges, 18095 markings/sec, 70 secs
lola: 935903 markings, 1980344 edges, 18223 markings/sec, 75 secs
lola: 1030208 markings, 2184989 edges, 18861 markings/sec, 80 secs
lola: 1126405 markings, 2388938 edges, 19239 markings/sec, 85 secs
lola: 1223415 markings, 2591523 edges, 19402 markings/sec, 90 secs
lola: 1314547 markings, 2792060 edges, 18226 markings/sec, 95 secs
lola: 1410093 markings, 2987530 edges, 19109 markings/sec, 100 secs
lola: 1504723 markings, 3193521 edges, 18926 markings/sec, 105 secs
lola: 1596507 markings, 3386240 edges, 18357 markings/sec, 110 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 1680202 markings, 3567898 edges

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-3 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: MAX(p33)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p33)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-4 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p34 + p35)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p34 + p35)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 4 markings, 3 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-1 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 4 markings, 3 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-2 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10 + p11)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 4 markings, 3 edges

FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 1 1 20 20 20 20 10 20 20 20 1 1 1 1 1
lola:
preliminary result: 20 1 1 20 20 20 20 10 20 20 20 1 1 1 1 1
lola: ========================================
lola: memory consumption: 19792 KB
lola: time consumption: 253 seconds

BK_STOP 1552404264794

--------------------
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-V20P10N10"
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-V20P10N10, 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-155225094500112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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