About the Execution of LoLA for GPPP-PT-C1000N0000001000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
191.140 | 309429.00 | 314826.00 | 40.00 | FT?FFFFTFFFFFFFF | 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)
...............
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-C1000N0000001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400355
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000001000-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526762487873
info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C1000N0000001000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C1000N0000001000 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ GPPP-PT-C1000N0000001000 @ 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-C1000N0000001000-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (S7P <= ADP)
lola: LP says that atomic proposition is always false: (NADplus <= GSSG)
lola: LP says that atomic proposition is always false: (3 <= R5P)
lola: LP says that atomic proposition is always true: (start <= NADPplus)
lola: LP says that atomic proposition is always false: (3 <= R5P)
lola: LP says that atomic proposition is always false: (2 <= E4P)
lola: LP says that atomic proposition is always true: (3 <= NADplus)
lola: LP says that atomic proposition is always false: (3 <= R5P)
lola: LP says that atomic proposition is always true: (_1_3_BPG <= NADplus)
lola: LP says that atomic proposition is always false: (2 <= start)
lola: LP says that atomic proposition is always false: (2 <= start)
lola: A (G ((S7P <= GSSG))) : E (F (((NADPplus <= _3PG)))) : E (F (((F6P <= 0) AND (Pyr + 1 <= Lac)))) : A (G (((2 <= ATP)))) : E (F (())) : E (F (FALSE)) : A (G ((FBP <= NADPplus))) : E (F (((1 <= FBP) AND (2 <= _1_3_BPG)))) : A (G (((FBP <= 2) OR (c2 + 1 <= GSH) OR (b1 <= 1) OR (a2 + 1 <= Xu5P)))) : A (G (((_2PG <= S7P) OR (1 <= R5P) OR ((Lac <= b2) AND (2 <= Pyr))))) : A (G ((2 <= NADPplus))) : A (G (((GAP <= R5P) OR (_2PG <= Lac) OR (Gluc <= 1) OR ((GAP <= 0))))) : A (G ((((_2PG <= 1) OR (GAP + 1 <= NADH))))) : A (G (((PEP <= 2) OR (a1 + 1 <= GSSG) OR ((ADP + 1 <= start) AND (PEP + 1 <= F6P))))) : E (F (((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1)))) : A (G (((2 <= a1) OR (2 <= NADPH) OR ((1 <= DHAP) AND (3 <= c2)) OR (_1_3_BPG + 1 <= _2PG) OR (Pyr <= 1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
spx_run: Lost feasibility 10 times - iter 2070 and 1053 nodes.
spx_run: Lost feasibility 10 times - iter 2107 and 1077 nodes.
spx_run: Lost feasibility 10 times - iter 2210 and 1138 nodes.
spx_run: Lost feasibility 10 times - iter 399 and 226 nodes.
spx_run: Lost feasibility 10 times - iter 868 and 514 nodes.
spx_run: Lost feasibility 10 times - iter 3355 and 1592 nodes.
spx_run: Lost feasibility 10 times - iter 3794 and 1832 nodes.
spx_run: Lost feasibility 10 times - iter 3947 and 1937 nodes.
spx_run: Lost feasibility 10 times - iter 3951 and 1939 nodes.
spx_run: Lost feasibility 10 times - iter 3999 and 1973 nodes.
spx_run: Lost feasibility 10 times - iter 5918 and 2353 nodes.
spx_run: Lost feasibility 10 times - iter 5922 and 2355 nodes.
spx_run: Lost feasibility 10 times - iter 8181 and 3339 nodes.
spx_run: Lost feasibility 10 times - iter 8185 and 3341 nodes.
spx_run: Lost feasibility 10 times - iter 51909 and 21968 nodes.
spx_run: Lost feasibility 10 times - iter 53546 and 22852 nodes.
spx_run: Lost feasibility 10 times - iter 254352 and 128790 nodes.
spx_run: Lost feasibility 10 times - iter 257032 and 130336 nodes.
spx_run: Lost feasibility 10 times - iter 309433 and 160859 nodes.
spx_run: Lost feasibility 10 times - iter 312117 and 162405 nodes.
spx_run: Lost feasibility 10 times - iter 168 and 114 nodes.
check_solution: Variable C49 = -1 is below its lower bound 0
check_solution: Constraint R3 = 4.64427112514e-310 is above its equality of -1000
check_solution: Constraint R6 = 0 is above its equality of -4000
check_solution: Constraint R9 = 0 is above its equality of -2000
check_solution: Constraint R11 = 0 is above its equality of -3000
check_solution: Constraint R12 = 0 is above its equality of -2000
check_solution: Constraint R13 = 0 is above its equality of -7000
check_solution: Constraint R23 = 0 is above its equality of -1
check_solution: Constraint R25 = 0 is above its equality of -2000
Seriously low accuracy found ||*|| = 7000 (rel. error 1)
spx_run: Lost feasibility 10 times - iter 49351 and 24004 nodes.
spx_run: Lost feasibility 10 times - iter 50728 and 24858 nodes.
spx_run: Lost feasibility 10 times - iter 29633 and 18128 nodes.
spx_run: Lost feasibility 10 times - iter 43787 and 27034 nodes.
spx_run: Lost feasibility 10 times - iter 7971 and 3107 nodes.
spx_run: Lost feasibility 10 times - iter 7975 and 3109 nodes.
spx_run: Lost feasibility 10 times - iter 11107 and 4485 nodes.
spx_run: Lost feasibility 10 times - iter 11111 and 4487 nodes.
spx_run: Lost feasibility 10 times - iter 45094 and 17921 nodes.
spx_run: Lost feasibility 10 times - iter 45098 and 17923 nodes.
spx_run: Lost feasibility 10 times - iter 46688 and 18511 nodes.
spx_run: Lost feasibility 10 times - iter 46692 and 18513 nodes.
spx_run: Lost feasibility 10 times - iter 68720 and 28540 nodes.
spx_run: Lost feasibility 10 times - iter 70357 and 29424 nodes.
spx_run: Lost feasibility 10 times - iter 270987 and 135378 nodes.
spx_run: Lost feasibility 10 times - iter 273667 and 136924 nodes.
spx_run: Lost feasibility 10 times - iter 326074 and 167445 nodes.
spx_run: Lost feasibility 10 times - iter 328758 and 168991 nodes.
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= ATP))))
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 (((2 <= ATP))))
lola: processed formula length: 20
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((ATP <= 1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4001 markings, 4000 edges
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= NADPplus)))
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 ((2 <= NADPplus)))
lola: processed formula length: 23
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: (NADPplus <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2004 markings, 2003 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((S7P <= GSSG)))
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 ((S7P <= GSSG)))
lola: processed formula length: 21
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: (GSSG + 1 <= S7P)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-4-0.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: 17007 markings, 17006 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FBP <= NADPplus)))
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 ((FBP <= NADPplus)))
lola: processed formula length: 25
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: (NADPplus + 1 <= FBP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-5-0.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: 2005 markings, 2004 edges
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= FBP) AND (2 <= _1_3_BPG))))
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 (((1 <= FBP) AND (2 <= _1_3_BPG))))
lola: processed formula length: 40
lola: 7 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((1 <= FBP) AND (2 <= _1_3_BPG))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2015 markings, 2014 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NADPplus <= _3PG))))
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 (((NADPplus <= _3PG))))
lola: processed formula length: 28
lola: 7 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: 2004 markings, 2003 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((F6P <= 0) AND (Pyr + 1 <= Lac))))
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 (((F6P <= 0) AND (Pyr + 1 <= Lac))))
lola: processed formula length: 41
lola: 7 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((F6P <= 0) AND (Pyr + 1 <= Lac))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((_2PG <= 1) OR (GAP + 1 <= NADH)))))
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 ((((_2PG <= 1) OR (GAP + 1 <= NADH)))))
lola: processed formula length: 45
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: (((2 <= _2PG) AND (NADH <= GAP)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1))))
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 (((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1))))
lola: processed formula length: 58
lola: 7 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((FBP <= 2) AND (ADP + 1 <= NADH) AND (Ru5P <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-10-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-C1000N0000001000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((GAP <= R5P) OR (_2PG <= Lac) OR (Gluc <= 1) OR ((GAP <= 0)))))
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 (((GAP <= R5P) OR (_2PG <= Lac) OR (Gluc <= 1) OR ((GAP <= 0)))))
lola: processed formula length: 73
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((R5P + 1 <= GAP) AND (Lac + 1 <= _2PG) AND (2 <= Gluc) AND ((1 <= GAP)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FBP <= 2) OR (c2 + 1 <= GSH) OR (b1 <= 1) OR (a2 + 1 <= Xu5P))))
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 (((FBP <= 2) OR (c2 + 1 <= GSH) OR (b1 <= 1) OR (a2 + 1 <= Xu5P))))
lola: processed formula length: 75
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((3 <= FBP) AND (GSH <= c2) AND (2 <= b1) AND (Xu5P <= a2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((PEP <= 2) OR (a1 + 1 <= GSSG) OR ((ADP + 1 <= start) AND (PEP + 1 <= F6P)))))
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 (((PEP <= 2) OR (a1 + 1 <= GSSG) OR ((ADP + 1 <= start) AND (PEP + 1 <= F6P)))))
lola: processed formula length: 87
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((3 <= PEP) AND (GSSG <= a1) AND ((start <= ADP) OR (F6P <= PEP)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1691 markings, 1690 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((_2PG <= S7P) OR (1 <= R5P) OR ((Lac <= b2) AND (2 <= Pyr)))))
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 (((_2PG <= S7P) OR (1 <= R5P) OR ((Lac <= b2) AND (2 <= Pyr)))))
lola: processed formula length: 71
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((S7P + 1 <= _2PG) AND (R5P <= 0) AND ((b2 + 1 <= Lac) OR (Pyr <= 1)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to GPPP-PT-C1000N0000001000-ReachabilityCardinality-14-0.sara
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= a1) OR (2 <= NADPH) OR ((1 <= DHAP) AND (3 <= c2)) OR (_1_3_BPG + 1 <= _2PG) OR (Pyr <= 1))))
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 (((2 <= a1) OR (2 <= NADPH) OR ((1 <= DHAP) AND (3 <= c2)) OR (_1_3_BPG + 1 <= _2PG) OR (Pyr <= 1))))
lola: processed formula length: 110
lola: 8 rewrites
lola: closed formula file GPPP-PT-C1000N0000001000-ReachabilityCardinality.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: ((a1 <= 1) AND (NADPH <= 1) AND ((DHAP <= 0) OR (c2 <= 2)) AND (_2PG <= _1_3_BPG) AND (2 <= Pyr))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
FORMULA GPPP-PT-C1000N0000001000-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes no no no no no no no no
lola:
preliminary result: no yes yes no no no no yes no no no no no no no no
lola: memory consumption: 25188 KB
lola: time consumption: 307 seconds
sara: try reading problem file GPPP-PT-C1000N0000001000-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
BK_STOP 1526762797302
--------------------
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-C1000N0000001000"
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/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 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-C1000N0000001000, 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 r088-blw7-152649998400355"
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 ;