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

About the Execution of LoLA for S_GPPP-PT-C1000N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.520 507841.00 1191643.00 6995.10 FTF?FFTT?FTTTFFT 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-C1000N0000001000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600594
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496401077370


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000001000: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_GPPP-PT-C1000N0000001000 @ 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-C1000N0000001000-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(Transketolase2) OR (NOT FIREABLE(Glutathione_reductose) AND NOT FIREABLE(Transketolase2)) OR FIREABLE(TIM_backward)))) : E (F (FIREABLE(Enolase))) : A (G ((NOT FIREABLE(Phosphofructokinase) OR NOT FIREABLE(Transaldolase) OR (NOT FIREABLE(remove) AND NOT FIREABLE(Transaldolase)) OR NOT FIREABLE(Phosphoglycerate_mutase)))) : E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(Transketolase1) AND FIREABLE(Ru5P_isomerase) AND (FIREABLE(remove) OR FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(Transketolase1) AND NOT FIREABLE(Phosphoclucose_isomerase)))))) : A (G (())) : E (F ((NOT FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase) AND FIREABLE(Enolase) AND (FIREABLE(generate) OR FIREABLE(Glutathione_reductose))))) : E (F (((((FIREABLE(Transaldolase) OR FIREABLE(Ru5P_epimerase)) AND FIREABLE(Glutathione_reductose)) OR (FIREABLE(remove) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(TIM_forward)))) AND FIREABLE(Pyruvate_kinase)))) : A (G ((NOT FIREABLE(Enolase) OR (NOT FIREABLE(remove) AND NOT FIREABLE(Phosphoglycerate_mutase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Pyruvate_kinase)))))) : A (G (((NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Phosphoclucose_isomerase)) OR NOT FIREABLE(GAP_dehydrogenase) OR FIREABLE(Hexokinase)))) : E (F (FIREABLE(Phosphoglycerate_mutase))) : A (G ((((FIREABLE(Hexokinase) OR FIREABLE(Phosphoglycerate_kinase) OR FIREABLE(Phosphoglycerate_mutase))) OR NOT FIREABLE(G6P_dehydrogenase)))) : E (F ((FIREABLE(Phosphoglycerate_mutase) AND FIREABLE(Phosphofructokinase) AND ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Aldolase) AND FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(Transaldolase)) OR FIREABLE(remove))))) : A (G (((NOT FIREABLE(Aldolase) OR NOT FIREABLE(Ru5P_isomerase) OR (FIREABLE(Aldolase) AND NOT FIREABLE(TIM_backward))) AND (NOT FIREABLE(Transketolase2) OR FIREABLE(Transketolase1) OR FIREABLE(Phosphoglycerate_kinase))))) : A (G (((FIREABLE(Glutathione_oxidation) AND FIREABLE(Enolase)) OR NOT FIREABLE(Transketolase2) OR (NOT FIREABLE(Lactate_dehydrogenase) AND NOT FIREABLE(G6P_dehydrogenase)) OR FIREABLE(TIM_forward) OR FIREABLE(GAP_dehydrogenase) OR FIREABLE(TIM_backward)))) : A (G (())) : E (F ((((FIREABLE(Glutathione_oxidation) AND FIREABLE(generate)) OR FIREABLE(Phosphoglycerate_mutase) OR (FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Phosphoclucose_isomerase))) AND NOT FIREABLE(Transaldolase))))
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 ((NOT FIREABLE(Transketolase2) OR (NOT FIREABLE(Glutathione_reductose) AND NOT FIREABLE(Transketolase2)) OR FIREABLE(TIM_backward))))
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: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Enolase)))
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-C1000N0000001000-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Phosphofructokinase) OR NOT FIREABLE(Transaldolase) OR (NOT FIREABLE(remove) AND NOT FIREABLE(Transaldolase)) OR NOT FIREABLE(Phosphoglycerate_mutase))))
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 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability.sara.
sara: 1: error near '': syntax error, unexpected $end, expecting PROBLEM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2979787 markings, 8761553 edges, 595957 markings/sec, 0 secs
lola: sara is running 5 secs || 5850876 markings, 17295560 edges, 574218 markings/sec, 5 secs
lola: sara is running 10 secs || 8686639 markings, 25719151 edges, 567153 markings/sec, 10 secs
lola: sara is running 15 secs || 11417477 markings, 33849771 edges, 546168 markings/sec, 15 secs
lola: sara is running 20 secs || 14147618 markings, 41967294 edges, 546028 markings/sec, 20 secs
lola: sara is running 25 secs || 16888903 markings, 50127124 edges, 548257 markings/sec, 25 secs
lola: sara is running 30 secs || 19677654 markings, 58433759 edges, 557750 markings/sec, 30 secs
lola: sara is running 35 secs || 22448632 markings, 66688177 edges, 554196 markings/sec, 35 secs
lola: sara is running 40 secs || 25157769 markings, 74754010 edges, 541827 markings/sec, 40 secs
lola: sara is running 45 secs || 27804195 markings, 82628576 edges, 529285 markings/sec, 45 secs
lola: sara is running 50 secs || 30445480 markings, 90498831 edges, 528257 markings/sec, 50 secs
lola: sara is running 55 secs || 33072613 markings, 98332364 edges, 525427 markings/sec, 55 secs
lola: sara is running 60 secs || 35718768 markings, 106211979 edges, 529231 markings/sec, 60 secs
lola: sara is running 65 secs || 38334824 markings, 113996737 edges, 523211 markings/sec, 65 secs
lola: sara is running 70 secs || 40924811 markings, 121720608 edges, 517997 markings/sec, 70 secs
lola: sara is running 75 secs || 43572614 markings, 129601572 edges, 529561 markings/sec, 75 secs
lola: sara is running 80 secs || 46196188 markings, 137418802 edges, 524715 markings/sec, 80 secs
lola: sara is running 85 secs || 48821210 markings, 145245274 edges, 525004 markings/sec, 85 secs
lola: sara is running 90 secs || 51466372 markings, 153112378 edges, 529032 markings/sec, 90 secs
lola: sara is running 95 secs || 54023450 markings, 160731412 edges, 511416 markings/sec, 95 secs
lola: sara is running 100 secs || 56648858 markings, 168556979 edges, 525082 markings/sec, 100 secs
lola: sara is running 105 secs || 59061960 markings, 175770243 edges, 482620 markings/sec, 105 secs
lola: sara is running 110 secs || 61647750 markings, 183456654 edges, 517158 markings/sec, 110 secs
lola: sara is running 115 secs || 64281321 markings, 191295419 edges, 526714 markings/sec, 115 secs
lola: sara is running 120 secs || 66925385 markings, 199190679 edges, 528813 markings/sec, 120 secs
lola: sara is running 125 secs || 69611315 markings, 207183619 edges, 537186 markings/sec, 125 secs
lola: sara is running 130 secs || 72264405 markings, 215113978 edges, 530618 markings/sec, 130 secs
lola: sara is running 135 secs || 74942110 markings, 223061500 edges, 535541 markings/sec, 135 secs
lola: sara is running 140 secs || 77594420 markings, 230967161 edges, 530462 markings/sec, 140 secs
lola: sara is running 145 secs || 80250740 markings, 238886804 edges, 531264 markings/sec, 145 secs
lola: sara is running 150 secs || 82885783 markings, 246742575 edges, 527009 markings/sec, 150 secs
lola: sara is running 155 secs || 85489797 markings, 254506868 edges, 520803 markings/sec, 155 secs
lola: sara is running 160 secs || 88059776 markings, 262163354 edges, 513996 markings/sec, 160 secs
lola: sara is running 165 secs || 90634236 markings, 269828066 edges, 514892 markings/sec, 165 secs
lola: sara is running 170 secs || 93170562 markings, 277388780 edges, 507265 markings/sec, 170 secs
lola: sara is running 175 secs || 95698679 markings, 284945191 edges, 505623 markings/sec, 175 secs
lola: sara is running 180 secs || 98221255 markings, 292471376 edges, 504515 markings/sec, 180 secs
lola: sara is running 185 secs || 100708660 markings, 299879981 edges, 497481 markings/sec, 185 secs
lola: sara is running 190 secs || 103224211 markings, 307370143 edges, 503110 markings/sec, 190 secs
lola: sara is running 195 secs || 105776351 markings, 314969792 edges, 510428 markings/sec, 195 secs
lola: sara is running 200 secs || 108276933 markings, 322447718 edges, 500116 markings/sec, 200 secs
lola: sara is running 205 secs || 110815894 markings, 329995577 edges, 507792 markings/sec, 205 secs
lola: sara is running 210 secs || 113338672 markings, 337505303 edges, 504556 markings/sec, 210 secs
lola: sara is running 215 secs || 115866762 markings, 345037551 edges, 505618 markings/sec, 215 secs
lola: sara is running 220 secs || 118451525 markings, 352732470 edges, 516953 markings/sec, 220 secs
lola: sara is running 225 secs || 120935482 markings, 360158091 edges, 496791 markings/sec, 225 secs
lola: sara is running 230 secs || 123480309 markings, 367726328 edges, 508965 markings/sec, 230 secs
lola: sara is running 235 secs || 125934618 markings, 375081629 edges, 490862 markings/sec, 235 secs
lola: sara is running 240 secs || 128439441 markings, 382512597 edges, 500965 markings/sec, 240 secs
lola: sara is running 245 secs || 130946152 markings, 389997290 edges, 501342 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GAP_dehydrogenase) AND FIREABLE(Transketolase1) AND FIREABLE(Ru5P_isomerase) AND (FIREABLE(remove) OR FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(Transketolase1) AND NOT FIREABLE(Phosphoclucose_isomerase))))))
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 19 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-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: subprocess 4 will run for 273 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-C1000N0000001000-ReachabilityFireability.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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Glutathione_oxidation) AND NOT FIREABLE(Hexokinase) AND FIREABLE(Enolase) AND (FIREABLE(generate) OR FIREABLE(Glutathione_reductose)))))
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 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-5.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(Transaldolase) OR FIREABLE(Ru5P_epimerase)) AND FIREABLE(Glutathione_reductose)) OR (FIREABLE(remove) AND (FIREABLE(Ru5P_epimerase) OR FIREABLE(TIM_forward)))) AND FIREABLE(Pyruvate_kinase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-6.sara
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara========================================

lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Enolase) OR (NOT FIREABLE(remove) AND NOT FIREABLE(Phosphoglycerate_mutase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Pyruvate_kinase))))))
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 23 literals and 8 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-C1000N0000001000-ReachabilityFireability-7.sara
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Phosphoclucose_isomerase)) OR NOT FIREABLE(GAP_dehydrogenase) OR FIREABLE(Hexokinase))))
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: sara: using a prefix tree store (--store=prefix)
try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-6.sara.
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 26 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-8.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Phosphoglycerate_mutase)))
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: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-9.sara
lola: The predicate is reachable.
lola: lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(Hexokinase) OR FIREABLE(Phosphoglycerate_kinase) OR FIREABLE(Phosphoglycerate_mutase))) OR NOT FIREABLE(G6P_dehydrogenase))))
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 24 literals and 4 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-10.sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Phosphoglycerate_mutase) AND FIREABLE(Phosphofructokinase) AND ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Aldolase) AND FIREABLE(Phosphoclucose_isomerase) AND FIREABLE(Transaldolase)) OR FIREABLE(remove)))))
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 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3933018 markings, 8474216 edges, 786604 markings/sec, 0 secs
lola: sara is running 5 secs || 7770931 markings, 16799353 edges, 767583 markings/sec, 5 secs
lola: sara is running 10 secs || 11571228 markings, 25047768 edges, 760059 markings/sec, 10 secs
lola: sara is running 15 secs || 15367911 markings, 33290860 edges, 759337 markings/sec, 15 secs
lola: sara is running 20 secs || 19170679 markings, 41547938 edges, 760554 markings/sec, 20 secs
lola: sara is running 25 secs || 22963166 markings, 49785284 edges, 758497 markings/sec, 25 secs
lola: sara is running 30 secs || 26753207 markings, 58017281 edges, 758008 markings/sec, 30 secs
lola: sara is running 35 secs || 30522417 markings, 66204562 edges, 753842 markings/sec, 35 secs
lola: sara is running 40 secs || 34288065 markings, 74385716 edges, 753130 markings/sec, 40 secs
lola: sara is running 45 secs || 38036482 markings, 82528890 edges, 749683 markings/sec, 45 secs
lola: sara is running 50 secs || 41770997 markings, 90641715 edges, 746903 markings/sec, 50 secs
lola: sara is running 55 secs || 45504251 markings, 98755109 edges, 746651 markings/sec, 55 secs
lola: sara is running 60 secs || 49221627 markings, 106831700 edges, 743475 markings/sec, 60 secs
lola: sara is running 65 secs || 52942066 markings, 114916043 edges, 744088 markings/sec, 65 secs
lola: sara is running 70 secs || 56665825 markings, 123005795 edges, 744752 markings/sec, 70 secs
lola: sara is running 75 secs || 60374593 markings, 131067465 edges, 741754 markings/sec, 75 secs
lola: sara is running 80 secs || 64086928 markings, 139132088 edges, 742467 markings/sec, 80 secs
lola: sara is running 85 secs || 67795149 markings, 147192973 edges, 741644 markings/sec, 85 secs
lola: sara is running 90 secs || 71505635 markings, 155253945 edges, 742097 markings/sec, 90 secs
lola: sara is running 95 secs || 75204924 markings, 163292574 edges, 739858 markings/sec, 95 secs
lola: sara is running 100 secs || 78900230 markings, 171324864 edges, 739061 markings/sec, 100 secs
lola: sara is running 105 secs || 82592144 markings, 179348592 edges, 738383 markings/sec, 105 secs
lola: sara is running 110 secs || 86286758 markings, 187377062 edges, 738923 markings/sec, 110 secs
lola: sara is running 115 secs || 89970354 markings, 195384199 edges, 736719 markings/sec, 115 secs
lola: sara is running 120 secs || 93650142 markings, 203381995 edges, 735958 markings/sec, 120 secs
lola: sara is running 125 secs || 97328018 markings, 211374604 edges, 735575 markings/sec, 125 secs
lola: sara is running 130 secs || 101020919 markings, 219399091 edges, 738580 markings/sec, 130 secs
lola: sara is running 135 secs || 104727987 markings, 227457787 edges, 741414 markings/sec, 135 secs
lola: sara is running 140 secs || 108399340 markings, 235437454 edges, 734271 markings/sec, 140 secs
lola: sara is running 145 secs || 112078775 markings, 243433943 edges, 735887 markings/sec, 145 secs
lola: sara is running 150 secs || 115791244 markings, 251501862 edges, 742494 markings/sec, 150 secs
lola: sara is running 155 secs || 119511029 markings, 259589395 edges, 743957 markings/sec, 155 secs
lola: sara is running 160 secs || 123254347 markings, 267723164 edges, 748664 markings/sec, 160 secs
lola: sara is running 165 secs || 126991641 markings, 275847470 edges, 747459 markings/sec, 165 secs
lola: sara is running 170 secs || 130732661 markings, 283979206 edges, 748204 markings/sec, 170 secs
lola: sara is running 175 secs || 134402858 markings, 291955197 edges, 734039 markings/sec, 175 secs
lola: sara is running 180 secs || 138067070 markings, 299922141 edges, 732842 markings/sec, 180 secs
lola: sara is running 185 secs || 141723815 markings, 307867279 edges, 731349 markings/sec, 185 secs
lola: sara is running 190 secs || 145372039 markings, 315797929 edges, 729645 markings/sec, 190 secs
lola: sara is running 195 secs || 149038638 markings, 323768178 edges, 733320 markings/sec, 195 secs
lola: sara is running 200 secs || 152706112 markings, 331739715 edges, 733495 markings/sec, 200 secs
lola: sara is running 205 secs || 156397826 markings, 339763680 edges, 738343 markings/sec, 205 secs
lola: sara is running 210 secs || 160059608 markings, 347726644 edges, 732356 markings/sec, 210 secs
lola: sara is running 215 secs || 163710175 markings, 355659375 edges, 730113 markings/sec, 215 secs
lola: sara is running 220 secs || 166894958 markings, 362582566 edges, 636957 markings/sec, 220 secs
lola: sara is running 225 secs || 166903889 markings, 362602107 edges, 1786 markings/sec, 225 secs
lola: sara is running 230 secs || 166927035 markings, 362652762 edges, 4629 markings/sec, 230 secs
lola: sara is running 235 secs || 166985841 markings, 362781460 edges, 11761 markings/sec, 235 secs
lola: sara is running 240 secs || 166995905 markings, 362803485 edges, 2013 markings/sec, 240 secs
lola: sara is running 245 secs || 167089144 markings, 363002322 edges, 18648 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Aldolase) OR NOT FIREABLE(Ru5P_isomerase) OR (FIREABLE(Aldolase) AND NOT FIREABLE(TIM_backward))) AND (NOT FIREABLE(Transketolase2) OR FIREABLE(Transketolase1) OR FIREABLE(Phosphoglycerate_kinase)))))
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 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 13 will run for 1010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(Glutathione_oxidation) AND FIREABLE(Enolase)) OR NOT FIREABLE(Transketolase2) OR (NOT FIREABLE(Lactate_dehydrogenase) AND NOT FIREABLE(G6P_dehydrogenase)) OR FIREABLE(TIM_forward) OR FIREABLE(GAP_dehydrogenase) OR FIREABLE(TIM_backward))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: ========================================
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 136 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1516 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-C1000N0000001000-ReachabilityFireability.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 15 will run for 3032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(Glutathione_oxidation) AND FIREABLE(generate)) OR FIREABLE(Phosphoglycerate_mutase) OR (FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Phosphoclucose_isomerase))) AND NOT FIREABLE(Transaldolase))))
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 39 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no yes unknown no yes yes yes no no yes no unknown no no yes yes
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496401585211

--------------------
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-C1000N0000001000"
export BK_EXAMINATION="ReachabilityFireability"
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-C1000N0000001000.tgz
mv S_GPPP-PT-C1000N0000001000 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-C1000N0000001000, examination is ReachabilityFireability"
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-149441612600594"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;