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-full
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732583900068
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527456652513


BK_STOP 1527456996812

--------------------
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': 'LTLFireability', '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': 396121, 'Memory': 7492.41, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability 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 LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ NeighborGrid-PT-d5n4m1t35 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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-LTLFireability.task
lola: A (G (X (F ((FIREABLE(ti_0_2_1_2_3v_3_3_0_2_0) U FIREABLE(ti_2_2_3_1_1v_3_3_2_2_1)))))) : A (G ((X (G (FIREABLE(to_1_2_3_0_1v_2_3_0_1_2))) U F (G (FIREABLE(ti_3_0_1_2_0v_3_1_2_2_1)))))) : A (FIREABLE(to_2_2_0_3_3v_3_3_0_0_0)) : A (X ((F (X (FIREABLE(ti_1_0_0_0_2v_1_3_0_1_1))) U F (X (FIREABLE(ti_2_0_1_2_0v_3_0_2_2_3)))))) : A (G (FIREABLE(ti_0_0_2_3_0v_3_3_3_0_1))) : A ((X ((FIREABLE(to_0_3_0_3_2v_1_2_3_3_3) U FIREABLE(ti_3_0_0_1_3v_3_3_1_1_0))) U G (F (G (FIREABLE(to_3_0_2_3_0v_3_0_3_2_1)))))) : A (X (X (X (FIREABLE(to_1_3_2_2_1v_2_2_1_2_0))))) : A (X (F (FIREABLE(to_0_1_0_1_3v_3_1_3_1_0)))) : A (FIREABLE(to_2_3_3_0_0v_3_2_0_3_0)) : A (F (X (X ((FIREABLE(to_2_1_3_3_3v_2_2_2_2_0) U FIREABLE(ti_1_1_3_0_0v_2_0_0_3_3)))))) : A (G (G ((F (FIREABLE(ti_0_0_3_0_1v_0_1_2_1_2)) U X (FIREABLE(ti_0_0_3_1_1v_0_1_0_0_1)))))) : A (F (G (FIREABLE(ti_3_0_0_0_2v_3_1_0_3_1)))) : A (X (G (F (G (G (FIREABLE(to_0_1_0_0_1v_3_1_3_3_1))))))) : A (FIREABLE(ti_1_2_0_0_3v_2_3_0_1_2)) : A (FIREABLE(to_2_0_0_3_3v_3_3_1_3_2)) : A (FIREABLE(to_1_1_1_0_0v_2_2_2_0_1))
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 (G (X (F ((FIREABLE(ti_0_2_1_2_3v_3_3_0_2_0) U FIREABLE(ti_2_2_3_1_1v_3_3_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F ((FIREABLE(ti_0_2_1_2_3v_3_3_0_2_0) U FIREABLE(ti_2_2_3_1_1v_3_3_2_2_1))))))
lola: processed formula: A (G (X (F ((FIREABLE(ti_0_2_1_2_3v_3_3_0_2_0) U FIREABLE(ti_2_2_3_1_1v_3_3_2_2_1))))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 4622 markings, 4621 edges, 924 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: 10274 markings, 10274 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G (FIREABLE(to_1_2_3_0_1v_2_3_0_1_2))) U F (G (FIREABLE(ti_3_0_1_2_0v_3_1_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X (G (FIREABLE(to_1_2_3_0_1v_2_3_0_1_2))) U F (G (FIREABLE(ti_3_0_1_2_0v_3_1_2_2_1))))))
lola: processed formula: A (G ((X (G (FIREABLE(to_1_2_3_0_1v_2_3_0_1_2))) U F (G (FIREABLE(ti_3_0_1_2_0v_3_1_2_2_1))))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 5828 markings, 5827 edges, 1166 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(to_2_2_0_3_3v_3_3_0_0_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_2_2_0_3_3v_3_3_0_0_0)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.task
lola: processed formula with 0 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 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F (X (FIREABLE(ti_1_0_0_0_2v_1_3_0_1_1))) U F (X (FIREABLE(ti_2_0_1_2_0v_3_0_2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F (X (FIREABLE(ti_1_0_0_0_2v_1_3_0_1_1))) U F (X (FIREABLE(ti_2_0_1_2_0v_3_0_2_2_3))))))
lola: processed formula: A (X ((F (X (FIREABLE(ti_1_0_0_0_2v_1_3_0_1_1))) U F (X (FIREABLE(ti_2_0_1_2_0v_3_0_2_2_3))))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 5621 markings, 5620 edges, 1124 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: 8501 markings, 8501 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ti_0_0_2_3_0v_3_3_3_0_1)))
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 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(to_0_3_0_3_2v_1_2_3_3_3) U FIREABLE(ti_3_0_0_1_3v_3_3_1_1_0))) U G (F (G (FIREABLE(to_3_0_2_3_0v_3_0_3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((FIREABLE(to_0_3_0_3_2v_1_2_3_3_3) U FIREABLE(ti_3_0_0_1_3v_3_3_1_1_0))) U F (G (FIREABLE(to_3_0_2_3_0v_3_0_3_2_1)))))
lola: processed formula: A ((X ((FIREABLE(to_0_3_0_3_2v_1_2_3_3_3) U FIREABLE(ti_3_0_0_1_3v_3_3_1_1_0))) U F (G (FIREABLE(to_3_0_2_3_0v_3_0_3_2_1)))))
lola: processed formula length: 125
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 5365 markings, 5364 edges, 1073 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 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (FIREABLE(to_1_3_2_2_1v_2_2_1_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (FIREABLE(to_1_3_2_2_1v_2_2_1_2_0)))))
lola: processed formula: A (X (X (X (FIREABLE(to_1_3_2_2_1v_2_2_1_2_0)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5905 markings, 5904 edges, 1181 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: 11370 markings, 11370 edges
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(to_0_1_0_1_3v_3_1_3_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (FIREABLE(to_0_1_0_1_3v_3_1_3_1_0))))
lola: processed formula: A (X (F (FIREABLE(to_0_1_0_1_3v_3_1_3_1_0))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 6108 markings, 6107 edges, 1222 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: 12521 markings, 12521 edges
lola: ========================================
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(to_2_3_3_0_0v_3_2_0_3_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_2_3_3_0_0v_3_2_0_3_0)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.task
lola: processed formula with 0 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 9 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X ((FIREABLE(to_2_1_3_3_3v_2_2_2_2_0) U FIREABLE(ti_1_1_3_0_0v_2_0_0_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((FIREABLE(to_2_1_3_3_3v_2_2_2_2_0) U FIREABLE(ti_1_1_3_0_0v_2_0_0_3_3))))))
lola: processed formula: A (F (X (X ((FIREABLE(to_2_1_3_3_3v_2_2_2_2_0) U FIREABLE(ti_1_1_3_0_0v_2_0_0_3_3))))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 5430 markings, 5429 edges, 1086 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: 8643 markings, 8643 edges
lola: ========================================
lola: subprocess 10 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((F (FIREABLE(ti_0_0_3_0_1v_0_1_2_1_2)) U X (FIREABLE(ti_0_0_3_1_1v_0_1_0_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((F (FIREABLE(ti_0_0_3_0_1v_0_1_2_1_2)) U X (FIREABLE(ti_0_0_3_1_1v_0_1_0_0_1))))))
lola: processed formula: A (G (G ((F (FIREABLE(ti_0_0_3_0_1v_0_1_2_1_2)) U X (FIREABLE(ti_0_0_3_1_1v_0_1_0_0_1))))))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 4649 markings, 4648 edges, 930 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: 9443 markings, 9443 edges
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(ti_3_0_0_0_2v_3_1_0_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(ti_3_0_0_0_2v_3_1_0_3_1))))
lola: processed formula: A (F (G (FIREABLE(ti_3_0_0_0_2v_3_1_0_3_1))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1836 markings, 1835 edges, 367 markings/sec, 0 secs
lola: 2691 markings, 2690 edges, 171 markings/sec, 5 secs
lola: 3464 markings, 3463 edges, 155 markings/sec, 10 secs
lola: 4101 markings, 4100 edges, 127 markings/sec, 15 secs
lola: 4960 markings, 4959 edges, 172 markings/sec, 20 secs
lola: 5525 markings, 5524 edges, 113 markings/sec, 25 secs
lola: 5883 markings, 5882 edges, 72 markings/sec, 30 secs
lola: 6034 markings, 6033 edges, 30 markings/sec, 35 secs
lola: 6163 markings, 6162 edges, 26 markings/sec, 40 secs
lola: 6233 markings, 6232 edges, 14 markings/sec, 45 secs
lola: 6283 markings, 6282 edges, 10 markings/sec, 50 secs
lola: 6503 markings, 6502 edges, 44 markings/sec, 55 secs
lola: 6818 markings, 6817 edges, 63 markings/sec, 60 secs
lola: 7133 markings, 7132 edges, 63 markings/sec, 65 secs
lola: 7379 markings, 7378 edges, 49 markings/sec, 70 secs
lola: 7635 markings, 7634 edges, 51 markings/sec, 75 secs
lola: 7835 markings, 7834 edges, 40 markings/sec, 80 secs
lola: 8050 markings, 8049 edges, 43 markings/sec, 85 secs
lola: 8247 markings, 8246 edges, 39 markings/sec, 90 secs
lola: 8315 markings, 8314 edges, 14 markings/sec, 95 secs
lola: 8383 markings, 8382 edges, 14 markings/sec, 100 secs
lola: 8443 markings, 8442 edges, 12 markings/sec, 105 secs
lola: 8505 markings, 8504 edges, 12 markings/sec, 110 secs
lola: 8689 markings, 8688 edges, 37 markings/sec, 115 secs
lola: 8817 markings, 8816 edges, 26 markings/sec, 120 secs
lola: 8957 markings, 8956 edges, 28 markings/sec, 125 secs
lola: 9081 markings, 9080 edges, 25 markings/sec, 130 secs
lola: 9309 markings, 9308 edges, 46 markings/sec, 135 secs
lola: 9434 markings, 9433 edges, 25 markings/sec, 140 secs
lola: 9511 markings, 9510 edges, 15 markings/sec, 145 secs
lola: 9596 markings, 9595 edges, 17 markings/sec, 150 secs
lola: 9681 markings, 9680 edges, 17 markings/sec, 155 secs
lola: 9767 markings, 9766 edges, 17 markings/sec, 160 secs
lola: 9846 markings, 9845 edges, 16 markings/sec, 165 secs
lola: 9924 markings, 9923 edges, 16 markings/sec, 170 secs
lola: 9996 markings, 9995 edges, 14 markings/sec, 175 secs
lola: 10074 markings, 10073 edges, 16 markings/sec, 180 secs
lola: 10178 markings, 10177 edges, 21 markings/sec, 185 secs
lola: 10260 markings, 10259 edges, 16 markings/sec, 190 secs
lola: 10338 markings, 10337 edges, 16 markings/sec, 195 secs
lola: 10414 markings, 10413 edges, 15 markings/sec, 200 secs
lola: 10490 markings, 10489 edges, 15 markings/sec, 205 secs
lola: 10564 markings, 10563 edges, 15 markings/sec, 210 secs
lola: 10644 markings, 10643 edges, 16 markings/sec, 215 secs
lola: 10720 markings, 10719 edges, 15 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: 10773 markings, 10774 edges
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G (G (FIREABLE(to_0_1_0_0_1v_3_1_3_3_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (G (FIREABLE(to_0_1_0_0_1v_3_1_3_3_1))))))
lola: processed formula: A (X (F (G (G (FIREABLE(to_0_1_0_0_1v_3_1_3_3_1))))))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.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: 6047 markings, 6046 edges, 1209 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 13 will run for 1080 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(ti_1_2_0_0_3v_2_3_0_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_1_2_0_0_3v_2_3_0_1_2)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.task
lola: processed formula with 0 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 14 will run for 1620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(to_2_0_0_3_3v_3_3_1_3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_2_0_0_3_3v_3_3_1_3_2)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.task
lola: processed formula with 0 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 15 will run for 3240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(to_1_1_1_0_0v_2_2_2_0_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_1_1_1_0_0v_2_2_2_0_1)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-LTLFireability.task
lola: processed formula with 0 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: RESULT
lola:
SUMMARY: no no yes no no no no no yes no no no no yes yes yes
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-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="LTLFireability"
export BK_TOOL="irma4mcc-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 irma4mcc-full"
echo " Input is NeighborGrid-PT-d5n4m1t35, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-csrt-152732583900068"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;