fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r165-csrt-155286441800004
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for SafeBus-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
549.330 772426.00 806809.00 149.20 5 6 1 5 1 1 1 1 1 6 1 1 5 ? 5 6 normal

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.r165-csrt-155286441800004.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 SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-csrt-155286441800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt

-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-UpperBounds-00
FORMULA_NAME SafeBus-COL-06-UpperBounds-01
FORMULA_NAME SafeBus-COL-06-UpperBounds-02
FORMULA_NAME SafeBus-COL-06-UpperBounds-03
FORMULA_NAME SafeBus-COL-06-UpperBounds-04
FORMULA_NAME SafeBus-COL-06-UpperBounds-05
FORMULA_NAME SafeBus-COL-06-UpperBounds-06
FORMULA_NAME SafeBus-COL-06-UpperBounds-07
FORMULA_NAME SafeBus-COL-06-UpperBounds-08
FORMULA_NAME SafeBus-COL-06-UpperBounds-09
FORMULA_NAME SafeBus-COL-06-UpperBounds-10
FORMULA_NAME SafeBus-COL-06-UpperBounds-11
FORMULA_NAME SafeBus-COL-06-UpperBounds-12
FORMULA_NAME SafeBus-COL-06-UpperBounds-13
FORMULA_NAME SafeBus-COL-06-UpperBounds-14
FORMULA_NAME SafeBus-COL-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1553105267186

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-COL-06 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ SafeBus-COL-06 @ 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: 613/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4800
lola: finding significant places
lola: 150 places, 463 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 393 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-06-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (p39 + p38 + p37 + p36 + p35 + p34 <= 0)
lola: after: (6 <= 0)
lola: always false
lola: MAX(p137 + p138 + p139 + p140 + p141 + p142) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136) : MAX(p76) : MAX(p137 + p138 + p139 + p140 + p141 + p142) : MAX(p143) : MAX(p14) : MAX(p13) : MAX(p87 + p86 + p85 + p84 + p83 + p88) : MAX(p87 + p86 + p85 + p84 + p83 + p88) : MAX(p21 + p22 + p23 + p24 + p25 + p26) : MAX(p143) : MAX(p143) : MAX(p7 + p8 + p9 + p10 + p11 + p12) : MAX(p14) : MAX(p7 + p8 + p9 + p10 + p11 + p12) : MAX(0)
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 SafeBus-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges

