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

About the Execution of 2018-Gold for GPPP-PT-C0010N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2435.600 561037.00 586076.00 119.30 4 10 1 30 30 2 20 70 1 70 110 20 36 2 10 10 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.r088-csrt-155246565800121.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 GPPP-PT-C0010N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246565800121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.6K Feb 11 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 7 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 31 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 01:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col

-rw-r--r-- 1 mcc users 17 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1552863716114

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0010N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0010N0000000010 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C0010N0000000010 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0010N0000000010-UpperBounds.task
lola: MAX(FBP) : MAX(NADH) : MAX(E4P) : MAX(b1) : MAX(b1) : MAX(R5P) : MAX(GSH) : MAX(Pi) : MAX(E4P) : MAX(c1) : MAX(ADP) : MAX(GSH) : MAX(Xu5P) : MAX(R5P) : MAX(NADH) : MAX(_1_3_BPG)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FBP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FBP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: 1620088 markings, 4553382 edges, 324018 markings/sec, 0 secs
lola: 4239265 markings, 12403718 edges, 523835 markings/sec, 5 secs
lola: 6713827 markings, 19928290 edges, 494912 markings/sec, 10 secs
lola: 9019565 markings, 27470835 edges, 461148 markings/sec, 15 secs
lola: 11211468 markings, 34637246 edges, 438381 markings/sec, 20 secs
lola: 13326176 markings, 41802406 edges, 422942 markings/sec, 25 secs
lola: 15403497 markings, 48693828 edges, 415464 markings/sec, 30 secs
lola: 17596967 markings, 55326603 edges, 438694 markings/sec, 35 secs
lola: 19659417 markings, 61603507 edges, 412490 markings/sec, 40 secs
lola: 21663572 markings, 67747331 edges, 400831 markings/sec, 45 secs
lola: 23704126 markings, 73949141 edges, 408111 markings/sec, 50 secs
lola: 25721696 markings, 80142186 edges, 403514 markings/sec, 55 secs
lola: 28024251 markings, 87150006 edges, 460511 markings/sec, 60 secs
lola: 30290288 markings, 94080177 edges, 453207 markings/sec, 65 secs
lola: 32534349 markings, 100926185 edges, 448812 markings/sec, 70 secs
lola: 34894205 markings, 108134905 edges, 471971 markings/sec, 75 secs
lola: 37030116 markings, 115114261 edges, 427182 markings/sec, 80 secs
lola: 38929692 markings, 121569671 edges, 379915 markings/sec, 85 secs
lola: 40741470 markings, 128115542 edges, 362356 markings/sec, 90 secs
lola: 42631951 markings, 134514588 edges, 378096 markings/sec, 95 secs
lola: 44518533 markings, 140886701 edges, 377316 markings/sec, 100 secs
lola: 46440395 markings, 147224957 edges, 384372 markings/sec, 105 secs
lola: 48311699 markings, 153851163 edges, 374261 markings/sec, 110 secs
lola: 50170048 markings, 160379658 edges, 371670 markings/sec, 115 secs
lola: 52067182 markings, 166908218 edges, 379427 markings/sec, 120 secs
lola: 53874203 markings, 173255661 edges, 361404 markings/sec, 125 secs
lola: 55628337 markings, 179414607 edges, 350827 markings/sec, 130 secs
lola: 57434081 markings, 186005821 edges, 361149 markings/sec, 135 secs
lola: 59101249 markings, 192961775 edges, 333434 markings/sec, 140 secs
lola: 60825892 markings, 200017815 edges, 344929 markings/sec, 145 secs
lola: 62488959 markings, 205887864 edges, 332613 markings/sec, 150 secs
lola: 64134411 markings, 211468749 edges, 329090 markings/sec, 155 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 65642091 markings, 216428084 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-0 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NADH)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 2816 markings, 4492 edges, 563 markings/sec, 25 secs
lola: 3072668 markings, 7532466 edges, 613970 markings/sec, 30 secs
lola: 5983861 markings, 14777318 edges, 582239 markings/sec, 35 secs
lola: 8852250 markings, 21899142 edges, 573678 markings/sec, 40 secs
lola: 11689569 markings, 28733813 edges, 567464 markings/sec, 45 secs
lola: 14571167 markings, 35652112 edges, 576320 markings/sec, 50 secs
lola: 17508514 markings, 42883458 edges, 587469 markings/sec, 55 secs
lola: 20207359 markings, 50002042 edges, 539769 markings/sec, 60 secs
lola: 22395536 markings, 56579767 edges, 437635 markings/sec, 65 secs
lola: 24451687 markings, 62779574 edges, 411230 markings/sec, 70 secs
lola: 26468746 markings, 68855502 edges, 403412 markings/sec, 75 secs
lola: 28400180 markings, 74683602 edges, 386287 markings/sec, 80 secs
lola: 30327210 markings, 80505031 edges, 385406 markings/sec, 85 secs
lola: 32365565 markings, 86665770 edges, 407671 markings/sec, 90 secs
lola: 34549674 markings, 93268497 edges, 436822 markings/sec, 95 secs
lola: 37017162 markings, 99997028 edges, 493498 markings/sec, 100 secs
lola: 39359184 markings, 106830292 edges, 468404 markings/sec, 105 secs
lola: 41755237 markings, 113726887 edges, 479211 markings/sec, 110 secs
lola: 44171629 markings, 120771776 edges, 483278 markings/sec, 115 secs
lola: 46308539 markings, 127213773 edges, 427382 markings/sec, 120 secs
lola: 48734213 markings, 134148659 edges, 485135 markings/sec, 125 secs
lola: 50788592 markings, 140752802 edges, 410876 markings/sec, 130 secs
lola: 52818490 markings, 147239992 edges, 405980 markings/sec, 135 secs
lola: 54781203 markings, 153503396 edges, 392543 markings/sec, 140 secs
lola: 56759828 markings, 159819983 edges, 395725 markings/sec, 145 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 58348953 markings, 164788918 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-1 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(E4P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(E4P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 14 markings, 13 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-2 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(b1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(b1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 30
lola: SUBRESULT
lola: result: 30
lola: produced by: state space
lola: The maximum value of the given expression is 30
lola: 0 markings, 0 edges
lola: ========================================

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

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-4 30 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(R5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R5P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 108 markings, 107 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSH)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 24 markings, 23 edges
lola: ========================================
lola: ========================================

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

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-7 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(E4P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(E4P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 14 markings, 13 edges

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

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-9 70 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ADP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ADP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 110
lola: SUBRESULT
lola: result: 110
lola: produced by: state space
lola: The maximum value of the given expression is 110
lola: 42 markings, 41 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-10 110 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(GSH)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 24 markings, 23 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-11 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Xu5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Xu5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 38
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 1007954 markings, 1435719 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-12 36 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(R5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R5P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 108 markings, 107 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADH)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(NADH)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 374 markings, 396 edges, 75 markings/sec, 25 secs
lola: 3043981 markings, 7464636 edges, 608721 markings/sec, 30 secs
lola: 5718381 markings, 14092636 edges, 534880 markings/sec, 35 secs
lola: 8374321 markings, 20741703 edges, 531188 markings/sec, 40 secs
lola: 11006688 markings, 27093403 edges, 526473 markings/sec, 45 secs
lola: 13879444 markings, 33991616 edges, 574551 markings/sec, 50 secs
lola: 16830658 markings, 41145821 edges, 590243 markings/sec, 55 secs
lola: 19585597 markings, 48213726 edges, 550988 markings/sec, 60 secs
lola: 21869976 markings, 55000272 edges, 456876 markings/sec, 65 secs
lola: 24102896 markings, 61727708 edges, 446584 markings/sec, 70 secs
lola: 26330421 markings, 68438455 edges, 445505 markings/sec, 75 secs
lola: 28483826 markings, 74936887 edges, 430681 markings/sec, 80 secs
lola: 30685271 markings, 81583545 edges, 440289 markings/sec, 85 secs
lola: 32852346 markings, 88135663 edges, 433415 markings/sec, 90 secs
lola: 35045515 markings, 94767451 edges, 438634 markings/sec, 95 secs
lola: 37647099 markings, 101686822 edges, 520317 markings/sec, 100 secs
lola: 39906594 markings, 108476845 edges, 451899 markings/sec, 105 secs
lola: 42388639 markings, 115469967 edges, 496409 markings/sec, 110 secs
lola: 44692527 markings, 122342750 edges, 460778 markings/sec, 115 secs
lola: 46849371 markings, 128678813 edges, 431369 markings/sec, 120 secs
lola: 49188870 markings, 135608445 edges, 467900 markings/sec, 125 secs
lola: 51224392 markings, 142151225 edges, 407104 markings/sec, 130 secs
lola: 53195542 markings, 148442663 edges, 394230 markings/sec, 135 secs
lola: 55131648 markings, 154622365 edges, 387221 markings/sec, 140 secs
lola: 57056959 markings, 160768147 edges, 385062 markings/sec, 145 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 58348953 markings, 164788918 edges
lola: ========================================

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-14 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3010 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(_1_3_BPG)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file GPPP-PT-C0010N0000000010-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: 192 markings, 191 edges

FORMULA GPPP-PT-C0010N0000000010-UpperBounds-15 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 4 10 1 30 30 2 20 70 1 70 110 20 36 2 10 10
lola:
preliminary result: 4 10 1 30 30 2 20 70 1 70 110 20 36 2 10 10
lola: ========================================
lola: memory consumption: 18084 KB
lola: time consumption: 561 seconds

BK_STOP 1552864277151

--------------------
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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r088-csrt-155246565800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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