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 irma4mcc-structural
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 r259-csrt-152732584600067
=====================================================================

--------------------
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 1527462461716


BK_STOP 1527463851467

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeighborGrid-PT-d5n4m1t35 as instance name.
Using NeighborGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 884612, 'Memory': 4190.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola NeighborGrid-PT-d5n4m1t35...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
NeighborGrid-PT-d5n4m1t35: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d5n4m1t35: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 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: 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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((2 <= p_0_1_1_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= p_0_1_1_3_3))))
lola: processed formula: A (F (X ((2 <= p_0_1_1_3_3))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4639 markings, 4638 edges, 928 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
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\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p_1_3_1_1_1)))
lola: processed formula: A (X ((2 <= p_1_3_1_1_1)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5654 markings, 5653 edges, 1131 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: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: processed formula: A ((X ((1 <= p_3_1_3_0_2)) U G (G ((1 <= p_0_1_0_3_1)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5543 markings, 5542 edges, 1109 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: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((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: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
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: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: processed formula: A (X (G (F ((2 <= p_0_2_1_0_2)))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5181 markings, 5180 edges, 1036 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: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((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: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
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: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: processed formula: A (X (X (F (X ((2 <= p_1_0_0_0_0))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5423 markings, 5422 edges, 1085 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: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: processed formula: A (F ((p_1_1_1_1_2 <= p_0_3_3_1_3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
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: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4092 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
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\xfcchi-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: 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: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((2 <= p_0_2_0_0_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p_0_2_0_0_3)))))
lola: processed formula: A (X (F (G ((2 <= p_0_2_0_0_3)))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5222 markings, 5221 edges, 1044 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: 8162 markings, 8163 edges
lola: ========================================
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: 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)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: 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)))))
lola: processed formula: 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)))))
lola: processed formula length: 77
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 12 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((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: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
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: ========================================
lola: subprocess 13 will run for 1164 seconds at most (--localtimelimit=-1)
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\xfcchi-Automaton
lola: processed formula: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: processed formula: A (X ((p_0_3_1_3_3 <= p_2_0_3_2_3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5276 markings, 5275 edges, 1055 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
lola: ========================================
lola: subprocess 14 will run for 1742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: processed formula: A (G (G (((2 <= p_1_1_3_1_3) U (p_0_0_1_1_0 <= p_3_0_0_0_2)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 745 markings, 744 edges, 149 markings/sec, 0 secs
lola: 1001 markings, 1000 edges, 51 markings/sec, 5 secs
lola: 1070 markings, 1069 edges, 14 markings/sec, 10 secs
lola: 1086 markings, 1085 edges, 3 markings/sec, 15 secs
lola: 1096 markings, 1095 edges, 2 markings/sec, 20 secs
lola: 1118 markings, 1117 edges, 4 markings/sec, 25 secs
lola: 1142 markings, 1141 edges, 5 markings/sec, 30 secs
lola: 1162 markings, 1161 edges, 4 markings/sec, 35 secs
lola: 1195 markings, 1194 edges, 7 markings/sec, 40 secs
lola: 1229 markings, 1228 edges, 7 markings/sec, 45 secs
lola: 1240 markings, 1239 edges, 2 markings/sec, 50 secs
lola: 1258 markings, 1257 edges, 4 markings/sec, 55 secs
lola: 1286 markings, 1285 edges, 6 markings/sec, 60 secs
lola: 1309 markings, 1308 edges, 5 markings/sec, 65 secs
lola: 1343 markings, 1342 edges, 7 markings/sec, 70 secs
lola: 1367 markings, 1366 edges, 5 markings/sec, 75 secs
lola: 1384 markings, 1383 edges, 3 markings/sec, 80 secs
lola: 1398 markings, 1397 edges, 3 markings/sec, 85 secs
lola: 1417 markings, 1416 edges, 4 markings/sec, 90 secs
lola: 1440 markings, 1439 edges, 5 markings/sec, 95 secs
lola: 1462 markings, 1461 edges, 4 markings/sec, 100 secs
lola: 1483 markings, 1482 edges, 4 markings/sec, 105 secs
lola: 1493 markings, 1492 edges, 2 markings/sec, 110 secs
lola: 1507 markings, 1506 edges, 3 markings/sec, 115 secs
lola: 1526 markings, 1525 edges, 4 markings/sec, 120 secs
lola: 1542 markings, 1541 edges, 3 markings/sec, 125 secs
lola: 1574 markings, 1573 edges, 6 markings/sec, 130 secs
lola: 1588 markings, 1587 edges, 3 markings/sec, 135 secs
lola: 1602 markings, 1601 edges, 3 markings/sec, 140 secs
lola: 1631 markings, 1630 edges, 6 markings/sec, 145 secs
lola: 1661 markings, 1660 edges, 6 markings/sec, 150 secs
lola: 1693 markings, 1692 edges, 6 markings/sec, 155 secs
lola: 1725 markings, 1724 edges, 6 markings/sec, 160 secs
lola: 1746 markings, 1745 edges, 4 markings/sec, 165 secs
lola: 1769 markings, 1768 edges, 5 markings/sec, 170 secs
lola: 1791 markings, 1790 edges, 4 markings/sec, 175 secs
lola: 1814 markings, 1813 edges, 5 markings/sec, 180 secs
lola: 1836 markings, 1835 edges, 4 markings/sec, 185 secs
lola: 1859 markings, 1858 edges, 5 markings/sec, 190 secs
lola: 1878 markings, 1877 edges, 4 markings/sec, 195 secs
lola: 1899 markings, 1898 edges, 4 markings/sec, 200 secs
lola: 1921 markings, 1920 edges, 4 markings/sec, 205 secs
lola: 1941 markings, 1940 edges, 4 markings/sec, 210 secs
lola: 1966 markings, 1965 edges, 5 markings/sec, 215 secs
lola: 1986 markings, 1985 edges, 4 markings/sec, 220 secs
lola: 2007 markings, 2006 edges, 4 markings/sec, 225 secs
lola: 2029 markings, 2028 edges, 4 markings/sec, 230 secs
lola: 2049 markings, 2048 edges, 4 markings/sec, 235 secs
lola: 2074 markings, 2073 edges, 5 markings/sec, 240 secs
lola: 2093 markings, 2092 edges, 4 markings/sec, 245 secs
lola: 2115 markings, 2114 edges, 4 markings/sec, 250 secs
lola: 2137 markings, 2136 edges, 4 markings/sec, 255 secs
lola: 2156 markings, 2155 edges, 4 markings/sec, 260 secs
lola: 2178 markings, 2177 edges, 4 markings/sec, 265 secs
lola: 2201 markings, 2200 edges, 5 markings/sec, 270 secs
lola: 2220 markings, 2219 edges, 4 markings/sec, 275 secs
lola: 2241 markings, 2240 edges, 4 markings/sec, 280 secs
lola: 2270 markings, 2269 edges, 6 markings/sec, 285 secs
lola: 2294 markings, 2293 edges, 5 markings/sec, 290 secs
lola: 2317 markings, 2316 edges, 5 markings/sec, 295 secs
lola: 2352 markings, 2351 edges, 7 markings/sec, 300 secs
lola: 2377 markings, 2376 edges, 5 markings/sec, 305 secs
lola: 2391 markings, 2390 edges, 3 markings/sec, 310 secs
lola: 2404 markings, 2403 edges, 3 markings/sec, 315 secs
lola: 2423 markings, 2422 edges, 4 markings/sec, 320 secs
lola: 2452 markings, 2451 edges, 6 markings/sec, 325 secs
lola: 2477 markings, 2476 edges, 5 markings/sec, 330 secs
lola: 2503 markings, 2502 edges, 5 markings/sec, 335 secs
lola: 2533 markings, 2532 edges, 6 markings/sec, 340 secs
lola: 2562 markings, 2561 edges, 6 markings/sec, 345 secs
lola: 2590 markings, 2589 edges, 6 markings/sec, 350 secs
lola: 2620 markings, 2619 edges, 6 markings/sec, 355 secs
lola: 2635 markings, 2634 edges, 3 markings/sec, 360 secs
lola: 2671 markings, 2670 edges, 7 markings/sec, 365 secs
lola: 2686 markings, 2685 edges, 3 markings/sec, 370 secs
lola: 2705 markings, 2704 edges, 4 markings/sec, 375 secs
lola: 2719 markings, 2718 edges, 3 markings/sec, 380 secs
lola: 2737 markings, 2736 edges, 4 markings/sec, 385 secs
lola: 2759 markings, 2758 edges, 4 markings/sec, 390 secs
lola: 2775 markings, 2774 edges, 3 markings/sec, 395 secs
lola: 2794 markings, 2793 edges, 4 markings/sec, 400 secs
lola: 2831 markings, 2830 edges, 7 markings/sec, 405 secs
lola: 2859 markings, 2858 edges, 6 markings/sec, 410 secs
lola: 2894 markings, 2893 edges, 7 markings/sec, 415 secs
lola: 2922 markings, 2921 edges, 6 markings/sec, 420 secs
lola: 2954 markings, 2953 edges, 6 markings/sec, 425 secs
lola: 2991 markings, 2990 edges, 7 markings/sec, 430 secs
lola: 3013 markings, 3012 edges, 4 markings/sec, 435 secs
lola: 3039 markings, 3038 edges, 5 markings/sec, 440 secs
lola: 3055 markings, 3054 edges, 3 markings/sec, 445 secs
lola: 3072 markings, 3071 edges, 3 markings/sec, 450 secs
lola: 3095 markings, 3094 edges, 5 markings/sec, 455 secs
lola: 3129 markings, 3128 edges, 7 markings/sec, 460 secs
lola: 3155 markings, 3154 edges, 5 markings/sec, 465 secs
lola: 3181 markings, 3180 edges, 5 markings/sec, 470 secs
lola: 3215 markings, 3214 edges, 7 markings/sec, 475 secs
lola: 3251 markings, 3250 edges, 7 markings/sec, 480 secs
lola: 3290 markings, 3289 edges, 8 markings/sec, 485 secs
lola: 3319 markings, 3318 edges, 6 markings/sec, 490 secs
lola: 3340 markings, 3339 edges, 4 markings/sec, 495 secs
lola: 3379 markings, 3378 edges, 8 markings/sec, 500 secs
lola: 3407 markings, 3406 edges, 6 markings/sec, 505 secs
lola: 3434 markings, 3433 edges, 5 markings/sec, 510 secs
lola: 3448 markings, 3447 edges, 3 markings/sec, 515 secs
lola: 3467 markings, 3466 edges, 4 markings/sec, 520 secs
lola: 3481 markings, 3480 edges, 3 markings/sec, 525 secs
lola: 3500 markings, 3499 edges, 4 markings/sec, 530 secs
lola: 3518 markings, 3517 edges, 4 markings/sec, 535 secs
lola: 3548 markings, 3547 edges, 6 markings/sec, 540 secs
lola: 3566 markings, 3565 edges, 4 markings/sec, 545 secs
lola: 3581 markings, 3580 edges, 3 markings/sec, 550 secs
lola: 3597 markings, 3596 edges, 3 markings/sec, 555 secs
lola: 3612 markings, 3611 edges, 3 markings/sec, 560 secs
lola: 3627 markings, 3626 edges, 3 markings/sec, 565 secs
lola: 3643 markings, 3642 edges, 3 markings/sec, 570 secs
lola: 3664 markings, 3663 edges, 4 markings/sec, 575 secs
lola: 3679 markings, 3678 edges, 3 markings/sec, 580 secs
lola: 3695 markings, 3694 edges, 3 markings/sec, 585 secs
lola: 3721 markings, 3720 edges, 5 markings/sec, 590 secs
lola: 3746 markings, 3745 edges, 5 markings/sec, 595 secs
lola: 3773 markings, 3772 edges, 5 markings/sec, 600 secs
lola: 3801 markings, 3800 edges, 6 markings/sec, 605 secs
lola: 3827 markings, 3826 edges, 5 markings/sec, 610 secs
lola: 3855 markings, 3854 edges, 6 markings/sec, 615 secs
lola: 3895 markings, 3894 edges, 8 markings/sec, 620 secs
lola: 3928 markings, 3927 edges, 7 markings/sec, 625 secs
lola: 3960 markings, 3959 edges, 6 markings/sec, 630 secs
lola: 3976 markings, 3975 edges, 3 markings/sec, 635 secs
lola: 3993 markings, 3992 edges, 3 markings/sec, 640 secs
lola: 4028 markings, 4027 edges, 7 markings/sec, 645 secs
lola: 4082 markings, 4081 edges, 11 markings/sec, 650 secs
lola: 4127 markings, 4126 edges, 9 markings/sec, 655 secs
lola: 4168 markings, 4167 edges, 8 markings/sec, 660 secs
lola: 4198 markings, 4197 edges, 6 markings/sec, 665 secs
lola: 4228 markings, 4227 edges, 6 markings/sec, 670 secs
lola: 4247 markings, 4246 edges, 4 markings/sec, 675 secs
lola: 4265 markings, 4264 edges, 4 markings/sec, 680 secs
lola: 4283 markings, 4282 edges, 4 markings/sec, 685 secs
lola: 4301 markings, 4300 edges, 4 markings/sec, 690 secs
lola: 4320 markings, 4319 edges, 4 markings/sec, 695 secs
lola: 4339 markings, 4338 edges, 4 markings/sec, 700 secs
lola: 4357 markings, 4356 edges, 4 markings/sec, 705 secs
lola: 4375 markings, 4374 edges, 4 markings/sec, 710 secs
lola: 4394 markings, 4393 edges, 4 markings/sec, 715 secs
lola: 4413 markings, 4412 edges, 4 markings/sec, 720 secs
lola: 4431 markings, 4430 edges, 4 markings/sec, 725 secs
lola: 4459 markings, 4458 edges, 6 markings/sec, 730 secs
lola: 4505 markings, 4504 edges, 9 markings/sec, 735 secs
lola: 4547 markings, 4546 edges, 8 markings/sec, 740 secs
lola: 4572 markings, 4571 edges, 5 markings/sec, 745 secs
lola: 4601 markings, 4600 edges, 6 markings/sec, 750 secs
lola: 4634 markings, 4633 edges, 7 markings/sec, 755 secs
lola: 4664 markings, 4663 edges, 6 markings/sec, 760 secs
lola: 4696 markings, 4695 edges, 6 markings/sec, 765 secs
lola: 4726 markings, 4725 edges, 6 markings/sec, 770 secs
lola: 4756 markings, 4755 edges, 6 markings/sec, 775 secs
lola: 4788 markings, 4787 edges, 6 markings/sec, 780 secs
lola: 4832 markings, 4831 edges, 9 markings/sec, 785 secs
lola: 4884 markings, 4883 edges, 10 markings/sec, 790 secs
lola: 4923 markings, 4922 edges, 8 markings/sec, 795 secs
lola: 4959 markings, 4958 edges, 7 markings/sec, 800 secs
lola: 4995 markings, 4994 edges, 7 markings/sec, 805 secs
lola: 5030 markings, 5029 edges, 7 markings/sec, 810 secs
lola: 5068 markings, 5067 edges, 8 markings/sec, 815 secs
lola: 5105 markings, 5104 edges, 7 markings/sec, 820 secs
lola: 5144 markings, 5143 edges, 8 markings/sec, 825 secs
lola: 5183 markings, 5182 edges, 8 markings/sec, 830 secs
lola: 5220 markings, 5219 edges, 7 markings/sec, 835 secs
lola: 5262 markings, 5261 edges, 8 markings/sec, 840 secs
lola: 5296 markings, 5295 edges, 7 markings/sec, 845 secs
lola: 5318 markings, 5317 edges, 4 markings/sec, 850 secs
lola: 5342 markings, 5341 edges, 5 markings/sec, 855 secs
lola: 5393 markings, 5392 edges, 10 markings/sec, 860 secs
lola: 5444 markings, 5443 edges, 10 markings/sec, 865 secs
lola: 5508 markings, 5507 edges, 13 markings/sec, 870 secs
lola: 5562 markings, 5561 edges, 11 markings/sec, 875 secs
lola: 5616 markings, 5615 edges, 11 markings/sec, 880 secs
lola: 5661 markings, 5660 edges, 9 markings/sec, 885 secs
lola: 5700 markings, 5699 edges, 8 markings/sec, 890 secs
lola: 5763 markings, 5762 edges, 13 markings/sec, 895 secs
lola: 5819 markings, 5818 edges, 11 markings/sec, 900 secs
lola: 5872 markings, 5871 edges, 11 markings/sec, 905 secs
lola: 5931 markings, 5930 edges, 12 markings/sec, 910 secs
lola: 5995 markings, 5994 edges, 13 markings/sec, 915 secs
lola: 6050 markings, 6049 edges, 11 markings/sec, 920 secs
lola: 6110 markings, 6109 edges, 12 markings/sec, 925 secs
lola: 6169 markings, 6168 edges, 12 markings/sec, 930 secs
lola: 6251 markings, 6250 edges, 16 markings/sec, 935 secs
lola: 6338 markings, 6337 edges, 17 markings/sec, 940 secs
lola: 6408 markings, 6407 edges, 14 markings/sec, 945 secs
lola: 6477 markings, 6476 edges, 14 markings/sec, 950 secs
lola: 6548 markings, 6547 edges, 14 markings/sec, 955 secs
lola: 6611 markings, 6610 edges, 13 markings/sec, 960 secs
lola: 6670 markings, 6669 edges, 12 markings/sec, 965 secs
lola: 6728 markings, 6727 edges, 12 markings/sec, 970 secs
lola: 6815 markings, 6814 edges, 17 markings/sec, 975 secs
lola: 6855 markings, 6854 edges, 8 markings/sec, 980 secs
lola: 6884 markings, 6883 edges, 6 markings/sec, 985 secs
lola: 6914 markings, 6913 edges, 6 markings/sec, 990 secs
lola: 6943 markings, 6942 edges, 6 markings/sec, 995 secs
lola: 6973 markings, 6972 edges, 6 markings/sec, 1000 secs
lola: 7004 markings, 7003 edges, 6 markings/sec, 1005 secs
lola: 7035 markings, 7034 edges, 6 markings/sec, 1010 secs
lola: 7066 markings, 7065 edges, 6 markings/sec, 1015 secs
lola: 7106 markings, 7105 edges, 8 markings/sec, 1020 secs
lola: 7160 markings, 7159 edges, 11 markings/sec, 1025 secs
lola: 7211 markings, 7210 edges, 10 markings/sec, 1030 secs
lola: 7349 markings, 7348 edges, 28 markings/sec, 1035 secs
lola: 7483 markings, 7482 edges, 27 markings/sec, 1040 secs
lola: 7613 markings, 7612 edges, 26 markings/sec, 1045 secs
lola: 7741 markings, 7740 edges, 26 markings/sec, 1050 secs
lola: 7873 markings, 7872 edges, 26 markings/sec, 1055 secs
lola: 8011 markings, 8010 edges, 28 markings/sec, 1060 secs
lola: 8146 markings, 8145 edges, 27 markings/sec, 1065 secs
lola: 8276 markings, 8275 edges, 26 markings/sec, 1070 secs
lola: 8406 markings, 8405 edges, 26 markings/sec, 1075 secs
lola: 8547 markings, 8546 edges, 28 markings/sec, 1080 secs
lola: 8681 markings, 8680 edges, 27 markings/sec, 1085 secs
lola: 8823 markings, 8822 edges, 28 markings/sec, 1090 secs
lola: 8965 markings, 8964 edges, 28 markings/sec, 1095 secs
lola: 9095 markings, 9094 edges, 26 markings/sec, 1100 secs
lola: 9189 markings, 9188 edges, 19 markings/sec, 1105 secs
lola: 9277 markings, 9276 edges, 18 markings/sec, 1110 secs
lola: 9357 markings, 9356 edges, 16 markings/sec, 1115 secs
lola: 9462 markings, 9470 edges, 21 markings/sec, 1120 secs
lola: 9560 markings, 9576 edges, 20 markings/sec, 1125 secs
lola: 9656 markings, 9680 edges, 19 markings/sec, 1130 secs
lola: 9757 markings, 9789 edges, 20 markings/sec, 1135 secs
lola: 9860 markings, 9901 edges, 21 markings/sec, 1140 secs
lola: 9954 markings, 10001 edges, 19 markings/sec, 1145 secs
lola: 10047 markings, 10096 edges, 19 markings/sec, 1150 secs
lola: 10099 markings, 10148 edges, 10 markings/sec, 1155 secs
lola: 10141 markings, 10190 edges, 8 markings/sec, 1160 secs
lola: 10209 markings, 10258 edges, 14 markings/sec, 1165 secs
lola: 10322 markings, 10371 edges, 23 markings/sec, 1170 secs
lola: 10444 markings, 10493 edges, 24 markings/sec, 1175 secs
lola: 10559 markings, 10608 edges, 23 markings/sec, 1180 secs
lola: 10673 markings, 10722 edges, 23 markings/sec, 1185 secs
lola: 10791 markings, 10840 edges, 24 markings/sec, 1190 secs
lola: 10904 markings, 10953 edges, 23 markings/sec, 1195 secs
lola: 11026 markings, 11075 edges, 24 markings/sec, 1200 secs
lola: 11152 markings, 11201 edges, 25 markings/sec, 1205 secs
lola: 11275 markings, 11324 edges, 25 markings/sec, 1210 secs
lola: 11448 markings, 11497 edges, 35 markings/sec, 1215 secs
lola: 11546 markings, 11595 edges, 20 markings/sec, 1220 secs
lola: 11651 markings, 11700 edges, 21 markings/sec, 1225 secs
lola: 11802 markings, 11851 edges, 30 markings/sec, 1230 secs
lola: 11902 markings, 11951 edges, 20 markings/sec, 1235 secs
lola: 11991 markings, 12040 edges, 18 markings/sec, 1240 secs
lola: 12105 markings, 12154 edges, 23 markings/sec, 1245 secs
lola: 12243 markings, 12292 edges, 28 markings/sec, 1250 secs
lola: 12385 markings, 12434 edges, 28 markings/sec, 1255 secs
lola: 12531 markings, 12580 edges, 29 markings/sec, 1260 secs
lola: 12688 markings, 12737 edges, 31 markings/sec, 1265 secs
lola: 12835 markings, 12884 edges, 29 markings/sec, 1270 secs
lola: 12976 markings, 13025 edges, 28 markings/sec, 1275 secs
lola: 13112 markings, 13161 edges, 27 markings/sec, 1280 secs
lola: 13269 markings, 13318 edges, 31 markings/sec, 1285 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: 13274 markings, 13324 edges
lola: ========================================
lola: subprocess 15 will run for 2194 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (F ((p_3_0_3_0_1 <= p_3_0_1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_3_0_3_0_1 <= p_3_0_1_3_3)))
lola: processed formula: A (F ((p_3_0_3_0_1 <= p_3_0_1_3_3)))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 31 unused bits
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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no yes no yes yes no no yes
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="irma4mcc-structural"
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 irma4mcc-structural"
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 r259-csrt-152732584600067"
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 ;