About the Execution of 2018-Gold for QuasiCertifProtocol-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
168.380 | 7572.00 | 7474.00 | 19.80 | FFTFFFFTFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r132-oct2-155403939200068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 QuasiCertifProtocol-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939200068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.1K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 61K 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 QuasiCertifProtocol-COL-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1554073711251
info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-LTLCardinality.task
lola: A (F (X (G (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 <= p118)))))) : A (G (F (X (F ((p84 + p83 + p82 + p81 + p80 + p85 + p86 <= p255 + p254 + p253 + p252 + p251 + p250 + p249)))))) : A ((p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79)) : A ((2 <= p256 + p257 + p258 + p259 + p260 + p261 + p262)) : A ((3 <= p242 + p235 + p200 + p228 + p221 + p214 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p222 + p223 + p224 + p225 + p226 + p227 + p201 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248)) : A (X ((X ((3 <= p117)) U (p88 <= p110 + p111 + p112 + p113 + p114 + p115 + p116)))) : A (G ((p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79 <= p87))) : A ((p30 <= p119)) : A (G ((G ((p179 + p185 + p184 + p183 + p182 + p181 + p180 <= p129)) U F ((3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))))) : A ((X ((p127 <= p117)) U F (X ((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))))) : A (X ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138))) : A ((2 <= p100 + p101 + p102 + p96 + p97 + p98 + p99)) : A (G (X ((p128 <= p87)))) : A (F (F (X (X ((2 <= p89 + p90 + p91 + p92 + p93 + p94 + p95)))))) : A (X (X ((p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6)))) : A ((G (F ((1 <= p103 + p104 + p105 + p106 + p107 + p108 + p109))) U ((p29 <= p103 + p104 + p105 + p106 + p107 + p108 + p109) U (1 <= p117))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79)
lola: processed formula length: 339
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p256 + p257 + p258 + p259 + p260 + p261 + p262)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p256 + p257 + p258 + p259 + p260 + p261 + p262)
lola: processed formula length: 53
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p242 + p235 + p200 + p228 + p221 + p214 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p222 + p223 + p224 + p225 + p226 + p227 + p201 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p242 + p235 + p200 + p228 + p221 + p214 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p222 + p223 + p224 + p225 + p226 + p227 + p201 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248)
lola: processed formula length: 347
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p30 <= p119)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 <= p119)
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p100 + p101 + p102 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p100 + p101 + p102 + p96 + p97 + p98 + p99)
lola: processed formula length: 49
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: processed formula length: 65
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138)))
lola: processed formula length: 355
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 19 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= p117)) U (p88 <= p110 + p111 + p112 + p113 + p114 + p115 + p116))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= p117)) U (p88 <= p110 + p111 + p112 + p113 + p114 + p115 + p116))))
lola: processed formula length: 83
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 13 markings, 13 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p128 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p128 <= p87))))
lola: processed formula length: 25
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 19 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((2 <= p89 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= p89 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: processed formula length: 62
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 19 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p100 + p101 + p102 + p96 + p97 + p98 + p99 <= p0 + p1 + p2 + p3 + p4 + p5 + p6))))
lola: processed formula length: 92
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45 markings, 72 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79 <= p87)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p73 + p66 + p59 + p52 + p45 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51 + p53 + p54 + p55 + p56 + p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 + p67 + p68 + p69 + p70 + p71 + p72 + p74 + p75 + p76 + p77 + p78 + p79 <= p87)))
lola: processed formula length: 308
lola: 26 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 35 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p29 <= p103 + p104 + p105 + p106 + p107 + p108 + p109) U (1 <= p117)) OR (G (F ((1 <= p103 + p104 + p105 + p106 + p107 + p108 + p109))) AND F ((1 <= p117)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p29 <= p103 + p104 + p105 + p106 + p107 + p108 + p109) U (1 <= p117)) OR (G (F ((1 <= p103 + p104 + p105 + p106 + p107 + p108 + p109))) AND F ((1 <= p117)))))
lola: processed formula length: 164
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 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: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p84 + p83 + p82 + p81 + p80 + p85 + p86 <= p255 + p254 + p253 + p252 + p251 + p250 + p249))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p84 + p83 + p82 + p81 + p80 + p85 + p86 <= p255 + p254 + p253 + p252 + p251 + p250 + p249))))
lola: processed formula length: 103
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 19 markings, 19 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)) OR (G ((p179 + p185 + p184 + p183 + p182 + p181 + p180 <= p129)) AND F ((3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)) OR (G ((p179 + p185 + p184 + p183 + p182 + p181 + p180 <= p129)) AND F ((3 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))))))
lola: processed formula length: 195
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 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: 10 markings, 10 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 <= p118))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p144 + p151 + p158 + p165 + p172 + p178 + p177 + p176 + p175 + p174 + p173 + p171 + p170 + p169 + p168 + p167 + p166 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p150 + p149 + p148 + p147 + p146 + p145 + p143 + p142 + p141 + p140 + p139 + p138 <= p118))))
lola: processed formula length: 362
lola: 24 rewrites
lola: closed formula file QuasiCertifProtocol-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: 132060 markings, 402309 edges
lola: ========================================
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes no no no no no no yes yes
lola:
preliminary result: no no yes no no no no yes no no no no no no yes yes
lola: memory consumption: 19596 KB
lola: time consumption: 7 seconds
BK_STOP 1554073718823
--------------------
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="QuasiCertifProtocol-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 QuasiCertifProtocol-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 r132-oct2-155403939200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-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 ;