fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15950.900 596357.00 1115500.00 4608.60 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 S_GPPP-PT-C0100N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600547
=====================================================================

--------------------
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 1496395790248


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GPPP-PT-C0100N0000001000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000001000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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: state equation: calling and running 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: The predicate is not invariant.
lola: lola: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-2.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: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2357422 markings, 9631245 edges, 471484 markings/sec, 0 secs
lola: sara is running 5 secs || 4320355 markings, 18410289 edges, 392587 markings/sec, 5 secs
lola: sara is running 10 secs || 6492587 markings, 27429876 edges, 434446 markings/sec, 10 secs
lola: sara is running 15 secs || 8384750 markings, 35719666 edges, 378433 markings/sec, 15 secs
lola: sara is running 20 secs || 10020848 markings, 43989455 edges, 327220 markings/sec, 20 secs
lola: sara is running 25 secs || 11601712 markings, 51727430 edges, 316173 markings/sec, 25 secs
lola: sara is running 30 secs || 13340659 markings, 59479957 edges, 347789 markings/sec, 30 secs
lola: sara is running 35 secs || 15341004 markings, 67411637 edges, 400069 markings/sec, 35 secs
lola: sara is running 40 secs || 17249871 markings, 76493549 edges, 381773 markings/sec, 40 secs
lola: sara is running 45 secs || 19102042 markings, 84956765 edges, 370434 markings/sec, 45 secs
lola: sara is running 50 secs || 20800838 markings, 92656039 edges, 339759 markings/sec, 50 secs
lola: sara is running 55 secs || 22396717 markings, 100725578 edges, 319176 markings/sec, 55 secs
lola: sara is running 60 secs || 23928378 markings, 108401397 edges, 306332 markings/sec, 60 secs
lola: sara is running 65 secs || 25833999 markings, 116620983 edges, 381124 markings/sec, 65 secs
lola: sara is running 70 secs || 27699297 markings, 123539684 edges, 373060 markings/sec, 70 secs
lola: sara is running 75 secs || 29626623 markings, 132183295 edges, 385465 markings/sec, 75 secs
lola: sara is running 80 secs || 31446155 markings, 141046962 edges, 363906 markings/sec, 80 secs
lola: sara is running 85 secs || 33315895 markings, 149750948 edges, 373948 markings/sec, 85 secs
lola: sara is running 90 secs || 34987108 markings, 157631704 edges, 334243 markings/sec, 90 secs
lola: sara is running 95 secs || 36656106 markings, 165299341 edges, 333800 markings/sec, 95 secs
lola: sara is running 100 secs || 38173868 markings, 173132994 edges, 303552 markings/sec, 100 secs
lola: sara is running 105 secs || 39712146 markings, 180686421 edges, 307656 markings/sec, 105 secs
lola: sara is running 110 secs || 41470404 markings, 188203974 edges, 351652 markings/sec, 110 secs
lola: sara is running 115 secs || 43356021 markings, 195662780 edges, 377123 markings/sec, 115 secs
lola: sara is running 120 secs || 45346782 markings, 203307864 edges, 398152 markings/sec, 120 secs
lola: sara is running 125 secs || 47129492 markings, 211546851 edges, 356542 markings/sec, 125 secs
lola: sara is running 130 secs || 48909224 markings, 220195898 edges, 355946 markings/sec, 130 secs
lola: sara is running 135 secs || 50711884 markings, 229210470 edges, 360532 markings/sec, 135 secs
lola: sara is running 140 secs || 52502660 markings, 237300713 edges, 358155 markings/sec, 140 secs
lola: sara is running 145 secs || 54194934 markings, 245308814 edges, 338455 markings/sec, 145 secs
lola: sara is running 150 secs || 55709722 markings, 252932166 edges, 302958 markings/sec, 150 secs
lola: sara is running 155 secs || 57314317 markings, 260413818 edges, 320919 markings/sec, 155 secs
lola: sara is running 160 secs || 58858208 markings, 268136995 edges, 308778 markings/sec, 160 secs
lola: sara is running 165 secs || 60277776 markings, 275317851 edges, 283914 markings/sec, 165 secs
lola: sara is running 170 secs || 62502607 markings, 283759895 edges, 444966 markings/sec, 170 secs
lola: sara is running 175 secs || 64238295 markings, 290365316 edges, 347138 markings/sec, 175 secs
lola: sara is running 180 secs || 66285434 markings, 298253667 edges, 409428 markings/sec, 180 secs
lola: sara is running 185 secs || 68020115 markings, 306282453 edges, 346936 markings/sec, 185 secs
lola: sara is running 190 secs || 69759045 markings, 314684429 edges, 347786 markings/sec, 190 secs
lola: sara is running 195 secs || 71573574 markings, 323603923 edges, 362906 markings/sec, 195 secs
lola: sara is running 200 secs || 73384204 markings, 332752787 edges, 362126 markings/sec, 200 secs
lola: sara is running 205 secs || 75109501 markings, 340331781 edges, 345059 markings/sec, 205 secs
lola: sara is running 210 secs || 76803567 markings, 348278896 edges, 338813 markings/sec, 210 secs
lola: sara is running 215 secs || 78275318 markings, 355342461 edges, 294350 markings/sec, 215 secs
lola: sara is running 220 secs || 79882908 markings, 363041536 edges, 321518 markings/sec, 220 secs
lola: sara is running 225 secs || 81368226 markings, 370677818 edges, 297064 markings/sec, 225 secs
lola: sara is running 230 secs || 82866321 markings, 377941378 edges, 299619 markings/sec, 230 secs
lola: sara is running 235 secs || 84483712 markings, 385169480 edges, 323478 markings/sec, 235 secs
lola: sara is running 240 secs || 86584554 markings, 393374194 edges, 420168 markings/sec, 240 secs
lola: sara is running 245 secs || 88269433 markings, 399818853 edges, 336976 markings/sec, 245 secs
lola: sara is running 250 secs || 90212747 markings, 406862386 edges, 388663 markings/sec, 250 secs
lola: sara is running 255 secs || 92006076 markings, 415101113 edges, 358666 markings/sec, 255 secs
lola: sara is running 260 secs || 93779910 markings, 423315924 edges, 354767 markings/sec, 260 secs
lola: sara is running 265 secs || 95443659 markings, 431418593 edges, 332750 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: subprocess 5 will run for 297 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: ========================================
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: 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: 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
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 || 6582120 markings, 7419418 edges, 1316424 markings/sec, 0 secs
lola: sara is running 5 secs || 13149199 markings, 14148516 edges, 1313416 markings/sec, 5 secs
lola: sara is running 10 secs || 18808589 markings, 19900293 edges, 1131878 markings/sec, 10 secs
lola: sara is running 15 secs || 23282645 markings, 24444169 edges, 894811 markings/sec, 15 secs
lola: sara is running 20 secs || 27493122 markings, 28720644 edges, 842095 markings/sec, 20 secs
lola: sara is running 25 secs || 31611482 markings, 32903808 edges, 823672 markings/sec, 25 secs
lola: sara is running 30 secs || 35713573 markings, 37070519 edges, 820418 markings/sec, 30 secs
lola: sara is running 35 secs || 39711167 markings, 41131352 edges, 799519 markings/sec, 35 secs
lola: sara is running 40 secs || 43648352 markings, 45131025 edges, 787437 markings/sec, 40 secs
lola: sara is running 45 secs || 47621808 markings, 49167678 edges, 794691 markings/sec, 45 secs
lola: sara is running 50 secs || 51613869 markings, 53223415 edges, 798412 markings/sec, 50 secs
lola: sara is running 55 secs || 55589434 markings, 57262723 edges, 795113 markings/sec, 55 secs
lola: sara is running 60 secs || 59559968 markings, 61297065 edges, 794107 markings/sec, 60 secs
lola: sara is running 65 secs || 63513957 markings, 65314794 edges, 790798 markings/sec, 65 secs
lola: sara is running 70 secs || 67458737 markings, 69323301 edges, 788956 markings/sec, 70 secs
lola: sara is running 75 secs || 71383222 markings, 73311562 edges, 784897 markings/sec, 75 secs
lola: sara is running 80 secs || 75304910 markings, 77297109 edges, 784338 markings/sec, 80 secs
lola: sara is running 85 secs || 79210316 markings, 81266405 edges, 781081 markings/sec, 85 secs
lola: sara is running 90 secs || 83116066 markings, 85236227 edges, 781150 markings/sec, 90 secs
lola: sara is running 95 secs || 86977386 markings, 89161049 edges, 772264 markings/sec, 95 secs
lola: sara is running 100 secs || 90843531 markings, 93091183 edges, 773229 markings/sec, 100 secs
lola: sara is running 105 secs || 94735132 markings, 97047327 edges, 778320 markings/sec, 105 secs
lola: sara is running 110 secs || 98689332 markings, 101067331 edges, 790840 markings/sec, 110 secs
lola: sara is running 115 secs || 102603522 markings, 105047019 edges, 782838 markings/sec, 115 secs
lola: sara is running 120 secs || 106508590 markings, 109017705 edges, 781014 markings/sec, 120 secs
lola: sara is running 125 secs || 110410644 markings, 112985478 edges, 780411 markings/sec, 125 secs
lola: sara is running 130 secs || 114287958 markings, 116928498 edges, 775463 markings/sec, 130 secs
lola: sara is running 135 secs || 118138731 markings, 120844767 edges, 770155 markings/sec, 135 secs
lola: sara is running 140 secs || 122128183 markings, 124902406 edges, 797890 markings/sec, 140 secs
lola: sara is running 145 secs || 126056798 markings, 128898407 edges, 785723 markings/sec, 145 secs
lola: sara is running 150 secs || 129928771 markings, 132837161 edges, 774395 markings/sec, 150 secs
lola: sara is running 155 secs || 133908522 markings, 136885880 edges, 795950 markings/sec, 155 secs
lola: sara is running 160 secs || 137876506 markings, 140923049 edges, 793597 markings/sec, 160 secs
lola: sara is running 165 secs || 141784173 markings, 144899131 edges, 781533 markings/sec, 165 secs
lola: sara is running 170 secs || 145814723 markings, 149000638 edges, 806110 markings/sec, 170 secs
lola: sara is running 175 secs || 149743740 markings, 152999242 edges, 785803 markings/sec, 175 secs
lola: sara is running 180 secs || 153756327 markings, 157083278 edges, 802517 markings/sec, 180 secs
lola: sara is running 185 secs || 157747729 markings, 161146284 edges, 798280 markings/sec, 185 secs
lola: sara is running 190 secs || 161700894 markings, 165170716 edges, 790633 markings/sec, 190 secs
lola: sara is running 195 secs || 165787743 markings, 169331830 edges, 817370 markings/sec, 195 secs
lola: sara is running 200 secs || 169811667 markings, 173429366 edges, 804785 markings/sec, 200 secs
lola: sara is running 205 secs || 173856181 markings, 177548433 edges, 808903 markings/sec, 205 secs
lola: sara is running 210 secs || 177199535 markings, 180953799 edges, 668671 markings/sec, 210 secs
lola: sara is running 215 secs || 177240076 markings, 180995114 edges, 8108 markings/sec, 215 secs
lola: sara is running 220 secs || 177243986 markings, 180999119 edges, 782 markings/sec, 220 secs
lola: sara is running 225 secs || 177244113 markings, 180999247 edges, 25 markings/sec, 225 secs
lola: sara is running 230 secs || 177244253 markings, 180999390 edges, 28 markings/sec, 230 secs
lola: sara is running 235 secs || 177244418 markings, 180999560 edges, 33 markings/sec, 235 secs
lola: sara is running 240 secs || 177244572 markings, 180999717 edges, 31 markings/sec, 240 secs
lola: sara is running 245 secs || 177271618 markings, 181027217 edges, 5409 markings/sec, 245 secs
lola: sara is running 250 secs || 177330556 markings, 181087271 edges, 11788 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 376 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 429 seconds at most (--localtimelimit=-1)
lola: ========================================
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 501 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: ========================================
lola: subprocess 11 will run for 601 seconds at most (--localtimelimit=-1)
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 || 3359990 markings, 9568488 edges, 671998 markings/sec, 0 secs
lola: sara is running 5 secs || 6294369 markings, 19234385 edges, 586876 markings/sec, 5 secs
lola: sara is running 10 secs || 9160159 markings, 28156233 edges, 573158 markings/sec, 10 secs
lola: sara is running 15 secs || 11790604 markings, 35457552 edges, 526089 markings/sec, 15 secs
lola: sara is running 20 secs || 14292150 markings, 42414166 edges, 500309 markings/sec, 20 secs
lola: sara is running 25 secs || 16863219 markings, 49565541 edges, 514214 markings/sec, 25 secs
lola: sara is running 30 secs || 19348423 markings, 56493753 edges, 497041 markings/sec, 30 secs
lola: sara is running 35 secs || 21864156 markings, 63491699 edges, 503147 markings/sec, 35 secs
lola: sara is running 40 secs || 24296858 markings, 70282559 edges, 486540 markings/sec, 40 secs
lola: sara is running 45 secs || 26746027 markings, 77099637 edges, 489834 markings/sec, 45 secs
lola: sara is running 50 secs || 29188836 markings, 83914133 edges, 488562 markings/sec, 50 secs
lola: sara is running 55 secs || 31603545 markings, 90648340 edges, 482942 markings/sec, 55 secs

lola: sara is running 60 secs || 33958772 markings, 97213908 edges, 471045 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 736 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 981 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: state equation: write sara problem file to GPPP-PT-C0100N0000001000-ReachabilityCardinality-13.sara
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1472 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
sara: try reading problem file GPPP-PT-C0100N0000001000-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2944 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: The predicate is not invariant.
lola: ========================================lola:
RESULT
lola:
SUMMARY: no no no unknown yes no yes unknown yes yes no no no no yes no
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 1496396386605

--------------------
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="S_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/S_GPPP-PT-C0100N0000001000.tgz
mv S_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 S_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 r108-blw3-149441612600547"
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 ;