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)
.................
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C1000N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400343
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526751623826

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ GPPP-PT-C1000N0000000010 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_dehydrogenase)))) : E (F ((FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase)))))) : E (F (FIREABLE(remove))) : A (G ((FIREABLE(remove) OR FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Transketolase2)))) : E (F (((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR FIREABLE(Enolase))))) : A (G (NOT FIREABLE(Pyruvate_kinase))) : E (F ((NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_dehydrogenase)))) : E (F ((FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase)))) : A (G ((FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(TIM_forward) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphofructokinase)))) : E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase))))) : E (F (FIREABLE(remove))) : A (G ((FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(generate) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(Pyruvate_kinase)))) : A (G (((FIREABLE(TIM_backward)) OR NOT FIREABLE(remove)))) : E (F (((FIREABLE(remove) AND FIREABLE(Glutathione_oxidation)) OR FIREABLE(Enolase)))) : E (F (FIREABLE(Enolase))) : E (F (((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND FIREABLE(Pyruvate_kinase))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(remove)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(remove)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(remove)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-0.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: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(Pyruvate_kinase)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(Pyruvate_kinase)))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(Pyruvate_kinase)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-0.sara
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(remove)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(remove)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(remove)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-2-0.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: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(Enolase)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(Enolase)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-3-0.sara
lola: 17 markings, 16 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(TIM_backward)) OR NOT FIREABLE(remove))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((FIREABLE(TIM_backward)) OR NOT FIREABLE(remove))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NOT FIREABLE(TIM_backward)) AND FIREABLE(remove))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-4-0.sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-3-0.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-4-0.sara.

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4892722 markings, 8629375 edges, 978544 markings/sec, 0 secs
lola: sara is running 5 secs || 9500286 markings, 16774544 edges, 921513 markings/sec, 5 secs
lola: sara is running 10 secs || 14122469 markings, 24664646 edges, 924437 markings/sec, 10 secs
lola: sara is running 15 secs || 18615975 markings, 32471091 edges, 898701 markings/sec, 15 secs
lola: sara is running 20 secs || 22960226 markings, 40019631 edges, 868850 markings/sec, 20 secs
lola: sara is running 25 secs || 26689357 markings, 47389725 edges, 745826 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 27785396 markings, 49622705 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(remove) AND FIREABLE(Glutathione_oxidation)) OR FIREABLE(Enolase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(remove) AND FIREABLE(Glutathione_oxidation)) OR FIREABLE(Enolase))))
lola: processed formula length: 86
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(remove) OR FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Transketolase2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(remove) OR FIREABLE(Glutathione_reductose) OR NOT FIREABLE(Transketolase2))))
lola: processed formula length: 95
lola: 2 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(remove) AND NOT FIREABLE(Glutathione_reductose) AND FIREABLE(Transketolase2))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-6-0.sara
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(generate) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(Pyruvate_kinase))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(Phosphoglycerate_mutase) OR NOT FIREABLE(generate) OR NOT FIREABLE(Enolase) OR NOT FIREABLE(Pyruvate_kinase))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(Phosphoglycerate_mutase) AND FIREABLE(generate) AND FIREABLE(Enolase) AND FIREABLE(Pyruvate_kinase))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4750387 markings, 8129212 edges, 950077 markings/sec, 0 secs
lola: sara is running 5 secs || 9050715 markings, 16214652 edges, 860066 markings/sec, 5 secs
lola: sara is running 10 secs || 13515619 markings, 24014958 edges, 892981 markings/sec, 10 secs
lola: sara is running 15 secs || 17907461 markings, 31664959 edges, 878368 markings/sec, 15 secs
lola: sara is running 20 secs || 22264712 markings, 39176643 edges, 871450 markings/sec, 20 secs
lola: sara is running 25 secs || 26115714 markings, 46377462 edges, 770200 markings/sec, 25 secs
lola: sara is running 30 secs || 30654716 markings, 53830183 edges, 907800 markings/sec, 30 secs
lola: sara is running 35 secs || 34962410 markings, 61064317 edges, 861539 markings/sec, 35 secs
lola: sara is running 40 secs || 38673481 markings, 68185103 edges, 742214 markings/sec, 40 secs
lola: sara is running 45 secs || 42102830 markings, 75508622 edges, 685870 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 44399935 markings, 80442883 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_dehydrogenase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_dehydrogenase))))
lola: processed formula length: 242
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Lactate_dehydrogenase)) AND FIREABLE(Pyruvate_kinase) AND (FIREABLE(G6P_dehydrogenase) OR FIREABLE(Transaldolase) OR NOT FIREABLE(Pyruvate_kinase)) AND FIREABLE(Lactate_dehydrogenase))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-8-0.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: 52892 markings, 111276 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_dehydrogenase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_dehydrogenase))))
lola: processed formula length: 190
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(Pyruvate_kinase) AND NOT FIREABLE(Glutathione_oxidation) AND (NOT FIREABLE(Ru5P_epimerase) OR NOT FIREABLE(Glutathione_reductose)) AND FIREABLE(Lactate_dehydrogenase))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-9-0.sara
lola: lola: SUBRESULT
state equation: calling and running saralola: result: yes
lola:
produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(TIM_forward) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphofructokinase))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(Phosphoglycerate_mutase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(TIM_forward) OR NOT FIREABLE(Lactate_dehydrogenase) OR FIREABLE(Phosphofructokinase))))
lola: processed formula length: 176
lola: 2 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(Phosphoglycerate_mutase) AND NOT FIREABLE(Ru5P_isomerase) AND FIREABLE(TIM_forward) AND FIREABLE(Lactate_dehydrogenase) AND NOT FIREABLE(Phosphofructokinase))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 255 markings, 254 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR FIREABLE(Enolase)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR FIREABLE(Enolase)))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(GAP_dehydrogenase) OR (NOT FIREABLE(generate) AND NOT FIREABLE(Glutathione_oxidation))) AND (FIREABLE(remove) OR FIREABLE(Enolase)))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-11-0.sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-9-0.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND FIREABLE(Pyruvate_kinase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND FIREABLE(Pyruvate_kinase))))
lola: processed formula length: 196
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(GAP_dehydrogenase) OR NOT FIREABLE(Ru5P_epimerase)) AND (FIREABLE(GAP_dehydrogenase) OR FIREABLE(Ru5P_isomerase) OR NOT FIREABLE(Aldolase)) AND FIREABLE(Pyruvate_kinase))
lola: state equation: Generated DNF with 63 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-12-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1161 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase))))
lola: processed formula length: 217
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(remove) AND FIREABLE(TIM_forward) AND (FIREABLE(Hexokinase) OR NOT FIREABLE(Ru5P_epimerase)) AND (NOT FIREABLE(Phosphoglycerate_kinase) OR NOT FIREABLE(G6P_dehydrogenase)) AND FIREABLE(Hexokinase))
lola: state equation: Generated DNF with 110 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4275706 markings, 8807507 edges, 855141 markings/sec, 0 secs
lola: sara is running 5 secs || 7629685 markings, 17380698 edges, 670796 markings/sec, 5 secs
lola: sara is running 10 secs || 11536898 markings, 25636996 edges, 781443 markings/sec, 10 secs
lola: sara is running 15 secs || 14698794 markings, 33662151 edges, 632379 markings/sec, 15 secs
lola: sara is running 20 secs || 18579309 markings, 41638194 edges, 776103 markings/sec, 20 secs
lola: sara is running 25 secs || 22060397 markings, 49618735 edges, 696218 markings/sec, 25 secs
lola: sara is running 30 secs || 25254717 markings, 57513053 edges, 638864 markings/sec, 30 secs
lola: sara is running 35 secs || 28655355 markings, 65274323 edges, 680128 markings/sec, 35 secs
lola: sara is running 40 secs || 31914889 markings, 72994993 edges, 651907 markings/sec, 40 secs
lola: sara is running 45 secs || 35187475 markings, 79585806 edges, 654517 markings/sec, 45 secs
lola: sara is running 50 secs || 38187770 markings, 86854948 edges, 600059 markings/sec, 50 secs
lola: sara is running 55 secs || 41382964 markings, 94610593 edges, 639039 markings/sec, 55 secs
lola: sara is running 60 secs || 44702446 markings, 102114282 edges, 663896 markings/sec, 60 secs
lola: sara is running 65 secs || 47971344 markings, 109222810 edges, 653780 markings/sec, 65 secs
lola: sara is running 70 secs || 51220748 markings, 117024910 edges, 649881 markings/sec, 70 secs
lola: sara is running 75 secs || 53871043 markings, 124355126 edges, 530059 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 56304744 markings, 131050265 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase))))))
lola: processed formula length: 220
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(Enolase) AND (FIREABLE(Transketolase1) OR FIREABLE(Aldolase) OR (FIREABLE(remove) AND FIREABLE(Phosphoclucose_isomerase)) OR FIREABLE(Aldolase) OR (FIREABLE(TIM_backward) AND FIREABLE(Hexokinase))))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(Pyruvate_kinase) AND FIREABLE(Transketolase1) AND (FIREABLE(Aldolase) OR FIREABLE(Transketolase2)) AND (NOT FIREABLE(Aldolase)) AND (NOT FIREABLE(remove) OR NOT FIREABLE(TIM_forward) OR FIREABLE(Phosphoclucose_isomerase)))
lola: state equation: Generated DNF with 33 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000000010-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000000010-ReachabilityFireability-15-0.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: ========================================

FORMULA GPPP-PT-C1000N0000000010-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes no no no no yes yes yes yes yes
lola:
preliminary result: yes yes no no yes no yes no no no no yes yes yes yes yes
lola: memory consumption: 14580 KB
lola: time consumption: 172 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="GPPP-PT-C1000N0000000010"
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/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is GPPP-PT-C1000N0000000010, 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 r088-blw7-152649998400343"
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 ;