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 440K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.8K 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 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 255K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D10N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900173
=====================================================================

--------------------
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 Diffusion2D-PT-D10N010-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D10N010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526654800920

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D10N010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D10N010 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D10N010 @ 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: 784/65536 symbol table entries, 37 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 100 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D10N010-ReachabilityCardinality.task
lola: A (G (((cAMP__2_7_ <= cAMP__9_10_) OR (cAMP__3_1_ <= cAMP__5_3_)))) : E (F (((3 <= cAMP__4_9_) OR ((3 <= cAMP__2_5_) AND (2 <= cAMP__3_1_) AND (cAMP__3_3_ + 1 <= cAMP__9_1_))))) : E (F (((cAMP__5_1_ <= cAMP__10_2_) AND (3 <= cAMP__1_6_)))) : E (F (((cAMP__1_5_ + 1 <= cAMP__9_7_) AND (cAMP__1_5_ + 1 <= cAMP__2_3_) AND ((cAMP__7_1_ + 1 <= cAMP__7_7_) OR (cAMP__10_7_ <= 2))))) : E (F (((2 <= cAMP__6_4_) AND (1 <= cAMP__2_5_) AND (cAMP__5_3_ <= cAMP__4_1_) AND (((cAMP__10_1_ <= cAMP__10_6_) AND (1 <= cAMP__1_8_)) OR (3 <= cAMP__3_2_))))) : E (F (((3 <= cAMP__6_4_) AND (3 <= cAMP__9_10_) AND ((2 <= cAMP__1_7_) OR (cAMP__3_5_ <= cAMP__4_5_)) AND (cAMP__9_5_ <= 1) AND (cAMP__9_4_ <= 0)))) : A (G ((((1 <= cAMP__7_10_) AND (2 <= cAMP__9_2_)) OR (cAMP__4_1_ <= cAMP__5_1_) OR (1 <= cAMP__9_2_)))) : E (F ((3 <= cAMP__9_4_))) : A (G ((((cAMP__10_2_ <= cAMP__7_9_) AND (1 <= cAMP__3_7_)) OR ((cAMP__6_1_ <= cAMP__9_8_) AND (cAMP__3_10_ <= cAMP__3_2_)) OR (3 <= cAMP__6_6_) OR (3 <= cAMP__4_3_) OR ((cAMP__9_3_ <= cAMP__3_3_) AND (cAMP__8_2_ <= cAMP__6_6_))))) : A (G (((1 <= cAMP__10_6_) OR (cAMP__4_1_ <= cAMP__8_2_)))) : A (G ((cAMP__5_1_ <= cAMP__8_10_))) : E (F (((2 <= cAMP__7_8_) AND (cAMP__5_6_ <= cAMP__8_1_) AND (cAMP__8_7_ + 1 <= cAMP__6_3_) AND ((1 <= cAMP__7_10_) OR (cAMP__6_8_ <= cAMP__4_10_))))) : E (F (((cAMP__9_8_ + 1 <= cAMP__9_7_) AND (cAMP__3_4_ <= cAMP__8_10_) AND (2 <= cAMP__5_3_)))) : E (F ((((cAMP__1_10_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_5_) AND (3 <= cAMP__1_10_) AND (2 <= cAMP__1_8_)) OR ((cAMP__6_3_ <= cAMP__5_10_) AND (2 <= cAMP__3_6_) AND (cAMP__7_7_ <= cAMP__6_1_) AND (cAMP__9_7_ <= cAMP__3_1_))))) : E (F ((((2 <= cAMP__6_2_) AND (cAMP__1_1_ + 1 <= cAMP__9_9_)) OR (((cAMP__4_2_ <= cAMP__3_6_) OR (2 <= cAMP__6_10_)) AND ((2 <= cAMP__1_9_) OR (3 <= cAMP__5_8_)))))) : A (G ((cAMP__8_3_ <= 1)))
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 ((3 <= cAMP__9_4_)))
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 ((3 <= cAMP__9_4_)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: (3 <= cAMP__9_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-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: 259 markings, 551 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-7 TRUE 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 ((cAMP__8_3_ <= 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 ((cAMP__8_3_ <= 1)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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 <= cAMP__8_3_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-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: 51 markings, 106 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-15 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: A (G ((cAMP__5_1_ <= cAMP__8_10_)))
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 ((cAMP__5_1_ <= cAMP__8_10_)))
lola: processed formula length: 35
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: (cAMP__8_10_ + 1 <= cAMP__5_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-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 (((cAMP__5_1_ <= cAMP__10_2_) AND (3 <= cAMP__1_6_))))
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 (((cAMP__5_1_ <= cAMP__10_2_) AND (3 <= cAMP__1_6_))))
lola: processed formula length: 59
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((cAMP__5_1_ <= cAMP__10_2_) AND (3 <= cAMP__1_6_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 917 markings, 2979 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-2 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 (((1 <= cAMP__10_6_) OR (cAMP__4_1_ <= cAMP__8_2_))))
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 (((1 <= cAMP__10_6_) OR (cAMP__4_1_ <= cAMP__8_2_))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((cAMP__10_6_ <= 0) AND (cAMP__8_2_ + 1 <= cAMP__4_1_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 11 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__2_7_ <= cAMP__9_10_) OR (cAMP__3_1_ <= cAMP__5_3_))))
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 (((cAMP__2_7_ <= cAMP__9_10_) OR (cAMP__3_1_ <= cAMP__5_3_))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((cAMP__9_10_ + 1 <= cAMP__2_7_) AND (cAMP__5_3_ + 1 <= cAMP__3_1_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola:
FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= cAMP__7_10_) AND (2 <= cAMP__9_2_)) OR (cAMP__4_1_ <= cAMP__5_1_) OR (1 <= cAMP__9_2_))))
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 ((((1 <= cAMP__7_10_) AND (2 <= cAMP__9_2_)) OR (cAMP__4_1_ <= cAMP__5_1_) OR (1 <= cAMP__9_2_))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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)
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-5-0.sara.
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: (((cAMP__7_10_ <= 0) OR (cAMP__9_2_ <= 1)) AND (cAMP__5_1_ + 1 <= cAMP__4_1_) AND (cAMP__9_2_ <= 0))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__9_8_ + 1 <= cAMP__9_7_) AND (cAMP__3_4_ <= cAMP__8_10_) AND (2 <= cAMP__5_3_))))
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 (((cAMP__9_8_ + 1 <= cAMP__9_7_) AND (cAMP__3_4_ <= cAMP__8_10_) AND (2 <= cAMP__5_3_))))
lola: processed formula length: 94
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((cAMP__9_8_ + 1 <= cAMP__9_7_) AND (cAMP__3_4_ <= cAMP__8_10_) AND (2 <= cAMP__5_3_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 136 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__4_9_) OR ((3 <= cAMP__2_5_) AND (2 <= cAMP__3_1_) AND (cAMP__3_3_ + 1 <= cAMP__9_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 (((3 <= cAMP__4_9_) OR ((3 <= cAMP__2_5_) AND (2 <= cAMP__3_1_) AND (cAMP__3_3_ + 1 <= cAMP__9_1_)))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((3 <= cAMP__4_9_) OR ((3 <= cAMP__2_5_) AND (2 <= cAMP__3_1_) AND (cAMP__3_3_ + 1 <= cAMP__9_1_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 986 markings, 2689 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__1_5_ + 1 <= cAMP__9_7_) AND (cAMP__1_5_ + 1 <= cAMP__2_3_) AND ((cAMP__7_1_ + 1 <= cAMP__7_7_) OR (cAMP__10_7_ <= 2)))))
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 (((cAMP__1_5_ + 1 <= cAMP__9_7_) AND (cAMP__1_5_ + 1 <= cAMP__2_3_) AND ((cAMP__7_1_ + 1 <= cAMP__7_7_) OR (cAMP__10_7_ <= 2)))))
lola: processed formula length: 135
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((cAMP__1_5_ + 1 <= cAMP__9_7_) AND (cAMP__1_5_ + 1 <= cAMP__2_3_) AND ((cAMP__7_1_ + 1 <= cAMP__7_7_) OR (cAMP__10_7_ <= 2)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-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: 8 markings, 7 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__6_4_) AND (3 <= cAMP__9_10_) AND ((2 <= cAMP__1_7_) OR (cAMP__3_5_ <= cAMP__4_5_)) AND (cAMP__9_5_ <= 1) AND (cAMP__9_4_ <= 0))))
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 (((3 <= cAMP__6_4_) AND (3 <= cAMP__9_10_) AND ((2 <= cAMP__1_7_) OR (cAMP__3_5_ <= cAMP__4_5_)) AND (cAMP__9_5_ <= 1) AND (cAMP__9_4_ <= 0))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((3 <= cAMP__6_4_) AND (3 <= cAMP__9_10_) AND ((2 <= cAMP__1_7_) OR (cAMP__3_5_ <= cAMP__4_5_)) AND (cAMP__9_5_ <= 1) AND (cAMP__9_4_ <= 0))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-10-0.sara

lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 204 markings, 551 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__6_4_) AND (1 <= cAMP__2_5_) AND (cAMP__5_3_ <= cAMP__4_1_) AND (((cAMP__10_1_ <= cAMP__10_6_) AND (1 <= cAMP__1_8_)) OR (3 <= cAMP__3_2_)))))
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 (((2 <= cAMP__6_4_) AND (1 <= cAMP__2_5_) AND (cAMP__5_3_ <= cAMP__4_1_) AND (((cAMP__10_1_ <= cAMP__10_6_) AND (1 <= cAMP__1_8_)) OR (3 <= cAMP__3_2_)))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((2 <= cAMP__6_4_) AND (1 <= cAMP__2_5_) AND (cAMP__5_3_ <= cAMP__4_1_) AND (((cAMP__10_1_ <= cAMP__10_6_) AND (1 <= cAMP__1_8_)) OR (3 <= cAMP__3_2_)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-11-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: 29 markings, 60 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= cAMP__6_2_) AND (cAMP__1_1_ + 1 <= cAMP__9_9_)) OR (((cAMP__4_2_ <= cAMP__3_6_) OR (2 <= cAMP__6_10_)) AND ((2 <= cAMP__1_9_) OR (3 <= cAMP__5_8_))))))
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 ((((2 <= cAMP__6_2_) AND (cAMP__1_1_ + 1 <= cAMP__9_9_)) OR (((cAMP__4_2_ <= cAMP__3_6_) OR (2 <= cAMP__6_10_)) AND ((2 <= cAMP__1_9_) OR (3 <= cAMP__5_8_))))))
lola: processed formula length: 168
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: (((2 <= cAMP__6_2_) AND (cAMP__1_1_ + 1 <= cAMP__9_9_)) OR (((cAMP__4_2_ <= cAMP__3_6_) OR (2 <= cAMP__6_10_)) AND ((2 <= cAMP__1_9_) OR (3 <= cAMP__5_8_))))
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 103 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__7_8_) AND (cAMP__5_6_ <= cAMP__8_1_) AND (cAMP__8_7_ + 1 <= cAMP__6_3_) AND ((1 <= cAMP__7_10_) OR (cAMP__6_8_ <= cAMP__4_10_)))))
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 (((2 <= cAMP__7_8_) AND (cAMP__5_6_ <= cAMP__8_1_) AND (cAMP__8_7_ + 1 <= cAMP__6_3_) AND ((1 <= cAMP__7_10_) OR (cAMP__6_8_ <= cAMP__4_10_)))))
lola: processed formula length: 150
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: ((2 <= cAMP__7_8_) AND (cAMP__5_6_ <= cAMP__8_1_) AND (cAMP__8_7_ + 1 <= cAMP__6_3_) AND ((1 <= cAMP__7_10_) OR (cAMP__6_8_ <= cAMP__4_10_)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 94 markings, 132 edges
lola: ========================================

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__1_10_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_5_) AND (3 <= cAMP__1_10_) AND (2 <= cAMP__1_8_)) OR ((cAMP__6_3_ <= cAMP__5_10_) AND (2 <= cAMP__3_6_) AND (cAMP__7_7_ <= cAMP__6_1_) AND (cAMP__9_7_ <= cAMP__3_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 ((((cAMP__1_10_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_5_) AND (3 <= cAMP__1_10_) AND (2 <= cAMP__1_8_)) OR ((cAMP__6_3_ <= cAMP__5_10_) AND (2 <= cAMP__3_6_) AND (cAMP__7_7_ <= cAMP__6_1_) AND (cAMP__9_7_ <= cAMP__3_1_)))))
lola: processed formula length: 233
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: (((cAMP__1_10_ <= cAMP__1_5_) AND (cAMP__4_1_ <= cAMP__1_5_) AND (3 <= cAMP__1_10_) AND (2 <= cAMP__1_8_)) OR ((cAMP__6_3_ <= cAMP__5_10_) AND (2 <= cAMP__3_6_) AND (cAMP__7_7_ <= cAMP__6_1_) AND (cAMP__9_7_ <= cAMP__3_1_)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 178 markings, 351 edges

FORMULA Diffusion2D-PT-D10N010-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__10_2_ <= cAMP__7_9_) AND (1 <= cAMP__3_7_)) OR ((cAMP__6_1_ <= cAMP__9_8_) AND (cAMP__3_10_ <= cAMP__3_2_)) OR (3 <= cAMP__6_6_) OR (3 <= cAMP__4_3_) OR ((cAMP__9_3_ <= cAMP__3_3_) AND (cAMP__8_2_ <= cAMP__6_6_)))))
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 ((((cAMP__10_2_ <= cAMP__7_9_) AND (1 <= cAMP__3_7_)) OR ((cAMP__6_1_ <= cAMP__9_8_) AND (cAMP__3_10_ <= cAMP__3_2_)) OR (3 <= cAMP__6_6_) OR (3 <= cAMP__4_3_) OR ((cAMP__9_3_ <= cAMP__3_3_) AND (cAMP__8_2_ <= cAMP__6_6_)))))
lola: processed formula length: 234
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D10N010-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: (((cAMP__7_9_ + 1 <= cAMP__10_2_) OR (cAMP__3_7_ <= 0)) AND ((cAMP__9_8_ + 1 <= cAMP__6_1_) OR (cAMP__3_2_ + 1 <= cAMP__3_10_)) AND (cAMP__6_6_ <= 2) AND (cAMP__4_3_ <= 2) AND ((cAMP__3_3_ + 1 <= cAMP__9_3_) OR (cAMP__6_6_ + 1 <= cAMP__8_2_)))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N010-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D10N010-ReachabilityCardinality-15-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 Diffusion2D-PT-D10N010-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no yes no no no yes yes yes yes no
lola:
preliminary result: no yes yes yes yes yes no yes no no no yes yes yes yes no
lola: memory consumption: 28528 KB
lola: time consumption: 0 seconds

BK_STOP 1526654801947

--------------------
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="Diffusion2D-PT-D10N010"
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/Diffusion2D-PT-D10N010.tgz
mv Diffusion2D-PT-D10N010 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 Diffusion2D-PT-D10N010, 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 r076-blw3-152649936900173"
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 '' ReachabilityCardinality.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 ;