About the Execution of Irma.struct for AirplaneLD-COL-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
436.840 | 56423.00 | 22472.00 | 2220.40 | FFTFFFTFFFFFFTTF | normal |
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 200K
-rw-r--r-- 1 mcc users 4.0K 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 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 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 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K 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 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is AirplaneLD-COL-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-qhx2-152732139300003
=====================================================================
--------------------
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 AirplaneLD-COL-0010-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528262440347
BK_STOP 1528262496770
--------------------
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 AirplaneLD-COL-0010 as instance name.
Using AirplaneLD as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 179, 'Memory': 111.76, 'Tool': 'lola'}, {'Time': 242, 'Memory': 110.65, 'Tool': 'lola'}, {'Time': 5015, 'Memory': 342.73, 'Tool': 'itstools'}, {'Time': 5092, 'Memory': 324.52, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola AirplaneLD-COL-0010...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
AirplaneLD-COL-0010: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
AirplaneLD-COL-0010: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ AirplaneLD-COL-0010 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 177/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 89 places, 88 transitions, 54 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 75 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0010-LTLCardinality.task
lola: A ((2 <= p3)) : A ((p61 + p62 <= p47)) : A (F ((X ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26)) U F ((p60 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16))))) : A (((2 <= p64 + p65) U X ((p61 + p62 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))) : A ((3 <= p0)) : A (X (G (X ((3 <= p4))))) : A (X (G (F (G ((1 <= p64 + p65)))))) : A ((3 <= p63)) : A (X (((p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53 <= p1) U (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 <= p68 + p67)))) : A (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))) : A (F (G (X (G ((p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 <= p4)))))) : A ((G (G ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53))) U G (F ((2 <= p2))))) : A (G (((p66 <= p48 + p49) U G ((2 <= p68 + p67))))) : A (((3 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53) U G (X ((2 <= p61 + p62))))) : A (F ((p66 <= p5))) : A (X ((F ((3 <= p46)) U G ((2 <= p2)))))
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 ((2 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p3)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p61 + p62 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p61 + p62 <= p47)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26)) U F ((p60 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26)) U F ((p60 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16)))))
lola: processed formula: A (F ((X ((2 <= p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26)) U F ((p60 <= p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16)))))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p64 + p65) U X ((p61 + p62 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p64 + p65) U X ((p61 + p62 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
lola: processed formula: A (((2 <= p64 + p65) U X ((p61 + p62 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X ((3 <= p4)))))
lola: processed formula: A (X (G (X ((3 <= p4)))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((1 <= p64 + p65))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((1 <= p64 + p65)))))
lola: processed formula: A (X (F (G ((1 <= p64 + p65)))))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 86881 markings, 677144 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p63)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53 <= p1) U (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 <= p68 + p67))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53 <= p1) U (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 <= p68 + p67))))
lola: processed formula: A (X (((p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53 <= p1) U (p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 <= p68 + p67))))
lola: processed formula length: 150
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: processed formula: A (F ((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 <= p4))))))
lola: processed formula: A (F (G (X (G ((p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 <= p4))))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53))) U G (F ((2 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53))) U G (F ((2 <= p2)))))
lola: processed formula: A ((G (G ((1 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53))) U G (F ((2 <= p2)))))
lola: processed formula length: 98
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p66 <= p48 + p49) U G ((2 <= p68 + p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((p66 <= p48 + p49) U G ((2 <= p68 + p67)))))
lola: processed formula: A (G (((p66 <= p48 + p49) U G ((2 <= p68 + p67)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53) U G (X ((2 <= p61 + p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53) U G (X ((2 <= p61 + p62)))))
lola: processed formula: A (((3 <= p59 + p58 + p57 + p56 + p55 + p54 + p50 + p51 + p52 + p53) U G (X ((2 <= p61 + p62)))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 173849 markings, 1138568 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p66 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p66 <= p5)))
lola: processed formula: A (F ((p66 <= p5)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 17689 markings, 25692 edges
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p46)) U G ((2 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((3 <= p46)) U G ((2 <= p2)))))
lola: processed formula: A (X ((F ((3 <= p46)) U G ((2 <= p2)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: 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: 9 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no no no no no no yes yes no
FORMULA AirplaneLD-COL-0010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-LTLCardinality-15 FALSE 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="AirplaneLD-COL-0010"
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/AirplaneLD-COL-0010.tgz
mv AirplaneLD-COL-0010 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 AirplaneLD-COL-0010, 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 r187-qhx2-152732139300003"
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 '
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 ;