About the Execution of LoLA for GPPP-PT-C1000N0000000010
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 192K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C1000N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400338
=====================================================================
--------------------
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-C1000N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526747141658
info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-UpperBounds.task
lola: MAX(Pi) : MAX(Ru5P) : MAX(G6P) : MAX(Pi) : MAX(ATP) : MAX(Pi) : MAX(Gluc) : MAX(start) : MAX(S7P) : MAX(b1) : MAX(GSH) : MAX(Pi) : MAX(GSH) : MAX(a2) : MAX(ATP) : MAX(a1)
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(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-C1000N0000000010-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: 7000
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: 2 markings, 1 edges
lola: check_solution: Constraint R1 = 6.94457599838e-310 is below its lower bound 1
check_solution: Constraint R3 = 0 is above its equality of -10
check_solution: Constraint R6 = 6.15378779518e-313 is above its equality of -40
check_solution: Constraint R9 = 2.12199580776e-314 is above its equality of -2000
check_solution: Constraint R11 = 1.06099789568e-313 is above its equality of -3000
check_solution: Constraint R12 = 1.48539705397e-313 is above its equality of -20
check_solution: Constraint R13 = 1.90979621226e-313 is above its equality of -7000
check_solution: Constraint R23 = 6.15378779518e-313 is above its equality of -1
check_solution: Constraint R25 = 7.00258611177e-313 is above its equality of -20
Seriously low accuracy found ||*|| = 7000 (rel. error 1)
spx_run: Lost feasibility 10 times - iter 164 and 112 nodes.
spx_run: Lost feasibility 10 times - iter 657 and 342 nodes.
spx_run: Lost feasibility 10 times - iter 762 and 396 nodes.
spx_run: Lost feasibility 10 times - iter 1921 and 1056 nodes.
spx_run: Lost feasibility 10 times - iter 5993 and 3170 nodes.
spx_run: Lost feasibility 10 times - iter 6208 and 3272 nodes.
spx_run: Lost feasibility 10 times - iter 12243 and 6376 nodes.
spx_run: Lost feasibility 10 times - iter 12506 and 6500 nodes.
spx_run: Lost feasibility 10 times - iter 21721 and 11139 nodes.
spx_run: Lost feasibility 10 times - iter 21826 and 11193 nodes.
check_solution: Variable C27 = -1.18877474767 is below its lower bound 0
check_solution: Variable C29 = -0.550689099133 is below its lower bound 0
check_solution: Constraint R3 = 0 is above its equality of -10
check_solution: Constraint R6 = 8.91238232591e-313 is above its equality of -40
check_solution: Constraint R7 = 0.695725440979 is above its equality of 0
check_solution: Constraint R8 = 0.00830013941745 is above its equality of 0
check_solution: Constraint R9 = 7.95445689804e-322 is above its equality of -2000
check_solution: Constraint R11 = 6.94457599838e-310 is above its equality of -3000
check_solution: Constraint R12 = 4.67671847562e-310 is above its equality of -20
check_solution: Constraint R13 = 2.12199581814e-314 is above its equality of -7000
Seriously low accuracy found ||*|| = 1e+30 (rel. error 5e+29)
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-0 7000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ru5P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ru5P)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 5404361 markings, 8180591 edges, 1080872 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: 6365263 markings, 9754263 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-1 47 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(G6P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(G6P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 1083 markings, 1083 edges, 217 markings/sec, 25 secs
lola: 2743926 markings, 9316425 edges, 548569 markings/sec, 30 secs
lola: 5128529 markings, 17986402 edges, 476921 markings/sec, 35 secs
lola: 7316982 markings, 26644318 edges, 437691 markings/sec, 40 secs
lola: 9414784 markings, 35037557 edges, 419560 markings/sec, 45 secs
lola: 11479519 markings, 43406924 edges, 412947 markings/sec, 50 secs
lola: 13352700 markings, 51831646 edges, 374636 markings/sec, 55 secs
lola: 15708816 markings, 59481179 edges, 471223 markings/sec, 60 secs
lola: 17934802 markings, 67124011 edges, 445197 markings/sec, 65 secs
lola: 20065953 markings, 75373675 edges, 426230 markings/sec, 70 secs
lola: 21814472 markings, 83204536 edges, 349704 markings/sec, 75 secs
lola: 23858396 markings, 91273959 edges, 408785 markings/sec, 80 secs
lola: 25407296 markings, 99087662 edges, 309780 markings/sec, 85 secs
lola: 27397918 markings, 107121106 edges, 398124 markings/sec, 90 secs
lola: 29475335 markings, 115136483 edges, 415483 markings/sec, 95 secs
lola: 31035809 markings, 122693950 edges, 312095 markings/sec, 100 secs
lola: 32875734 markings, 130542147 edges, 367985 markings/sec, 105 secs
lola: 34370561 markings, 138178065 edges, 298965 markings/sec, 110 secs
lola: 36133860 markings, 145974675 edges, 352660 markings/sec, 115 secs
lola: 37663112 markings, 153775913 edges, 305850 markings/sec, 120 secs
lola: 39391346 markings, 161553149 edges, 345647 markings/sec, 125 secs
lola: 40922024 markings, 169337594 edges, 306136 markings/sec, 130 secs
lola: 42682393 markings, 177174142 edges, 352074 markings/sec, 135 secs
lola: 44194444 markings, 184909487 edges, 302410 markings/sec, 140 secs
lola: 45919884 markings, 192763264 edges, 345088 markings/sec, 145 secs
lola: 47487811 markings, 200442441 edges, 313585 markings/sec, 150 secs
lola: 49105876 markings, 208224569 edges, 323613 markings/sec, 155 secs
lola: 50829788 markings, 216129197 edges, 344782 markings/sec, 160 secs
lola: 52411638 markings, 223844992 edges, 316370 markings/sec, 165 secs
lola: 54054056 markings, 231715184 edges, 328484 markings/sec, 170 secs
lola: 55686349 markings, 239537839 edges, 326459 markings/sec, 175 secs
lola: 57366529 markings, 247450855 edges, 336036 markings/sec, 180 secs
lola: 59015449 markings, 255284977 edges, 329784 markings/sec, 185 secs
lola: 60655501 markings, 263153104 edges, 328010 markings/sec, 190 secs
lola: 62351109 markings, 271104997 edges, 339122 markings/sec, 195 secs
lola: 64051276 markings, 279175850 edges, 340033 markings/sec, 200 secs
lola: 65777086 markings, 287363112 edges, 345162 markings/sec, 205 secs
lola: 67582852 markings, 295826605 edges, 361153 markings/sec, 210 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: 68710657 markings, 301058844 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-2 47 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 248 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-C1000N0000000010-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: 7000
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: 2 markings, 1 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-3 7000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 328 markings, 327 edges, 66 markings/sec, 25 secs
lola: 3513812 markings, 9380865 edges, 702697 markings/sec, 30 secs
lola: 6779283 markings, 18056438 edges, 653094 markings/sec, 35 secs
lola: 9884424 markings, 26715336 edges, 621028 markings/sec, 40 secs
lola: 12756977 markings, 35333388 edges, 574511 markings/sec, 45 secs
lola: 15883948 markings, 43922388 edges, 625394 markings/sec, 50 secs
lola: 18662857 markings, 52220787 edges, 555782 markings/sec, 55 secs
lola: 21357552 markings, 60369839 edges, 538939 markings/sec, 60 secs
lola: 23812395 markings, 68329172 edges, 490969 markings/sec, 65 secs
lola: 26509457 markings, 76599720 edges, 539412 markings/sec, 70 secs
lola: 28961362 markings, 84576417 edges, 490381 markings/sec, 75 secs
lola: 31516014 markings, 92767117 edges, 510930 markings/sec, 80 secs
lola: 34044831 markings, 100739407 edges, 505763 markings/sec, 85 secs
lola: 36638379 markings, 108923334 edges, 518710 markings/sec, 90 secs
lola: 39224865 markings, 117083630 edges, 517297 markings/sec, 95 secs
lola: 42257643 markings, 125059195 edges, 606556 markings/sec, 100 secs
lola: 44753520 markings, 132976465 edges, 499175 markings/sec, 105 secs
lola: 47674597 markings, 141120263 edges, 584215 markings/sec, 110 secs
lola: 49632462 markings, 147386097 edges, 391573 markings/sec, 115 secs
lola: 52051307 markings, 154921343 edges, 483769 markings/sec, 120 secs
lola: 54526166 markings, 162742333 edges, 494972 markings/sec, 125 secs
lola: 56924332 markings, 170501126 edges, 479633 markings/sec, 130 secs
lola: 59404366 markings, 178379262 edges, 496007 markings/sec, 135 secs
lola: 61843922 markings, 186197511 edges, 487911 markings/sec, 140 secs
lola: 64330261 markings, 194006116 edges, 497268 markings/sec, 145 secs
lola: 67115474 markings, 201962062 edges, 557043 markings/sec, 150 secs
lola: 69755889 markings, 209915515 edges, 528083 markings/sec, 155 secs
lola: 72108483 markings, 217479310 edges, 470519 markings/sec, 160 secs
lola: 74458063 markings, 225040891 edges, 469916 markings/sec, 165 secs
lola: 76809890 markings, 232581672 edges, 470365 markings/sec, 170 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: 76947295 markings, 232946403 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-4 47 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 277 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-C1000N0000000010-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: 7000
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: 2 markings, 1 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-5 7000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Gluc)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Gluc)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 4000
lola: SUBRESULT
lola: result: 4000
lola: produced by: state space
lola: The maximum value of the given expression is 4000
lola: 2 markings, 1 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-6 4000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 7 will run for 339 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: MAX(start)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(start)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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 GPPP-PT-C1000N0000000010-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(S7P)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(S7P)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 509 markings, 517 edges, 102 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 346457 markings, 487371 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 432 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-C1000N0000000010-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: 3000
lola: SUBRESULT
lola: result: 3000
lola: produced by: state space
lola: The maximum value of the given expression is 3000
lola: 0 markings, 0 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-9 3000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 504 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-C1000N0000000010-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: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 5453906 markings, 8254033 edges, 1090781 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 6612935 markings, 10001935 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-10 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 597 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-C1000N0000000010-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: 7000
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: 2 markings, 1 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-11 7000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 747 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-C1000N0000000010-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: 1913 markings, 2201 edges, 383 markings/sec, 25 secs
lola: 5503931 markings, 8331005 edges, 1100404 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 6612935 markings, 10001935 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-12 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 984 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 868 markings, 951 edges, 174 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 338947 markings, 479933 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-13 2000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ATP)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 3481069 markings, 9294477 edges, 696214 markings/sec, 30 secs
lola: 6702469 markings, 17852262 edges, 644280 markings/sec, 35 secs
lola: 9787645 markings, 26425111 edges, 617035 markings/sec, 40 secs
lola: 12609218 markings, 34889632 edges, 564315 markings/sec, 45 secs
lola: 15627312 markings, 43399498 edges, 603619 markings/sec, 50 secs
lola: 18452580 markings, 51580378 edges, 565054 markings/sec, 55 secs
lola: 21103882 markings, 59608166 edges, 530260 markings/sec, 60 secs
lola: 23604609 markings, 67617969 edges, 500145 markings/sec, 65 secs
lola: 26306388 markings, 75929471 edges, 540356 markings/sec, 70 secs
lola: 28757108 markings, 83962369 edges, 490144 markings/sec, 75 secs
lola: 31332917 markings, 92140442 edges, 515162 markings/sec, 80 secs
lola: 33854738 markings, 100093339 edges, 504364 markings/sec, 85 secs
lola: 36406846 markings, 108137175 edges, 510422 markings/sec, 90 secs
lola: 38934691 markings, 116117670 edges, 505569 markings/sec, 95 secs
lola: 41937469 markings, 124094881 edges, 600556 markings/sec, 100 secs
lola: 44392914 markings, 131880901 edges, 491089 markings/sec, 105 secs
lola: 47257231 markings, 139788673 edges, 572863 markings/sec, 110 secs
lola: 49528018 markings, 147058265 edges, 454157 markings/sec, 115 secs
lola: 52000930 markings, 154758361 edges, 494582 markings/sec, 120 secs
lola: 54223230 markings, 161825435 edges, 444460 markings/sec, 125 secs
lola: 56648572 markings, 169570837 edges, 485068 markings/sec, 130 secs
lola: 59086339 markings, 177384106 edges, 487553 markings/sec, 135 secs
lola: 61526641 markings, 185177151 edges, 488060 markings/sec, 140 secs
lola: 64005178 markings, 192958277 edges, 495707 markings/sec, 145 secs
lola: 66620812 markings, 200835399 edges, 523127 markings/sec, 150 secs
lola: 69401139 markings, 208776884 edges, 556065 markings/sec, 155 secs
lola: 71759294 markings, 216355556 edges, 471631 markings/sec, 160 secs
lola: 74110629 markings, 223922775 edges, 470267 markings/sec, 165 secs
lola: 76426621 markings, 231379093 edges, 463198 markings/sec, 170 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: 76947295 markings, 232946403 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-14 47 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 2747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-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: 2000
lola: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: 0 markings, 0 edges
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-15 2000 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 7000 47 47 7000 47 7000 4000 1 1 3000 20 7000 20 2000 47 2000
lola:
preliminary result: 7000 47 47 7000 47 7000 4000 1 1 3000 20 7000 20 2000 47 2000
lola: ========================================
lola: memory consumption: 18604 KB
lola: time consumption: 823 seconds
BK_STOP 1526747964587
--------------------
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="GPPP-PT-C1000N0000000010"
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/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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 GPPP-PT-C1000N0000000010, 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-blw7-152649998400338"
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 ;