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 4.8M
-rw-r--r-- 1 mcc users 3.5K 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.2K 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.8K 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 11K 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.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.9K 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 4.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D40N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937000278
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526702244274

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D40N100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D40N100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D40N100 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13924/65536 symbol table entries, 3777 collisions
lola: preprocessing...
lola: Size of bit vector: 51200
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1600 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D40N100-ReachabilityCardinality.task
lola: A (G ((cAMP__34_2_ <= cAMP__8_40_))) : A (G ((((2 <= cAMP__10_3_) AND (cAMP__9_3_ <= cAMP__12_30_) AND (2 <= cAMP__38_3_)) OR (cAMP__2_7_ <= cAMP__15_14_)))) : E (F (((3 <= cAMP__33_30_) AND (2 <= cAMP__12_26_)))) : E (F ((3 <= cAMP__40_15_))) : A (G (((2 <= cAMP__28_24_) OR (cAMP__34_14_ <= cAMP__18_29_) OR (cAMP__4_30_ <= cAMP__18_7_) OR ((cAMP__21_16_ <= 1) AND (cAMP__30_33_ + 1 <= cAMP__39_3_))))) : A (G (((cAMP__6_1_ + 1 <= cAMP__5_9_) OR (cAMP__22_18_ <= 1) OR (2 <= cAMP__33_23_)))) : E (F ((2 <= cAMP__40_27_))) : A (G ((cAMP__1_38_ <= 2))) : E (F ((((cAMP__31_21_ + 1 <= cAMP__22_16_) AND (cAMP__38_15_ + 1 <= cAMP__26_25_)) OR ((cAMP__14_21_ + 1 <= cAMP__6_2_) AND (cAMP__4_40_ + 1 <= cAMP__8_10_))))) : A (G ((cAMP__10_9_ <= cAMP__26_34_))) : A (G ((cAMP__8_9_ <= cAMP__38_26_))) : E (F ((cAMP__11_18_ + 1 <= cAMP__13_5_))) : E (F (((3 <= cAMP__33_28_) OR (2 <= cAMP__40_15_) OR (((1 <= cAMP__32_22_) OR (1 <= cAMP__4_18_)) AND ((cAMP__21_26_ <= cAMP__3_18_) OR (2 <= cAMP__34_40_)))))) : A (G (((cAMP__8_39_ <= 0) OR (cAMP__39_12_ + 1 <= cAMP__39_2_) OR ((cAMP__5_31_ <= 2) AND (cAMP__7_19_ + 1 <= cAMP__33_15_))))) : A (G (((2 <= cAMP__6_17_) OR (cAMP__20_12_ <= cAMP__37_11_)))) : A (G ((((cAMP__6_24_ + 1 <= cAMP__25_12_) AND (cAMP__5_22_ <= 1)) OR (cAMP__14_39_ <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__40_15_)))
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__40_15_)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__40_15_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 9798 markings, 34935 edges, 1960 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 19595 markings, 68741 edges, 1959 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20106 markings, 70313 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__40_27_)))
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__40_27_)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__40_27_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4084 markings, 14945 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_38_ <= 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 ((cAMP__1_38_ <= 2)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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 <= cAMP__1_38_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6979 markings, 20695 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__33_30_) AND (2 <= cAMP__12_26_))))
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__33_30_) AND (2 <= cAMP__12_26_))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__33_30_) AND (2 <= cAMP__12_26_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-3-0.sara.
lola: sara is running 0 secs || 9584 markings, 34422 edges, 1917 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 19144 markings, 69579 edges, 1912 markings/sec, 5 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__34_2_ <= cAMP__8_40_)))
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__34_2_ <= cAMP__8_40_)))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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_40_ + 1 <= cAMP__34_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__10_9_ <= cAMP__26_34_)))
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_9_ <= cAMP__26_34_)))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__26_34_ + 1 <= cAMP__10_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__8_9_ <= cAMP__38_26_)))
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_9_ <= cAMP__38_26_)))
lola: processed formula length: 36
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__38_26_ + 1 <= cAMP__8_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__11_18_ + 1 <= cAMP__13_5_)))
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__11_18_ + 1 <= cAMP__13_5_)))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__11_18_ + 1 <= cAMP__13_5_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 9583 markings, 33036 edges, 1917 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 19188 markings, 63727 edges, 1921 markings/sec, 5 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__6_17_) OR (cAMP__20_12_ <= cAMP__37_11_))))
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 <= cAMP__6_17_) OR (cAMP__20_12_ <= cAMP__37_11_))))
lola: processed formula length: 63
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__6_17_ <= 1) AND (cAMP__37_11_ + 1 <= cAMP__20_12_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__6_1_ + 1 <= cAMP__5_9_) OR (cAMP__22_18_ <= 1) OR (2 <= cAMP__33_23_))))
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__6_1_ + 1 <= cAMP__5_9_) OR (cAMP__22_18_ <= 1) OR (2 <= cAMP__33_23_))))
lola: processed formula length: 88
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__5_9_ <= cAMP__6_1_) AND (2 <= cAMP__22_18_) AND (cAMP__33_23_ <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1626 markings, 4062 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__6_24_ + 1 <= cAMP__25_12_) AND (cAMP__5_22_ <= 1)) OR (cAMP__14_39_ <= 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__6_24_ + 1 <= cAMP__25_12_) AND (cAMP__5_22_ <= 1)) OR (cAMP__14_39_ <= 1))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__25_12_ <= cAMP__6_24_) OR (2 <= cAMP__5_22_)) AND (2 <= cAMP__14_39_))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2723 markings, 9584 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= cAMP__10_3_) AND (cAMP__9_3_ <= cAMP__12_30_) AND (2 <= cAMP__38_3_)) OR (cAMP__2_7_ <= cAMP__15_14_))))
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 <= cAMP__10_3_) AND (cAMP__9_3_ <= cAMP__12_30_) AND (2 <= cAMP__38_3_)) OR (cAMP__2_7_ <= cAMP__15_14_))))
lola: processed formula length: 119
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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_3_ <= 1) OR (cAMP__12_30_ + 1 <= cAMP__9_3_) OR (cAMP__38_3_ <= 1)) AND (cAMP__15_14_ + 1 <= cAMP__2_7_))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5748 markings, 21353 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__8_39_ <= 0) OR (cAMP__39_12_ + 1 <= cAMP__39_2_) OR ((cAMP__5_31_ <= 2) AND (cAMP__7_19_ + 1 <= cAMP__33_15_)))))
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_39_ <= 0) OR (cAMP__39_12_ + 1 <= cAMP__39_2_) OR ((cAMP__5_31_ <= 2) AND (cAMP__7_19_ + 1 <= cAMP__33_15_)))))
lola: processed formula length: 129
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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: ((1 <= cAMP__8_39_) AND (cAMP__39_2_ <= cAMP__39_12_) AND ((3 <= cAMP__5_31_) OR (cAMP__33_15_ <= cAMP__7_19_)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__33_28_) OR (2 <= cAMP__40_15_) OR (((1 <= cAMP__32_22_) OR (1 <= cAMP__4_18_)) AND ((cAMP__21_26_ <= cAMP__3_18_) OR (2 <= cAMP__34_40_))))))
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__33_28_) OR (2 <= cAMP__40_15_) OR (((1 <= cAMP__32_22_) OR (1 <= cAMP__4_18_)) AND ((cAMP__21_26_ <= cAMP__3_18_) OR (2 <= cAMP__34_40_))))))
lola: processed formula length: 164
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__33_28_) OR (2 <= cAMP__40_15_) OR (((1 <= cAMP__32_22_) OR (1 <= cAMP__4_18_)) AND ((cAMP__21_26_ <= cAMP__3_18_) OR (2 <= cAMP__34_40_))))
lola: state equation: Generated DNF with 10 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola:
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__31_21_ + 1 <= cAMP__22_16_) AND (cAMP__38_15_ + 1 <= cAMP__26_25_)) OR ((cAMP__14_21_ + 1 <= cAMP__6_2_) AND (cAMP__4_40_ + 1 <= cAMP__8_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 ((((cAMP__31_21_ + 1 <= cAMP__22_16_) AND (cAMP__38_15_ + 1 <= cAMP__26_25_)) OR ((cAMP__14_21_ + 1 <= cAMP__6_2_) AND (cAMP__4_40_ + 1 <= cAMP__8_10_)))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__31_21_ + 1 <= cAMP__22_16_) AND (cAMP__38_15_ + 1 <= cAMP__26_25_)) OR ((cAMP__14_21_ + 1 <= cAMP__6_2_) AND (cAMP__4_40_ + 1 <= cAMP__8_10_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__28_24_) OR (cAMP__34_14_ <= cAMP__18_29_) OR (cAMP__4_30_ <= cAMP__18_7_) OR ((cAMP__21_16_ <= 1) AND (cAMP__30_33_ + 1 <= cAMP__39_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 (((2 <= cAMP__28_24_) OR (cAMP__34_14_ <= cAMP__18_29_) OR (cAMP__4_30_ <= cAMP__18_7_) OR ((cAMP__21_16_ <= 1) AND (cAMP__30_33_ + 1 <= cAMP__39_3_)))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D40N100-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__28_24_ <= 1) AND (cAMP__18_29_ + 1 <= cAMP__34_14_) AND (cAMP__18_7_ + 1 <= cAMP__4_30_) AND ((2 <= cAMP__21_16_) OR (cAMP__39_3_ <= cAMP__30_33_)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 9677 markings, 32349 edges, 1935 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 19330 markings, 66473 edges, 1931 markings/sec, 5 secs

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-D40N100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes no yes no no yes yes no no no
lola:
preliminary result: no no yes yes no no yes no yes no no yes yes no no no
lola: memory consumption: 33160 KB
lola: time consumption: 126 seconds

BK_STOP 1526702370513

--------------------
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-D40N100"
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-D40N100.tgz
mv Diffusion2D-PT-D40N100 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-D40N100, 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-152649937000278"
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 ;