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 59M
-rw-r--r-- 1 mcc users 4.1K 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 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 59M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582800067
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527429948630

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d5n4m1t35 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d5n4m1t35 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3567 seconds
lola: LoLA will run for 3567 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 197632/65536 symbol table entries, 177787 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1024 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: A (F (F (X ((2 <= p_0_1_1_3_3))))) : A (X ((2 <= p_1_3_1_1_1))) : A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1))))) : A ((3 <= p_0_2_0_2_0)) : A (X (G (F ((2 <= p_0_2_1_0_2))))) : A ((p_3_3_0_3_1 <= p_3_1_3_3_1)) : A (X (X (F (X ((2 <= p_1_0_0_0_0)))))) : A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3))) : A (G ((p_0_0_3_2_1 <= p_3_0_0_3_3))) : A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0)))) : A (X (G (F (G ((2 <= p_0_2_0_0_3)))))) : A (F ((G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) U F ((p_1_2_3_0_3 <= p_0_3_2_1_2))))) : A ((1 <= p_3_2_1_3_0)) : A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3))) : A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2))))) : A (F (F (F (F ((p_3_0_3_0_1 <= p_3_0_1_3_3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p_0_2_0_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_0_2_0_2_0)
lola: processed formula length: 18
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_3_3_0_3_1 <= p_3_1_3_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_3_3_0_3_1 <= p_3_1_3_3_1)
lola: processed formula length: 28
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_3_2_1_3_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_3_2_1_3_0)
lola: processed formula length: 18
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p_0_1_1_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p_0_1_1_3_3))))
lola: processed formula length: 30
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 5524 markings, 5523 edges, 1105 markings/sec, 0 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: 9798 markings, 9798 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p_1_3_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p_1_3_1_1_1)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 6448 markings, 6447 edges, 1290 markings/sec, 0 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: 8161 markings, 8161 edges

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((2 <= p_1_0_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((2 <= p_1_0_0_0_0))))))
lola: processed formula length: 38
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 6654 markings, 6653 edges, 1331 markings/sec, 0 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: 8161 markings, 8161 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p_3_1_3_0_2)) U G ((1 <= p_0_1_0_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((1 <= p_3_1_3_0_2)) U G ((1 <= p_0_1_0_3_1))))
lola: processed formula length: 53
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 6824 markings, 6823 edges, 1365 markings/sec, 0 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: 8424 markings, 8424 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: processed formula length: 36
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 6331 markings, 6330 edges, 1266 markings/sec, 0 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: 8976 markings, 8976 edges

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_0_0_3_2_1 <= p_3_0_0_3_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 ((p_0_0_3_2_1 <= p_3_0_0_3_3)))
lola: processed formula length: 36
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: ========================================
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: (p_3_0_0_3_3 + 1 <= p_0_0_3_2_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d5n4m1t35-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: 2 markings, 1 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
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: (p_0_3_3_1_3 + 1 <= p_1_1_1_1_2)
lola: processed formula length: 32
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_3_0_3_0_1 <= p_3_0_1_3_3)))
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: (p_3_0_1_3_3 + 1 <= p_3_0_3_0_1)
lola: processed formula length: 32
lola: 22 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p_0_2_0_0_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p_0_2_0_0_3))))
lola: processed formula length: 30
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 1443 markings, 1442 edges, 289 markings/sec, 0 secs
lola: 2171 markings, 2170 edges, 146 markings/sec, 5 secs
lola: 2772 markings, 2771 edges, 120 markings/sec, 10 secs
lola: 3283 markings, 3282 edges, 102 markings/sec, 15 secs
lola: 3782 markings, 3781 edges, 100 markings/sec, 20 secs
lola: 4202 markings, 4201 edges, 84 markings/sec, 25 secs
lola: 4319 markings, 4318 edges, 23 markings/sec, 30 secs
lola: 4367 markings, 4366 edges, 10 markings/sec, 35 secs
lola: 4469 markings, 4468 edges, 20 markings/sec, 40 secs
lola: 4688 markings, 4687 edges, 44 markings/sec, 45 secs
lola: 4904 markings, 4903 edges, 43 markings/sec, 50 secs
lola: 5022 markings, 5021 edges, 24 markings/sec, 55 secs
lola: 5160 markings, 5159 edges, 28 markings/sec, 60 secs
lola: 5251 markings, 5250 edges, 18 markings/sec, 65 secs
lola: 5311 markings, 5310 edges, 12 markings/sec, 70 secs
lola: 5422 markings, 5421 edges, 22 markings/sec, 75 secs
lola: 5562 markings, 5561 edges, 28 markings/sec, 80 secs
lola: 5690 markings, 5689 edges, 26 markings/sec, 85 secs
lola: 5794 markings, 5793 edges, 21 markings/sec, 90 secs
lola: 5896 markings, 5895 edges, 20 markings/sec, 95 secs
lola: 6040 markings, 6039 edges, 29 markings/sec, 100 secs
lola: 6264 markings, 6263 edges, 45 markings/sec, 105 secs
lola: 6474 markings, 6473 edges, 42 markings/sec, 110 secs
lola: 6699 markings, 6698 edges, 45 markings/sec, 115 secs
lola: 6923 markings, 6922 edges, 45 markings/sec, 120 secs
lola: 7189 markings, 7200 edges, 53 markings/sec, 125 secs
lola: 7492 markings, 7528 edges, 61 markings/sec, 130 secs
lola: 7801 markings, 7863 edges, 62 markings/sec, 135 secs
lola: 8101 markings, 8188 edges, 60 markings/sec, 140 secs
lola: 8405 markings, 8517 edges, 61 markings/sec, 145 secs
lola: 8713 markings, 8851 edges, 62 markings/sec, 150 secs
lola: 9013 markings, 9176 edges, 60 markings/sec, 155 secs
lola: 9271 markings, 9450 edges, 52 markings/sec, 160 secs
lola: 9425 markings, 9604 edges, 31 markings/sec, 165 secs
lola: 9553 markings, 9733 edges, 26 markings/sec, 170 secs
lola: 9763 markings, 9943 edges, 42 markings/sec, 175 secs
lola: 9964 markings, 10146 edges, 40 markings/sec, 180 secs
lola: 10263 markings, 10463 edges, 60 markings/sec, 185 secs
lola: 10583 markings, 10815 edges, 64 markings/sec, 190 secs
lola: 10706 markings, 10942 edges, 25 markings/sec, 195 secs
lola: 10985 markings, 11239 edges, 56 markings/sec, 200 secs
lola: 11321 markings, 11609 edges, 67 markings/sec, 205 secs
lola: 11661 markings, 11983 edges, 68 markings/sec, 210 secs
lola: 11912 markings, 12244 edges, 50 markings/sec, 215 secs
lola: 12081 markings, 12413 edges, 34 markings/sec, 220 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: 12099 markings, 12433 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p_0_2_1_0_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p_0_2_1_0_2))))
lola: processed formula length: 30
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 1506 markings, 1505 edges, 301 markings/sec, 0 secs
lola: 2259 markings, 2258 edges, 151 markings/sec, 5 secs
lola: 2834 markings, 2833 edges, 115 markings/sec, 10 secs
lola: 3206 markings, 3205 edges, 74 markings/sec, 15 secs
lola: 3275 markings, 3274 edges, 14 markings/sec, 20 secs
lola: 3325 markings, 3324 edges, 10 markings/sec, 25 secs
lola: 3375 markings, 3374 edges, 10 markings/sec, 30 secs
lola: 3466 markings, 3465 edges, 18 markings/sec, 35 secs
lola: 3592 markings, 3591 edges, 25 markings/sec, 40 secs
lola: 3738 markings, 3737 edges, 29 markings/sec, 45 secs
lola: 3844 markings, 3843 edges, 21 markings/sec, 50 secs
lola: 3876 markings, 3875 edges, 6 markings/sec, 55 secs
lola: 3963 markings, 3962 edges, 17 markings/sec, 60 secs
lola: 4119 markings, 4118 edges, 31 markings/sec, 65 secs
lola: 4269 markings, 4268 edges, 30 markings/sec, 70 secs
lola: 4425 markings, 4424 edges, 31 markings/sec, 75 secs
lola: 4595 markings, 4594 edges, 34 markings/sec, 80 secs
lola: 4742 markings, 4741 edges, 29 markings/sec, 85 secs
lola: 4843 markings, 4842 edges, 20 markings/sec, 90 secs
lola: 4989 markings, 4988 edges, 29 markings/sec, 95 secs
lola: 5094 markings, 5093 edges, 21 markings/sec, 100 secs
lola: 5157 markings, 5156 edges, 13 markings/sec, 105 secs
lola: 5211 markings, 5210 edges, 11 markings/sec, 110 secs
lola: 5275 markings, 5274 edges, 13 markings/sec, 115 secs
lola: 5400 markings, 5399 edges, 25 markings/sec, 120 secs
lola: 5536 markings, 5535 edges, 27 markings/sec, 125 secs
lola: 5669 markings, 5668 edges, 27 markings/sec, 130 secs
lola: 5797 markings, 5796 edges, 26 markings/sec, 135 secs
lola: 5927 markings, 5926 edges, 26 markings/sec, 140 secs
lola: 6068 markings, 6067 edges, 28 markings/sec, 145 secs
lola: 6293 markings, 6292 edges, 45 markings/sec, 150 secs
lola: 6548 markings, 6547 edges, 51 markings/sec, 155 secs
lola: 6685 markings, 6684 edges, 27 markings/sec, 160 secs
lola: 6910 markings, 6909 edges, 45 markings/sec, 165 secs
lola: 7064 markings, 7063 edges, 31 markings/sec, 170 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: 7144 markings, 7144 edges
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 969 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p_1_2_3_0_3 <= p_0_3_2_1_2)) OR (G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) AND F ((p_1_2_3_0_3 <= p_0_3_2_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((p_1_2_3_0_3 <= p_0_3_2_1_2)) OR (G ((p_3_0_0_0_1 <= p_0_1_1_0_0)) AND F ((p_1_2_3_0_3 <= p_0_3_2_1_2))))))
lola: processed formula length: 117
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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: 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
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p_1_3_2_0_3) U (3 <= p_3_1_3_0_1)) U ((1 <= p_2_0_0_2_3) U (p_3_0_1_0_3 <= p_3_2_0_1_0))))
lola: processed formula length: 101
lola: 20 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2907 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p_0_0_1_1_0 <= p_3_0_0_0_2)))) AND A (G (((2 <= p_1_1_3_1_3) OR (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2907 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p_1_1_3_1_3) OR (p_0_0_1_1_0 <= p_3_0_0_0_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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((2 <= p_1_1_3_1_3) OR (p_0_0_1_1_0 <= p_3_0_0_0_2))))
lola: processed formula length: 60
lola: 25 rewrites
lola: closed formula file NeighborGrid-PT-d5n4m1t35-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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p_1_1_3_1_3 <= 1) AND (p_3_0_0_0_2 + 1 <= p_0_0_1_1_0))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no yes no yes yes no no yes
lola:
preliminary result: no no no no no yes no yes no yes no yes yes no no yes
lola: memory consumption: 184356 KB
lola: time consumption: 660 seconds

BK_STOP 1527430611495

--------------------
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="NeighborGrid-PT-d5n4m1t35"
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/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 NeighborGrid-PT-d5n4m1t35, 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 r256-csrt-152732582800067"
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 ;