About the Execution of LoLA for S_GPPP-PT-C0100N0000100000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15950.200 | 1103104.00 | 2048448.00 | 12799.90 | TFFTF?FT?FTTTTTF | 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-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600565
=====================================================================
--------------------
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-C0100N0000100000-ReachabilityCardinality-0
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-1
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-15
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-2
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-3
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-4
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-5
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-6
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-7
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-8
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496397724358
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_GPPP-PT-C0100N0000100000: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_GPPP-PT-C0100N0000100000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_GPPP-PT-C0100N0000100000 @ 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-C0100N0000100000-ReachabilityCardinality.task
lola: E (F ((3 <= Lac))) : E (F (((3 <= ADP) AND ((3 <= b1) OR (start <= NADPH)) AND (Pi <= Gluc)))) : A (G (((_1_3_BPG <= 0) OR (S7P <= NADPplus) OR ((Pi + 1 <= G6P) AND (Gluc <= S7P))))) : E (F (((GAP <= 2) AND (NADPplus <= 0) AND (Ru5P <= 0)))) : A (G ((3 <= NADPplus))) : E (F ((((Pyr + 1 <= NADPplus) OR ((Ru5P <= GAP) AND (2 <= _1_3_BPG))) AND (2 <= Lac)))) : E (F ((((2 <= F6P) AND (1 <= PEP) AND ((NADH <= Xu5P) OR (2 <= a1))) OR ((2 <= Lac) AND (1 <= _1_3_BPG) AND (_2PG + 1 <= E4P))))) : A (G ((3 <= GSSG))) : A (G (((S7P <= 2) OR (2 <= GSSG)))) : E (F ((((2 <= a2) OR (Xu5P <= NADPH) OR ((2 <= FBP) AND (2 <= NADH))) AND (3 <= S7P)))) : A (G (((Xu5P <= 2) OR (2 <= Ru5P) OR (1 <= _2PG)))) : A (G ((E4P <= NADplus))) : A (G ((((start <= 2) OR (GSH <= 0)) AND ((ADP <= 0) OR (_1_3_BPG <= 1))))) : E (F (((2 <= S7P) AND (a2 <= _3PG) AND (3 <= NADH) AND (2 <= G6P) AND (((DHAP <= GSSG) AND (NADPplus <= Pyr)) OR (GSSG <= start))))) : E (F ((GSSG + 1 <= Lac))) : A (G (((Pyr + 1 <= Pi) OR (c1 <= 0) OR (_1_3_BPG <= 1))))
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 <= 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: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ADP) AND ((3 <= b1) OR (start <= NADPH)) AND (Pi <= Gluc))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministicsara:
place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3560008 markings, 9478506 edges, 712002 markings/sec, 0 secs
lola: sara is running 5 secs || 6925261 markings, 18862039 edges, 673051 markings/sec, 5 secs
lola: sara is running 10 secs || 10409085 markings, 27695131 edges, 696765 markings/sec, 10 secs
lola: sara is running 15 secs || 13451504 markings, 34985279 edges, 608484 markings/sec, 15 secs
lola: sara is running 20 secs || 16194536 markings, 41567146 edges, 548606 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_1_3_BPG <= 0) OR (S7P <= NADPplus) OR ((Pi + 1 <= G6P) AND (Gluc <= S7P)))))
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-C0100N0000100000-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3062657 markings, 8385756 edges, 612531 markings/sec, 0 secs
lola: sara is running 5 secs || 5725943 markings, 16791424 edges, 532657 markings/sec, 5 secs
lola: sara is running 10 secs || 8255550 markings, 23970336 edges, 505921 markings/sec, 10 secs
lola: sara is running 15 secs || 10684036 markings, 31917686 edges, 485697 markings/sec, 15 secs
lola: sara is running 20 secs || 13326806 markings, 38567886 edges, 528554 markings/sec, 20 secs
lola: sara is running 25 secs || 15672121 markings, 46476719 edges, 469063 markings/sec, 25 secs
lola: sara is running 30 secs || 18347425 markings, 53635345 edges, 535061 markings/sec, 30 secs
lola: sara is running 35 secs || 20821705 markings, 60581327 edges, 494856 markings/sec, 35 secs
lola: sara is running 40 secs || 23330825 markings, 68578950 edges, 501824 markings/sec, 40 secs
lola: sara is running 45 secs || 25956269 markings, 75255969 edges, 525089 markings/sec, 45 secs
lola: sara is running 50 secs || 28429293 markings, 81780667 edges, 494605 markings/sec, 50 secs
lola: sara is running 55 secs || 30812510 markings, 89512857 edges, 476643 markings/sec, 55 secs
lola: sara is running 60 secs || 33381708 markings, 96800397 edges, 513840 markings/sec, 60 secs
lola: sara is running 65 secs || 36021844 markings, 102687311 edges, 528027 markings/sec, 65 secs
lola: sara is running 70 secs || 38310978 markings, 109846303 edges, 457827 markings/sec, 70 secs
lola: sara is running 75 secs || 40867226 markings, 117568677 edges, 511250 markings/sec, 75 secs
lola: sara is running 80 secs || 43343659 markings, 124161512 edges, 495287 markings/sec, 80 secs
lola: sara is running 85 secs || 45832347 markings, 129734394 edges, 497738 markings/sec, 85 secs
lola: sara is running 90 secs || 48098697 markings, 136383863 edges, 453270 markings/sec, 90 secs
lola: sara is running 95 secs || 50548429 markings, 143940446 edges, 489946 markings/sec, 95 secs
lola: sara is running 100 secs || 52986629 markings, 151100183 edges, 487640 markings/sec, 100 secs
lola: sara is running 105 secs || 55632929 markings, 156943921 edges, 529260 markings/sec, 105 secs
lola: sara is running 110 secs || 58044366 markings, 162587137 edges, 482287 markings/sec, 110 secs
lola: sara is running 115 secs || 60155711 markings, 169709344 edges, 422269 markings/sec, 115 secs
lola: sara is running 120 secs || 62840710 markings, 177520346 edges, 537000 markings/sec, 120 secs
lola: sara is running 125 secs || 65269290 markings, 184212390 edges, 485716 markings/sec, 125 secs
lola: sara is running 130 secs || 67825832 markings, 189810602 edges, 511308 markings/sec, 130 secs
lola: sara is running 135 secs || 70180558 markings, 195308932 edges, 470945 markings/sec, 135 secs
lola: sara is running 140 secs || 72230985 markings, 202182289 edges, 410085 markings/sec, 140 secs
lola: sara is running 145 secs || 74970515 markings, 210051081 edges, 547906 markings/sec, 145 secs
lola: sara is running 150 secs || 77287949 markings, 216809753 edges, 463487 markings/sec, 150 secs
lola: sara is running 155 secs || 79857523 markings, 222571389 edges, 513915 markings/sec, 155 secs
lola: sara is running 160 secs || 82226384 markings, 227944782 edges, 473772 markings/sec, 160 secs
lola: sara is running 165 secs || 84554057 markings, 234224513 edges, 465535 markings/sec, 165 secs
lola: sara is running 170 secs || 86846016 markings, 241497007 edges, 458392 markings/sec, 170 secs
lola: sara is running 175 secs || 89368077 markings, 248846770 edges, 504412 markings/sec, 175 secs
lola: sara is running 180 secs || 91796581 markings, 255504615 edges, 485701 markings/sec, 180 secs
lola: sara is running 185 secs || 94306121 markings, 260962422 edges, 501908 markings/sec, 185 secs
lola: sara is running 190 secs || 96668602 markings, 266346931 edges, 472496 markings/sec, 190 secs
lola: sara is running 195 secs || 98973197 markings, 272570815 edges, 460919 markings/sec, 195 secs
lola: sara is running 200 secs || 101236907 markings, 279749301 edges, 452742 markings/sec, 200 secs
lola: sara is running 205 secs || 103816649 markings, 287179015 edges, 515948 markings/sec, 205 secs
lola: sara is running 210 secs || 106147296 markings, 293886755 edges, 466129 markings/sec, 210 secs
lola: sara is running 215 secs || 108692188 markings, 299475211 edges, 508978 markings/sec, 215 secs
lola: sara is running 220 secs || 111056970 markings, 304808386 edges, 472956 markings/sec, 220 secs
lola: sara is running 225 secs || 113392253 markings, 310293930 edges, 467057 markings/sec, 225 secs
lola: sara is running 230 secs || 115468350 markings, 317109916 edges, 415219 markings/sec, 230 secs
lola: sara is running 235 secs || 118143712 markings, 324711807 edges, 535072 markings/sec, 235 secs
lola: sara is running 240 secs || 120403126 markings, 331195581 edges, 451883 markings/sec, 240 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 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((GAP <= 2) AND (NADPplus <= 0) AND (Ru5P <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4034083 markings, 7846690 edges, 806817 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= NADPplus)))
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:
========================================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-C0100N0000100000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3601964 markings, 7676635 edges, 720393 markings/sec, 0 secs
lola: sara is running 5 secs || 6542616 markings, 14532051 edges, 588130 markings/sec, 5 secs
lola: sara is running 10 secs || 9080984 markings, 21145511 edges, 507674 markings/sec, 10 secs
lola: sara is running 15 secs || 11565216 markings, 27604446 edges, 496846 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Pyr + 1 <= NADPplus) OR ((Ru5P <= GAP) AND (2 <= _1_3_BPG))) AND (2 <= 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 5 literals and 2 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-C0100N0000100000-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= F6P) AND (1 <= PEP) AND ((NADH <= Xu5P) OR (2 <= a1))) OR ((2 <= Lac) AND (1 <= _1_3_BPG) AND (_2PG + 1 <= E4P)))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= GSSG)))
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-C0100N0000100000-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-7.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 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((S7P <= 2) OR (2 <= GSSG))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-8.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 9 will run for 460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= a2) OR (Xu5P <= NADPH) OR ((2 <= FBP) AND (2 <= NADH))) AND (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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-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 537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Xu5P <= 2) OR (2 <= Ru5P) OR (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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-10.sara
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E4P <= NADplus)))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: lola: state equation: calling and running saraSTORE
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-C0100N0000100000-ReachabilityCardinality-11.sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3646315 markings, 9719847 edges, 729263 markings/sec, 0 secs
lola: sara is running 5 secs || 7089800 markings, 19321196 edges, 688697 markings/sec, 5 secs
lola: sara is running 10 secs || 10619830 markings, 28199771 edges, 706006 markings/sec, 10 secs
lola: sara is running 15 secs || 13679569 markings, 35532649 edges, 611948 markings/sec, 15 secs
lola: sara is running 20 secs || 16471784 markings, 42232312 edges, 558443 markings/sec, 20 secs
lola: sara is running 25 secs || 19156291 markings, 48673781 edges, 536901 markings/sec, 25 secs
lola: sara is running 30 secs || 21790202 markings, 54993694 edges, 526782 markings/sec, 30 secs
lola: sara is running 35 secs || 24450449 markings, 61376543 edges, 532049 markings/sec, 35 secs
lola: sara is running 40 secs || 27066522 markings, 67653749 edges, 523215 markings/sec, 40 secs
lola: sara is running 45 secs || 29684308 markings, 73934707 edges, 523557 markings/sec, 45 secs
lola: sara is running 50 secs || 32227207 markings, 80036196 edges, 508580 markings/sec, 50 secs
lola: sara is running 55 secs || 34797772 markings, 86204077 edges, 514113 markings/sec, 55 secs
lola: sara is running 60 secs || 37381843 markings, 92404390 edges, 516814 markings/sec, 60 secs
lola: sara is running 65 secs || 39916546 markings, 98486304 edges, 506941 markings/sec, 65 secs
lola: sara is running 70 secs || 42431760 markings, 104521262 edges, 503043 markings/sec, 70 secs
lola: sara is running 75 secs || 44922888 markings, 110498622 edges, 498226 markings/sec, 75 secs
lola: sara is running 80 secs || 47418330 markings, 116486335 edges, 499088 markings/sec, 80 secs
lola: sara is running 85 secs || 49918615 markings, 122485515 edges, 500057 markings/sec, 85 secs
lola: sara is running 90 secs || 52411021 markings, 128465568 edges, 498481 markings/sec, 90 secs
lola: sara is running 95 secs || 54881903 markings, 134394118 edges, 494176 markings/sec, 95 secs
lola: sara is running 100 secs || 57339663 markings, 140291134 edges, 491552 markings/sec, 100 secs
lola: sara is running 105 secs || 59809253 markings, 146216524 edges, 493918 markings/sec, 105 secs
lola: sara is running 110 secs || 62275513 markings, 152133810 edges, 493252 markings/sec, 110 secs
lola: sara is running 115 secs || 64738385 markings, 158043203 edges, 492574 markings/sec, 115 secs
lola: sara is running 120 secs || 67024587 markings, 163528681 edges, 457240 markings/sec, 120 secs
lola: sara is running 125 secs || 69515116 markings, 169504291 edges, 498106 markings/sec, 125 secs
lola: sara is running 130 secs || 72025531 markings, 175527948 edges, 502083 markings/sec, 130 secs
lola: sara is running 135 secs || 74514959 markings, 181500619 edges, 497886 markings/sec, 135 secs
lola: sara is running 140 secs || 76976019 markings, 187405571 edges, 492212 markings/sec, 140 secs
lola: sara is running 145 secs || 79508594 markings, 193482141 edges, 506515 markings/sec, 145 secs
lola: sara is running 150 secs || 82010058 markings, 199483764 edges, 500293 markings/sec, 150 secs
lola: sara is running 155 secs || 84514388 markings, 205492500 edges, 500866 markings/sec, 155 secs
lola: sara is running 160 secs || 87006166 markings, 211471007 edges, 498356 markings/sec, 160 secs
lola: sara is running 165 secs || 89540849 markings, 217552529 edges, 506937 markings/sec, 165 secs
lola: sara is running 170 secs || 91973846 markings, 223389963 edges, 486599 markings/sec, 170 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 761 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((start <= 2) OR (GSH <= 0)) AND ((ADP <= 0) OR (_1_3_BPG <= 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: 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-C0100N0000100000-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= S7P) AND (a2 <= _3PG) AND (3 <= NADH) AND (2 <= G6P) AND (((DHAP <= GSSG) AND (NADPplus <= Pyr)) OR (GSSG <= start)))))lola:
lola: ========================================
lola: ========================================
SUBTASK
lola: checking reachability
lola: lola: state equation: calling and running sara
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 11 literals and 2 conjunctive subformulas
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2371210 markings, 8075252 edges, 474242 markings/sec, 0 secs
lola: sara is running 5 secs || 4653501 markings, 15813982 edges, 456458 markings/sec, 5 secs
lola: sara is running 10 secs || 6894789 markings, 23323077 edges, 448258 markings/sec, 10 secs
lola: sara is running 15 secs || 9063689 markings, 30635720 edges, 433780 markings/sec, 15 secs
lola: sara is running 20 secs || 11112852 markings, 37420511 edges, 409833 markings/sec, 20 secs
lola: sara is running 25 secs || 13307669 markings, 44673450 edges, 438963 markings/sec, 25 secs
lola: sara is running 30 secs || 15521643 markings, 51860518 edges, 442795 markings/sec, 30 secs
lola: sara is running 35 secs || 17751369 markings, 59076391 edges, 445945 markings/sec, 35 secs
lola: sara is running 40 secs || 19854429 markings, 66070582 edges, 420612 markings/sec, 40 secs
lola: sara is running 45 secs || 22082110 markings, 73157755 edges, 445536 markings/sec, 45 secs
lola: sara is running 50 secs || 24218093 markings, 80052441 edges, 427197 markings/sec, 50 secs
lola: sara is running 55 secs || 26312126 markings, 86896398 edges, 418807 markings/sec, 55 secs
lola: sara is running 60 secs || 28474963 markings, 94001801 edges, 432567 markings/sec, 60 secs
lola: sara is running 65 secs || 30730326 markings, 101152208 edges, 451073 markings/sec, 65 secs
lola: sara is running 70 secs || 32935827 markings, 108155651 edges, 441100 markings/sec, 70 secs
lola: sara is running 75 secs || 35087479 markings, 115038241 edges, 430330 markings/sec, 75 secs
lola: sara is running 80 secs || 37257901 markings, 121999704 edges, 434084 markings/sec, 80 secs
lola: sara is running 85 secs || 39376998 markings, 128846972 edges, 423819 markings/sec, 85 secs
lola: sara is running 90 secs || 41475856 markings, 135664652 edges, 419772 markings/sec, 90 secs
lola: sara is running 95 secs || 43552410 markings, 142173507 edges, 415311 markings/sec, 95 secs
lola: sara is running 100 secs || 45753123 markings, 149016231 edges, 440143 markings/sec, 100 secs
lola: sara is running 105 secs || 47928354 markings, 155929424 edges, 435046 markings/sec, 105 secs
lola: sara is running 110 secs || 50067830 markings, 162723818 edges, 427895 markings/sec, 110 secs
lola: sara is running 115 secs || 52168538 markings, 169538157 edges, 420142 markings/sec, 115 secs
lola: sara is running 120 secs || 54215287 markings, 175980601 edges, 409350 markings/sec, 120 secs
lola: sara is running 125 secs || 56366955 markings, 182642939 edges, 430334 markings/sec, 125 secs
lola: sara is running 130 secs || 58483690 markings, 189365995 edges, 423347 markings/sec, 130 secs
lola: sara is running 135 secs || 60451670 markings, 195865560 edges, 393596 markings/sec, 135 secs
lola: sara is running 140 secs || 62614367 markings, 202372189 edges, 432539 markings/sec, 140 secs
lola: sara is running 145 secs || 64742644 markings, 209104350 edges, 425655 markings/sec, 145 secs
lola: sara is running 150 secs || 66712921 markings, 215564345 edges, 394055 markings/sec, 150 secs
lola: sara is running 155 secs || 68862110 markings, 222049103 edges, 429838 markings/sec, 155 secs
lola: sara is running 160 secs || 71025067 markings, 228937307 edges, 432591 markings/sec, 160 secs
lola: sara is running 165 secs || 73097700 markings, 235409486 edges, 414527 markings/sec, 165 secs
lola: sara is running 170 secs || 75210189 markings, 241964573 edges, 422498 markings/sec, 170 secs
lola: sara is running 175 secs || 77150006 markings, 248420100 edges, 387963 markings/sec, 175 secs
lola: sara is running 180 secs || 79286082 markings, 254737127 edges, 427215 markings/sec, 180 secs
lola: sara is running 185 secs || 81247656 markings, 261205725 edges, 392315 markings/sec, 185 secs
lola: sara is running 190 secs || 83262685 markings, 267207169 edges, 403006 markings/sec, 190 secs
lola: sara is running 195 secs || 85319074 markings, 273847023 edges, 411278 markings/sec, 195 secs
lola: sara is running 200 secs || 87322182 markings, 279912401 edges, 400622 markings/sec, 200 secs
lola: sara is running 205 secs || 89369807 markings, 286459769 edges, 409525 markings/sec, 205 secs
lola: sara is running 210 secs || 91356369 markings, 292516058 edges, 397312 markings/sec, 210 secs
lola: sara is running 215 secs || 93399734 markings, 299043500 edges, 408673 markings/sec, 215 secs
lola: sara is running 220 secs || 95335004 markings, 304914142 edges, 387054 markings/sec, 220 secs
lola: sara is running 225 secs || 97350439 markings, 311440016 edges, 403087 markings/sec, 225 secs
lola: sara is running 230 secs || 99393675 markings, 317565160 edges, 408647 markings/sec, 230 secs
lola: sara is running 235 secs || 101454321 markings, 324286502 edges, 412129 markings/sec, 235 secs
lola: sara is running 240 secs || 103488589 markings, 330327844 edges, 406854 markings/sec, 240 secs
lola: sara is running 245 secs || 105441878 markings, 336839525 edges, 390658 markings/sec, 245 secs
lola: sara is running 250 secs || 107494441 markings, 342817633 edges, 410513 markings/sec, 250 secs
lola: sara is running 255 secs || 109413960 markings, 349105260 edges, 383904 markings/sec, 255 secs
lola: sara is running 260 secs || 111515920 markings, 355343956 edges, 420392 markings/sec, 260 secs
lola: sara is running 265 secs || 113426379 markings, 361237673 edges, 382092 markings/sec, 265 secs
lola: sara is running 270 secs || 115447845 markings, 367630450 edges, 404293 markings/sec, 270 secs
lola: sara is running 275 secs || 117371223 markings, 373473056 edges, 384676 markings/sec, 275 secs
lola: sara is running 280 secs || 119312541 markings, 379936711 edges, 388264 markings/sec, 280 secs
lola: sara is running 285 secs || 121285669 markings, 385611376 edges, 394626 markings/sec, 285 secs
lola: sara is running 290 secs || 123146664 markings, 391475579 edges, 372199 markings/sec, 290 secs
lola: sara is running 295 secs || 125078741 markings, 397505742 edges, 386415 markings/sec, 295 secs
lola: sara is running 300 secs || 126897942 markings, 403020743 edges, 363840 markings/sec, 300 secs
lola: sara is running 305 secs || 128723856 markings, 409141511 edges, 365183 markings/sec, 305 secs
lola: sara is running 310 secs || 130728798 markings, 414917350 edges, 400988 markings/sec, 310 secs
lola: sara is running 315 secs || 132565791 markings, 420556728 edges, 367399 markings/sec, 315 secs
lola: sara is running 320 secs || 134535912 markings, 427024882 edges, 394024 markings/sec, 320 secs
lola: sara is running 325 secs || 136579677 markings, 432998497 edges, 408753 markings/sec, 325 secs
lola: sara is running 330 secs || 138580990 markings, 439359266 edges, 400263 markings/sec, 330 secs
lola: sara is running 335 secs || 140866713 markings, 446254112 edges, 457145 markings/sec, 335 secs
lola: sara is running 340 secs || 142887893 markings, 452473652 edges, 404236 markings/sec, 340 secs
lola: sara is running 345 secs || 144967586 markings, 459344674 edges, 415939 markings/sec, 345 secs
lola: sara is running 350 secs || 147095227 markings, 465458780 edges, 425528 markings/sec, 350 secs
lola: sara is running 355 secs || 149069936 markings, 471614286 edges, 394942 markings/sec, 355 secs
lola: sara is running 360 secs || 151167390 markings, 478256154 edges, 419491 markings/sec, 360 secs
lola: sara is running 365 secs || 153153312 markings, 484172113 edges, 397184 markings/sec, 365 secs
lola: sara is running 370 secs || 154997258 markings, 490059208 edges, 368789 markings/sec, 370 secs
lola: sara is running 375 secs || 156983114 markings, 496142083 edges, 397171 markings/sec, 375 secs
lola: sara is running 380 secs || 158949681 markings, 502020850 edges, 393313 markings/sec, 380 secs
lola: sara is running 385 secs || 160811740 markings, 508016630 edges, 372412 markings/sec, 385 secs
lola: sara is running 390 secs || 162962658 markings, 514510117 edges, 430184 markings/sec, 390 secs
lola: sara is running 395 secs || 164886727 markings, 520297986 edges, 384814 markings/sec, 395 secs
lola: sara is running 400 secs || 166730332 markings, 526280242 edges, 368721 markings/sec, 400 secs
lola: sara is running 405 secs || 168705046 markings, 532256895 edges, 394943 markings/sec, 405 secs
lola: sara is running 410 secs || 170501739 markings, 537661156 edges, 359339 markings/sec, 410 secs
lola: sara is running 415 secs || 172342824 markings, 543327721 edges, 368217 markings/sec, 415 secs
lola: sara is running 420 secs || 174262950 markings, 549526405 edges, 384025 markings/sec, 420 secs
lola: sara is running 425 secs || 176169279 markings, 555028206 edges, 381266 markings/sec, 425 secs
lola: sara is running 430 secs || 177980527 markings, 560592173 edges, 362250 markings/sec, 430 secs
lola: sara is running 435 secs || 179853163 markings, 566914068 edges, 374527 markings/sec, 435 secs
lola: sara is running 440 secs || 181922252 markings, 572765808 edges, 413818 markings/sec, 440 secs
lola: sara is running 445 secs || 183889594 markings, 578736634 edges, 393468 markings/sec, 445 secs
lola: sara is running 450 secs || 185734570 markings, 585001475 edges, 368995 markings/sec, 450 secs
lola: sara is running 455 secs || 187959600 markings, 591281240 edges, 445006 markings/sec, 455 secs
lola: sara is running 460 secs || 189845047 markings, 597053687 edges, 377089 markings/sec, 460 secs
lola: sara is running 465 secs || 191722965 markings, 603139521 edges, 375584 markings/sec, 465 secs
lola: sara is running 470 secs || 193778502 markings, 609340793 edges, 411107 markings/sec, 470 secs
lola: sara is running 475 secs || 193835889 markings, 609497940 edges, 11477 markings/sec, 475 secs
lola: sara is running 480 secs || 193839664 markings, 609508221 edges, 755 markings/sec, 480 secs
lola: sara is running 485 secs || 193839747 markings, 609508467 edges, 17 markings/sec, 485 secs
lola: sara is running 490 secs || 193839832 markings, 609508722 edges, 17 markings/sec, 490 secs
lola: sara is running 495 secs || 193861281 markings, 609567831 edges, 4290 markings/sec, 495 secs
lola: sara is running 500 secs || 193865722 markings, 609580047 edges, 888 markings/sec, 500 secs
lola: sara is running 505 secs || 193874522 markings, 609604480 edges, 1760 markings/sec, 505 secs
lola: sara is running 510 secs || 193886722 markings, 609637408 edges, 2440 markings/sec, 510 secs
lola: sara is running 515 secs || 193894276 markings, 609658497 edges, 1511 markings/sec, 515 secs
lola: sara is running 520 secs || 193894358 markings, 609658743 edges, 16 markings/sec, 520 secs
lola: sara is running 525 secs || 193894439 markings, 609658985 edges, 16 markings/sec, 525 secs
lola: sara is running 530 secs || 193900200 markings, 609675324 edges, 1152 markings/sec, 530 secs
lola: sara is running 535 secs || 193900291 markings, 609675525 edges, 18 markings/sec, 535 secs
lola: sara is running 540 secs || 193900441 markings, 609675829 edges, 30 markings/sec, 540 secs
lola: sara is running 545 secs || 193926557 markings, 609747673 edges, 5223 markings/sec, 545 secs
lola: sara is running 550 secs || 193926623 markings, 609747871 edges, 13 markings/sec, 550 secs
lola: sara is running 555 secs || 193926695 markings, 609748089 edges, 14 markings/sec, 555 secs
lola: sara is running 560 secs || 193939026 markings, 609781778 edges, 2466 markings/sec, 560 secs
lola: sara is running 565 secs || 193939112 markings, 609782034 edges, 17 markings/sec, 565 secs
lola: sara is running 570 secs || 193945239 markings, 609798619 edges, 1225 markings/sec, 570 secs
lola: sara is running 575 secs || 193947377 markings, 609804987 edges, 428 markings/sec, 575 secs
lola: sara is running 580 secs || 193950456 markings, 609813498 edges, 616 markings/sec, 580 secs
lola: sara is running 585 secs || 193961505 markings, 609843472 edges, 2210 markings/sec, 585 secs
lola: sara is running 590 secs || 193985841 markings, 609909961 edges, 4867 markings/sec, 590 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((GSSG + 1 <= 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: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-14.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 15 will run for 2440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Pyr + 1 <= Pi) OR (c1 <= 0) OR (_1_3_BPG <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: yes no unknown no yes yes yes yes yes no no yes no unknown no yes
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496398827462
--------------------
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-C0100N0000100000"
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-C0100N0000100000.tgz
mv S_GPPP-PT-C0100N0000100000 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-C0100N0000100000, 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-149441612600565"
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 ;