About the Execution of LoLA for Diffusion2D-PT-D10N100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11916.840 | 3600000.00 | 1099563.00 | 1401.30 | FTF?T?TTTT??T?TT | 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 428K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K 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 10K 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 17K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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-D10N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900185
=====================================================================
--------------------
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-D10N100-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D10N100-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526662038948
info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D10N100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D10N100 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D10N100 @ 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-D10N100-CTLCardinality.task
lola: NOT(E (F (A (F ((1 <= cAMP__1_2_)))))) : E (F (NOT(E (X ((cAMP__5_9_ <= cAMP__8_10_)))))) : A (G (((cAMP__6_1_ <= cAMP__2_5_) OR ((1 <= cAMP__8_10_) AND (cAMP__8_10_ <= cAMP__4_2_)) OR (cAMP__4_6_ <= 0)))) : E (((cAMP__1_3_ <= cAMP__6_4_) U A (F ((3 <= cAMP__3_1_))))) : (E (X (E (G ((3 <= cAMP__9_10_))))) OR E (F ((3 <= cAMP__8_10_)))) : ((E (G (((2 <= cAMP__8_2_) OR (cAMP__6_8_ <= cAMP__2_7_)))) OR ((cAMP__5_6_ <= 1) OR (cAMP__7_4_ + 1 <= cAMP__4_8_) OR ((cAMP__4_5_ <= 2) AND (cAMP__7_10_ <= 2)))) AND A (G ((cAMP__1_5_ <= cAMP__4_5_)))) : E (G (E (F ((1 <= cAMP__4_1_))))) : E (F (E (((cAMP__8_4_ <= cAMP__8_8_) U (3 <= cAMP__9_6_))))) : E ((E (F ((cAMP__8_2_ <= cAMP__6_9_))) U E (F ((2 <= cAMP__2_1_))))) : ((((cAMP__4_5_ <= 2) AND (cAMP__9_9_ <= 0) AND ((cAMP__10_10_ + 1 <= cAMP__9_7_) OR (cAMP__6_4_ + 1 <= cAMP__5_4_))) OR E (X ((cAMP__1_2_ + 1 <= cAMP__2_4_)))) OR A (F (E (F ((2 <= cAMP__8_10_)))))) : NOT(((E (F ((3 <= cAMP__10_7_))) OR (cAMP__8_2_ + 1 <= cAMP__5_6_)) AND E (F ((2 <= cAMP__6_3_))))) : (A (F ((cAMP__8_5_ <= cAMP__5_7_))) AND E (F (((1 <= cAMP__10_9_) AND (cAMP__1_8_ <= cAMP__5_5_) AND (cAMP__2_9_ + 1 <= cAMP__9_2_))))) : NOT((NOT(E (F ((3 <= cAMP__10_9_)))) AND ((3 <= cAMP__7_3_) OR (cAMP__7_2_ <= cAMP__6_6_) OR (cAMP__2_6_ <= cAMP__5_4_) OR (cAMP__3_7_ <= cAMP__10_1_) OR ((cAMP__9_2_ <= cAMP__3_4_) AND (2 <= cAMP__5_5_))))) : E (F ((E (G ((3 <= cAMP__3_1_))) AND A (G ((3 <= cAMP__8_3_)))))) : E (((((3 <= cAMP__4_1_) AND (3 <= cAMP__2_3_)) OR (cAMP__6_10_ <= 0)) U E (G ((3 <= cAMP__7_7_))))) : E (F (NOT(A (F ((cAMP__4_1_ <= cAMP__3_5_))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 (A (X ((cAMP__8_10_ + 1 <= cAMP__5_9_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((cAMP__8_10_ + 1 <= cAMP__5_9_)))
lola: processed formula length: 45
lola: 33 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 141355 markings, 380183 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-1 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: (E (X (E (G ((3 <= cAMP__9_10_))))) OR E (F ((3 <= cAMP__8_10_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 ((3 <= cAMP__8_10_)))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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__8_10_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-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: 169 markings, 419 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola:
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-4 TRUE 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: (((cAMP__4_5_ <= 2) AND (cAMP__9_9_ <= 0) AND ((cAMP__10_10_ + 1 <= cAMP__9_7_) OR (cAMP__6_4_ + 1 <= cAMP__5_4_))) OR (E (X ((cAMP__1_2_ + 1 <= cAMP__2_4_))) OR E (F ((2 <= cAMP__8_10_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= cAMP__8_10_)))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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__8_10_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 76 markings, 181 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-9 TRUE 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 ((3 <= cAMP__9_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 ((3 <= cAMP__9_6_)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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_6_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-3-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: 37 markings, 73 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-7 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: E (F ((2 <= cAMP__2_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 ((2 <= cAMP__2_1_)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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__2_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-4-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: 105 markings, 303 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-8 TRUE 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__1_2_ <= 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:695
lola: processed formula: A (G ((cAMP__1_2_ <= 0)))
lola: processed formula length: 25
lola: 33 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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:695
lola: formula 0: (1 <= cAMP__1_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-5-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-D10N100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__6_1_ <= cAMP__2_5_) OR ((1 <= cAMP__8_10_) AND (cAMP__8_10_ <= cAMP__4_2_)) OR (cAMP__4_6_ <= 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 (((cAMP__6_1_ <= cAMP__2_5_) OR ((1 <= cAMP__8_10_) AND (cAMP__8_10_ <= cAMP__4_2_)) OR (cAMP__4_6_ <= 0))))
lola: processed formula length: 115
lola: 33 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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__2_5_ + 1 <= cAMP__6_1_) AND ((cAMP__8_10_ <= 0) OR (cAMP__4_2_ + 1 <= cAMP__8_10_)) AND (1 <= cAMP__4_6_))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-6-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: 8 markings, 7 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-2 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 (E (G ((cAMP__3_5_ + 1 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (cAMP__3_5_ + 1 <= cAMP__4_1_)
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 309 markings, 310 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-15 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 (((cAMP__1_3_ <= cAMP__6_4_) U A (F ((3 <= cAMP__3_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((cAMP__1_3_ <= cAMP__6_4_) U A(TRUE U (3 <= cAMP__3_1_)))
lola: processed formula length: 59
lola: 33 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 573126 markings, 2921562 edges, 114625 markings/sec, 0 secs
lola: 1076914 markings, 5569527 edges, 100758 markings/sec, 5 secs
lola: 1565463 markings, 8146111 edges, 97710 markings/sec, 10 secs
lola: 2011320 markings, 10553102 edges, 89171 markings/sec, 15 secs
lola: 2439263 markings, 12858910 edges, 85589 markings/sec, 20 secs
lola: 2834276 markings, 14972156 edges, 79003 markings/sec, 25 secs
lola: 3232840 markings, 17163878 edges, 79713 markings/sec, 30 secs
lola: 3631424 markings, 19369777 edges, 79717 markings/sec, 35 secs
lola: 4038608 markings, 21569379 edges, 81437 markings/sec, 40 secs
lola: 4441476 markings, 23768584 edges, 80574 markings/sec, 45 secs
lola: 4820072 markings, 25840987 edges, 75719 markings/sec, 50 secs
lola: 5223884 markings, 28006076 edges, 80762 markings/sec, 55 secs
lola: 5609142 markings, 30118820 edges, 77052 markings/sec, 60 secs
lola: 5984093 markings, 32203555 edges, 74990 markings/sec, 65 secs
lola: 6384678 markings, 34372993 edges, 80117 markings/sec, 70 secs
lola: 6766009 markings, 36449360 edges, 76266 markings/sec, 75 secs
lola: 7140631 markings, 38484004 edges, 74924 markings/sec, 80 secs
lola: 7516840 markings, 40542571 edges, 75242 markings/sec, 85 secs
lola: 7882810 markings, 42554255 edges, 73194 markings/sec, 90 secs
lola: 8244673 markings, 44553765 edges, 72373 markings/sec, 95 secs
lola: 8642107 markings, 46691880 edges, 79487 markings/sec, 100 secs
lola: 9003316 markings, 48688856 edges, 72242 markings/sec, 105 secs
lola: 9365832 markings, 50678969 edges, 72503 markings/sec, 110 secs
lola: 9722184 markings, 52660619 edges, 71270 markings/sec, 115 secs
lola: 10090907 markings, 54685840 edges, 73745 markings/sec, 120 secs
lola: 10462397 markings, 56730492 edges, 74298 markings/sec, 125 secs
lola: 10808754 markings, 58673271 edges, 69271 markings/sec, 130 secs
lola: 11161021 markings, 60624312 edges, 70453 markings/sec, 135 secs
lola: 11505991 markings, 62565998 edges, 68994 markings/sec, 140 secs
lola: 11853136 markings, 64502606 edges, 69429 markings/sec, 145 secs
lola: 12174410 markings, 66353013 edges, 64255 markings/sec, 150 secs
lola: 12536392 markings, 68342563 edges, 72396 markings/sec, 155 secs
lola: 12878864 markings, 70252970 edges, 68494 markings/sec, 160 secs
lola: 13218385 markings, 72146043 edges, 67904 markings/sec, 165 secs
lola: 13561321 markings, 74080916 edges, 68587 markings/sec, 170 secs
lola: 13887880 markings, 75942976 edges, 65312 markings/sec, 175 secs
lola: 14225355 markings, 77839320 edges, 67495 markings/sec, 180 secs
lola: 14557180 markings, 79724230 edges, 66365 markings/sec, 185 secs
lola: 14881236 markings, 81585086 edges, 64811 markings/sec, 190 secs
lola: 15208255 markings, 83461852 edges, 65404 markings/sec, 195 secs
lola: 15546971 markings, 85357404 edges, 67743 markings/sec, 200 secs
lola: 15863312 markings, 87194902 edges, 63268 markings/sec, 205 secs
lola: 16191962 markings, 89078872 edges, 65730 markings/sec, 210 secs
lola: 16522454 markings, 90943979 edges, 66098 markings/sec, 215 secs
lola: 16877991 markings, 92886210 edges, 71107 markings/sec, 220 secs
lola: 17210493 markings, 94771483 edges, 66500 markings/sec, 225 secs
lola: 17544290 markings, 96657037 edges, 66759 markings/sec, 230 secs
lola: 17865933 markings, 98473585 edges, 64329 markings/sec, 235 secs
lola: 18196094 markings, 100324582 edges, 66032 markings/sec, 240 secs
lola: 18514233 markings, 102147894 edges, 63628 markings/sec, 245 secs
lola: 18867057 markings, 104089929 edges, 70565 markings/sec, 250 secs
lola: 19185730 markings, 105895573 edges, 63735 markings/sec, 255 secs
lola: 19514847 markings, 107741464 edges, 65823 markings/sec, 260 secs
lola: 19847188 markings, 109626392 edges, 66468 markings/sec, 265 secs
lola: 20189934 markings, 111520007 edges, 68549 markings/sec, 270 secs
lola: 20534709 markings, 113458636 edges, 68955 markings/sec, 275 secs
lola: 20864349 markings, 115355515 edges, 65928 markings/sec, 280 secs
lola: 21207915 markings, 117315442 edges, 68713 markings/sec, 285 secs
lola: 21531645 markings, 119206243 edges, 64746 markings/sec, 290 secs
lola: 21870170 markings, 121137179 edges, 67705 markings/sec, 295 secs
lola: 22214200 markings, 123063567 edges, 68806 markings/sec, 300 secs
lola: 22554777 markings, 124995525 edges, 68115 markings/sec, 305 secs
lola: 22921419 markings, 126985867 edges, 73328 markings/sec, 310 secs
lola: 23336377 markings, 129179196 edges, 82992 markings/sec, 315 secs
lola: 23734961 markings, 131308389 edges, 79717 markings/sec, 320 secs
lola: 24072189 markings, 133196470 edges, 67446 markings/sec, 325 secs
lola: 24395039 markings, 135058670 edges, 64570 markings/sec, 330 secs
lola: 24736895 markings, 136992066 edges, 68371 markings/sec, 335 secs
lola: 25061339 markings, 138853883 edges, 64889 markings/sec, 340 secs
lola: 25442461 markings, 140939704 edges, 76224 markings/sec, 345 secs
lola: 25774251 markings, 142833851 edges, 66358 markings/sec, 350 secs
lola: 26099945 markings, 144663398 edges, 65139 markings/sec, 355 secs
lola: 26451277 markings, 146620825 edges, 70266 markings/sec, 360 secs
lola: 26776489 markings, 148496363 edges, 65042 markings/sec, 365 secs
lola: 27116817 markings, 150403281 edges, 68066 markings/sec, 370 secs
lola: 27452136 markings, 152304620 edges, 67064 markings/sec, 375 secs
lola: 27767933 markings, 154114728 edges, 63159 markings/sec, 380 secs
lola: 28103897 markings, 156026424 edges, 67193 markings/sec, 385 secs
lola: 28434590 markings, 157921959 edges, 66139 markings/sec, 390 secs
lola: 28762211 markings, 159786993 edges, 65524 markings/sec, 395 secs
lola: 29087801 markings, 161629669 edges, 65118 markings/sec, 400 secs
lola: 29390184 markings, 163409953 edges, 60477 markings/sec, 405 secs
lola: 29731451 markings, 165289732 edges, 68253 markings/sec, 410 secs
lola: 30030912 markings, 167009440 edges, 59892 markings/sec, 415 secs
lola: 30335694 markings, 168757259 edges, 60956 markings/sec, 420 secs
lola: 30664691 markings, 170618675 edges, 65799 markings/sec, 425 secs
lola: 30967194 markings, 172371671 edges, 60501 markings/sec, 430 secs
lola: 31300155 markings, 174240157 edges, 66592 markings/sec, 435 secs
lola: 31605330 markings, 175995479 edges, 61035 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown unknown yes yes yes unknown unknown unknown unknown unknown yes
lola: memory consumption: 8796940 KB
lola: time consumption: 447 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= cAMP__4_1_) AND (3 <= cAMP__2_3_)) OR (cAMP__6_10_ <= 0)) U E (G ((3 <= cAMP__7_7_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((((3 <= cAMP__4_1_) AND (3 <= cAMP__2_3_)) OR (cAMP__6_10_ <= 0)) U NOT(A(TRUE U (cAMP__7_7_ <= 2))))
lola: processed formula length: 104
lola: 34 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 770201 markings, 3189801 edges, 154040 markings/sec, 0 secs
lola: 1399336 markings, 5862949 edges, 125827 markings/sec, 5 secs
lola: 1984441 markings, 8401648 edges, 117021 markings/sec, 10 secs
lola: 2566856 markings, 10924164 edges, 116483 markings/sec, 15 secs
lola: 3128949 markings, 13385171 edges, 112419 markings/sec, 20 secs
lola: 3679209 markings, 15786498 edges, 110052 markings/sec, 25 secs
lola: 4247615 markings, 18242111 edges, 113681 markings/sec, 30 secs
lola: 4792665 markings, 20615786 edges, 109010 markings/sec, 35 secs
lola: 5331177 markings, 22947488 edges, 107702 markings/sec, 40 secs
lola: 5839647 markings, 25208727 edges, 101694 markings/sec, 45 secs
lola: 6312958 markings, 27312130 edges, 94662 markings/sec, 50 secs
lola: 6810307 markings, 29480880 edges, 99470 markings/sec, 55 secs
lola: 7306903 markings, 31634433 edges, 99319 markings/sec, 60 secs
lola: 7786913 markings, 33727698 edges, 96002 markings/sec, 65 secs
lola: 8228023 markings, 35685264 edges, 88222 markings/sec, 70 secs
lola: 8642556 markings, 37510487 edges, 82907 markings/sec, 75 secs
lola: 9057929 markings, 39331358 edges, 83075 markings/sec, 80 secs
lola: 9438169 markings, 41047020 edges, 76048 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9669903 markings, 42072727 edges
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= cAMP__3_1_))) AND A (G ((3 <= cAMP__8_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(A(TRUE U (cAMP__3_1_ <= 2))) AND NOT(E(TRUE U (cAMP__8_3_ <= 2)))))
lola: processed formula length: 81
lola: 36 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 702088 markings, 2902442 edges, 140418 markings/sec, 0 secs
lola: 1322728 markings, 5570488 edges, 124128 markings/sec, 5 secs
lola: 1886819 markings, 8003824 edges, 112818 markings/sec, 10 secs
lola: 2406914 markings, 10304471 edges, 104019 markings/sec, 15 secs
lola: 2923472 markings, 12552535 edges, 103312 markings/sec, 20 secs
lola: 3431310 markings, 14810607 edges, 101568 markings/sec, 25 secs
lola: 3955770 markings, 17129504 edges, 104892 markings/sec, 30 secs
lola: 4477158 markings, 19456241 edges, 104278 markings/sec, 35 secs
lola: 4982134 markings, 21718082 edges, 100995 markings/sec, 40 secs
lola: 5462010 markings, 23891922 edges, 95975 markings/sec, 45 secs
lola: 5935920 markings, 26036375 edges, 94782 markings/sec, 50 secs
lola: 6416282 markings, 28213565 edges, 96072 markings/sec, 55 secs
lola: 6893435 markings, 30353343 edges, 95431 markings/sec, 60 secs
lola: 7386177 markings, 32553368 edges, 98548 markings/sec, 65 secs
lola: 7884768 markings, 34754599 edges, 99718 markings/sec, 70 secs
lola: 8367670 markings, 36934301 edges, 96580 markings/sec, 75 secs
lola: 8812153 markings, 38960729 edges, 88897 markings/sec, 80 secs
lola: 9254345 markings, 40983650 edges, 88438 markings/sec, 85 secs
lola: 9765390 markings, 43218435 edges, 102209 markings/sec, 90 secs
lola: 10205058 markings, 45232973 edges, 87934 markings/sec, 95 secs
lola: 10638269 markings, 47234621 edges, 86642 markings/sec, 100 secs
lola: 11118077 markings, 49389548 edges, 95962 markings/sec, 105 secs
lola: 11541578 markings, 51361595 edges, 84700 markings/sec, 110 secs
lola: 11999832 markings, 53423737 edges, 91651 markings/sec, 115 secs
lola: 12433916 markings, 55435474 edges, 86817 markings/sec, 120 secs
lola: 12877804 markings, 57476957 edges, 88778 markings/sec, 125 secs
lola: 13308443 markings, 59467153 edges, 86128 markings/sec, 130 secs
lola: 13738436 markings, 61454028 edges, 85999 markings/sec, 135 secs
lola: 14163871 markings, 63418615 edges, 85087 markings/sec, 140 secs
lola: 14600466 markings, 65408282 edges, 87319 markings/sec, 145 secs
lola: 15026694 markings, 67395687 edges, 85246 markings/sec, 150 secs
lola: 15428390 markings, 69292123 edges, 80339 markings/sec, 155 secs
lola: 15857081 markings, 71285521 edges, 85738 markings/sec, 160 secs
lola: 16277752 markings, 73246746 edges, 84134 markings/sec, 165 secs
lola: 16696896 markings, 75186998 edges, 83829 markings/sec, 170 secs
lola: 17103163 markings, 77094538 edges, 81253 markings/sec, 175 secs
lola: 17499406 markings, 78987365 edges, 79249 markings/sec, 180 secs
lola: 17876851 markings, 80810650 edges, 75489 markings/sec, 185 secs
lola: 18320506 markings, 82830219 edges, 88731 markings/sec, 190 secs
lola: 18714263 markings, 84695422 edges, 78751 markings/sec, 195 secs
lola: 19108576 markings, 86584030 edges, 78863 markings/sec, 200 secs
lola: 19520940 markings, 88476172 edges, 82473 markings/sec, 205 secs
lola: 19932136 markings, 90399738 edges, 82239 markings/sec, 210 secs
lola: 20374082 markings, 92398706 edges, 88389 markings/sec, 215 secs
lola: 20768868 markings, 94261412 edges, 78957 markings/sec, 220 secs
lola: 21166587 markings, 96136433 edges, 79544 markings/sec, 225 secs
lola: 21577585 markings, 98069332 edges, 82200 markings/sec, 230 secs
lola: 21990180 markings, 99999021 edges, 82519 markings/sec, 235 secs
lola: 22379726 markings, 101828329 edges, 77909 markings/sec, 240 secs
lola: 22769762 markings, 103677020 edges, 78007 markings/sec, 245 secs
lola: 23157192 markings, 105538549 edges, 77486 markings/sec, 250 secs
lola: 23551148 markings, 107399682 edges, 78791 markings/sec, 255 secs
lola: 23947321 markings, 109261744 edges, 79235 markings/sec, 260 secs
lola: 24334695 markings, 111110156 edges, 77475 markings/sec, 265 secs
lola: 24795810 markings, 113142976 edges, 92223 markings/sec, 270 secs
lola: 25185577 markings, 114992962 edges, 77953 markings/sec, 275 secs
lola: 25602193 markings, 116892491 edges, 83323 markings/sec, 280 secs
lola: 25996101 markings, 118746584 edges, 78782 markings/sec, 285 secs
lola: 26372919 markings, 120555708 edges, 75364 markings/sec, 290 secs
lola: 26761824 markings, 122391196 edges, 77781 markings/sec, 295 secs
lola: 27202243 markings, 124379436 edges, 88084 markings/sec, 300 secs
lola: 27684244 markings, 126475569 edges, 96400 markings/sec, 305 secs
lola: 28072866 markings, 128286481 edges, 77724 markings/sec, 310 secs
lola: 28472793 markings, 130160078 edges, 79985 markings/sec, 315 secs
lola: 28881014 markings, 132032788 edges, 81644 markings/sec, 320 secs
lola: 29287797 markings, 133926549 edges, 81357 markings/sec, 325 secs
lola: 29669656 markings, 135697289 edges, 76372 markings/sec, 330 secs
lola: 30076466 markings, 137571960 edges, 81362 markings/sec, 335 secs
lola: 30495368 markings, 139512743 edges, 83780 markings/sec, 340 secs
lola: 30884611 markings, 141324555 edges, 77849 markings/sec, 345 secs
lola: 31264249 markings, 143084298 edges, 75928 markings/sec, 350 secs
lola: 31666653 markings, 144940071 edges, 80481 markings/sec, 355 secs
lola: 32033174 markings, 146718221 edges, 73304 markings/sec, 360 secs
lola: 32422085 markings, 148545361 edges, 77782 markings/sec, 365 secs
lola: 32789619 markings, 150310688 edges, 73507 markings/sec, 370 secs
lola: 33173673 markings, 152113917 edges, 76811 markings/sec, 375 secs
lola: 33557494 markings, 153924041 edges, 76764 markings/sec, 380 secs
lola: 33936935 markings, 155697316 edges, 75888 markings/sec, 385 secs
lola: 34318665 markings, 157470848 edges, 76346 markings/sec, 390 secs
lola: 34701242 markings, 159261834 edges, 76515 markings/sec, 395 secs
lola: 35079898 markings, 161037777 edges, 75731 markings/sec, 400 secs
lola: 35532446 markings, 163030806 edges, 90510 markings/sec, 405 secs
lola: 35932263 markings, 164883543 edges, 79963 markings/sec, 410 secs
lola: 36320480 markings, 166700988 edges, 77643 markings/sec, 415 secs
lola: 36714391 markings, 168529236 edges, 78782 markings/sec, 420 secs
lola: 37111133 markings, 170377150 edges, 79348 markings/sec, 425 secs
lola: 37476950 markings, 172142288 edges, 73163 markings/sec, 430 secs
lola: 37838869 markings, 173904833 edges, 72384 markings/sec, 435 secs
lola: 38233804 markings, 175753780 edges, 78987 markings/sec, 440 secs
lola: 38620890 markings, 177573008 edges, 77417 markings/sec, 445 secs
lola: 39032426 markings, 179470276 edges, 82307 markings/sec, 450 secs
lola: 39373491 markings, 181170265 edges, 68213 markings/sec, 455 secs
lola: 39752290 markings, 182984309 edges, 75760 markings/sec, 460 secs
lola: 40144630 markings, 184830779 edges, 78468 markings/sec, 465 secs
lola: 40514736 markings, 186607661 edges, 74021 markings/sec, 470 secs
lola: 40913927 markings, 188461716 edges, 79838 markings/sec, 475 secs
lola: 41327784 markings, 190393369 edges, 82771 markings/sec, 480 secs
lola: 41764941 markings, 192368138 edges, 87431 markings/sec, 485 secs
lola: 42136306 markings, 194149312 edges, 74273 markings/sec, 490 secs
lola: 42513404 markings, 195912764 edges, 75420 markings/sec, 495 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown unknown yes yes yes unknown unknown unknown unknown yes yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= cAMP__10_9_))) OR ((cAMP__7_3_ <= 2) AND (cAMP__6_6_ + 1 <= cAMP__7_2_) AND (cAMP__5_4_ + 1 <= cAMP__2_6_) AND (cAMP__10_1_ + 1 <= cAMP__3_7_) AND ((cAMP__3_4_ + 1 <= cAMP__9_2_) OR (cAMP__5_5_ <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__7_3_ <= 2) AND (cAMP__6_6_ + 1 <= cAMP__7_2_) AND (cAMP__5_4_ + 1 <= cAMP__2_6_) AND (cAMP__10_1_ + 1 <= cAMP__3_7_) AND ((cAMP__3_4_ + 1 <= cAMP__9_2_) OR (cAMP__5_5_ <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__7_3_ <= 2) AND (cAMP__6_6_ + 1 <= cAMP__7_2_) AND (cAMP__5_4_ + 1 <= cAMP__2_6_) AND (cAMP__10_1_ + 1 <= cAMP__3_7_) AND ((cAMP__3_4_ + 1 <= cAMP__9_2_) OR (cAMP__5_5_ <= 1)))
lola: processed formula length: 184
lola: 31 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: processed formula with 6 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: ========================================
lola: subprocess 12 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__10_9_)))
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__10_9_)))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.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__10_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D10N100-CTLCardinality-12-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: 118 markings, 280 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (1 <= cAMP__4_1_)
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file Diffusion2D-PT-D10N100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 30811 markings, 70490 edges
lola: ========================================
FORMULA Diffusion2D-PT-D10N100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((cAMP__10_7_ <= 2))) AND (cAMP__5_6_ <= cAMP__8_2_)) OR A (G ((cAMP__6_3_ <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown yes yes yes yes unknown unknown yes unknown yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 25216 KB
lola: time consumption: 1887 seconds
lola: time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown yes yes yes yes unknown unknown yes unknown yes yes
lola:
preliminary result: no yes no unknown yes unknown yes yes yes yes unknown unknown yes unknown yes yes
lola: memory consumption: 25216 KB
lola: time consumption: 3569 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D10N100"
export BK_EXAMINATION="CTLCardinality"
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-D10N100.tgz
mv Diffusion2D-PT-D10N100 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-D10N100, examination is CTLCardinality"
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-152649936900185"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;