About the Execution of 2018-Gold for SafeBus-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
168.610 | 31610.00 | 32533.00 | 32.40 | FTFTTTFFTTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r165-csrt-155286441800005.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is SafeBus-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-csrt-155286441800005
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.3K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 1 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 42K Mar 10 17:31 model.pnml
--------------------
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 SafeBus-COL-06-LTLCardinality-00
FORMULA_NAME SafeBus-COL-06-LTLCardinality-01
FORMULA_NAME SafeBus-COL-06-LTLCardinality-02
FORMULA_NAME SafeBus-COL-06-LTLCardinality-03
FORMULA_NAME SafeBus-COL-06-LTLCardinality-04
FORMULA_NAME SafeBus-COL-06-LTLCardinality-05
FORMULA_NAME SafeBus-COL-06-LTLCardinality-06
FORMULA_NAME SafeBus-COL-06-LTLCardinality-07
FORMULA_NAME SafeBus-COL-06-LTLCardinality-08
FORMULA_NAME SafeBus-COL-06-LTLCardinality-09
FORMULA_NAME SafeBus-COL-06-LTLCardinality-10
FORMULA_NAME SafeBus-COL-06-LTLCardinality-11
FORMULA_NAME SafeBus-COL-06-LTLCardinality-12
FORMULA_NAME SafeBus-COL-06-LTLCardinality-13
FORMULA_NAME SafeBus-COL-06-LTLCardinality-14
FORMULA_NAME SafeBus-COL-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553105267011
info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-COL-06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ SafeBus-COL-06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 613/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4800
lola: finding significant places
lola: 150 places, 463 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 393 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-06-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p19 + p18 + p17 + p16 + p15 + p14)
lola: after: (p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= 6)
lola: LP says that atomic proposition is always true: (p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p27 + p26 + p25 + p24 + p23 <= p8 + p9 + p10 + p11 + p12 + p13)
lola: after: (p22 + p27 + p26 + p25 + p24 + p23 <= 1)
lola: LP says that atomic proposition is always true: (p22 + p27 + p26 + p25 + p24 + p23 <= 1)
lola: LP says that atomic proposition is always false: (2 <= p22 + p27 + p26 + p25 + p24 + p23)
lola: LP says that atomic proposition is always false: (3 <= p131)
lola: LP says that atomic proposition is always true: (p132 + p133 + p134 + p135 + p136 + p137 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p8 + p9 + p10 + p11 + p12 + p13)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p98 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p97 + p96 + p95 + p93 + p92 + p91 + p90 + p89 + p94 + p99)
lola: LP says that atomic proposition is always false: (3 <= p7)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p19 + p18 + p17 + p16 + p15 + p14)
lola: after: (0 <= 3)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p131)
lola: place invariant simplifies atomic proposition
lola: before: (p21 <= p138 + p139 + p140 + p141 + p142 + p143)
lola: after: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p19 + p18 + p17 + p16 + p15 + p14 <= p98 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p97 + p96 + p95 + p93 + p92 + p91 + p90 + p89 + p94 + p99)
lola: after: (6 <= p98 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p97 + p96 + p95 + p93 + p92 + p91 + p90 + p89 + p94 + p99)
lola: LP says that atomic proposition is always false: (6 <= p98 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p97 + p96 + p95 + p93 + p92 + p91 + p90 + p89 + p94 + p99)
lola: A (X ((3 <= p125 + p126 + p127 + p128 + p129 + p130))) : A (TRUE) : A ((p144 + p145 + p146 + p147 + p148 + p149 <= p131)) : A ((p34 + p35 + p36 + p37 + p38 + p39 <= p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88)) : A (F (X (F (X ((1 <= p0 + p1 + p2 + p3 + p4 + p5)))))) : A (F (TRUE)) : A (F (FALSE)) : A (X ((X ((p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p132 + p133 + p134 + p135 + p136 + p137)) U F (FALSE)))) : A (F ((X ((p0 + p1 + p2 + p3 + p4 + p5 <= p125 + p126 + p127 + p128 + p129 + p130)) U F (TRUE)))) : A (F (X (F (F ((1 <= p144 + p145 + p146 + p147 + p148 + p149)))))) : A (((FALSE U FALSE) U F (G ((1 <= p131))))) : A (X (X (G (G ((1 <= p131)))))) : A ((X (G (FALSE)) U G (F (FALSE)))) : A (G ((F ((2 <= p28 + p29 + p30 + p31 + p32 + p33)) U TRUE))) : A (X ((G ((2 <= p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88)) U X (FALSE)))) : A (F (G ((TRUE U FALSE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.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: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p144 + p145 + p146 + p147 + p148 + p149 <= p131)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p144 + p145 + p146 + p147 + p148 + p149 <= p131)
lola: processed formula length: 49
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p34 + p35 + p36 + p37 + p38 + p39 <= p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p34 + p35 + p36 + p37 + p38 + p39 <= p81 + p80 + p79 + p78 + p77 + p75 + p74 + p73 + p72 + p71 + p69 + p68 + p67 + p53 + p54 + p55 + p56 + p57 + p66 + p59 + p60 + p61 + p62 + p63 + p65 + p64 + p58 + p70 + p76 + p82 + p83 + p84 + p85 + p86 + p87 + p88)
lola: processed formula length: 252
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.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: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.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: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.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:
FORMULA SafeBus-COL-06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA SafeBus-COL-06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA SafeBus-COL-06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p125 + p126 + p127 + p128 + p129 + p130)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula length: 54
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 52 markings, 52 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5)))))
lola: processed formula length: 50
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 3913 markings, 3912 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 58
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 7 markings, 6 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= p131)))))
lola: processed formula length: 27
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 52 markings, 52 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p131))))
lola: processed formula length: 23
lola: 59 rewrites
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 54 markings, 55 edges
lola: ========================================
FORMULA SafeBus-COL-06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes no no yes yes no no no yes no no
lola:
preliminary result: no yes no yes yes yes no no yes yes no no no yes no no
lola: memory consumption: 20320 KB
lola: time consumption: 31 seconds
BK_STOP 1553105298621
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is SafeBus-COL-06, 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 r165-csrt-155286441800005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 ;