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

About the Execution of LoLA for S_GPPP-PT-C0100N0000010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15949.570 1327470.00 2625386.00 10468.40 TFTTTF?T?FTTFF?F 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-C0100N0000010000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600556
=====================================================================


--------------------
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-C0100N0000010000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000010000-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496396895325


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000010000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_GPPP-PT-C0100N0000010000 @ 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-C0100N0000010000-ReachabilityCardinality.task
lola: E (F (((3 <= c1) AND (2 <= c2)))) : A (G (((2 <= NADPH) OR ((3 <= DHAP) AND (ATP <= NADplus)) OR (_2PG <= GAP)))) : E (F (((NADplus <= GAP) AND (3 <= b2)))) : E (F (((Xu5P <= 1) AND (GSSG <= 2) AND ((Gluc <= NADPH) OR (b2 <= GSSG) OR (1 <= R5P))))) : E (F (((NADPH <= F6P) AND (2 <= ADP) AND (a1 + 1 <= c2) AND (a1 <= Pyr) AND ((1 <= R5P) OR (F6P <= G6P))))) : A (G ((_1_3_BPG <= c2))) : E (F ((3 <= S7P))) : A (G (((start + 1 <= Xu5P) OR (a2 + 1 <= NADPH) OR ((F6P <= 2) AND (_3PG <= 2))))) : E (F (((3 <= E4P) AND ((c1 + 1 <= DHAP) OR ((2 <= start) AND (1 <= DHAP)))))) : E (F ((GSSG <= PEP))) : E (F (((1 <= NADPplus) AND ((F6P + 1 <= Pyr) OR (start + 1 <= Pyr))))) : E (F (((NADplus <= DHAP) OR ((NADH + 1 <= b2) AND (Ru5P + 1 <= PEP))))) : A (G (((1 <= Pi) OR ((G6P <= 0) AND (_3PG <= 1))))) : E (F ((NADPplus <= _1_3_BPG))) : A (G ((b1 <= ATP))) : E (F (((2 <= Ru5P) AND (1 <= _3PG) AND (GAP <= NADplus) AND (Xu5P <= GSSG))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= c1) AND (2 <= c2))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= NADPH) OR ((3 <= DHAP) AND (ATP <= NADplus)) OR (_2PG <= GAP))))
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 6 literals and 2 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-C0100N0000010000-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADplus <= GAP) AND (3 <= b2))))
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-C0100N0000010000-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3170230 markings, 9650045 edges, 634046 markings/sec, 0 secs
lola: sara is running 5 secs || 5542825 markings, 19341792 edges, 474519 markings/sec, 5 secs
lola: sara is running 10 secs || 7795777 markings, 29423467 edges, 450590 markings/sec, 10 secs
lola: sara is running 15 secs || 9958653 markings, 39335708 edges, 432575 markings/sec, 15 secs
lola: sara is running 20 secs || 12633266 markings, 48757067 edges, 534923 markings/sec, 20 secs
lola: sara is running 25 secs || 15025091 markings, 57079285 edges, 478365 markings/sec, 25 secs
lola: sara is running 30 secs || 17302266 markings, 64972761 edges, 455435 markings/sec, 30 secs
lola: sara is running 35 secs || 19498632 markings, 72601267 edges, 439273 markings/sec, 35 secs
lola: sara is running 40 secs || 21663767 markings, 80130177 edges, 433027 markings/sec, 40 secs
lola: sara is running 45 secs || 23842314 markings, 87688943 edges, 435709 markings/sec, 45 secs
lola: sara is running 50 secs || 25954181 markings, 95040649 edges, 422373 markings/sec, 50 secs
lola: sara is running 55 secs || 28077358 markings, 102401580 edges, 424635 markings/sec, 55 secs
lola: sara is running 60 secs || 30169013 markings, 109686828 edges, 418331 markings/sec, 60 secs
lola: sara is running 65 secs || 32271279 markings, 116972501 edges, 420453 markings/sec, 65 secs
lola: sara is running 70 secs || 34326765 markings, 124108157 edges, 411097 markings/sec, 70 secs
lola: sara is running 75 secs || 36412570 markings, 131361323 edges, 417161 markings/sec, 75 secs
lola: sara is running 80 secs || 38506524 markings, 138621967 edges, 418791 markings/sec, 80 secs
lola: sara is running 85 secs || 40551856 markings, 145743933 edges, 409066 markings/sec, 85 secs
lola: sara is running 90 secs || 42674875 markings, 153101259 edges, 424604 markings/sec, 90 secs
lola: sara is running 95 secs || 44716122 markings, 160185964 edges, 408249 markings/sec, 95 secs
lola: sara is running 100 secs || 46714757 markings, 167136153 edges, 399727 markings/sec, 100 secs
lola: sara is running 105 secs || 48763164 markings, 174237336 edges, 409681 markings/sec, 105 secs
lola: sara is running 110 secs || 50756120 markings, 181171014 edges, 398591 markings/sec, 110 secs
lola: sara is running 115 secs || 52829530 markings, 188360796 edges, 414682 markings/sec, 115 secs
lola: sara is running 120 secs || 54839075 markings, 195328279 edges, 401909 markings/sec, 120 secs
lola: sara is running 125 secs || 56815590 markings, 202208335 edges, 395303 markings/sec, 125 secs
lola: sara is running 130 secs || 58830476 markings, 209189258 edges, 402977 markings/sec, 130 secs
lola: sara is running 135 secs || 60801221 markings, 216021941 edges, 394149 markings/sec, 135 secs
lola: sara is running 140 secs || 62722877 markings, 222710008 edges, 384331 markings/sec, 140 secs
lola: sara is running 145 secs || 64746237 markings, 229720509 edges, 404672 markings/sec, 145 secs
lola: sara is running 150 secs || 66727203 markings, 236586943 edges, 396193 markings/sec, 150 secs
lola: sara is running 155 secs || 68648176 markings, 243260179 edges, 384195 markings/sec, 155 secs
lola: sara is running 160 secs || 70611222 markings, 250073260 edges, 392609 markings/sec, 160 secs
lola: sara is running 165 secs || 72590758 markings, 256932576 edges, 395907 markings/sec, 165 secs
lola: sara is running 170 secs || 74553488 markings, 263738102 edges, 392546 markings/sec, 170 secs
lola: sara is running 175 secs || 76497779 markings, 270501298 edges, 388858 markings/sec, 175 secs
lola: sara is running 180 secs || 78527880 markings, 277534290 edges, 406020 markings/sec, 180 secs
lola: sara is running 185 secs || 80539768 markings, 284505793 edges, 402378 markings/sec, 185 secs
lola: sara is running 190 secs || 82522501 markings, 291376943 edges, 396547 markings/sec, 190 secs
lola: sara is running 195 secs || 84507744 markings, 298258726 edges, 397049 markings/sec, 195 secs
lola: sara is running 200 secs || 86455377 markings, 305014797 edges, 389527 markings/sec, 200 secs
lola: sara is running 205 secs || 88434831 markings, 311889290 edges, 395891 markings/sec, 205 secs
lola: sara is running 210 secs || 90442843 markings, 318846196 edges, 401602 markings/sec, 210 secs
lola: sara is running 215 secs || 92482532 markings, 325913009 edges, 407938 markings/sec, 215 secs
lola: sara is running 220 secs || 94477632 markings, 332824638 edges, 399020 markings/sec, 220 secs
lola: sara is running 225 secs || 96474591 markings, 339742642 edges, 399392 markings/sec, 225 secs
lola: sara is running 230 secs || 98508360 markings, 346788820 edges, 406754 markings/sec, 230 secs
lola: sara is running 235 secs || 100556083 markings, 353883450 edges, 409545 markings/sec, 235 secs
lola: sara is running 240 secs || 102581896 markings, 360901752 edges, 405163 markings/sec, 240 secs
lola: sara is running 245 secs || 104604415 markings, 367908247 edges, 404504 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Xu5P <= 1) AND (GSSG <= 2) AND ((Gluc <= NADPH) OR (b2 <= GSSG) OR (1 <= 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADPH <= F6P) AND (2 <= ADP) AND (a1 + 1 <= c2) AND (a1 <= Pyr) AND ((1 <= R5P) OR (F6P <= G6P)))))
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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= c2)))
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-C0100N0000010000-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3732325 markings, 9959865 edges, 746465 markings/sec, 0 secs
lola: sara is running 5 secs || 7288499 markings, 19875582 edges, 711235 markings/sec, 5 secs
lola: sara is running 10 secs || 10953666 markings, 28998841 edges, 733033 markings/sec, 10 secs
lola: sara is running 15 secs || 14131767 markings, 36617642 edges, 635620 markings/sec, 15 secs
lola: sara is running 20 secs || 17068286 markings, 43663617 edges, 587304 markings/sec, 20 secs
lola: sara is running 25 secs || 19850235 markings, 50338653 edges, 556390 markings/sec, 25 secs
lola: sara is running 30 secs || 22573011 markings, 56871954 edges, 544555 markings/sec, 30 secs
lola: sara is running 35 secs || 25243191 markings, 63279093 edges, 534036 markings/sec, 35 secs
lola: sara is running 40 secs || 27968143 markings, 69817127 edges, 544990 markings/sec, 40 secs
lola: sara is running 45 secs || 30662643 markings, 76282298 edges, 538900 markings/sec, 45 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= S7P)))
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: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((start + 1 <= Xu5P) OR (a2 + 1 <= NADPH) OR ((F6P <= 2) AND (_3PG <= 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: 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 6 literals and 2 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-C0100N0000010000-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ========================================
...considering subproblem: E (F (((3 <= E4P) AND ((c1 + 1 <= DHAP) OR ((2 <= start) AND (1 <= DHAP))))))state equation: calling and running sara

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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-8.sara
sara: try reading problem file GPPP-PT-C0100N0000010000-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-C0100N0000010000-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3216262 markings, 9751533 edges, 643252 markings/sec, 0 secs
lola: sara is running 5 secs || 5738505 markings, 19618423 edges, 504449 markings/sec, 5 secs
lola: sara is running 10 secs || 8079038 markings, 29398400 edges, 468107 markings/sec, 10 secs
lola: sara is running 15 secs || 10449326 markings, 37464094 edges, 474058 markings/sec, 15 secs
lola: sara is running 20 secs || 12680861 markings, 45109111 edges, 446307 markings/sec, 20 secs
lola: sara is running 25 secs || 14907391 markings, 52674682 edges, 445306 markings/sec, 25 secs
lola: sara is running 30 secs || 17085914 markings, 60105063 edges, 435705 markings/sec, 30 secs
lola: sara is running 35 secs || 19223681 markings, 67409846 edges, 427553 markings/sec, 35 secs
lola: sara is running 40 secs || 21342236 markings, 74779122 edges, 423711 markings/sec, 40 secs
lola: sara is running 45 secs || 23474634 markings, 81959119 edges, 426480 markings/sec, 45 secs
lola: sara is running 50 secs || 25579392 markings, 89116959 edges, 420952 markings/sec, 50 secs
lola: sara is running 55 secs || 27697550 markings, 96378757 edges, 423632 markings/sec, 55 secs
lola: sara is running 60 secs || 29831738 markings, 103754223 edges, 426838 markings/sec, 60 secs
lola: sara is running 65 secs || 31950798 markings, 111152540 edges, 423812 markings/sec, 65 secs
lola: sara is running 70 secs || 34038952 markings, 118268465 edges, 417631 markings/sec, 70 secs
lola: sara is running 75 secs || 36171668 markings, 125564573 edges, 426543 markings/sec, 75 secs
lola: sara is running 80 secs || 38285971 markings, 132869343 edges, 422861 markings/sec, 80 secs
lola: sara is running 85 secs || 40330324 markings, 139955468 edges, 408871 markings/sec, 85 secs
lola: sara is running 90 secs || 42421262 markings, 146943254 edges, 418188 markings/sec, 90 secs
lola: sara is running 95 secs || 44492066 markings, 154106014 edges, 414161 markings/sec, 95 secs
lola: sara is running 100 secs || 46505154 markings, 161252186 edges, 402618 markings/sec, 100 secs
lola: sara is running 105 secs || 48597015 markings, 168414306 edges, 418372 markings/sec, 105 secs
lola: sara is running 110 secs || 50680123 markings, 175479978 edges, 416622 markings/sec, 110 secs
lola: sara is running 115 secs || 52749422 markings, 182526482 edges, 413860 markings/sec, 115 secs
lola: sara is running 120 secs || 54805155 markings, 189552924 edges, 411147 markings/sec, 120 secs
lola: sara is running 125 secs || 56860598 markings, 196600913 edges, 411089 markings/sec, 125 secs
lola: sara is running 130 secs || 58901761 markings, 203627397 edges, 408233 markings/sec, 130 secs
lola: sara is running 135 secs || 60933688 markings, 210648212 edges, 406385 markings/sec, 135 secs
lola: sara is running 140 secs || 62954254 markings, 217657763 edges, 404113 markings/sec, 140 secs
lola: sara is running 145 secs || 64981044 markings, 224709634 edges, 405358 markings/sec, 145 secs
lola: sara is running 150 secs || 66999367 markings, 231760480 edges, 403665 markings/sec, 150 secs
lola: sara is running 155 secs || 69031869 markings, 238775289 edges, 406500 markings/sec, 155 secs
lola: sara is running 160 secs || 71125676 markings, 245754954 edges, 418761 markings/sec, 160 secs
lola: sara is running 165 secs || 73222195 markings, 252701235 edges, 419304 markings/sec, 165 secs
lola: sara is running 170 secs || 75241244 markings, 259736902 edges, 403810 markings/sec, 170 secs
lola: sara is running 175 secs || 77260206 markings, 266885093 edges, 403792 markings/sec, 175 secs
lola: sara is running 180 secs || 79264426 markings, 274017263 edges, 400844 markings/sec, 180 secs
lola: sara is running 185 secs || 81351372 markings, 280954909 edges, 417389 markings/sec, 185 secs
lola: sara is running 190 secs || 83457797 markings, 287863149 edges, 421285 markings/sec, 190 secs
lola: sara is running 195 secs || 85448576 markings, 295000477 edges, 398156 markings/sec, 195 secs
lola: sara is running 200 secs || 87364012 markings, 301939798 edges, 383087 markings/sec, 200 secs
lola: sara is running 205 secs || 89539966 markings, 309024717 edges, 435191 markings/sec, 205 secs
lola: sara is running 210 secs || 91666982 markings, 316197548 edges, 425403 markings/sec, 210 secs
lola: sara is running 215 secs || 93648583 markings, 323386829 edges, 396320 markings/sec, 215 secs
lola: sara is running 220 secs || 95703527 markings, 330438597 edges, 410989 markings/sec, 220 secs
lola: sara is running 225 secs || 97853913 markings, 337405022 edges, 430077 markings/sec, 225 secs
lola: sara is running 230 secs || 99825448 markings, 344617085 edges, 394307 markings/sec, 230 secs
lola: sara is running 235 secs || 101901541 markings, 351791751 edges, 415219 markings/sec, 235 secs
lola: sara is running 240 secs || 104070055 markings, 358811197 edges, 433703 markings/sec, 240 secs
lola: sara is running 245 secs || 106029251 markings, 366041208 edges, 391839 markings/sec, 245 secs
lola: sara is running 250 secs || 108126921 markings, 373050226 edges, 419534 markings/sec, 250 secs
lola: sara is running 255 secs || 110219256 markings, 380123616 edges, 418467 markings/sec, 255 secs
lola: sara is running 260 secs || 112160458 markings, 387361591 edges, 388240 markings/sec, 260 secs
lola: sara is running 265 secs || 114436549 markings, 394448996 edges, 455218 markings/sec, 265 secs
lola: sara is running 270 secs || 116466668 markings, 401850919 edges, 406024 markings/sec, 270 secs
lola: sara is running 275 secs || 118570250 markings, 409163195 edges, 420716 markings/sec, 275 secs
lola: sara is running 280 secs || 120782132 markings, 416405135 edges, 442376 markings/sec, 280 secs
lola: sara is running 285 secs || 122773883 markings, 423882790 edges, 398350 markings/sec, 285 secs
lola: sara is running 290 secs || 125070490 markings, 431030027 edges, 459321 markings/sec, 290 secs
lola: sara is running 295 secs || 127096770 markings, 438514343 edges, 405256 markings/sec, 295 secs
lola: sara is running 300 secs || 129259371 markings, 445807609 edges, 432520 markings/sec, 300 secs
lola: sara is running 305 secs || 131394129 markings, 453102263 edges, 426952 markings/sec, 305 secs
lola: sara is running 310 secs || 133420510 markings, 460414139 edges, 405276 markings/sec, 310 secs
lola: sara is running 315 secs || 135586335 markings, 467478270 edges, 433165 markings/sec, 315 secs
lola: sara is running 320 secs || 137791672 markings, 474851481 edges, 441067 markings/sec, 320 secs
lola: sara is running 325 secs || 139789035 markings, 481758023 edges, 399473 markings/sec, 325 secs
lola: sara is running 330 secs || 141827855 markings, 488836253 edges, 407764 markings/sec, 330 secs
lola: sara is running 335 secs || 143786251 markings, 495607678 edges, 391679 markings/sec, 335 secs
lola: sara is running 340 secs || 145923714 markings, 503022181 edges, 427493 markings/sec, 340 secs
lola: sara is running 345 secs || 147983487 markings, 510135002 edges, 411955 markings/sec, 345 secs
lola: sara is running 350 secs || 150120212 markings, 517555767 edges, 427345 markings/sec, 350 secs
lola: sara is running 355 secs || 152202836 markings, 524749827 edges, 416525 markings/sec, 355 secs
lola: sara is running 360 secs || 154339085 markings, 532175080 edges, 427250 markings/sec, 360 secs
lola: sara is running 365 secs || 156433714 markings, 539392992 edges, 418926 markings/sec, 365 secs
lola: sara is running 370 secs || 158474830 markings, 546498204 edges, 408223 markings/sec, 370 secs
lola: sara is running 375 secs || 160523083 markings, 553577241 edges, 409651 markings/sec, 375 secs
lola: sara is running 380 secs || 162568144 markings, 560683779 edges, 409012 markings/sec, 380 secs
lola: sara is running 385 secs || 164678428 markings, 568007929 edges, 422057 markings/sec, 385 secs
lola: sara is running 390 secs || 166688734 markings, 574954289 edges, 402061 markings/sec, 390 secs
lola: sara is running 395 secs || 168761574 markings, 582148365 edges, 414568 markings/sec, 395 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((GSSG <= PEP)))
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: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= NADPplus) AND ((F6P + 1 <= Pyr) OR (start + 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.lola:
========================================
lola: ========================================
lola: subprocess 11 will run for 565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NADplus <= DHAP) OR ((NADH + 1 <= b2) AND (Ru5P + 1 <= PEP)))))
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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Pi) OR ((G6P <= 0) AND (_3PG <= 1)))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-12.sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 941 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NADPplus <= _1_3_BPG)))
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: state equation: write sara problem file to GPPP-PT-C0100N0000010000-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((b1 <= ATP)))
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-C0100N0000010000-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000010000-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2765380 markings, 9509557 edges, 553076 markings/sec, 0 secs
lola: sara is running 5 secs || 4801310 markings, 18021248 edges, 407186 markings/sec, 5 secs
lola: sara is running 10 secs || 6729558 markings, 26058309 edges, 385650 markings/sec, 10 secs
lola: sara is running 15 secs || 8627316 markings, 33965934 edges, 379552 markings/sec, 15 secs
lola: sara is running 20 secs || 10488922 markings, 41728339 edges, 372321 markings/sec, 20 secs
lola: sara is running 25 secs || 12346569 markings, 49530830 edges, 371529 markings/sec, 25 secs
lola: sara is running 30 secs || 14228865 markings, 57479866 edges, 376459 markings/sec, 30 secs

