About the Execution of LoLA for SafeBus-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
485.590 | 623388.00 | 633985.00 | 1476.40 | 6 6 6 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 448K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200233
=====================================================================
--------------------
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-PT-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527026332097
info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-06 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ SafeBus-PT-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: 595/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: Size of bit vector: 4608
lola: finding significant places
lola: 144 places, 451 transitions, 109 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 375 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-06-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (msgl_1 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(listen_6 + listen_5 + listen_4 + listen_1 + listen_2 + listen_3) : MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6) : MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6) : MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6) : MAX(wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5) : MAX(cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6) : MAX(PMC_6 + PMC_5 + PMC_4 + PMC_3 + PMC_2 + PMC_1) : MAX(cable_free) : MAX(Cpt1_2) : MAX(wait_ack_2_3) : MAX(wait_ack_2_6) : MAX(AMC_4_3) : MAX(loop_em_1) : MAX(wait_ack_6_1) : MAX(0) : MAX(wait_msg_3)
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 SafeBus-PT-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-PT-06-UpperBounds-14 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(Cpt1_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Cpt1_2)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 2 markings, 1 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-8 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(wait_ack_2_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_2_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_2_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_2_6)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_4_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_4_3)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(loop_em_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(loop_em_1)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 152 markings, 162 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_6_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_6_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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
FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_free)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_free)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_msg_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_msg_3)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 122277 markings, 211855 edges, 24455 markings/sec, 30 secs
lola: 240043 markings, 452443 edges, 23553 markings/sec, 35 secs
lola: 353152 markings, 701618 edges, 22622 markings/sec, 40 secs
lola: 464713 markings, 961473 edges, 22312 markings/sec, 45 secs
lola: 576592 markings, 1229569 edges, 22376 markings/sec, 50 secs
lola: 687097 markings, 1506001 edges, 22101 markings/sec, 55 secs
lola: 797635 markings, 1784870 edges, 22108 markings/sec, 60 secs
lola: 907883 markings, 2064734 edges, 22050 markings/sec, 65 secs
lola: 1017573 markings, 2349454 edges, 21938 markings/sec, 70 secs
lola: 1125456 markings, 2639277 edges, 21577 markings/sec, 75 secs
lola: 1232873 markings, 2930662 edges, 21483 markings/sec, 80 secs
lola: 1339988 markings, 3228904 edges, 21423 markings/sec, 85 secs
lola: 1449267 markings, 3535262 edges, 21856 markings/sec, 90 secs
lola: 1558070 markings, 3841850 edges, 21761 markings/sec, 95 secs
lola: 1665704 markings, 4144100 edges, 21527 markings/sec, 100 secs
lola: 1775669 markings, 4448137 edges, 21993 markings/sec, 105 secs
lola: 1882886 markings, 4748920 edges, 21443 markings/sec, 110 secs
lola: 1991904 markings, 5050883 edges, 21804 markings/sec, 115 secs
lola: 2099175 markings, 5348369 edges, 21454 markings/sec, 120 secs
lola: 2206849 markings, 5652038 edges, 21535 markings/sec, 125 secs
lola: 2312553 markings, 5956173 edges, 21141 markings/sec, 130 secs
lola: 2419088 markings, 6266781 edges, 21307 markings/sec, 135 secs
lola: 2521615 markings, 6582481 edges, 20505 markings/sec, 140 secs
lola: 2625233 markings, 6911328 edges, 20724 markings/sec, 145 secs
lola: 2728031 markings, 7242299 edges, 20560 markings/sec, 150 secs
lola: 2830949 markings, 7588471 edges, 20584 markings/sec, 155 secs
lola: 2933348 markings, 7933248 edges, 20480 markings/sec, 160 secs
lola: 3035672 markings, 8289526 edges, 20465 markings/sec, 165 secs
lola: 3139391 markings, 8651240 edges, 20744 markings/sec, 170 secs
lola: 3242532 markings, 9016653 edges, 20628 markings/sec, 175 secs
lola: 3345130 markings, 9380419 edges, 20520 markings/sec, 180 secs
lola: 3451224 markings, 9765404 edges, 21219 markings/sec, 185 secs
lola: 3557320 markings, 10156116 edges, 21219 markings/sec, 190 secs
lola: 3662175 markings, 10545709 edges, 20971 markings/sec, 195 secs
lola: 3768932 markings, 10945736 edges, 21351 markings/sec, 200 secs
lola: 3873961 markings, 11341318 edges, 21006 markings/sec, 205 secs
lola: 3979333 markings, 11747550 edges, 21074 markings/sec, 210 secs
lola: 4086632 markings, 12169351 edges, 21460 markings/sec, 215 secs
lola: 4195743 markings, 12602919 edges, 21822 markings/sec, 220 secs
lola: 4307580 markings, 13048978 edges, 22367 markings/sec, 225 secs
lola: 4416119 markings, 13486344 edges, 21708 markings/sec, 230 secs
lola: 4524689 markings, 13933857 edges, 21714 markings/sec, 235 secs
lola: 4634916 markings, 14386364 edges, 22045 markings/sec, 240 secs
lola: 4741869 markings, 14823428 edges, 21391 markings/sec, 245 secs
lola: 4844065 markings, 15243728 edges, 20439 markings/sec, 250 secs
lola: 4948482 markings, 15682988 edges, 20883 markings/sec, 255 secs
lola: 5052782 markings, 16124616 edges, 20860 markings/sec, 260 secs
lola: 5159153 markings, 16585722 edges, 21274 markings/sec, 265 secs
lola: 5262342 markings, 17047137 edges, 20638 markings/sec, 270 secs
lola: 5366382 markings, 17511632 edges, 20808 markings/sec, 275 secs
lola: 5471231 markings, 17984913 edges, 20970 markings/sec, 280 secs
lola: 5582071 markings, 18478718 edges, 22168 markings/sec, 285 secs
lola: 5695077 markings, 19019125 edges, 22601 markings/sec, 290 secs
lola: 5799263 markings, 19527480 edges, 20837 markings/sec, 295 secs
lola: 5904348 markings, 20111124 edges, 21017 markings/sec, 300 secs
lola: 6001600 markings, 20811867 edges, 19450 markings/sec, 305 secs
lola: 6088713 markings, 21570904 edges, 17423 markings/sec, 310 secs
lola: 6146983 markings, 22511225 edges, 11654 markings/sec, 315 secs
lola: 6187981 markings, 23440621 edges, 8200 markings/sec, 320 secs
lola: 6217264 markings, 24495201 edges, 5857 markings/sec, 325 secs
lola: 6237570 markings, 25635835 edges, 4061 markings/sec, 330 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6242876 markings, 26146213 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 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: 67 markings, 66 edges, 13 markings/sec, 25 secs
lola: 124948 markings, 213259 edges, 24976 markings/sec, 30 secs
lola: 247364 markings, 447985 edges, 24483 markings/sec, 35 secs
lola: 369360 markings, 695503 edges, 24399 markings/sec, 40 secs
lola: 490686 markings, 952884 edges, 24265 markings/sec, 45 secs
lola: 611775 markings, 1220537 edges, 24218 markings/sec, 50 secs
lola: 732662 markings, 1499665 edges, 24177 markings/sec, 55 secs
lola: 850723 markings, 1770817 edges, 23612 markings/sec, 60 secs
lola: 971113 markings, 2058191 edges, 24078 markings/sec, 65 secs
lola: 1089272 markings, 2347440 edges, 23632 markings/sec, 70 secs
lola: 1206220 markings, 2637518 edges, 23390 markings/sec, 75 secs
lola: 1326002 markings, 2941078 edges, 23956 markings/sec, 80 secs
lola: 1444563 markings, 3248763 edges, 23712 markings/sec, 85 secs
lola: 1562752 markings, 3553900 edges, 23638 markings/sec, 90 secs
lola: 1681998 markings, 3865837 edges, 23849 markings/sec, 95 secs
lola: 1799005 markings, 4169772 edges, 23401 markings/sec, 100 secs
lola: 1915217 markings, 4474407 edges, 23242 markings/sec, 105 secs
lola: 2032648 markings, 4787809 edges, 23486 markings/sec, 110 secs
lola: 2151715 markings, 5111279 edges, 23813 markings/sec, 115 secs
lola: 2272247 markings, 5453977 edges, 24106 markings/sec, 120 secs
lola: 2391646 markings, 5800782 edges, 23880 markings/sec, 125 secs
lola: 2512739 markings, 6163320 edges, 24219 markings/sec, 130 secs
lola: 2634837 markings, 6543944 edges, 24420 markings/sec, 135 secs
lola: 2757451 markings, 6943491 edges, 24523 markings/sec, 140 secs
lola: 2881436 markings, 7362319 edges, 24797 markings/sec, 145 secs
lola: 3003934 markings, 7793418 edges, 24500 markings/sec, 150 secs
lola: 3127195 markings, 8251760 edges, 24652 markings/sec, 155 secs
lola: 3249622 markings, 8714045 edges, 24485 markings/sec, 160 secs
lola: 3371038 markings, 9186293 edges, 24283 markings/sec, 165 secs
lola: 3491004 markings, 9660794 edges, 23993 markings/sec, 170 secs
lola: 3608219 markings, 10154065 edges, 23443 markings/sec, 175 secs
lola: 3735787 markings, 10686786 edges, 25514 markings/sec, 180 secs
lola: 3861277 markings, 11240648 edges, 25098 markings/sec, 185 secs
lola: 3986753 markings, 11767769 edges, 25095 markings/sec, 190 secs
lola: 4108786 markings, 12325204 edges, 24407 markings/sec, 195 secs
lola: 4230217 markings, 12885732 edges, 24286 markings/sec, 200 secs
lola: 4352609 markings, 13461201 edges, 24478 markings/sec, 205 secs
lola: 4468031 markings, 14014237 edges, 23084 markings/sec, 210 secs
lola: 4584596 markings, 14597138 edges, 23313 markings/sec, 215 secs
lola: 4699467 markings, 15214109 edges, 22974 markings/sec, 220 secs
lola: 4807833 markings, 15841399 edges, 21673 markings/sec, 225 secs
lola: 4912553 markings, 16480252 edges, 20944 markings/sec, 230 secs
lola: 5014285 markings, 17114711 edges, 20346 markings/sec, 235 secs
lola: 5112594 markings, 17777675 edges, 19662 markings/sec, 240 secs
lola: 5207599 markings, 18473013 edges, 19001 markings/sec, 245 secs
lola: 5296407 markings, 19173630 edges, 17762 markings/sec, 250 secs
lola: 5381469 markings, 19902505 edges, 17012 markings/sec, 255 secs
lola: 5459656 markings, 20653015 edges, 15637 markings/sec, 260 secs
lola: 5537882 markings, 21456362 edges, 15645 markings/sec, 265 secs
lola: 5604044 markings, 22291777 edges, 13232 markings/sec, 270 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 5632788 markings, 22692048 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6)
lola: processed formula length: 92
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 3 markings, 2 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-5 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(PMC_6 + PMC_5 + PMC_4 + PMC_3 + PMC_2 + PMC_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(PMC_6 + PMC_5 + PMC_4 + PMC_3 + PMC_2 + PMC_1)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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: 3 markings, 2 edges
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-6 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(listen_6 + listen_5 + listen_4 + listen_1 + listen_2 + listen_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(listen_6 + listen_5 + listen_4 + listen_1 + listen_2 + listen_3)
lola: processed formula length: 68
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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
lola: ========================================
FORMULA SafeBus-PT-06-UpperBounds-0 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 982 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6)
lola: processed formula length: 92
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-1 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6)
lola: processed formula length: 92
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-2 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2947 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_6_1 + wait_a... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_6_1 + wait_a... (shortened)
lola: processed formula length: 452
lola: 0 rewrites
lola: closed formula file SafeBus-PT-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-PT-06-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 6 6 6 1 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 6 6 6 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: memory consumption: 18960 KB
lola: time consumption: 623 seconds
BK_STOP 1527026955485
--------------------
content from stderr:
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-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is SafeBus-PT-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 r148-smll-152685547200233"
echo "====================================================================="
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 '
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 ;