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 240K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 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 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600024
=====================================================================

--------------------
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-10-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527944026201


BK_STOP 1527944919163

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 1235625, 'Memory': 15943.54, 'Tool': 'lola'}, {'Time': 1374897, 'Memory': 15952.96, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola QuasiCertifProtocol-COL-10...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ QuasiCertifProtocol-COL-10 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: NOT(A (G (((1 <= p45) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p547) OR (p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p549) OR (1 <= p189))))) : (E (G (((p270 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) OR ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p549) AND (2 <= p549))))) OR NOT(A (G (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) OR (p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p191)))))) : E ((A (G ((1 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524))) U A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))) : E (F ((E (G ((p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 <= p547))) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + 1 <= p271) AND (p45 + 1 <= p44))))) : (E (X ((1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213))) OR ((A (G ((p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p79 + p68 + p57 + p46 + p123 + p134 + p145 + p156 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 + p136 + p135 + p133 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p115 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p114 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p113 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) AND A (G ((1 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524)))) OR E (((p189 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258))))) : ((A (G (((p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p548) AND (3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)))) AND (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p214) AND (1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213) AND ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p190) OR (p214 <= p549))) AND A (G ((1 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236))))) OR (E (X ((p547 <= 0))) AND E (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546))))) : ((((p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 <= p191) AND (p270 <= 0) AND ((1 <= p190) OR (p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546) OR (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p189))) AND A (((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 <= p44) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))) AND ((((p44 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (p547 <= 2)) OR (2 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392)) OR E (X (((p190 <= p45) AND (p191 <= p548)))))) : A (F (A (X (((1 <= p189) OR (1 <= p547)))))) : A (F ((1 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236))) : E (((3 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177) U E (G ((p189 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))) : E (G (E (X (((1 <= p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p214)))))) : NOT(A (G (A (G ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p548)))))) : A (G (E (G (((1 <= p189) OR (p190 <= p547)))))) : A (F (E (G (((1 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177) AND (p191 <= p548)))))) : A (F (((1 <= p189) AND (2 <= p549) AND (3 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND ((1 <= p191) OR (p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213))))) : NOT(NOT(E (F (((3 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236) OR (1 <= p190))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= p45) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p547) OR (p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p549) OR (1 <= p189)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p270 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) OR ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p549) AND (2 <= p549))))) OR NOT(A (G (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) OR (p237 + p238 + p239 + p240 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p270 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) OR ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p549) AND (2 <= p549)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p270) AND ((p549 + 1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202) OR (p549 <= 1)))))
lola: processed formula length: 201
lola: 5 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + 1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202) AND (p191 + 1 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((1 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524))) U A (F ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 <= 0))) U A(TRUE U (2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))
lola: processed formula length: 182
lola: 4 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 <= p547))) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + 1 <= p271) AND (p45 + 1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p547 + 1 <= p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225))) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + 1 <= p271) AND (p45 + 1 <= p44))))
lola: processed formula length: 231
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 331565 markings, 2805146 edges, 3225752436249460736 markings/sec, 0 secs
lola: 636120 markings, 5553547 edges, 60911 markings/sec, 5 secs
lola: 921394 markings, 8246156 edges, 57055 markings/sec, 10 secs
lola: 1183246 markings, 10919066 edges, 52370 markings/sec, 15 secs
lola: 1454070 markings, 13624245 edges, 54165 markings/sec, 20 secs
lola: 1746595 markings, 16305591 edges, 58505 markings/sec, 25 secs
lola: 2022008 markings, 18936757 edges, 55083 markings/sec, 30 secs
lola: 2273957 markings, 21580264 edges, 50390 markings/sec, 35 secs
lola: 2536640 markings, 24221089 edges, 52537 markings/sec, 40 secs
lola: 2817211 markings, 26849497 edges, 56114 markings/sec, 45 secs
lola: 3069618 markings, 29460991 edges, 50481 markings/sec, 50 secs
lola: 3318692 markings, 32079029 edges, 49815 markings/sec, 55 secs
lola: 3586132 markings, 34668643 edges, 53488 markings/sec, 60 secs
lola: 3819561 markings, 37261796 edges, 46686 markings/sec, 65 secs
lola: 4077522 markings, 39805258 edges, 51592 markings/sec, 70 secs
lola: 4317650 markings, 42421076 edges, 48026 markings/sec, 75 secs
lola: 4565623 markings, 45008500 edges, 49595 markings/sec, 80 secs
lola: 4790010 markings, 47521809 edges, 44877 markings/sec, 85 secs
lola: 5029705 markings, 50127715 edges, 47939 markings/sec, 90 secs
lola: 5260334 markings, 52724203 edges, 46126 markings/sec, 95 secs
lola: 5482736 markings, 55326084 edges, 44480 markings/sec, 100 secs
lola: 5701652 markings, 57924473 edges, 43783 markings/sec, 105 secs
lola: 5902308 markings, 60462130 edges, 40131 markings/sec, 110 secs
lola: 6204069 markings, 62906299 edges, 60352 markings/sec, 115 secs
lola: 6497629 markings, 65194039 edges, 58712 markings/sec, 120 secs
lola: 6766411 markings, 67442448 edges, 53756 markings/sec, 125 secs
lola: 7020197 markings, 69699598 edges, 50757 markings/sec, 130 secs
lola: 7236553 markings, 71937976 edges, 43271 markings/sec, 135 secs
lola: 7503978 markings, 74152803 edges, 53485 markings/sec, 140 secs
lola: 7766985 markings, 76287090 edges, 52601 markings/sec, 145 secs
lola: 8009807 markings, 78412216 edges, 48564 markings/sec, 150 secs
lola: 8235156 markings, 80583812 edges, 45070 markings/sec, 155 secs
lola: 8466161 markings, 82682703 edges, 46201 markings/sec, 160 secs
lola: 8713144 markings, 84746557 edges, 49397 markings/sec, 165 secs
lola: 8943768 markings, 86829778 edges, 46125 markings/sec, 170 secs
lola: 9145813 markings, 88933355 edges, 40409 markings/sec, 175 secs
lola: 9386419 markings, 90956622 edges, 48121 markings/sec, 180 secs
lola: 9611554 markings, 92987765 edges, 45027 markings/sec, 185 secs
lola: 9806909 markings, 95037532 edges, 39071 markings/sec, 190 secs
lola: 10043624 markings, 97086572 edges, 47343 markings/sec, 195 secs
lola: 10264201 markings, 99244560 edges, 44115 markings/sec, 200 secs
lola: 10478895 markings, 101309188 edges, 42939 markings/sec, 205 secs
lola: 10690995 markings, 103436362 edges, 42420 markings/sec, 210 secs
lola: 10906907 markings, 105525858 edges, 43182 markings/sec, 215 secs
lola: 11109271 markings, 107628830 edges, 40473 markings/sec, 220 secs
lola: 11313408 markings, 109753608 edges, 40827 markings/sec, 225 secs
lola: 11511952 markings, 111869480 edges, 39709 markings/sec, 230 secs
lola: 11702668 markings, 113981215 edges, 38143 markings/sec, 235 secs
lola: 11929271 markings, 116281345 edges, 45321 markings/sec, 240 secs
lola: 12254020 markings, 119074639 edges, 64950 markings/sec, 245 secs
lola: 12536100 markings, 121801622 edges, 56416 markings/sec, 250 secs
lola: 12848824 markings, 124549844 edges, 62545 markings/sec, 255 secs
lola: 13125727 markings, 127222632 edges, 55381 markings/sec, 260 secs
lola: 13402355 markings, 129873221 edges, 55326 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213))) OR ((A (G ((p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p79 + p68 + p57 + p46 + p123 + p134 + p145 + p156 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p155 + p154 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213))
lola: processed formula length: 85
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p79 + p68 + p57 + p46 + p123 + p134 + p145 + p156 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p158 + p157 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p147 + p146 + p144 + p143 + p142 + p141 + p140 + p139 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 73 markings, 72 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p189 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p189 <= p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258))
lola: processed formula length: 171
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 395346 markings, 2507245 edges, 2962460907961057280 markings/sec, 0 secs
lola: 737466 markings, 5036493 edges, 68424 markings/sec, 5 secs
lola: 1088849 markings, 7502824 edges, 70277 markings/sec, 10 secs
lola: 1423782 markings, 9957679 edges, 66987 markings/sec, 15 secs
lola: 1746535 markings, 12429025 edges, 64551 markings/sec, 20 secs
lola: 2059890 markings, 14894365 edges, 62671 markings/sec, 25 secs
lola: 2360211 markings, 17375841 edges, 60064 markings/sec, 30 secs
lola: 2645697 markings, 19833982 edges, 57097 markings/sec, 35 secs
lola: 2917151 markings, 22348293 edges, 54291 markings/sec, 40 secs
lola: 3184082 markings, 24774986 edges, 53386 markings/sec, 45 secs
lola: 3498119 markings, 27178723 edges, 62807 markings/sec, 50 secs
lola: 3778815 markings, 29575899 edges, 56139 markings/sec, 55 secs
lola: 4086441 markings, 32013755 edges, 61525 markings/sec, 60 secs
lola: 4373443 markings, 34482141 edges, 57400 markings/sec, 65 secs
lola: 4648597 markings, 36920007 edges, 55031 markings/sec, 70 secs
lola: 4939885 markings, 39414996 edges, 58258 markings/sec, 75 secs
lola: 5215702 markings, 41930284 edges, 55163 markings/sec, 80 secs
lola: 5489961 markings, 44428469 edges, 54852 markings/sec, 85 secs
lola: 5747008 markings, 46947488 edges, 51409 markings/sec, 90 secs
lola: 6090844 markings, 49334867 edges, 68767 markings/sec, 95 secs
lola: 6596501 markings, 51307983 edges, 101131 markings/sec, 100 secs
lola: 7057598 markings, 53204266 edges, 92219 markings/sec, 105 secs
lola: 7475345 markings, 55135446 edges, 83549 markings/sec, 110 secs
lola: 7934393 markings, 56930275 edges, 91810 markings/sec, 115 secs
lola: 8311012 markings, 58692635 edges, 75324 markings/sec, 120 secs
lola: 8743445 markings, 60416547 edges, 86487 markings/sec, 125 secs
lola: 9124062 markings, 62142987 edges, 76123 markings/sec, 130 secs
lola: 9537117 markings, 63855841 edges, 82611 markings/sec, 135 secs
lola: 9901145 markings, 65539531 edges, 72806 markings/sec, 140 secs
lola: 10279653 markings, 67236994 edges, 75702 markings/sec, 145 secs
lola: 10640162 markings, 68878871 edges, 72102 markings/sec, 150 secs
lola: 10990552 markings, 70555262 edges, 70078 markings/sec, 155 secs
lola: 11338655 markings, 72267517 edges, 69621 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11610905 markings, 73692160 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p548) AND (3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247)))) AND (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= p214) AND (1 <= p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213) AND ((p237 + p238 + p239 + p240 + p241 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p548) AND (3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
----- Kill lola and sara stderr -----
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p547 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p547 <= 0))
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 <= p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546))
lola: processed formula length: 293
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 <= p191) AND (p270 <= 0) AND ((1 <= p190) OR (p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546) OR (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p189))) AND A (((p203 + p204 + p205 + p206 + p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 <= p191) AND (p270 <= 0) AND ((1 <= p190) OR (p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546) OR (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p189)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 <= p191) AND (p270 <= 0) AND ((1 <= p190) OR (p269 + p268 + p267 + p266 + p265 + p259 + p260 + p261 + p262 + p263 + p264 <= p545 + p544 + p543 + p542 + p541 + p540 + p539 + p538 + p537 + p536 + p546) OR (p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p189)))
lola: processed formula length: 357
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 <= p44) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 <= p44) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))
lola: processed formula: A (((p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 <= p44) U (p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))
lola: processed formula length: 246
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 303124 markings, 1859180 edges, 60625 markings/sec, 0 secs
lola: 566144 markings, 3750314 edges, 52604 markings/sec, 5 secs
lola: 836208 markings, 5684072 edges, 54013 markings/sec, 10 secs
lola: 1106586 markings, 7649420 edges, 54076 markings/sec, 15 secs
lola: 1381948 markings, 9659509 edges, 55072 markings/sec, 20 secs
lola: 1648530 markings, 11734668 edges, 53316 markings/sec, 25 secs
lola: 1914462 markings, 13833216 edges, 53186 markings/sec, 30 secs
lola: 2183020 markings, 15957958 edges, 53712 markings/sec, 35 secs
lola: 2451835 markings, 18123693 edges, 53763 markings/sec, 40 secs
lola: 2706040 markings, 20350795 edges, 50841 markings/sec, 45 secs
lola: 2940964 markings, 22592416 edges, 46985 markings/sec, 50 secs
lola: 3237117 markings, 24518704 edges, 59231 markings/sec, 55 secs
lola: 3615093 markings, 26095040 edges, 75595 markings/sec, 60 secs
lola: 3968656 markings, 27796857 edges, 70713 markings/sec, 65 secs
lola: 4302054 markings, 29585355 edges, 66680 markings/sec, 70 secs
lola: 4613911 markings, 31414335 edges, 62371 markings/sec, 75 secs
lola: 4913805 markings, 33301683 edges, 59979 markings/sec, 80 secs
lola: 5198812 markings, 35196172 edges, 57001 markings/sec, 85 secs
lola: 5473681 markings, 37130184 edges, 54974 markings/sec, 90 secs
lola: 5733580 markings, 39074413 edges, 51980 markings/sec, 95 secs
lola: 5962904 markings, 41026335 edges, 45865 markings/sec, 100 secs
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: 6086657 markings, 41934939 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p44 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (p547 <= 2)) OR (2 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p44 + 1 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (p547 <= 2)) OR (2 <= p382 + p371 + p360 + p349 + p338 + p327 + p316 + p305 + p294 + p283 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p306 + ... (shortened)
lola: processed formula length: 952
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p190 <= p45) AND (p191 <= p548))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p190 <= p45) AND (p191 <= p548)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p189) OR (1 <= p547))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((1 <= p189) OR (1 <= p547))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 427710 markings, 1509967 edges, 85542 markings/sec, 0 secs
lola: 824477 markings, 3054994 edges, 79353 markings/sec, 5 secs
lola: 1185091 markings, 4615360 edges, 72123 markings/sec, 10 secs
lola: 1551384 markings, 6138275 edges, 73259 markings/sec, 15 secs
lola: 1931917 markings, 7633083 edges, 76107 markings/sec, 20 secs
lola: 2281300 markings, 9185905 edges, 69877 markings/sec, 25 secs
lola: 2649146 markings, 10707797 edges, 73569 markings/sec, 30 secs
lola: 3010283 markings, 12226289 edges, 72227 markings/sec, 35 secs
lola: 3358650 markings, 13766934 edges, 69673 markings/sec, 40 secs
lola: 3710652 markings, 15303515 edges, 70400 markings/sec, 45 secs
lola: 4048800 markings, 16812207 edges, 67630 markings/sec, 50 secs
lola: 4377511 markings, 18356661 edges, 65742 markings/sec, 55 secs
lola: 4708470 markings, 19894491 edges, 66192 markings/sec, 60 secs
lola: 5028513 markings, 21429521 edges, 64009 markings/sec, 65 secs
lola: 5337635 markings, 22937496 edges, 61824 markings/sec, 70 secs
lola: 5636407 markings, 24478611 edges, 59754 markings/sec, 75 secs
lola: 6004201 markings, 25979297 edges, 73559 markings/sec, 80 secs
lola: 6372429 markings, 27338383 edges, 73646 markings/sec, 85 secs
lola: 6705646 markings, 28669366 edges, 66643 markings/sec, 90 secs
lola: 6997285 markings, 30010058 edges, 58328 markings/sec, 95 secs
lola: 7306810 markings, 31328230 edges, 61905 markings/sec, 100 secs
lola: 7636337 markings, 32593832 edges, 65905 markings/sec, 105 secs
lola: 7938835 markings, 33856074 edges, 60500 markings/sec, 110 secs
lola: 8205840 markings, 35113811 edges, 53401 markings/sec, 115 secs
lola: 8518232 markings, 36333651 edges, 62478 markings/sec, 120 secs
lola: 8804717 markings, 37558903 edges, 57297 markings/sec, 125 secs
lola: 9070130 markings, 38784505 edges, 53083 markings/sec, 130 secs
lola: 9357483 markings, 39970905 edges, 57471 markings/sec, 135 secs
lola: 9613778 markings, 41183453 edges, 51259 markings/sec, 140 secs
lola: 9890921 markings, 42364891 edges, 55429 markings/sec, 145 secs
lola: 10142429 markings, 43574900 edges, 50302 markings/sec, 150 secs
lola: 10415889 markings, 44783239 edges, 54692 markings/sec, 155 secs
lola: 10673744 markings, 46013945 edges, 51571 markings/sec, 160 secs
lola: 10922310 markings, 47232651 edges, 49713 markings/sec, 165 secs
lola: 11173891 markings, 48465096 edges, 50316 markings/sec, 170 secs
lola: 11415391 markings, 49718118 edges, 48300 markings/sec, 175 secs
lola: 11845591 markings, 50957124 edges, 86040 markings/sec, 180 secs
lola: 12281878 markings, 52160886 edges, 87257 markings/sec, 185 secs
lola: 12695272 markings, 53385247 edges, 82679 markings/sec, 190 secs
lola: 13085815 markings, 54625289 edges, 78109 markings/sec, 195 secs
lola: 13431094 markings, 55837301 edges, 69056 markings/sec, 200 secs
lola: 13854013 markings, 57017227 edges, 84584 markings/sec, 205 secs
lola: 14257274 markings, 58213547 edges, 80652 markings/sec, 210 secs
lola: 14634757 markings, 59409507 edges, 75497 markings/sec, 215 secs
lola: 14970663 markings, 60607567 edges, 67181 markings/sec, 220 secs
lola: 15388762 markings, 61822281 edges, 83620 markings/sec, 225 secs
lola: 15790244 markings, 63060303 edges, 80296 markings/sec, 230 secs
lola: 16144524 markings, 64313471 edges, 70856 markings/sec, 235 secs
lola: 16545502 markings, 65546658 edges, 80196 markings/sec, 240 secs
lola: 16934616 markings, 66799722 edges, 77823 markings/sec, 245 secs
lola: 17297132 markings, 68044581 edges, 72503 markings/sec, 250 secs
lola: 17685247 markings, 69293187 edges, 77623 markings/sec, 255 secs
lola: 18038386 markings, 70538432 edges, 70628 markings/sec, 260 secs
lola: 18411492 markings, 71787841 edges, 74621 markings/sec, 265 secs
lola: 18766180 markings, 73034521 edges, 70938 markings/sec, 270 secs
lola: 19113679 markings, 74285541 edges, 69500 markings/sec, 275 secs
lola: 19453337 markings, 75528475 edges, 67932 markings/sec, 280 secs
lola: 19786022 markings, 76780144 edges, 66537 markings/sec, 285 secs
lola: 20163325 markings, 78040210 edges, 75461 markings/sec, 290 secs
lola: 20668644 markings, 79374011 edges, 101064 markings/sec, 295 secs
lola: 21084185 markings, 80470011 edges, 83108 markings/sec, 300 secs
lola: 21429475 markings, 81649171 edges, 69058 markings/sec, 305 secs
lola: 21900396 markings, 82880001 edges, 94184 markings/sec, 310 secs
lola: 22307810 markings, 83954303 edges, 81483 markings/sec, 315 secs
lola: 22661268 markings, 85119790 edges, 70692 markings/sec, 320 secs
lola: 23120808 markings, 86371155 edges, 91908 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is QuasiCertifProtocol-COL-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673583600024"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;