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 mcc4mcc-full
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 r262-csrt-152732586700067
=====================================================================

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


BK_STOP 1527526544105

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 stderr -----
----- Start make result stdout -----
LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 4684 markings, 4683 edges, 937 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: 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: ========================================
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: 5802 markings, 5801 edges, 1160 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: 5597 markings, 5596 edges, 1119 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: 5399 markings, 5398 edges, 1080 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: 6196 markings, 6195 edges, 1239 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 389 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: 5600 markings, 5599 edges, 1120 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: 5186 markings, 5185 edges, 1037 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 1743 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: 737 markings, 736 edges, 147 markings/sec, 0 secs
lola: 998 markings, 997 edges, 52 markings/sec, 5 secs
lola: 1072 markings, 1071 edges, 15 markings/sec, 10 secs
lola: 1086 markings, 1085 edges, 3 markings/sec, 15 secs
lola: 1097 markings, 1096 edges, 2 markings/sec, 20 secs
lola: 1124 markings, 1123 edges, 5 markings/sec, 25 secs
lola: 1148 markings, 1147 edges, 5 markings/sec, 30 secs
lola: 1176 markings, 1175 edges, 6 markings/sec, 35 secs
lola: 1199 markings, 1198 edges, 5 markings/sec, 40 secs
lola: 1231 markings, 1230 edges, 6 markings/sec, 45 secs
lola: 1243 markings, 1242 edges, 2 markings/sec, 50 secs
lola: 1260 markings, 1259 edges, 3 markings/sec, 55 secs
lola: 1299 markings, 1298 edges, 8 markings/sec, 60 secs
lola: 1317 markings, 1316 edges, 4 markings/sec, 65 secs
lola: 1355 markings, 1354 edges, 8 markings/sec, 70 secs
lola: 1369 markings, 1368 edges, 3 markings/sec, 75 secs
lola: 1387 markings, 1386 edges, 4 markings/sec, 80 secs
lola: 1405 markings, 1404 edges, 4 markings/sec, 85 secs
lola: 1426 markings, 1425 edges, 4 markings/sec, 90 secs
lola: 1445 markings, 1444 edges, 4 markings/sec, 95 secs
lola: 1466 markings, 1465 edges, 4 markings/sec, 100 secs
lola: 1485 markings, 1484 edges, 4 markings/sec, 105 secs
lola: 1494 markings, 1493 edges, 2 markings/sec, 110 secs
lola: 1509 markings, 1508 edges, 3 markings/sec, 115 secs
lola: 1526 markings, 1525 edges, 3 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: 1589 markings, 1588 edges, 3 markings/sec, 135 secs
lola: 1605 markings, 1604 edges, 3 markings/sec, 140 secs
lola: 1633 markings, 1632 edges, 6 markings/sec, 145 secs
lola: 1665 markings, 1664 edges, 6 markings/sec, 150 secs
lola: 1695 markings, 1694 edges, 6 markings/sec, 155 secs
lola: 1728 markings, 1727 edges, 7 markings/sec, 160 secs
lola: 1751 markings, 1750 edges, 5 markings/sec, 165 secs
lola: 1777 markings, 1776 edges, 5 markings/sec, 170 secs
lola: 1797 markings, 1796 edges, 4 markings/sec, 175 secs
lola: 1823 markings, 1822 edges, 5 markings/sec, 180 secs
lola: 1845 markings, 1844 edges, 4 markings/sec, 185 secs
lola: 1869 markings, 1868 edges, 5 markings/sec, 190 secs
lola: 1894 markings, 1893 edges, 5 markings/sec, 195 secs
lola: 1916 markings, 1915 edges, 4 markings/sec, 200 secs
lola: 1939 markings, 1938 edges, 5 markings/sec, 205 secs
lola: 1958 markings, 1957 edges, 4 markings/sec, 210 secs
lola: 1980 markings, 1979 edges, 4 markings/sec, 215 secs
lola: 2003 markings, 2002 edges, 5 markings/sec, 220 secs
lola: 2022 markings, 2021 edges, 4 markings/sec, 225 secs
lola: 2047 markings, 2046 edges, 5 markings/sec, 230 secs
lola: 2067 markings, 2066 edges, 4 markings/sec, 235 secs
lola: 2091 markings, 2090 edges, 5 markings/sec, 240 secs
lola: 2111 markings, 2110 edges, 4 markings/sec, 245 secs
lola: 2133 markings, 2132 edges, 4 markings/sec, 250 secs
lola: 2155 markings, 2154 edges, 4 markings/sec, 255 secs
lola: 2175 markings, 2174 edges, 4 markings/sec, 260 secs
lola: 2200 markings, 2199 edges, 5 markings/sec, 265 secs
lola: 2219 markings, 2218 edges, 4 markings/sec, 270 secs
lola: 2243 markings, 2242 edges, 5 markings/sec, 275 secs
lola: 2270 markings, 2269 edges, 5 markings/sec, 280 secs
lola: 2295 markings, 2294 edges, 5 markings/sec, 285 secs
lola: 2321 markings, 2320 edges, 5 markings/sec, 290 secs
lola: 2358 markings, 2357 edges, 7 markings/sec, 295 secs
lola: 2381 markings, 2380 edges, 5 markings/sec, 300 secs
lola: 2393 markings, 2392 edges, 2 markings/sec, 305 secs
lola: 2411 markings, 2410 edges, 4 markings/sec, 310 secs
lola: 2430 markings, 2429 edges, 4 markings/sec, 315 secs
lola: 2458 markings, 2457 edges, 6 markings/sec, 320 secs
lola: 2483 markings, 2482 edges, 5 markings/sec, 325 secs
lola: 2515 markings, 2514 edges, 6 markings/sec, 330 secs
lola: 2539 markings, 2538 edges, 5 markings/sec, 335 secs
lola: 2568 markings, 2567 edges, 6 markings/sec, 340 secs
lola: 2599 markings, 2598 edges, 6 markings/sec, 345 secs
lola: 2624 markings, 2623 edges, 5 markings/sec, 350 secs
lola: 2644 markings, 2643 edges, 4 markings/sec, 355 secs
lola: 2674 markings, 2673 edges, 6 markings/sec, 360 secs
lola: 2694 markings, 2693 edges, 4 markings/sec, 365 secs
lola: 2711 markings, 2710 edges, 3 markings/sec, 370 secs
lola: 2723 markings, 2722 edges, 2 markings/sec, 375 secs
lola: 2748 markings, 2747 edges, 5 markings/sec, 380 secs
lola: 2763 markings, 2762 edges, 3 markings/sec, 385 secs
lola: 2782 markings, 2781 edges, 4 markings/sec, 390 secs
lola: 2807 markings, 2806 edges, 5 markings/sec, 395 secs
lola: 2841 markings, 2840 edges, 7 markings/sec, 400 secs
lola: 2877 markings, 2876 edges, 7 markings/sec, 405 secs
lola: 2912 markings, 2911 edges, 7 markings/sec, 410 secs
lola: 2938 markings, 2937 edges, 5 markings/sec, 415 secs
lola: 2976 markings, 2975 edges, 8 markings/sec, 420 secs
lola: 3004 markings, 3003 edges, 6 markings/sec, 425 secs
lola: 3033 markings, 3032 edges, 6 markings/sec, 430 secs
lola: 3049 markings, 3048 edges, 3 markings/sec, 435 secs
lola: 3067 markings, 3066 edges, 4 markings/sec, 440 secs
lola: 3091 markings, 3090 edges, 5 markings/sec, 445 secs
lola: 3117 markings, 3116 edges, 5 markings/sec, 450 secs
lola: 3150 markings, 3149 edges, 7 markings/sec, 455 secs
lola: 3176 markings, 3175 edges, 5 markings/sec, 460 secs
lola: 3208 markings, 3207 edges, 6 markings/sec, 465 secs
lola: 3245 markings, 3244 edges, 7 markings/sec, 470 secs
lola: 3287 markings, 3286 edges, 8 markings/sec, 475 secs
lola: 3319 markings, 3318 edges, 6 markings/sec, 480 secs
lola: 3345 markings, 3344 edges, 5 markings/sec, 485 secs
lola: 3385 markings, 3384 edges, 8 markings/sec, 490 secs
lola: 3410 markings, 3409 edges, 5 markings/sec, 495 secs
lola: 3438 markings, 3437 edges, 6 markings/sec, 500 secs
lola: 3453 markings, 3452 edges, 3 markings/sec, 505 secs
lola: 3473 markings, 3472 edges, 4 markings/sec, 510 secs
lola: 3487 markings, 3486 edges, 3 markings/sec, 515 secs
lola: 3511 markings, 3510 edges, 5 markings/sec, 520 secs
lola: 3526 markings, 3525 edges, 3 markings/sec, 525 secs
lola: 3558 markings, 3557 edges, 6 markings/sec, 530 secs
lola: 3575 markings, 3574 edges, 3 markings/sec, 535 secs
lola: 3592 markings, 3591 edges, 3 markings/sec, 540 secs
lola: 3609 markings, 3608 edges, 3 markings/sec, 545 secs
lola: 3626 markings, 3625 edges, 3 markings/sec, 550 secs
lola: 3643 markings, 3642 edges, 3 markings/sec, 555 secs
lola: 3666 markings, 3665 edges, 5 markings/sec, 560 secs
lola: 3681 markings, 3680 edges, 3 markings/sec, 565 secs
lola: 3696 markings, 3695 edges, 3 markings/sec, 570 secs
lola: 3721 markings, 3720 edges, 5 markings/sec, 575 secs
lola: 3748 markings, 3747 edges, 5 markings/sec, 580 secs
lola: 3776 markings, 3775 edges, 6 markings/sec, 585 secs
lola: 3802 markings, 3801 edges, 5 markings/sec, 590 secs
lola: 3831 markings, 3830 edges, 6 markings/sec, 595 secs
lola: 3860 markings, 3859 edges, 6 markings/sec, 600 secs
lola: 3897 markings, 3896 edges, 7 markings/sec, 605 secs
lola: 3937 markings, 3936 edges, 8 markings/sec, 610 secs
lola: 3962 markings, 3961 edges, 5 markings/sec, 615 secs
lola: 3978 markings, 3977 edges, 3 markings/sec, 620 secs
lola: 3997 markings, 3996 edges, 4 markings/sec, 625 secs
lola: 4043 markings, 4042 edges, 9 markings/sec, 630 secs
lola: 4092 markings, 4091 edges, 10 markings/sec, 635 secs
lola: 4136 markings, 4135 edges, 9 markings/sec, 640 secs
lola: 4177 markings, 4176 edges, 8 markings/sec, 645 secs
lola: 4217 markings, 4216 edges, 8 markings/sec, 650 secs
lola: 4236 markings, 4235 edges, 4 markings/sec, 655 secs
lola: 4256 markings, 4255 edges, 4 markings/sec, 660 secs
lola: 4275 markings, 4274 edges, 4 markings/sec, 665 secs
lola: 4294 markings, 4293 edges, 4 markings/sec, 670 secs
lola: 4313 markings, 4312 edges, 4 markings/sec, 675 secs
lola: 4332 markings, 4331 edges, 4 markings/sec, 680 secs
lola: 4352 markings, 4351 edges, 4 markings/sec, 685 secs
lola: 4370 markings, 4369 edges, 4 markings/sec, 690 secs
lola: 4389 markings, 4388 edges, 4 markings/sec, 695 secs
lola: 4407 markings, 4406 edges, 4 markings/sec, 700 secs
lola: 4427 markings, 4426 edges, 4 markings/sec, 705 secs
lola: 4455 markings, 4454 edges, 6 markings/sec, 710 secs
lola: 4499 markings, 4498 edges, 9 markings/sec, 715 secs
lola: 4543 markings, 4542 edges, 9 markings/sec, 720 secs
lola: 4571 markings, 4570 edges, 6 markings/sec, 725 secs
lola: 4600 markings, 4599 edges, 6 markings/sec, 730 secs
lola: 4630 markings, 4629 edges, 6 markings/sec, 735 secs
lola: 4660 markings, 4659 edges, 6 markings/sec, 740 secs
lola: 4690 markings, 4689 edges, 6 markings/sec, 745 secs
lola: 4721 markings, 4720 edges, 6 markings/sec, 750 secs
lola: 4753 markings, 4752 edges, 6 markings/sec, 755 secs
lola: 4785 markings, 4784 edges, 6 markings/sec, 760 secs
lola: 4825 markings, 4824 edges, 8 markings/sec, 765 secs
lola: 4870 markings, 4869 edges, 9 markings/sec, 770 secs
lola: 4908 markings, 4907 edges, 8 markings/sec, 775 secs
lola: 4944 markings, 4943 edges, 7 markings/sec, 780 secs
lola: 4983 markings, 4982 edges, 8 markings/sec, 785 secs
lola: 5020 markings, 5019 edges, 7 markings/sec, 790 secs
lola: 5059 markings, 5058 edges, 8 markings/sec, 795 secs
lola: 5098 markings, 5097 edges, 8 markings/sec, 800 secs
lola: 5135 markings, 5134 edges, 7 markings/sec, 805 secs
lola: 5173 markings, 5172 edges, 8 markings/sec, 810 secs
lola: 5210 markings, 5209 edges, 7 markings/sec, 815 secs
lola: 5243 markings, 5242 edges, 7 markings/sec, 820 secs
lola: 5288 markings, 5287 edges, 9 markings/sec, 825 secs
lola: 5309 markings, 5308 edges, 4 markings/sec, 830 secs
lola: 5333 markings, 5332 edges, 5 markings/sec, 835 secs
lola: 5377 markings, 5376 edges, 9 markings/sec, 840 secs
lola: 5422 markings, 5421 edges, 9 markings/sec, 845 secs
lola: 5486 markings, 5485 edges, 13 markings/sec, 850 secs
lola: 5546 markings, 5545 edges, 12 markings/sec, 855 secs
lola: 5606 markings, 5605 edges, 12 markings/sec, 860 secs
lola: 5655 markings, 5654 edges, 10 markings/sec, 865 secs
lola: 5694 markings, 5693 edges, 8 markings/sec, 870 secs
lola: 5750 markings, 5749 edges, 11 markings/sec, 875 secs
lola: 5811 markings, 5810 edges, 12 markings/sec, 880 secs
lola: 5865 markings, 5864 edges, 11 markings/sec, 885 secs
lola: 5930 markings, 5929 edges, 13 markings/sec, 890 secs
lola: 5991 markings, 5990 edges, 12 markings/sec, 895 secs
lola: 6048 markings, 6047 edges, 11 markings/sec, 900 secs
lola: 6101 markings, 6100 edges, 11 markings/sec, 905 secs
lola: 6159 markings, 6158 edges, 12 markings/sec, 910 secs
lola: 6242 markings, 6241 edges, 17 markings/sec, 915 secs
lola: 6338 markings, 6337 edges, 19 markings/sec, 920 secs
lola: 6407 markings, 6406 edges, 14 markings/sec, 925 secs
lola: 6477 markings, 6476 edges, 14 markings/sec, 930 secs
lola: 6547 markings, 6546 edges, 14 markings/sec, 935 secs
lola: 6611 markings, 6610 edges, 13 markings/sec, 940 secs
lola: 6668 markings, 6667 edges, 11 markings/sec, 945 secs
lola: 6721 markings, 6720 edges, 11 markings/sec, 950 secs
lola: 6810 markings, 6809 edges, 18 markings/sec, 955 secs
lola: 6850 markings, 6849 edges, 8 markings/sec, 960 secs
lola: 6879 markings, 6878 edges, 6 markings/sec, 965 secs
lola: 6910 markings, 6909 edges, 6 markings/sec, 970 secs
lola: 6939 markings, 6938 edges, 6 markings/sec, 975 secs
lola: 6969 markings, 6968 edges, 6 markings/sec, 980 secs
lola: 6999 markings, 6998 edges, 6 markings/sec, 985 secs
lola: 7029 markings, 7028 edges, 6 markings/sec, 990 secs
lola: 7059 markings, 7058 edges, 6 markings/sec, 995 secs
lola: 7094 markings, 7093 edges, 7 markings/sec, 1000 secs
lola: 7154 markings, 7153 edges, 12 markings/sec, 1005 secs
lola: 7196 markings, 7195 edges, 8 markings/sec, 1010 secs
lola: 7309 markings, 7308 edges, 23 markings/sec, 1015 secs
lola: 7439 markings, 7438 edges, 26 markings/sec, 1020 secs
lola: 7569 markings, 7568 edges, 26 markings/sec, 1025 secs
lola: 7704 markings, 7703 edges, 27 markings/sec, 1030 secs
lola: 7834 markings, 7833 edges, 26 markings/sec, 1035 secs
lola: 7964 markings, 7963 edges, 26 markings/sec, 1040 secs
lola: 8095 markings, 8094 edges, 26 markings/sec, 1045 secs
lola: 8225 markings, 8224 edges, 26 markings/sec, 1050 secs
lola: 8354 markings, 8353 edges, 26 markings/sec, 1055 secs
lola: 8484 markings, 8483 edges, 26 markings/sec, 1060 secs
lola: 8614 markings, 8613 edges, 26 markings/sec, 1065 secs
lola: 8745 markings, 8744 edges, 26 markings/sec, 1070 secs
lola: 8882 markings, 8881 edges, 27 markings/sec, 1075 secs
lola: 9012 markings, 9011 edges, 26 markings/sec, 1080 secs
lola: 9117 markings, 9116 edges, 21 markings/sec, 1085 secs
lola: 9210 markings, 9209 edges, 19 markings/sec, 1090 secs
lola: 9287 markings, 9286 edges, 15 markings/sec, 1095 secs
lola: 9369 markings, 9369 edges, 16 markings/sec, 1100 secs
lola: 9475 markings, 9484 edges, 21 markings/sec, 1105 secs
lola: 9572 markings, 9589 edges, 19 markings/sec, 1110 secs
lola: 9669 markings, 9694 edges, 19 markings/sec, 1115 secs
lola: 9769 markings, 9802 edges, 20 markings/sec, 1120 secs
lola: 9870 markings, 9912 edges, 20 markings/sec, 1125 secs
lola: 9955 markings, 10002 edges, 17 markings/sec, 1130 secs
lola: 10047 markings, 10096 edges, 18 markings/sec, 1135 secs
lola: 10097 markings, 10146 edges, 10 markings/sec, 1140 secs
lola: 10139 markings, 10188 edges, 8 markings/sec, 1145 secs
lola: 10206 markings, 10255 edges, 13 markings/sec, 1150 secs
lola: 10316 markings, 10365 edges, 22 markings/sec, 1155 secs
lola: 10433 markings, 10482 edges, 23 markings/sec, 1160 secs
lola: 10545 markings, 10594 edges, 22 markings/sec, 1165 secs
lola: 10663 markings, 10712 edges, 24 markings/sec, 1170 secs
lola: 10775 markings, 10824 edges, 22 markings/sec, 1175 secs
lola: 10893 markings, 10942 edges, 24 markings/sec, 1180 secs
lola: 11009 markings, 11058 edges, 23 markings/sec, 1185 secs
lola: 11121 markings, 11170 edges, 22 markings/sec, 1190 secs
lola: 11243 markings, 11292 edges, 24 markings/sec, 1195 secs
lola: 11393 markings, 11442 edges, 30 markings/sec, 1200 secs
lola: 11520 markings, 11569 edges, 25 markings/sec, 1205 secs
lola: 11624 markings, 11673 edges, 21 markings/sec, 1210 secs
lola: 11768 markings, 11817 edges, 29 markings/sec, 1215 secs
lola: 11878 markings, 11927 edges, 22 markings/sec, 1220 secs
lola: 11966 markings, 12015 edges, 18 markings/sec, 1225 secs
lola: 12064 markings, 12113 edges, 20 markings/sec, 1230 secs
lola: 12212 markings, 12261 edges, 30 markings/sec, 1235 secs
lola: 12350 markings, 12399 edges, 28 markings/sec, 1240 secs
lola: 12490 markings, 12539 edges, 28 markings/sec, 1245 secs
lola: 12632 markings, 12681 edges, 28 markings/sec, 1250 secs
lola: 12783 markings, 12832 edges, 30 markings/sec, 1255 secs
lola: 12942 markings, 12991 edges, 32 markings/sec, 1260 secs
lola: 13096 markings, 13145 edges, 31 markings/sec, 1265 secs
lola: 13262 markings, 13311 edges, 33 markings/sec, 1270 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 2210 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
----- Kill lola and sara stderr -----
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 -----
----- 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="mcc4mcc-full"
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 mcc4mcc-full"
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 r262-csrt-152732586700067"
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 ;