About the Execution of LoLA for S_GPPP-PT-C1000N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13423.500 | 1209420.00 | 2559002.00 | 467.60 | FFFTFFTFTFFTTFTT | 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-C1000N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600574
=====================================================================
--------------------
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-C1000N0000000010-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496398687363
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GPPP-PT-C1000N0000000010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000000010: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-ReachabilityCardinality.task
lola: A (G (((Lac <= 2) OR (Xu5P <= 1) OR ((NADplus <= 2) AND (b1 + 1 <= _2PG))))) : E (F (((Pi <= a1) AND (3 <= F6P)))) : A (G ((Lac <= b2))) : E (F ((((NADPH <= 2) AND (NADplus <= 2)) OR (b1 + 1 <= R5P)))) : E (F (((ATP + 1 <= PEP) AND (a2 <= 1) AND (1 <= b2)))) : A (G (((ADP <= c1) OR (1 <= c1) OR (_3PG <= 1) OR (NADplus + 1 <= a1)))) : E (F ((3 <= Lac))) : E (F ((((a2 <= b1) OR (1 <= E4P) OR ((Pi <= a2) AND (b2 <= c2))) AND (2 <= S7P)))) : A (G ((start <= 1))) : E (F ((1 <= _3PG))) : A (G ((_3PG <= ATP))) : A (G (())) : E (F (((3 <= c1) AND (Pi <= GSSG) AND (3 <= start) AND (GSH <= 0)))) : E (F (((b1 + 1 <= G6P) AND (ADP + 1 <= _2PG) AND (1 <= c1)))) : A (G (((Gluc <= 2) OR (Gluc + 1 <= GSSG) OR (start <= ADP)))) : A (G (((3 <= F6P) OR (1 <= ATP) OR (Pi <= PEP) OR (3 <= NADH) OR ((NADPH + 1 <= NADPplus) AND (NADPplus + 1 <= _3PG)))))
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 <= 2) OR (Xu5P <= 1) OR ((NADplus <= 2) AND (b1 + 1 <= _2PG)))))
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: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Pi <= a1) AND (3 <= F6P))))
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-C1000N0000000010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality.sara.
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3225745 markings, 9020959 edges, 645149 markings/sec, 0 secs
lola: sara is running 5 secs || 5908682 markings, 16430320 edges, 536587 markings/sec, 5 secs
lola: sara is running 10 secs || 8620986 markings, 23920783 edges, 542461 markings/sec, 10 secs
lola: sara is running 15 secs || 11326117 markings, 31456415 edges, 541026 markings/sec, 15 secs
lola: sara is running 20 secs || 14045371 markings, 39055170 edges, 543851 markings/sec, 20 secs
lola: sara is running 25 secs || 16731253 markings, 46994644 edges, 537176 markings/sec, 25 secs
lola: sara is running 30 secs || 19331445 markings, 54888001 edges, 520038 markings/sec, 30 secs
lola: sara is running 35 secs || 21629382 markings, 62319013 edges, 459587 markings/sec, 35 secs
lola: sara is running 40 secs || 23841544 markings, 69553371 edges, 442432 markings/sec, 40 secs
lola: sara is running 45 secs || 26068254 markings, 76858237 edges, 445342 markings/sec, 45 secs
lola: sara is running 50 secs || 28247420 markings, 84020666 edges, 435833 markings/sec, 50 secs
lola: sara is running 55 secs || 30589945 markings, 91716548 edges, 468505 markings/sec, 55 secs
lola: sara is running 60 secs || 32880678 markings, 99073481 edges, 458147 markings/sec, 60 secs
lola: sara is running 65 secs || 35322136 markings, 106944741 edges, 488292 markings/sec, 65 secs
lola: sara is running 70 secs || 37570282 markings, 114799639 edges, 449629 markings/sec, 70 secs
lola: sara is running 75 secs || 40092437 markings, 123114223 edges, 504431 markings/sec, 75 secs
lola: sara is running 80 secs || 42300510 markings, 130623649 edges, 441615 markings/sec, 80 secs
lola: sara is running 85 secs || 44342212 markings, 137376301 edges, 408340 markings/sec, 85 secs
lola: sara is running 90 secs || 46581358 markings, 144959999 edges, 447829 markings/sec, 90 secs
lola: sara is running 95 secs || 48693561 markings, 152219100 edges, 422441 markings/sec, 95 secs
lola: sara is running 100 secs || 50817695 markings, 159550596 edges, 424827 markings/sec, 100 secs
lola: sara is running 105 secs || 52867746 markings, 166595044 edges, 410010 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Lac <= b2)))
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-C1000N0000000010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3017851 markings, 7982556 edges, 603570 markings/sec, 0 secs
lola: sara is running 5 secs || 5778425 markings, 15413947 edges, 552115 markings/sec, 5 secs
lola: sara is running 10 secs || 8495589 markings, 22719732 edges, 543433 markings/sec, 10 secs
lola: sara is running 15 secs || 11258033 markings, 30144631 edges, 552489 markings/sec, 15 secs
lola: sara is running 20 secs || 13970284 markings, 37449144 edges, 542450 markings/sec, 20 secs
lola: sara is running 25 secs || 16763157 markings, 44961512 edges, 558575 markings/sec, 25 secs
lola: sara is running 30 secs || 19374940 markings, 51986561 edges, 522357 markings/sec, 30 secs
lola: sara is running 35 secs || 22050409 markings, 59163924 edges, 535094 markings/sec, 35 secs
lola: sara is running 40 secs || 24749677 markings, 66420419 edges, 539854 markings/sec, 40 secs
lola: sara is running 45 secs || 27465564 markings, 73720237 edges, 543177 markings/sec, 45 secs
lola: sara is running 50 secs || 30140171 markings, 80893219 edges, 534921 markings/sec, 50 secs
lola: sara is running 55 secs || 32843319 markings, 88150020 edges, 540630 markings/sec, 55 secs
lola: sara is running 60 secs || 35666105 markings, 95729572 edges, 564557 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NADPH <= 2) AND (NADplus <= 2)) OR (b1 + 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-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 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATP + 1 <= PEP) AND (a2 <= 1) AND (1 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ADP <= c1) OR (1 <= c1) OR (_3PG <= 1) OR (NADplus + 1 <= 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3826241 markings, 8337146 edges, 765248 markings/sec, 0 secs
lola: sara is running 5 secs || 7065220 markings, 15163355 edges, 647796 markings/sec, 5 secs
lola: sara is running 10 secs || 10386391 markings, 22370710 edges, 664234 markings/sec, 10 secs
lola: sara is running 15 secs || 13491632 markings, 29255973 edges, 621048 markings/sec, 15 secs
lola: sara is running 20 secs || 16633951 markings, 36387793 edges, 628464 markings/sec, 20 secs
lola: sara is running 25 secs || 19868842 markings, 43714665 edges, 646978 markings/sec, 25 secs
lola: sara is running 30 secs || 23243215 markings, 51346441 edges, 674875 markings/sec, 30 secs
lola: sara is running 35 secs || 26402023 markings, 58692257 edges, 631762 markings/sec, 35 secs
lola: sara is running 40 secs || 29090953 markings, 65254998 edges, 537786 markings/sec, 40 secs
lola: sara is running 45 secs || 31850984 markings, 71963420 edges, 552006 markings/sec, 45 secs
lola: sara is running 50 secs || 34554424 markings, 79173842 edges, 540688 markings/sec, 50 secs
lola: sara is running 55 secs || 37280923 markings, 86446120 edges, 545300 markings/sec, 55 secs
lola: sara is running 60 secs || 40040152 markings, 93809468 edges, 551846 markings/sec, 60 secs
lola: sara is running 65 secs || 43178206 markings, 101254087 edges, 627611 markings/sec, 65 secs
lola: sara is running 70 secs || 46052788 markings, 108621572 edges, 574916 markings/sec, 70 secs
lola: sara is running 75 secs || 49163756 markings, 116227486 edges, 622194 markings/sec, 75 secs
lola: sara is running 80 secs || 51677949 markings, 122628674 edges, 502839 markings/sec, 80 secs
lola: sara is running 85 secs || 54185093 markings, 128955944 edges, 501429 markings/sec, 85 secs
lola: sara is running 90 secs || 56921618 markings, 135638771 edges, 547305 markings/sec, 90 secs
lola: sara is running 95 secs || 59531118 markings, 141876985 edges, 521900 markings/sec, 95 secs
lola: sara is running 100 secs || 61863707 markings, 148291113 edges, 466518 markings/sec, 100 secs
lola: sara is running 105 secs || 64171170 markings, 154982220 edges, 461493 markings/sec, 105 secs
lola: sara is running 110 secs || 66646424 markings, 161749860 edges, 495051 markings/sec, 110 secs
lola: sara is running 115 secs || 69135065 markings, 168700263 edges, 497728 markings/sec, 115 secs
lola: sara is running 120 secs || 71665677 markings, 175744627 edges, 506122 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Lac)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-6.sara
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((a2 <= b1) OR (1 <= E4P) OR ((Pi <= a2) AND (b2 <= c2))) AND (2 <= 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-6.sara.try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2401363 markings, 8810401 edges, 480273 markings/sec, 0 secs
lola: sara is running 5 secs || 4678834 markings, 17304346 edges, 455494 markings/sec, 5 secs
lola: sara is running 10 secs || 6888964 markings, 25777114 edges, 442026 markings/sec, 10 secs
lola: sara is running 15 secs || 9106836 markings, 34214877 edges, 443574 markings/sec, 15 secs
lola: sara is running 20 secs || 11312983 markings, 42476575 edges, 441229 markings/sec, 20 secs
lola: sara is running 25 secs || 13448169 markings, 50811805 edges, 427037 markings/sec, 25 secs
lola: sara is running 30 secs || 15662998 markings, 59138433 edges, 442966 markings/sec, 30 secs
lola: sara is running 35 secs || 17841104 markings, 67336636 edges, 435621 markings/sec, 35 secs
lola: sara is running 40 secs || 20030648 markings, 75748289 edges, 437909 markings/sec, 40 secs
lola: sara is running 45 secs || 22251901 markings, 84026237 edges, 444251 markings/sec, 45 secs
lola: sara is running 50 secs || 24384988 markings, 92283411 edges, 426617 markings/sec, 50 secs
lola: sara is running 55 secs || 26503843 markings, 100525863 edges, 423771 markings/sec, 55 secs
lola: sara is running 60 secs || 28656540 markings, 108924168 edges, 430539 markings/sec, 60 secs
lola: sara is running 65 secs || 30749909 markings, 117133735 edges, 418674 markings/sec, 65 secs
lola: sara is running 70 secs || 32963623 markings, 125602931 edges, 442743 markings/sec, 70 secs
lola: sara is running 75 secs || 35129545 markings, 133798861 edges, 433184 markings/sec, 75 secs
lola: sara is running 80 secs || 37301148 markings, 142059335 edges, 434321 markings/sec, 80 secs
lola: sara is running 85 secs || 39433015 markings, 150488940 edges, 426373 markings/sec, 85 secs
lola: sara is running 90 secs || 41537729 markings, 158899404 edges, 420943 markings/sec, 90 secs
lola: sara is running 95 secs || 43712023 markings, 167239035 edges, 434859 markings/sec, 95 secs
lola: sara is running 100 secs || 45856648 markings, 175385105 edges, 428925 markings/sec, 100 secs
lola: sara is running 105 secs || 47983390 markings, 183583643 edges, 425348 markings/sec, 105 secs
lola: sara is running 110 secs || 50113594 markings, 192151523 edges, 426041 markings/sec, 110 secs
lola: sara is running 115 secs || 52276877 markings, 200517214 edges, 432657 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((start <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4723055 markings, 8189799 edges, 944611 markings/sec, 0 secs
lola: sara is running 5 secs || 9208028 markings, 15798619 edges, 896995 markings/sec, 5 secs
lola: sara is running 10 secs || 13057080 markings, 22847613 edges, 769810 markings/sec, 10 secs
lola: sara is running 15 secs || 17571448 markings, 29861769 edges, 902874 markings/sec, 15 secs
lola: sara is running 20 secs || 21722190 markings, 36928575 edges, 830148 markings/sec, 20 secs
lola: sara is running 25 secs || 25949691 markings, 43588474 edges, 845500 markings/sec, 25 secs
lola: sara is running 30 secs || 29501206 markings, 50321286 edges, 710303 markings/sec, 30 secs
lola: sara is running 35 secs || 32861593 markings, 56940811 edges, 672077 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-9.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_3PG <= 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-C1000N0000000010-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 613 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= c1) AND (Pi <= GSSG) AND (3 <= start) AND (GSH <= 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 4 literals and 1 conjunctive subformulas
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-9.sara.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-12.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3543550 markings, 8583904 edges, 708710 markings/sec, 0 secs
lola: sara is running 5 secs || 6874809 markings, 16772834 edges, 666252 markings/sec, 5 secs
lola: sara is running 10 secs || 10068790 markings, 24567285 edges, 638796 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((b1 + 1 <= G6P) AND (ADP + 1 <= _2PG) AND (1 <= c1))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2615397 markings, 10277705 edges, 523079 markings/sec, 0 secs
lola: sara is running 5 secs || 4771389 markings, 19496711 edges, 431198 markings/sec, 5 secs
lola: sara is running 10 secs || 6875650 markings, 28569968 edges, 420852 markings/sec, 10 secs
lola: sara is running 15 secs || 9014161 markings, 37954242 edges, 427702 markings/sec, 15 secs
lola: sara is running 20 secs || 11351915 markings, 46968813 edges, 467551 markings/sec, 20 secs
lola: sara is running 25 secs || 13416860 markings, 54953404 edges, 412989 markings/sec, 25 secs
lola: sara is running 30 secs || 15227813 markings, 63157943 edges, 362191 markings/sec, 30 secs
lola: sara is running 35 secs || 17112597 markings, 71129044 edges, 376957 markings/sec, 35 secs
lola: sara is running 40 secs || 19145139 markings, 79873700 edges, 406508 markings/sec, 40 secs
lola: sara is running 45 secs || 20922901 markings, 88140185 edges, 355552 markings/sec, 45 secs
lola: sara is running 50 secs || 23075991 markings, 96990771 edges, 430618 markings/sec, 50 secs
lola: sara is running 55 secs || 25035661 markings, 105439640 edges, 391934 markings/sec, 55 secs
lola: sara is running 60 secs || 26884743 markings, 113962661 edges, 369816 markings/sec, 60 secs
lola: sara is running 65 secs || 28956260 markings, 122239406 edges, 414303 markings/sec, 65 secs
lola: sara is running 70 secs || 30605537 markings, 129653597 edges, 329855 markings/sec, 70 secs
lola: sara is running 75 secs || 32189324 markings, 136615720 edges, 316757 markings/sec, 75 secs
lola: sara is running 80 secs || 33876754 markings, 144367124 edges, 337486 markings/sec, 80 secs
lola: sara is running 85 secs || 35447810 markings, 151663004 edges, 314211 markings/sec, 85 secs
lola: sara is running 90 secs || 37023645 markings, 159025502 edges, 315167 markings/sec, 90 secs
lola: sara is running 95 secs || 38962263 markings, 167353367 edges, 387724 markings/sec, 95 secs
lola: sara is running 100 secs || 40797387 markings, 175418684 edges, 367025 markings/sec, 100 secs
lola: sara is running 105 secs || 42616829 markings, 183513209 edges, 363888 markings/sec, 105 secs
lola: sara is running 110 secs || 44338048 markings, 191346012 edges, 344244 markings/sec, 110 secs
lola: sara is running 115 secs || 46185853 markings, 199478290 edges, 369561 markings/sec, 115 secs
lola: sara is running 120 secs || 48102423 markings, 208034057 edges, 383314 markings/sec, 120 secs
lola: sara is running 125 secs || 49830381 markings, 216093509 edges, 345592 markings/sec, 125 secs
lola: sara is running 130 secs || 51684372 markings, 224141088 edges, 370798 markings/sec, 130 secs
lola: sara is running 135 secs || 53406689 markings, 232082563 edges, 344463 markings/sec, 135 secs
lola: sara is running 140 secs || 55301919 markings, 240401176 edges, 379046 markings/sec, 140 secs
lola: sara is running 145 secs || 56871158 markings, 247696840 edges, 313848 markings/sec, 145 secs
lola: sara is running 150 secs || 58479174 markings, 254743042 edges, 321603 markings/sec, 150 secs
lola: sara is running 155 secs || 59920519 markings, 261544523 edges, 288269 markings/sec, 155 secs
lola: sara is running 160 secs || 61408827 markings, 268293960 edges, 297662 markings/sec, 160 secs
lola: sara is running 165 secs || 63016108 markings, 275800166 edges, 321456 markings/sec, 165 secs
lola: sara is running 170 secs || 64442187 markings, 282785546 edges, 285216 markings/sec, 170 secs
lola: sara is running 175 secs || 65930414 markings, 290038191 edges, 297645 markings/sec, 175 secs
lola: sara is running 180 secs || 67383602 markings, 297166387 edges, 290638 markings/sec, 180 secs
lola: sara is running 185 secs || 69177250 markings, 305118101 edges, 358730 markings/sec, 185 secs
lola: sara is running 190 secs || 70977755 markings, 312936300 edges, 360101 markings/sec, 190 secs
lola: sara is running 195 secs || 72642182 markings, 320590655 edges, 332885 markings/sec, 195 secs
lola: sara is running 200 secs || 74390128 markings, 328327327 edges, 349589 markings/sec, 200 secs
lola: sara is running 205 secs || 76054800 markings, 335984940 edges, 332934 markings/sec, 205 secs
lola: sara is running 210 secs || 77639670 markings, 343339614 edges, 316974 markings/sec, 210 secs
lola: sara is running 215 secs || 79208676 markings, 350756537 edges, 313801 markings/sec, 215 secs
lola: sara is running 220 secs || 81021450 markings, 359130787 edges, 362555 markings/sec, 220 secs
lola: sara is running 225 secs || 82814106 markings, 367070080 edges, 358531 markings/sec, 225 secs
lola: sara is running 230 secs || 84460635 markings, 374807436 edges, 329306 markings/sec, 230 secs
lola: sara is running 235 secs || 86133680 markings, 382534543 edges, 334609 markings/sec, 235 secs
lola: sara is running 240 secs || 87698964 markings, 390033831 edges, 313057 markings/sec, 240 secs
lola: sara is running 245 secs || 89454947 markings, 397952616 edges, 351197 markings/sec, 245 secs
lola: sara is running 250 secs || 90860882 markings, 404360639 edges, 281187 markings/sec, 250 secs
lola: sara is running 255 secs || 92690682 markings, 411247286 edges, 365960 markings/sec, 255 secs
lola: sara is running 260 secs || 94187392 markings, 417953968 edges, 299342 markings/sec, 260 secs
lola: sara is running 265 secs || 95610413 markings, 424708088 edges, 284604 markings/sec, 265 secs
lola: sara is running 270 secs || 97012432 markings, 431240689 edges, 280404 markings/sec, 270 secs
lola: sara is running 275 secs || 98316939 markings, 437655324 edges, 260901 markings/sec, 275 secs
lola: sara is running 280 secs || 99594575 markings, 443893694 edges, 255527 markings/sec, 280 secs
lola: sara is running 285 secs || 100950162 markings, 450450431 edges, 271117 markings/sec, 285 secs
lola: sara is running 290 secs || 102395247 markings, 457509420 edges, 289017 markings/sec, 290 secs
lola: sara is running 295 secs || 103751177 markings, 464176059 edges, 271186 markings/sec, 295 secs
lola: sara is running 300 secs || 105060348 markings, 470775147 edges, 261834 markings/sec, 300 secs
lola: sara is running 305 secs || 106352195 markings, 477346257 edges, 258369 markings/sec, 305 secs
lola: sara is running 310 secs || 107623074 markings, 483916187 edges, 254176 markings/sec, 310 secs
lola: sara is running 315 secs || 109144365 markings, 490575501 edges, 304258 markings/sec, 315 secs
lola: sara is running 320 secs || 110840352 markings, 498091227 edges, 339197 markings/sec, 320 secs
lola: sara is running 325 secs || 112452982 markings, 505306396 edges, 322526 markings/sec, 325 secs
lola: sara is running 330 secs || 114039647 markings, 512708131 edges, 317333 markings/sec, 330 secs
lola: sara is running 335 secs || 115592485 markings, 519859505 edges, 310568 markings/sec, 335 secs
lola: sara is running 340 secs || 117260930 markings, 527520592 edges, 333689 markings/sec, 340 secs
lola: sara is running 345 secs || 118816827 markings, 534816196 edges, 311179 markings/sec, 345 secs
lola: sara is running 350 secs || 120296816 markings, 541910734 edges, 295998 markings/sec, 350 secs
lola: sara is running 355 secs || 121785075 markings, 549098177 edges, 297652 markings/sec, 355 secs
lola: sara is running 360 secs || 123270210 markings, 555634474 edges, 297027 markings/sec, 360 secs
lola: sara is running 365 secs || 124974779 markings, 563323949 edges, 340914 markings/sec, 365 secs
lola: sara is running 370 secs || 126576858 markings, 570759956 edges, 320416 markings/sec, 370 secs
lola: sara is running 375 secs || 128046557 markings, 577911059 edges, 293940 markings/sec, 375 secs
lola: sara is running 380 secs || 129626286 markings, 585310222 edges, 315946 markings/sec, 380 secs
lola: sara is running 385 secs || 131184828 markings, 592403022 edges, 311708 markings/sec, 385 secs
lola: sara is running 390 secs || 132778819 markings, 599735803 edges, 318798 markings/sec, 390 secs
lola: sara is running 395 secs || 134343964 markings, 606753044 edges, 313029 markings/sec, 395 secs
lola: sara is running 400 secs || 135638090 markings, 612971888 edges, 258825 markings/sec, 400 secs
lola: sara is running 405 secs || 136935752 markings, 619308876 edges, 259532 markings/sec, 405 secs
lola: sara is running 410 secs || 138152698 markings, 625580390 edges, 243389 markings/sec, 410 secs
lola: sara is running 415 secs || 139350465 markings, 631663345 edges, 239553 markings/sec, 415 secs
lola: sara is running 420 secs || 140455196 markings, 637634741 edges, 220946 markings/sec, 420 secs
lola: sara is running 425 secs || 141571882 markings, 643383159 edges, 223337 markings/sec, 425 secs
lola: sara is running 430 secs || 142897396 markings, 649713332 edges, 265103 markings/sec, 430 secs
lola: sara is running 435 secs || 144151157 markings, 656186945 edges, 250752 markings/sec, 435 secs
lola: sara is running 440 secs || 145316522 markings, 662519628 edges, 233073 markings/sec, 440 secs
lola: sara is running 445 secs || 146496656 markings, 668490397 edges, 236027 markings/sec, 445 secs
lola: sara is running 450 secs || 147653708 markings, 674921096 edges, 231410 markings/sec, 450 secs
lola: sara is running 455 secs || 149171903 markings, 681861011 edges, 303639 markings/sec, 455 secs
lola: sara is running 460 secs || 150691964 markings, 688792946 edges, 304012 markings/sec, 460 secs
lola: sara is running 465 secs || 152207258 markings, 695759060 edges, 303059 markings/sec, 465 secs
lola: sara is running 470 secs || 153654531 markings, 702608560 edges, 289455 markings/sec, 470 secs
lola: sara is running 475 secs || 155126924 markings, 709382418 edges, 294479 markings/sec, 475 secs
lola: sara is running 480 secs || 156634125 markings, 716463832 edges, 301440 markings/sec, 480 secs
lola: sara is running 485 secs || 158040292 markings, 723141518 edges, 281233 markings/sec, 485 secs
lola: sara is running 490 secs || 159445228 markings, 730001356 edges, 280987 markings/sec, 490 secs
lola: sara is running 495 secs || 161080870 markings, 737416956 edges, 327128 markings/sec, 495 secs
lola: sara is running 500 secs || 162613493 markings, 744690922 edges, 306525 markings/sec, 500 secs
lola: sara is running 505 secs || 164094247 markings, 751676306 edges, 296151 markings/sec, 505 secs
lola: sara is running 510 secs || 165613704 markings, 758371008 edges, 303891 markings/sec, 510 secs
lola: sara is running 515 secs || 167144828 markings, 765197366 edges, 306225 markings/sec, 515 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Gluc <= 2) OR (Gluc + 1 <= GSSG) OR (start <= ADP))))
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-C1000N0000000010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2880578 markings, 8915980 edges, 576116 markings/sec, 0 secs
lola: sara is running 5 secs || 5593964 markings, 17075461 edges, 542677 markings/sec, 5 secs
lola: sara is running 10 secs || 7769861 markings, 25053421 edges, 435179 markings/sec, 10 secs
lola: sara is running 15 secs || 9915034 markings, 32814177 edges, 429035 markings/sec, 15 secs
lola: sara is running 20 secs || 12293643 markings, 40194433 edges, 475722 markings/sec, 20 secs
lola: sara is running 25 secs || 14378395 markings, 47914884 edges, 416950 markings/sec, 25 secs
lola: sara is running 30 secs || 16347035 markings, 55396108 edges, 393728 markings/sec, 30 secs
lola: sara is running 35 secs || 18094475 markings, 62570067 edges, 349488 markings/sec, 35 secs
lola: sara is running 40 secs || 20227565 markings, 70137621 edges, 426618 markings/sec, 40 secs
lola: sara is running 45 secs || 22788311 markings, 77629209 edges, 512149 markings/sec, 45 secs
lola: sara is running 50 secs || 25140025 markings, 84767836 edges, 470343 markings/sec, 50 secs
lola: sara is running 55 secs || 27160130 markings, 91993461 edges, 404021 markings/sec, 55 secs
lola: sara is running 60 secs || 29028988 markings, 99157008 edges, 373772 markings/sec, 60 secs
lola: sara is running 65 secs || 30733487 markings, 105973736 edges, 340900 markings/sec, 65 secs
lola: sara is running 70 secs || 32420007 markings, 112907366 edges, 337304 markings/sec, 70 secs
lola: sara is running 75 secs || 34123624 markings, 119884775 edges, 340723 markings/sec, 75 secs
lola: sara is running 80 secs || 36005766 markings, 127136002 edges, 376428 markings/sec, 80 secs
lola: sara is running 85 secs || 37752521 markings, 133950822 edges, 349351 markings/sec, 85 secs
lola: sara is running 90 secs || 39807535 markings, 140729915 edges, 411003 markings/sec, 90 secs
lola: sara is running 95 secs || 41944660 markings, 147486214 edges, 427425 markings/sec, 95 secs
lola: sara is running 100 secs || 44007390 markings, 154096816 edges, 412546 markings/sec, 100 secs
lola: sara is running 105 secs || 45782223 markings, 160773463 edges, 354967 markings/sec, 105 secs
lola: sara is running 110 secs || 47636201 markings, 167798981 edges, 370796 markings/sec, 110 secs
lola: sara is running 115 secs || 49277170 markings, 174511506 edges, 328194 markings/sec, 115 secs
lola: sara is running 120 secs || 50959468 markings, 181365825 edges, 336460 markings/sec, 120 secs
lola: sara is running 125 secs || 52644225 markings, 188268694 edges, 336951 markings/sec, 125 secs
lola: sara is running 130 secs || 54386056 markings, 194993375 edges, 348366 markings/sec, 130 secs
lola: sara is running 135 secs || 56035457 markings, 201433829 edges, 329880 markings/sec, 135 secs
lola: sara is running 140 secs || 57622591 markings, 207907015 edges, 317427 markings/sec, 140 secs
lola: sara is running 145 secs || 59228502 markings, 214574609 edges, 321182 markings/sec, 145 secs
lola: sara is running 150 secs || 60958533 markings, 221738107 edges, 346006 markings/sec, 150 secs
lola: sara is running 155 secs || 62818129 markings, 228477086 edges, 371919 markings/sec, 155 secs
lola: sara is running 160 secs || 64937411 markings, 235121256 edges, 423856 markings/sec, 160 secs
lola: sara is running 165 secs || 67200109 markings, 242110549 edges, 452540 markings/sec, 165 secs
lola: sara is running 170 secs || 69594854 markings, 249039213 edges, 478949 markings/sec, 170 secs
lola: sara is running 175 secs || 71565193 markings, 255853858 edges, 394068 markings/sec, 175 secs
lola: sara is running 180 secs || 73479817 markings, 262515816 edges, 382925 markings/sec, 180 secs
lola: sara is running 185 secs || 75375088 markings, 269110891 edges, 379054 markings/sec, 185 secs
lola: sara is running 190 secs || 77266253 markings, 275691851 edges, 378233 markings/sec, 190 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= F6P) OR (1 <= ATP) OR (Pi <= PEP) OR (3 <= NADH) OR ((NADPH + 1 <= NADPplus) AND (NADPplus + 1 <= _3PG)))))
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 10 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-C1000N0000000010-ReachabilityCardinality-15.sara
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes no yes yes no yes no no yes no
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityCardinality-15.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496399896783
--------------------
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-C1000N0000000010"
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-C1000N0000000010.tgz
mv S_GPPP-PT-C1000N0000000010 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-C1000N0000000010, 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-149441612600574"
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 '
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 ;