fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r028-blw3-149440264500547
Last Updated
June 27, 2017

About the Execution of LoLA for GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15950.050 619604.00 1137138.00 8180.80 FFFFFFTFF?TFT?TT 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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is GPPP-PT-C0100N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500547
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000001000-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494721787341


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C0100N0000001000 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-C0100N0000001000-ReachabilityCardinality.task
lola: A (G ((Lac <= NADPH))) : E (F (())) : A (G ((_1_3_BPG <= 2))) : E (F (((_3PG <= a2) AND (NADplus <= Ru5P) AND ((b2 <= _1_3_BPG) OR (c2 <= Pi)) AND (S7P <= c2) AND (c2 <= GAP) AND ((S7P <= b2) OR (FBP <= start))))) : E (F ((1 <= Pyr))) : E (F (())) : E (F ((3 <= NADH))) : A (G (((1 <= NADplus) OR (2 <= _2PG) OR (ATP <= NADPplus) OR (3 <= a2)))) : E (F ((((F6P <= NADplus) OR (1 <= _3PG) OR ((3 <= NADPH) AND (1 <= NADH))) AND ((GAP + 1 <= _3PG))))) : E (F (((G6P + 1 <= a2) AND (a2 + 1 <= NADPplus) AND (c2 <= 0) AND (a2 <= 2)))) : A (G ((Lac <= F6P))) : E (F (((NADplus <= a2) AND (2 <= R5P)))) : A (G (((b1 + 1 <= c1) OR (GAP + 1 <= NADH) OR (_2PG <= Ru5P)))) : A (G ((_2PG <= DHAP))) : E (F ((((c1 <= Gluc) OR (3 <= c2)) AND (Gluc + 1 <= S7P) AND (S7P <= 2) AND (b1 <= 0)))) : A (G ((_3PG <= a1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Lac <= NADPH)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-2.sara
lola: The predicate is not invariant.
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((_3PG <= a2) AND (NADplus <= Ru5P) AND ((b2 <= _1_3_BPG) OR (c2 <= Pi)) AND (S7P <= c2) AND (c2 <= GAP) AND ((S7P <= b2) OR (FBP <= start)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-3.sara.
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 2399700 markings, 9834442 edges, 479940 markings/sec, 0 secs
lola: sara is running 5 secs || 4436269 markings, 18813176 edges, 407314 markings/sec, 5 secs
lola: sara is running 10 secs || 6601204 markings, 27950568 edges, 432987 markings/sec, 10 secs
lola: sara is running 15 secs || 8526445 markings, 36229509 edges, 385048 markings/sec, 15 secs
lola: sara is running 20 secs || 10185684 markings, 44636921 edges, 331848 markings/sec, 20 secs
lola: sara is running 25 secs || 11768092 markings, 52509583 edges, 316482 markings/sec, 25 secs
lola: sara is running 30 secs || 13590116 markings, 60391292 edges, 364405 markings/sec, 30 secs
lola: sara is running 35 secs || 15564106 markings, 68404032 edges, 394798 markings/sec, 35 secs
lola: sara is running 40 secs || 17452278 markings, 77506890 edges, 377634 markings/sec, 40 secs
lola: sara is running 45 secs || 19264234 markings, 85702136 edges, 362391 markings/sec, 45 secs
lola: sara is running 50 secs || 20909670 markings, 93222261 edges, 329087 markings/sec, 50 secs
lola: sara is running 55 secs || 22490268 markings, 101202723 edges, 316120 markings/sec, 55 secs
lola: sara is running 60 secs || 23992089 markings, 108776754 edges, 300364 markings/sec, 60 secs
lola: sara is running 65 secs || 25900224 markings, 116863096 edges, 381627 markings/sec, 65 secs
lola: sara is running 70 secs || 27840913 markings, 124015128 edges, 388138 markings/sec, 70 secs
lola: sara is running 75 secs || 29716093 markings, 132619910 edges, 375036 markings/sec, 75 secs
lola: sara is running 80 secs || 31540224 markings, 141505671 edges, 364826 markings/sec, 80 secs
lola: sara is running 85 secs || 33410363 markings, 150214754 edges, 374028 markings/sec, 85 secs
lola: sara is running 90 secs || 35068351 markings, 158022301 edges, 331598 markings/sec, 90 secs
lola: sara is running 95 secs || 36773627 markings, 165856104 edges, 341055 markings/sec, 95 secs
lola: sara is running 100 secs || 38296453 markings, 173621459 edges, 304565 markings/sec, 100 secs
lola: sara is running 105 secs || 39803894 markings, 181134977 edges, 301488 markings/sec, 105 secs
lola: sara is running 110 secs || 41593646 markings, 188741407 edges, 357950 markings/sec, 110 secs
lola: sara is running 115 secs || 43437211 markings, 195972189 edges, 368713 markings/sec, 115 secs
lola: sara is running 120 secs || 45415662 markings, 203632224 edges, 395690 markings/sec, 120 secs
lola: sara is running 125 secs || 47186695 markings, 211827592 edges, 354207 markings/sec, 125 secs
lola: sara is running 130 secs || 48942327 markings, 220362162 edges, 351126 markings/sec, 130 secs
lola: sara is running 135 secs || 50728203 markings, 229294563 edges, 357175 markings/sec, 135 secs
lola: sara is running 140 secs || 52458669 markings, 237104954 edges, 346093 markings/sec, 140 secs
lola: sara is running 145 secs || 54120683 markings, 244911459 edges, 332403 markings/sec, 145 secs
lola: sara is running 150 secs || 55582709 markings, 252261390 edges, 292405 markings/sec, 150 secs
lola: sara is running 155 secs || 57164558 markings, 259587086 edges, 316370 markings/sec, 155 secs
lola: sara is running 160 secs || 58684563 markings, 267189475 edges, 304001 markings/sec, 160 secs
lola: sara is running 165 secs || 60067634 markings, 274330203 edges, 276614 markings/sec, 165 secs
lola: sara is running 170 secs || 62201947 markings, 282648169 edges, 426863 markings/sec, 170 secs
lola: sara is running 175 secs || 63937905 markings, 289214556 edges, 347192 markings/sec, 175 secs
lola: sara is running 180 secs || 65899540 markings, 296431305 edges, 392327 markings/sec, 180 secs
lola: sara is running 185 secs || 67566251 markings, 304303112 edges, 333342 markings/sec, 185 secs
lola: sara is running 190 secs || 69373996 markings, 312798666 edges, 361549 markings/sec, 190 secs
lola: sara is running 195 secs || 71126718 markings, 321373001 edges, 350544 markings/sec, 195 secs
lola: sara is running 200 secs || 72887991 markings, 330219083 edges, 352255 markings/sec, 200 secs
lola: sara is running 205 secs || 74606877 markings, 338074265 edges, 343777 markings/sec, 205 secs
lola: sara is running 210 secs || 76254138 markings, 345843588 edges, 329452 markings/sec, 210 secs
lola: sara is running 215 secs || 77720592 markings, 352724703 edges, 293291 markings/sec, 215 secs
lola: sara is running 220 secs || 79239336 markings, 360446782 edges, 303749 markings/sec, 220 secs
lola: sara is running 225 secs || 80781535 markings, 367582722 edges, 308440 markings/sec, 225 secs
lola: sara is running 230 secs || 82254818 markings, 374938033 edges, 294657 markings/sec, 230 secs
lola: sara is running 235 secs || 83603805 markings, 381894093 edges, 269797 markings/sec, 235 secs
lola: sara is running 240 secs || 85762986 markings, 390114364 edges, 431836 markings/sec, 240 secs
lola: sara is running 245 secs || 87548335 markings, 397051709 edges, 357070 markings/sec, 245 secs
lola: sara is running 250 secs || 89163957 markings, 403245175 edges, 323124 markings/sec, 250 secs
lola: sara is running 255 secs || 91232987 markings, 411466960 edges, 413806 markings/sec, 255 secs
lola: sara is running 260 secs || 92846262 markings, 418973318 edges, 322655 markings/sec, 260 secs
lola: sara is running 265 secs || 94601817 markings, 427346145 edges, 351111 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Pyr)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-4.sara
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: lola: lola: state equation: calling and running sara================================================================================


lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000001000-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= NADH)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-4.sara.
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= NADplus) OR (2 <= _2PG) OR (ATP <= NADPplus) OR (3 <= a2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-7.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 6396602 markings, 7230360 edges, 1279320 markings/sec, 0 secs
lola: sara is running 5 secs || 12777743 markings, 13764785 edges, 1276228 markings/sec, 5 secs
lola: sara is running 10 secs || 18462120 markings, 19548395 edges, 1136875 markings/sec, 10 secs
lola: sara is running 15 secs || 22949730 markings, 24106064 edges, 897522 markings/sec, 15 secs
lola: sara is running 20 secs || 27159689 markings, 28382016 edges, 841992 markings/sec, 20 secs
lola: sara is running 25 secs || 31305345 markings, 32592792 edges, 829131 markings/sec, 25 secs
lola: sara is running 30 secs || 35345010 markings, 36696088 edges, 807933 markings/sec, 30 secs
lola: sara is running 35 secs || 39285427 markings, 40698866 edges, 788083 markings/sec, 35 secs
lola: sara is running 40 secs || 43243826 markings, 44720065 edges, 791680 markings/sec, 40 secs
lola: sara is running 45 secs || 47210711 markings, 48749959 edges, 793377 markings/sec, 45 secs
lola: sara is running 50 secs || 51152562 markings, 52754761 edges, 788370 markings/sec, 50 secs
lola: sara is running 55 secs || 55058550 markings, 56723220 edges, 781198 markings/sec, 55 secs
lola: sara is running 60 secs || 58930645 markings, 60657566 edges, 774419 markings/sec, 60 secs
lola: sara is running 65 secs || 62816976 markings, 64606524 edges, 777266 markings/sec, 65 secs
lola: sara is running 70 secs || 66694895 markings, 68547199 edges, 775584 markings/sec, 70 secs
lola: sara is running 75 secs || 70558476 markings, 72473340 edges, 772716 markings/sec, 75 secs
lola: sara is running 80 secs || 74405850 markings, 76383443 edges, 769475 markings/sec, 80 secs
lola: sara is running 85 secs || 78248399 markings, 80288754 edges, 768510 markings/sec, 85 secs
lola: sara is running 90 secs || 82092428 markings, 84195740 edges, 768806 markings/sec, 90 secs
lola: sara is running 95 secs || 85875854 markings, 88041349 edges, 756685 markings/sec, 95 secs
lola: sara is running 100 secs || 89661442 markings, 91889533 edges, 757118 markings/sec, 100 secs
lola: sara is running 105 secs || 93448003 markings, 95738738 edges, 757312 markings/sec, 105 secs
lola: sara is running 110 secs || 97267487 markings, 99621798 edges, 763897 markings/sec, 110 secs
lola: sara is running 115 secs || 101028606 markings, 103445694 edges, 752224 markings/sec, 115 secs
lola: sara is running 120 secs || 104796690 markings, 107276960 edges, 753617 markings/sec, 120 secs
lola: sara is running 125 secs || 108628125 markings, 111172934 edges, 766287 markings/sec, 125 secs
lola: sara is running 130 secs || 112490288 markings, 115100330 edges, 772433 markings/sec, 130 secs
lola: sara is running 135 secs || 116299772 markings, 118974503 edges, 761897 markings/sec, 135 secs
lola: sara is running 140 secs || 120107748 markings, 122847374 edges, 761595 markings/sec, 140 secs
lola: sara is running 145 secs || 123888819 markings, 126693177 edges, 756214 markings/sec, 145 secs
lola: sara is running 150 secs || 127729517 markings, 130599911 edges, 768140 markings/sec, 150 secs
lola: sara is running 155 secs || 131579545 markings, 134516544 edges, 770006 markings/sec, 155 secs
lola: sara is running 160 secs || 135412120 markings, 138415598 edges, 766515 markings/sec, 160 secs
lola: sara is running 165 secs || 139226244 markings, 142296386 edges, 762825 markings/sec, 165 secs
lola: sara is running 170 secs || 143098960 markings, 146237013 edges, 774543 markings/sec, 170 secs
lola: sara is running 175 secs || 146869208 markings, 150073751 edges, 754050 markings/sec, 175 secs
lola: sara is running 180 secs || 150795230 markings, 154069411 edges, 785204 markings/sec, 180 secs
lola: sara is running 185 secs || 154595000 markings, 157937017 edges, 759954 markings/sec, 185 secs
lola: sara is running 190 secs || 158517758 markings, 161930184 edges, 784552 markings/sec, 190 secs
lola: sara is running 195 secs || 162399139 markings, 165881677 edges, 776276 markings/sec, 195 secs
lola: sara is running 200 secs || 166233462 markings, 169785697 edges, 766865 markings/sec, 200 secs
lola: sara is running 205 secs || 170174575 markings, 173798887 edges, 788223 markings/sec, 205 secs
lola: sara is running 210 secs || 174093538 markings, 177790107 edges, 783793 markings/sec, 210 secs
lola: sara is running 215 secs || 177189458 markings, 180943576 edges, 619184 markings/sec, 215 secs
lola: sara is running 220 secs || 177189603 markings, 180943724 edges, 29 markings/sec, 220 secs
lola: sara is running 225 secs || 177201545 markings, 180955854 edges, 2388 markings/sec, 225 secs
lola: sara is running 230 secs || 177201665 markings, 180955977 edges, 24 markings/sec, 230 secs
lola: sara is running 235 secs || 177238241 markings, 180993233 edges, 7315 markings/sec, 235 secs
lola: sara is running 240 secs || 177245004 markings, 181000159 edges, 1353 markings/sec, 240 secs
lola: sara is running 245 secs || 177279661 markings, 181035454 edges, 6931 markings/sec, 245 secs
lola: sara is running 250 secs || 177284973 markings, 181040839 edges, 1062 markings/sec, 250 secs
lola: sara is running 255 secs || 177317035 markings, 181073527 edges, 6412 markings/sec, 255 secs
lola: sara is running 260 secs || 177317176 markings, 181073670 edges, 28 markings/sec, 260 secs
lola: sara is running 265 secs || 177325244 markings, 181081833 edges, 1614 markings/sec, 265 secs
lola: sara is running 270 secs || 177337555 markings, 181094422 edges, 2462 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((F6P <= NADplus) OR (1 <= _3PG) OR ((3 <= NADPH) AND (1 <= NADH))) AND ((GAP + 1 <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((G6P + 1 <= a2) AND (a2 + 1 <= NADPplus) AND (c2 <= 0) AND (a2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Lac <= F6P)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((NADplus <= a2) AND (2 <= R5P))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3370110 markings, 9601901 edges, 674022 markings/sec, 0 secs
lola: sara is running 5 secs || 6304085 markings, 19266461 edges, 586795 markings/sec, 5 secs
lola: sara is running 10 secs || 9117664 markings, 28042417 edges, 562716 markings/sec, 10 secs
lola: sara is running 15 secs || 11587759 markings, 34897712 edges, 494019 markings/sec, 15 secs
lola: sara is running 20 secs || 13943731 markings, 41448058 edges, 471194 markings/sec, 20 secs
lola: sara is running 25 secs || 16394722 markings, 48264137 edges, 490198 markings/sec, 25 secs
lola: sara is running 30 secs || 18784292 markings, 54913170 edges, 477914 markings/sec, 30 secs
lola: sara is running 35 secs || 21138273 markings, 61471179 edges, 470796 markings/sec, 35 secs
lola: sara is running 40 secs || 23434093 markings, 67865137 edges, 459164 markings/sec, 40 secs
lola: sara is running 45 secs || 25706023 markings, 74200438 edges, 454386 markings/sec, 45 secs
lola: sara is running 50 secs || 28005379 markings, 80613440 edges, 459871 markings/sec, 50 secs
lola: sara is running 55 secs || 30436860 markings, 87395568 edges, 486296 markings/sec, 55 secs
lola: sara is running 60 secs || 32861762 markings, 94157496 edges, 484980 markings/sec, 60 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((b1 + 1 <= c1) OR (GAP + 1 <= NADH) OR (_2PG <= Ru5P))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_2PG <= DHAP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((c1 <= Gluc) OR (3 <= c2)) AND (Gluc + 1 <= S7P) AND (S7P <= 2) AND (b1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2921 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_3PG <= a1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-15.sara
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: no no no unknown yes no yes unknown yes yes no no no no yes no
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000001000-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494722406945

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-C0100N0000001000"
export BK_EXAMINATION="ReachabilityCardinality"
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-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is GPPP-PT-C0100N0000001000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-blw3-149440264500547"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;