FORMULA SafeBus-COL-06-UpperBounds-15 6 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(p143)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p143)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-5 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(p13)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p13)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-6 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(p143)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p143)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-10 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(p143)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p143)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-11 1 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(p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-13 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(p76)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p76)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 5 markings, 4 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-2 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(p21 + p22 + p23 + p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p21 + p22 + p23 + p24 + p25 + p26)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-9 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p137 + p138 + p139 + p140 + p141 + p142)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p137 + p138 + p139 + p140 + p141 + p142)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: 163809 markings, 313727 edges, 32762 markings/sec, 0 secs
lola: 324851 markings, 668316 edges, 32208 markings/sec, 5 secs
lola: 474624 markings, 1016259 edges, 29955 markings/sec, 10 secs
lola: 628312 markings, 1387665 edges, 30738 markings/sec, 15 secs
lola: 782338 markings, 1772507 edges, 30805 markings/sec, 20 secs
lola: 932384 markings, 2154703 edges, 30009 markings/sec, 25 secs
lola: 1082313 markings, 2546428 edges, 29986 markings/sec, 30 secs
lola: 1231017 markings, 2937692 edges, 29741 markings/sec, 35 secs
lola: 1378725 markings, 3337095 edges, 29542 markings/sec, 40 secs
lola: 1531184 markings, 3769717 edges, 30492 markings/sec, 45 secs
lola: 1690781 markings, 4260205 edges, 31919 markings/sec, 50 secs
lola: 1852922 markings, 4804329 edges, 32428 markings/sec, 55 secs
lola: 2012712 markings, 5380781 edges, 31958 markings/sec, 60 secs
lola: 2176776 markings, 6027634 edges, 32813 markings/sec, 65 secs
lola: 2333517 markings, 6673605 edges, 31348 markings/sec, 70 secs
lola: 2502874 markings, 7294613 edges, 33871 markings/sec, 75 secs
lola: 2656369 markings, 7982615 edges, 30699 markings/sec, 80 secs
lola: 2804160 markings, 8687545 edges, 29558 markings/sec, 85 secs
lola: 2938299 markings, 9541064 edges, 26828 markings/sec, 90 secs
lola: 3035746 markings, 10571191 edges, 19489 markings/sec, 95 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 3045060 markings, 11384286 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-3 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p137 + p138 + p139 + p140 + p141 + p142)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p137 + p138 + p139 + p140 + p141 + p142)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: 164794 markings, 315864 edges, 32959 markings/sec, 0 secs
lola: 326218 markings, 671484 edges, 32285 markings/sec, 5 secs
lola: 487349 markings, 1046214 edges, 32226 markings/sec, 10 secs
lola: 648700 markings, 1438651 edges, 32270 markings/sec, 15 secs
lola: 808965 markings, 1840280 edges, 32053 markings/sec, 20 secs
lola: 967789 markings, 2247081 edges, 31765 markings/sec, 25 secs
lola: 1125329 markings, 2658296 edges, 31508 markings/sec, 30 secs
lola: 1276334 markings, 3058357 edges, 30201 markings/sec, 35 secs
lola: 1427623 markings, 3473961 edges, 30258 markings/sec, 40 secs
lola: 1581847 markings, 3920610 edges, 30845 markings/sec, 45 secs
lola: 1746641 markings, 4443478 edges, 32959 markings/sec, 50 secs
lola: 1910231 markings, 5008094 edges, 32718 markings/sec, 55 secs
lola: 2073675 markings, 5618611 edges, 32689 markings/sec, 60 secs
lola: 2231701 markings, 6253824 edges, 31605 markings/sec, 65 secs
lola: 2395516 markings, 6935233 edges, 32763 markings/sec, 70 secs
lola: 2575388 markings, 7609245 edges, 35974 markings/sec, 75 secs
lola: 2737108 markings, 8371930 edges, 32344 markings/sec, 80 secs
lola: 2888680 markings, 9194421 edges, 30314 markings/sec, 85 secs
lola: 3008677 markings, 10123908 edges, 23999 markings/sec, 90 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 3045060 markings, 11384286 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-0 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7 + p8 + p9 + p10 + p11 + p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7 + p8 + p9 + p10 + p11 + p12)
lola: processed formula length: 35
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: 147627 markings, 379378 edges, 29525 markings/sec, 0 secs
lola: 290568 markings, 780934 edges, 28588 markings/sec, 5 secs
lola: 430982 markings, 1170552 edges, 28083 markings/sec, 10 secs
lola: 571566 markings, 1575423 edges, 28117 markings/sec, 15 secs
lola: 710561 markings, 1984439 edges, 27799 markings/sec, 20 secs
lola: 846167 markings, 2397117 edges, 27121 markings/sec, 25 secs
lola: 977805 markings, 2810908 edges, 26328 markings/sec, 30 secs
lola: 1111151 markings, 3243524 edges, 26669 markings/sec, 35 secs
lola: 1241226 markings, 3664873 edges, 26015 markings/sec, 40 secs
lola: 1375439 markings, 4103346 edges, 26843 markings/sec, 45 secs
lola: 1509119 markings, 4548556 edges, 26736 markings/sec, 50 secs
lola: 1641646 markings, 4988329 edges, 26505 markings/sec, 55 secs
lola: 1769746 markings, 5414290 edges, 25620 markings/sec, 60 secs
lola: 1899998 markings, 5854581 edges, 26050 markings/sec, 65 secs
lola: 2029050 markings, 6295644 edges, 25810 markings/sec, 70 secs
lola: 2158889 markings, 6737792 edges, 25968 markings/sec, 75 secs
lola: 2281433 markings, 7161440 edges, 24509 markings/sec, 80 secs
lola: 2400762 markings, 7578193 edges, 23866 markings/sec, 85 secs
lola: 2521088 markings, 7996840 edges, 24065 markings/sec, 90 secs
lola: 2639661 markings, 8420336 edges, 23715 markings/sec, 95 secs
lola: 2760299 markings, 8849276 edges, 24128 markings/sec, 100 secs
lola: 2887885 markings, 9310763 edges, 25517 markings/sec, 105 secs
lola: 3008659 markings, 9754039 edges, 24155 markings/sec, 110 secs
lola: 3128463 markings, 10200470 edges, 23961 markings/sec, 115 secs
lola: 3249763 markings, 10656223 edges, 24260 markings/sec, 120 secs
lola: 3371998 markings, 11114256 edges, 24447 markings/sec, 125 secs
lola: 3492915 markings, 11567137 edges, 24183 markings/sec, 130 secs
lola: 3614477 markings, 12027580 edges, 24312 markings/sec, 135 secs
lola: 3733142 markings, 12473703 edges, 23733 markings/sec, 140 secs
lola: 3854261 markings, 12937138 edges, 24224 markings/sec, 145 secs
lola: 3976048 markings, 13400043 edges, 24357 markings/sec, 150 secs
lola: 4094871 markings, 13857867 edges, 23765 markings/sec, 155 secs
lola: 4211590 markings, 14308863 edges, 23344 markings/sec, 160 secs
lola: 4329562 markings, 14772667 edges, 23594 markings/sec, 165 secs
lola: 4444303 markings, 15223650 edges, 22948 markings/sec, 170 secs
lola: 4562524 markings, 15697632 edges, 23644 markings/sec, 175 secs
lola: 4680974 markings, 16176647 edges, 23690 markings/sec, 180 secs
lola: 4797637 markings, 16654310 edges, 23333 markings/sec, 185 secs
lola: 4914171 markings, 17138082 edges, 23307 markings/sec, 190 secs
lola: 5029546 markings, 17617771 edges, 23075 markings/sec, 195 secs
lola: 5147562 markings, 18117634 edges, 23603 markings/sec, 200 secs
lola: 5266382 markings, 18619226 edges, 23764 markings/sec, 205 secs
lola: 5386584 markings, 19137531 edges, 24040 markings/sec, 210 secs
lola: 5504452 markings, 19637619 edges, 23574 markings/sec, 215 secs
lola: 5623895 markings, 20140241 edges, 23889 markings/sec, 220 secs
lola: 5741966 markings, 20638018 edges, 23614 markings/sec, 225 secs
lola: 5863817 markings, 21158772 edges, 24370 markings/sec, 230 secs
lola: 5990635 markings, 21705176 edges, 25364 markings/sec, 235 secs
lola: 6114873 markings, 22249859 edges, 24848 markings/sec, 240 secs
lola: 6245949 markings, 22831464 edges, 26215 markings/sec, 245 secs
lola: 6369816 markings, 23408211 edges, 24773 markings/sec, 250 secs
lola: 6496352 markings, 24007620 edges, 25307 markings/sec, 255 secs
lola: 6626649 markings, 24723179 edges, 26059 markings/sec, 260 secs
lola: 6754776 markings, 25534335 edges, 25625 markings/sec, 265 secs
lola: 6801906 markings, 26641717 edges, 9426 markings/sec, 270 secs
lola: 6811987 markings, 27901105 edges, 2016 markings/sec, 275 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 6816001 markings, 29153472 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-12 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p86 + p85 + p84 + p83 + p88)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p86 + p85 + p84 + p83 + p88)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7 + p8 + p9 + p10 + p11 + p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7 + p8 + p9 + p10 + p11 + p12)
lola: processed formula length: 35
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: 141497 markings, 361664 edges, 28299 markings/sec, 0 secs
lola: 277260 markings, 742941 edges, 27153 markings/sec, 5 secs
lola: 412598 markings, 1118022 edges, 27068 markings/sec, 10 secs
lola: 545551 markings, 1499220 edges, 26591 markings/sec, 15 secs
lola: 678454 markings, 1887652 edges, 26581 markings/sec, 20 secs
lola: 807860 markings, 2277205 edges, 25881 markings/sec, 25 secs
lola: 938334 markings, 2685463 edges, 26095 markings/sec, 30 secs
lola: 1065738 markings, 3095238 edges, 25481 markings/sec, 35 secs
lola: 1196156 markings, 3518101 edges, 26084 markings/sec, 40 secs
lola: 1324521 markings, 3937064 edges, 25673 markings/sec, 45 secs
lola: 1451546 markings, 4356201 edges, 25405 markings/sec, 50 secs
lola: 1581204 markings, 4787837 edges, 25932 markings/sec, 55 secs
lola: 1707865 markings, 5209988 edges, 25332 markings/sec, 60 secs
lola: 1833438 markings, 5628857 edges, 25115 markings/sec, 65 secs
lola: 1957697 markings, 6049669 edges, 24852 markings/sec, 70 secs
lola: 2083714 markings, 6481633 edges, 25203 markings/sec, 75 secs
lola: 2205064 markings, 6894711 edges, 24270 markings/sec, 80 secs
lola: 2325802 markings, 7316290 edges, 24148 markings/sec, 85 secs
lola: 2448836 markings, 7744200 edges, 24607 markings/sec, 90 secs
lola: 2569945 markings, 8169762 edges, 24222 markings/sec, 95 secs
lola: 2690854 markings, 8603010 edges, 24182 markings/sec, 100 secs
lola: 2812608 markings, 9037790 edges, 24351 markings/sec, 105 secs
lola: 2932606 markings, 9473946 edges, 24000 markings/sec, 110 secs
lola: 3052933 markings, 9917648 edges, 24065 markings/sec, 115 secs
lola: 3172507 markings, 10365244 edges, 23915 markings/sec, 120 secs
lola: 3295736 markings, 10829375 edges, 24646 markings/sec, 125 secs
lola: 3416914 markings, 11285343 edges, 24236 markings/sec, 130 secs
lola: 3537905 markings, 11738670 edges, 24198 markings/sec, 135 secs
lola: 3657857 markings, 12191649 edges, 23990 markings/sec, 140 secs
lola: 3780572 markings, 12655433 edges, 24543 markings/sec, 145 secs
lola: 3902150 markings, 13118959 edges, 24316 markings/sec, 150 secs
lola: 4020870 markings, 13573331 edges, 23744 markings/sec, 155 secs
lola: 4136508 markings, 14019140 edges, 23128 markings/sec, 160 secs
lola: 4249361 markings, 14456987 edges, 22571 markings/sec, 165 secs
lola: 4364742 markings, 14910628 edges, 23076 markings/sec, 170 secs
lola: 4487014 markings, 15395005 edges, 24454 markings/sec, 175 secs
lola: 4609112 markings, 15882835 edges, 24420 markings/sec, 180 secs
lola: 4731188 markings, 16378440 edges, 24415 markings/sec, 185 secs
lola: 4848785 markings, 16865657 edges, 23519 markings/sec, 190 secs
lola: 4965117 markings, 17348205 edges, 23266 markings/sec, 195 secs
lola: 5080963 markings, 17835104 edges, 23169 markings/sec, 200 secs
lola: 5200153 markings, 18340828 edges, 23838 markings/sec, 205 secs
lola: 5320643 markings, 18852078 edges, 24098 markings/sec, 210 secs
lola: 5442799 markings, 19378196 edges, 24431 markings/sec, 215 secs
lola: 5561063 markings, 19875386 edges, 23653 markings/sec, 220 secs
lola: 5682210 markings, 20384238 edges, 24229 markings/sec, 225 secs
lola: 5806634 markings, 20912223 edges, 24885 markings/sec, 230 secs
lola: 5933785 markings, 21460932 edges, 25430 markings/sec, 235 secs
lola: 6057857 markings, 21992993 edges, 24814 markings/sec, 240 secs
lola: 6183639 markings, 22560199 edges, 25156 markings/sec, 245 secs
lola: 6316556 markings, 23160965 edges, 26583 markings/sec, 250 secs
lola: 6439842 markings, 23733231 edges, 24657 markings/sec, 255 secs
lola: 6572771 markings, 24406608 edges, 26586 markings/sec, 260 secs
lola: 6708234 markings, 25214588 edges, 27093 markings/sec, 265 secs
lola: 6794800 markings, 26168992 edges, 17313 markings/sec, 270 secs
lola: 6809390 markings, 27437114 edges, 2918 markings/sec, 275 secs
lola: 6815601 markings, 28865043 edges, 1242 markings/sec, 280 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 6816001 markings, 29153472 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-14 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p86 + p85 + p84 + p83 + p88)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p86 + p85 + p84 + p83 + p88)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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 SafeBus-COL-06-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136)
lola: processed formula length: 254
lola: 0 rewrites
lola: closed formula file SafeBus-COL-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================

FORMULA SafeBus-COL-06-UpperBounds-1 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 5 6 1 5 1 1 1 1 1 6 1 1 5 1 5 6
lola:
preliminary result: 5 6 1 5 1 1 1 1 1 6 1 1 5 1 5 6
lola: memory consumption: 19276 KB
lola: time consumption: 772 seconds

BK_STOP 1553106039612

--------------------
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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r165-csrt-155286441800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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