lola: sara is running 35 secs || 16081006 markings, 65290308 edges, 370428 markings/sec, 35 secs
lola: sara is running 40 secs || 17985599 markings, 73203900 edges, 380919 markings/sec, 40 secs
lola: sara is running 45 secs || 19886927 markings, 81126044 edges, 380266 markings/sec, 45 secs
lola: sara is running 50 secs || 21796546 markings, 89056279 edges, 381924 markings/sec, 50 secs
lola: sara is running 55 secs || 23699495 markings, 96971501 edges, 380590 markings/sec, 55 secs
lola: sara is running 60 secs || 25618275 markings, 104975262 edges, 383756 markings/sec, 60 secs
lola: sara is running 65 secs || 27522441 markings, 112924792 edges, 380833 markings/sec, 65 secs
lola: sara is running 70 secs || 29415289 markings, 120866026 edges, 378570 markings/sec, 70 secs
lola: sara is running 75 secs || 31297171 markings, 128792140 edges, 376376 markings/sec, 75 secs
lola: sara is running 80 secs || 33171426 markings, 136685307 edges, 374851 markings/sec, 80 secs
lola: sara is running 85 secs || 35030600 markings, 144476440 edges, 371835 markings/sec, 85 secs
lola: sara is running 90 secs || 36881013 markings, 152189693 edges, 370083 markings/sec, 90 secs
lola: sara is running 95 secs || 38706962 markings, 159797758 edges, 365190 markings/sec, 95 secs
lola: sara is running 100 secs || 40505762 markings, 167272858 edges, 359760 markings/sec, 100 secs
lola: sara is running 105 secs || 42317400 markings, 174828815 edges, 362328 markings/sec, 105 secs
lola: sara is running 110 secs || 44094900 markings, 182255491 edges, 355500 markings/sec, 110 secs
lola: sara is running 115 secs || 45867119 markings, 189698038 edges, 354444 markings/sec, 115 secs
lola: sara is running 120 secs || 47653126 markings, 197236646 edges, 357201 markings/sec, 120 secs
lola: sara is running 125 secs || 49479200 markings, 204916248 edges, 365215 markings/sec, 125 secs
lola: sara is running 130 secs || 51306086 markings, 212567645 edges, 365377 markings/sec, 130 secs
lola: sara is running 135 secs || 53130381 markings, 220164424 edges, 364859 markings/sec, 135 secs
lola: sara is running 140 secs || 54974431 markings, 227849471 edges, 368810 markings/sec, 140 secs
lola: sara is running 145 secs || 56766602 markings, 235314832 edges, 358434 markings/sec, 145 secs
lola: sara is running 150 secs || 58604882 markings, 242975232 edges, 367656 markings/sec, 150 secs
lola: sara is running 155 secs || 60426266 markings, 250567353 edges, 364277 markings/sec, 155 secs
lola: sara is running 160 secs || 62244107 markings, 258164709 edges, 363568 markings/sec, 160 secs
lola: sara is running 165 secs || 64019374 markings, 265518103 edges, 355053 markings/sec, 165 secs
lola: sara is running 170 secs || 65782486 markings, 272883633 edges, 352622 markings/sec, 170 secs
lola: sara is running 175 secs || 67534201 markings, 280244835 edges, 350343 markings/sec, 175 secs
lola: sara is running 180 secs || 69280712 markings, 287604192 edges, 349302 markings/sec, 180 secs
lola: sara is running 185 secs || 71028099 markings, 294960284 edges, 349477 markings/sec, 185 secs
lola: sara is running 190 secs || 72782399 markings, 302288022 edges, 350860 markings/sec, 190 secs
lola: sara is running 195 secs || 74571035 markings, 309754040 edges, 357727 markings/sec, 195 secs
lola: sara is running 200 secs || 76332552 markings, 317101669 edges, 352303 markings/sec, 200 secs
lola: sara is running 205 secs || 78107802 markings, 324506485 edges, 355050 markings/sec, 205 secs
lola: sara is running 210 secs || 79864541 markings, 331848226 edges, 351348 markings/sec, 210 secs
lola: sara is running 215 secs || 81648386 markings, 339297268 edges, 356769 markings/sec, 215 secs
lola: sara is running 220 secs || 83430224 markings, 346740452 edges, 356368 markings/sec, 220 secs
lola: sara is running 225 secs || 85204618 markings, 354155090 edges, 354879 markings/sec, 225 secs
lola: sara is running 230 secs || 86980465 markings, 361575642 edges, 355169 markings/sec, 230 secs
lola: sara is running 235 secs || 88781117 markings, 369107994 edges, 360130 markings/sec, 235 secs
lola: sara is running 240 secs || 90537517 markings, 376446877 edges, 351280 markings/sec, 240 secs
lola: sara is running 245 secs || 92286119 markings, 383752804 edges, 349720 markings/sec, 245 secs
lola: sara is running 250 secs || 94034473 markings, 391057683 edges, 349671 markings/sec, 250 secs
lola: sara is running 255 secs || 95784241 markings, 398368513 edges, 349954 markings/sec, 255 secs
lola: sara is running 260 secs || 97548288 markings, 405737369 edges, 352809 markings/sec, 260 secs
lola: sara is running 265 secs || 99311084 markings, 413115243 edges, 352559 markings/sec, 265 secs
lola: sara is running 270 secs || 101074008 markings, 420489399 edges, 352585 markings/sec, 270 secs
lola: sara is running 275 secs || 102834239 markings, 427858200 edges, 352046 markings/sec, 275 secs
lola: sara is running 280 secs || 104586248 markings, 435182099 edges, 350402 markings/sec, 280 secs
lola: sara is running 285 secs || 106334162 markings, 442465465 edges, 349583 markings/sec, 285 secs
lola: sara is running 290 secs || 108077496 markings, 449719193 edges, 348667 markings/sec, 290 secs
lola: sara is running 295 secs || 109829750 markings, 456996336 edges, 350451 markings/sec, 295 secs
lola: sara is running 300 secs || 111581332 markings, 464271031 edges, 350316 markings/sec, 300 secs
lola: sara is running 305 secs || 113320707 markings, 471553288 edges, 347875 markings/sec, 305 secs
lola: sara is running 310 secs || 115058994 markings, 478799663 edges, 347657 markings/sec, 310 secs
lola: sara is running 315 secs || 116770198 markings, 485995516 edges, 342241 markings/sec, 315 secs
lola: sara is running 320 secs || 118484280 markings, 493153584 edges, 342816 markings/sec, 320 secs
lola: sara is running 325 secs || 120197064 markings, 500352049 edges, 342557 markings/sec, 325 secs
lola: sara is running 330 secs || 121919547 markings, 507562984 edges, 344497 markings/sec, 330 secs
lola: sara is running 335 secs || 123630360 markings, 514754054 edges, 342163 markings/sec, 335 secs
lola: sara is running 340 secs || 125351490 markings, 521921711 edges, 344226 markings/sec, 340 secs
lola: sara is running 345 secs || 127064110 markings, 529028563 edges, 342524 markings/sec, 345 secs
lola: sara is running 350 secs || 128817320 markings, 536276063 edges, 350642 markings/sec, 350 secs
lola: sara is running 355 secs || 130513563 markings, 543360824 edges, 339249 markings/sec, 355 secs
lola: sara is running 360 secs || 132217722 markings, 550489594 edges, 340832 markings/sec, 360 secs
lola: sara is running 365 secs || 133927010 markings, 557648445 edges, 341858 markings/sec, 365 secs
lola: sara is running 370 secs || 135633692 markings, 564804763 edges, 341336 markings/sec, 370 secs
lola: sara is running 375 secs || 137345229 markings, 571983971 edges, 342307 markings/sec, 375 secs
lola: sara is running 380 secs || 139062396 markings, 579104856 edges, 343433 markings/sec, 380 secs
lola: sara is running 385 secs || 140785754 markings, 586245707 edges, 344672 markings/sec, 385 secs
lola: sara is running 390 secs || 142500471 markings, 593424665 edges, 342943 markings/sec, 390 secs
lola: sara is running 395 secs || 144198703 markings, 600579740 edges, 339646 markings/sec, 395 secs
lola: sara is running 400 secs || 145893018 markings, 607693386 edges, 338863 markings/sec, 400 secs
lola: sara is running 405 secs || 147592258 markings, 614695607 edges, 339848 markings/sec, 405 secs
lola: sara is running 410 secs || 149352276 markings, 622012671 edges, 352004 markings/sec, 410 secs
lola: sara is running 415 secs || 151067006 markings, 629209513 edges, 342946 markings/sec, 415 secs
lola: sara is running 420 secs || 152768715 markings, 636365173 edges, 340342 markings/sec, 420 secs
lola: sara is running 425 secs || 154493822 markings, 643471353 edges, 345021 markings/sec, 425 secs
lola: sara is running 430 secs || 156193810 markings, 650592230 edges, 339998 markings/sec, 430 secs
lola: sara is running 435 secs || 157873233 markings, 657677628 edges, 335885 markings/sec, 435 secs
lola: sara is running 440 secs || 159540392 markings, 664614246 edges, 333432 markings/sec, 440 secs
lola: sara is running 445 secs || 161264773 markings, 671727868 edges, 344876 markings/sec, 445 secs
lola: sara is running 450 secs || 162955900 markings, 678821805 edges, 338225 markings/sec, 450 secs
lola: sara is running 455 secs || 164633614 markings, 685875899 edges, 335543 markings/sec, 455 secs
lola: sara is running 460 secs || 166328191 markings, 692839535 edges, 338915 markings/sec, 460 secs
lola: sara is running 465 secs || 168005013 markings, 699901726 edges, 335364 markings/sec, 465 secs
lola: sara is running 470 secs || 169649290 markings, 706842588 edges, 328855 markings/sec, 470 secs
lola: sara is running 475 secs || 171362905 markings, 713859753 edges, 342723 markings/sec, 475 secs
lola: sara is running 480 secs || 173077849 markings, 720681361 edges, 342989 markings/sec, 480 secs
lola: sara is running 485 secs || 174873136 markings, 726520987 edges, 359057 markings/sec, 485 secs
lola: sara is running 490 secs || 175902120 markings, 729915463 edges, 205797 markings/sec, 490 secs
lola: sara is running 495 secs || 176924181 markings, 733224476 edges, 204412 markings/sec, 495 secs
lola: sara is running 500 secs || 178264258 markings, 737633502 edges, 268015 markings/sec, 500 secs
lola: sara is running 505 secs || 179307381 markings, 741063822 edges, 208625 markings/sec, 505 secs
lola: sara is running 510 secs || 180767218 markings, 745773972 edges, 291967 markings/sec, 510 secs
lola: sara is running 515 secs || 182538377 markings, 751571740 edges, 354232 markings/sec, 515 secs
lola: sara is running 520 secs || 184330353 markings, 757526638 edges, 358395 markings/sec, 520 secs
lola: sara is running 525 secs || 186029279 markings, 763208510 edges, 339785 markings/sec, 525 secs
lola: sara is running 530 secs || 187570876 markings, 768389640 edges, 308319 markings/sec, 530 secs
lola: sara is running 535 secs || 189311945 markings, 775082611 edges, 348214 markings/sec, 535 secs
lola: sara is running 540 secs || 191107258 markings, 782388560 edges, 359063 markings/sec, 540 secs
lola: sara is running 545 secs || 192889691 markings, 789692684 edges, 356487 markings/sec, 545 secs
lola: sara is running 550 secs || 194684976 markings, 797000843 edges, 359057 markings/sec, 550 secs
lola: sara is running 555 secs || 194830479 markings, 797601108 edges, 29101 markings/sec, 555 secs
lola: sara is running 560 secs || 194830519 markings, 797601297 edges, 8 markings/sec, 560 secs
lola: sara is running 565 secs || 194844299 markings, 797665103 edges, 2756 markings/sec, 565 secs
lola: sara is running 570 secs || 194904338 markings, 797925025 edges, 12008 markings/sec, 570 secs
lola: sara is running 575 secs || 194922478 markings, 798001367 edges, 3628 markings/sec, 575 secs
lola: sara is running 580 secs || 194936092 markings, 798049585 edges, 2723 markings/sec, 580 secs
lola: sara is running 585 secs || 194953450 markings, 798111337 edges, 3472 markings/sec, 585 secs
lola: sara is running 590 secs || 194972718 markings, 798178993 edges, 3854 markings/sec, 590 secs
lola: sara is running 595 secs || 194972820 markings, 798179349 edges, 20 markings/sec, 595 secs
lola: sara is running 600 secs || 195009512 markings, 798322433 edges, 7338 markings/sec, 600 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2213 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Ru5P) AND (1 <= _3PG) AND (GAP <= NADplus) AND (Xu5P <= GSSG))))
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: RESULT
lola:
SUMMARY: yes no unknown no yes yes no no unknown no yes yes yes no unknown yes
lola: ========================================
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000010000-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496398222795

--------------------
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-C0100N0000010000"
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-C0100N0000010000.tgz
mv S_GPPP-PT-C0100N0000010000 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-C0100N0000010000, 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-149441612600556"
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 ;