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 3.2M
-rw-r--r-- 1 mcc users 3.7K 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.5K 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.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K 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 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 3.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D30N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474200071
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527863012064

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D30N100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D30N100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D30N100 @ 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: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N100-LTLCardinality.task
lola: A (G ((cAMP__7_13_ <= cAMP__27_4_))) : A ((G (F ((cAMP__22_23_ <= cAMP__28_29_))) U ((cAMP__18_27_ <= cAMP__12_9_) U (cAMP__9_22_ <= cAMP__17_27_)))) : A (G (F (F ((cAMP__2_18_ <= cAMP__9_22_))))) : A ((X (G ((2 <= cAMP__2_16_))) U (1 <= cAMP__16_26_))) : A (F ((cAMP__8_27_ <= cAMP__8_20_))) : A (G (X ((cAMP__24_19_ <= cAMP__13_18_)))) : A ((3 <= cAMP__16_7_)) : A (F ((2 <= cAMP__20_16_))) : A ((F (G ((cAMP__17_1_ <= cAMP__11_9_))) U X ((cAMP__27_5_ <= cAMP__29_16_)))) : A (F (X (((cAMP__28_27_ <= cAMP__18_18_) U (1 <= cAMP__14_5_))))) : A ((G (G ((cAMP__26_18_ <= cAMP__3_7_))) U ((cAMP__11_19_ <= cAMP__5_7_) U (2 <= cAMP__4_21_)))) : A (X ((G ((cAMP__29_25_ <= cAMP__8_18_)) U F ((1 <= cAMP__28_17_))))) : A ((((1 <= cAMP__2_8_) U (cAMP__23_27_ <= cAMP__9_18_)) U X ((cAMP__28_17_ <= cAMP__27_15_)))) : A ((cAMP__17_29_ <= cAMP__20_29_)) : A (G (F (G (X ((1 <= cAMP__10_4_)))))) : A (G ((cAMP__29_7_ <= cAMP__9_4_)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= cAMP__16_7_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= cAMP__16_7_)
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__17_29_ <= cAMP__20_29_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__17_29_ <= cAMP__20_29_)
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= cAMP__2_16_))) U (1 <= cAMP__16_26_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= cAMP__2_16_))) U (1 <= cAMP__16_26_)))
lola: processed formula length: 54
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 412 markings, 412 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((cAMP__27_5_ <= cAMP__29_16_)) OR (X (F ((cAMP__27_5_ <= cAMP__29_16_))) AND F (G ((cAMP__17_1_ <= cAMP__11_9_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((cAMP__27_5_ <= cAMP__29_16_)) OR (X (F ((cAMP__27_5_ <= cAMP__29_16_))) AND F (G ((cAMP__17_1_ <= cAMP__11_9_))))))
lola: processed formula length: 123
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= cAMP__14_5_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= cAMP__14_5_))))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 412 markings, 412 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= cAMP__28_17_)) OR (G ((cAMP__29_25_ <= cAMP__8_18_)) AND F ((1 <= cAMP__28_17_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= cAMP__28_17_)) OR (G ((cAMP__29_25_ <= cAMP__8_18_)) AND F ((1 <= cAMP__28_17_))))))
lola: processed formula length: 100
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 412 markings, 412 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= cAMP__2_8_) U (cAMP__23_27_ <= cAMP__9_18_)) U X ((cAMP__28_17_ <= cAMP__27_15_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= cAMP__2_8_) U (cAMP__23_27_ <= cAMP__9_18_)) U X ((cAMP__28_17_ <= cAMP__27_15_))))
lola: processed formula length: 94
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((cAMP__24_19_ <= cAMP__13_18_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((cAMP__24_19_ <= cAMP__13_18_))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 209145 markings, 528578 edges, 41829 markings/sec, 0 secs
lola: 407014 markings, 1052414 edges, 39574 markings/sec, 5 secs
lola: 601170 markings, 1550955 edges, 38831 markings/sec, 10 secs
lola: 784022 markings, 2050709 edges, 36570 markings/sec, 15 secs
lola: 971816 markings, 2541247 edges, 37559 markings/sec, 20 secs
lola: 1170600 markings, 3057752 edges, 39757 markings/sec, 25 secs
lola: 1340369 markings, 3529862 edges, 33954 markings/sec, 30 secs
lola: 1510191 markings, 3997945 edges, 33964 markings/sec, 35 secs
lola: 1681780 markings, 4459538 edges, 34318 markings/sec, 40 secs
lola: 1849663 markings, 4917305 edges, 33577 markings/sec, 45 secs
lola: 2016389 markings, 5378797 edges, 33345 markings/sec, 50 secs
lola: 2178610 markings, 5839356 edges, 32444 markings/sec, 55 secs
lola: 2341328 markings, 6288278 edges, 32544 markings/sec, 60 secs
lola: 2508876 markings, 6736193 edges, 33510 markings/sec, 65 secs
lola: 2667408 markings, 7174034 edges, 31706 markings/sec, 70 secs
lola: 2823839 markings, 7612664 edges, 31286 markings/sec, 75 secs
lola: 2986360 markings, 8065813 edges, 32504 markings/sec, 80 secs
lola: 3151783 markings, 8505889 edges, 33085 markings/sec, 85 secs
lola: 3316351 markings, 8959393 edges, 32914 markings/sec, 90 secs
lola: 3471950 markings, 9407896 edges, 31120 markings/sec, 95 secs
lola: 3631717 markings, 9850204 edges, 31953 markings/sec, 100 secs
lola: 3783772 markings, 10279436 edges, 30411 markings/sec, 105 secs
lola: 3943629 markings, 10719741 edges, 31971 markings/sec, 110 secs
lola: 4087751 markings, 11094830 edges, 28824 markings/sec, 115 secs
lola: 4244183 markings, 11525911 edges, 31286 markings/sec, 120 secs
lola: 4397695 markings, 11952833 edges, 30702 markings/sec, 125 secs
lola: 4552229 markings, 12364165 edges, 30907 markings/sec, 130 secs
lola: 4700021 markings, 12789730 edges, 29558 markings/sec, 135 secs
lola: 4847096 markings, 13208804 edges, 29415 markings/sec, 140 secs
lola: 5003474 markings, 13613180 edges, 31276 markings/sec, 145 secs
lola: 5152123 markings, 14032604 edges, 29730 markings/sec, 150 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5289320 markings, 14409199 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__7_13_ <= cAMP__27_4_)))
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__7_13_ <= cAMP__27_4_)))
lola: processed formula length: 36
lola: 21 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.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__27_4_ + 1 <= cAMP__7_13_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N100-LTLCardinality-8-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: 10 markings, 9 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__29_7_ <= cAMP__9_4_)))
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__29_7_ <= cAMP__9_4_)))
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.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_4_ + 1 <= cAMP__29_7_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N100-LTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= cAMP__20_16_)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (cAMP__20_16_ <= 1)
lola: processed formula length: 19
lola: 21 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 103 markings, 103 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cAMP__8_27_ <= cAMP__8_20_)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (cAMP__8_20_ + 1 <= cAMP__8_27_)
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= cAMP__10_4_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= cAMP__10_4_))))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 873
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 104 markings, 105 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((cAMP__2_18_ <= cAMP__9_22_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((cAMP__2_18_ <= cAMP__9_22_))))
lola: processed formula length: 40
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 167156 markings, 537622 edges, 33431 markings/sec, 0 secs
lola: 325372 markings, 1067693 edges, 31643 markings/sec, 5 secs
lola: 487406 markings, 1597578 edges, 32407 markings/sec, 10 secs
lola: 650374 markings, 2119771 edges, 32594 markings/sec, 15 secs
lola: 813097 markings, 2641843 edges, 32545 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 933351 markings, 3027287 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__11_19_ <= cAMP__5_7_) U (2 <= cAMP__4_21_)) OR (G ((cAMP__26_18_ <= cAMP__3_7_)) AND F ((2 <= cAMP__4_21_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__11_19_ <= cAMP__5_7_) U (2 <= cAMP__4_21_)) OR (G ((cAMP__26_18_ <= cAMP__3_7_)) AND F ((2 <= cAMP__4_21_)))))
lola: processed formula length: 122
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 103 markings, 103 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__18_27_ <= cAMP__12_9_) U (cAMP__9_22_ <= cAMP__17_27_)) OR (G (F ((cAMP__22_23_ <= cAMP__28_29_))) AND F ((cAMP__9_22_ <= cAMP__17_27_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__18_27_ <= cAMP__12_9_) U (cAMP__9_22_ <= cAMP__17_27_)) OR (G (F ((cAMP__22_23_ <= cAMP__28_29_))) AND F ((cAMP__9_22_ <= cAMP__17_27_)))))
lola: processed formula length: 151
lola: 19 rewrites
lola: closed formula file Diffusion2D-PT-D30N100-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges

FORMULA Diffusion2D-PT-D30N100-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no yes no no no yes yes no no
lola:
preliminary result: no yes no no yes no no no yes no no no yes yes no no
lola: ========================================
lola: memory consumption: 25848 KB
lola: time consumption: 204 seconds

BK_STOP 1527863216767

--------------------
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-D30N100"
export BK_EXAMINATION="LTLCardinality"
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-D30N100.tgz
mv Diffusion2D-PT-D30N100 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-D30N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-blw3-152732474200071"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;