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 244K
-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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 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 irma4mcc-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 r138-qhx2-152673580400024
=====================================================================

--------------------
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 1527139346103


BK_STOP 1527140291729

--------------------
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 stderr -----
----- Start make result stdout -----
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 <= p349) OR (p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p482) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p46) OR (1 <= p326))))) : (E (G (((p516 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) OR ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p46) AND (2 <= p46))))) OR NOT(A (G (((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10 <= p201)))))) : E ((A (G ((1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))) U A (F ((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178))))) : E (F ((E (G ((p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p482))) AND ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + 1 <= p0) AND (p349 + 1 <= p323))))) : (E (X ((1 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12))) OR ((A (G ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p202 + p213 + p224 + p235 + p246 + p257 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p260 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203))) AND A (G ((1 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))) OR E (((p326 <= p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494) U (3 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))))) : ((A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p325) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10)))) AND (((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p324) AND (1 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10 <= p45) OR (p324 <= p46))) AND A (G ((1 <= p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338))))) OR (E (X ((p482 <= 0))) AND E (((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p190 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33))))) : ((((p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 <= p201) AND (p516 <= 0) AND ((1 <= p45) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33) OR (p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= p326))) AND A (((p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 <= p323) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505)))) AND ((((p323 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (p482 <= 2)) OR (2 <= p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470)) OR E (X (((p45 <= p349) AND (p201 <= p325)))))) : A (F (A (X (((1 <= p326) OR (1 <= p482)))))) : A (F ((1 <= p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338))) : E (((3 <= p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337) U E (G ((p326 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44))))) : E (G (E (X (((1 <= p190 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191) AND (p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p324)))))) : NOT(A (G (A (G ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10 <= p325)))))) : A (G (E (G (((1 <= p326) OR (p45 <= p482)))))) : A (F (E (G (((1 <= p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337) AND (p201 <= p325)))))) : A (F (((1 <= p326) AND (2 <= p46) AND (3 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528) AND ((1 <= p201) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12))))) : NOT(NOT(E (F (((3 <= p348 + p347 + p346 + p345 + p344 + p343 + p342 + p341 + p340 + p339 + p338) OR (1 <= p45))))))
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 <= p349) OR (p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p482) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p46) OR (1 <= p326)))))
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 (((p516 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) OR ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p46) AND (2 <= p46))))) OR NOT(A (G (((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7... (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 (((p516 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) OR ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p46) AND (2 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p516) AND ((p46 + 1 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505) OR (p46 <= 1)))))
lola: processed formula length: 199
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 (((p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + 1 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505) AND (p201 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10))))
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 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))) U A (F ((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0))) U A(TRUE U (2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))
lola: processed formula length: 193
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 ((p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p482))) AND ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + 1 <= p0) AND (p349 + 1 <= p323)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p482 + 1 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471))) AND ((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 + 1 <= p0) AND (p349 + 1 <= p323))))
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: 305916 markings, 2601639 edges, 3225752436249460736 markings/sec, 0 secs
lola: 587894 markings, 5079716 edges, 56396 markings/sec, 5 secs
lola: 842454 markings, 7464944 edges, 50912 markings/sec, 10 secs
lola: 1065571 markings, 9694779 edges, 44623 markings/sec, 15 secs
lola: 1270251 markings, 11926550 edges, 40936 markings/sec, 20 secs
lola: 1527188 markings, 14347627 edges, 51387 markings/sec, 25 secs
lola: 1788965 markings, 16682978 edges, 52355 markings/sec, 30 secs
lola: 2021313 markings, 18927846 edges, 46470 markings/sec, 35 secs
lola: 2223402 markings, 21021674 edges, 40418 markings/sec, 40 secs
lola: 2446794 markings, 23349830 edges, 44678 markings/sec, 45 secs
lola: 2685243 markings, 25595726 edges, 47690 markings/sec, 50 secs
lola: 2909219 markings, 27760580 edges, 44795 markings/sec, 55 secs
lola: 3099811 markings, 29788406 edges, 38118 markings/sec, 60 secs
lola: 3316570 markings, 32054602 edges, 43352 markings/sec, 65 secs
lola: 3541088 markings, 34222337 edges, 44904 markings/sec, 70 secs
lola: 3733025 markings, 36227490 edges, 38387 markings/sec, 75 secs
lola: 3936328 markings, 38417189 edges, 40661 markings/sec, 80 secs
lola: 4140593 markings, 40447646 edges, 40853 markings/sec, 85 secs
lola: 4311198 markings, 42343158 edges, 34121 markings/sec, 90 secs
lola: 4500533 markings, 44326498 edges, 37867 markings/sec, 95 secs
lola: 4676724 markings, 46208653 edges, 35238 markings/sec, 100 secs
lola: 4861594 markings, 48256091 edges, 36974 markings/sec, 105 secs
lola: 5035716 markings, 50204896 edges, 34824 markings/sec, 110 secs
lola: 5211683 markings, 52148037 edges, 35193 markings/sec, 115 secs
lola: 5368420 markings, 53978395 edges, 31347 markings/sec, 120 secs
lola: 5528980 markings, 55872042 edges, 32112 markings/sec, 125 secs
lola: 5682283 markings, 57689470 edges, 30661 markings/sec, 130 secs
lola: 5847793 markings, 59723202 edges, 33102 markings/sec, 135 secs
lola: 6127062 markings, 62212995 edges, 55854 markings/sec, 140 secs
lola: 6420708 markings, 64621620 edges, 58729 markings/sec, 145 secs
lola: 6716658 markings, 67035260 edges, 59190 markings/sec, 150 secs
lola: 6985936 markings, 69381347 edges, 53856 markings/sec, 155 secs
lola: 7205632 markings, 71588073 edges, 43939 markings/sec, 160 secs
lola: 7477585 markings, 73965034 edges, 54391 markings/sec, 165 secs
lola: 7776799 markings, 76376477 edges, 59843 markings/sec, 170 secs
lola: 8043748 markings, 78702865 edges, 53390 markings/sec, 175 secs
lola: 8262496 markings, 80869839 edges, 43750 markings/sec, 180 secs
lola: 8529043 markings, 83211771 edges, 53309 markings/sec, 185 secs
lola: 8804468 markings, 85546471 edges, 55085 markings/sec, 190 secs
lola: 9036961 markings, 87733284 edges, 46499 markings/sec, 195 secs
lola: 9270551 markings, 89961426 edges, 46718 markings/sec, 200 secs
lola: 9535267 markings, 92272562 edges, 52943 markings/sec, 205 secs
lola: 9751603 markings, 94396387 edges, 43267 markings/sec, 210 secs
lola: 9995943 markings, 96658361 edges, 48868 markings/sec, 215 secs
lola: 10221206 markings, 98793129 edges, 45053 markings/sec, 220 secs
lola: 10443642 markings, 100980575 edges, 44487 markings/sec, 225 secs
lola: 10655678 markings, 103045716 edges, 42407 markings/sec, 230 secs
lola: 10869125 markings, 105158627 edges, 42689 markings/sec, 235 secs
lola: 11062535 markings, 107179786 edges, 38682 markings/sec, 240 secs
lola: 11257347 markings, 109169545 edges, 38962 markings/sec, 245 secs
lola: 11448384 markings, 111189403 edges, 38207 markings/sec, 250 secs
lola: 11624223 markings, 113098490 edges, 35168 markings/sec, 255 secs
lola: 11789986 markings, 114978135 edges, 33153 markings/sec, 260 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11838696 markings, 115597491 edges
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12))) OR ((A (G ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p202 + p213 + p224 + p235 + p246 + p257 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p28... (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 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12))
lola: processed formula length: 74
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 ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p202 + p213 + p224 + p235 + p246 + p257 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300... (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: state equation: calling and running sara
sara: try reading problem file 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 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p326 <= p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494) U (3 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p326 <= p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494) U (3 <= p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528))
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: 319808 markings, 1985478 edges, 2919226186611556352 markings/sec, 0 secs
lola: 597933 markings, 4016085 edges, 55625 markings/sec, 5 secs
lola: 892707 markings, 6060130 edges, 58955 markings/sec, 10 secs
lola: 1140898 markings, 7935336 edges, 49638 markings/sec, 15 secs
lola: 1401950 markings, 9805925 edges, 52210 markings/sec, 20 secs
lola: 1639761 markings, 11674677 edges, 47562 markings/sec, 25 secs
lola: 1890929 markings, 13589115 edges, 50234 markings/sec, 30 secs
lola: 2134789 markings, 15497590 edges, 48772 markings/sec, 35 secs
lola: 2356631 markings, 17341153 edges, 44368 markings/sec, 40 secs
lola: 2561312 markings, 19096457 edges, 40936 markings/sec, 45 secs
lola: 2748073 markings, 20775743 edges, 37352 markings/sec, 50 secs
lola: 2930952 markings, 22483531 edges, 36576 markings/sec, 55 secs
lola: 3164949 markings, 24622769 edges, 46799 markings/sec, 60 secs
lola: 3414703 markings, 26489111 edges, 49951 markings/sec, 65 secs
lola: 3626336 markings, 28285625 edges, 42327 markings/sec, 70 secs
lola: 3852313 markings, 30129019 edges, 45195 markings/sec, 75 secs
lola: 4068134 markings, 31867407 edges, 43164 markings/sec, 80 secs
lola: 4264964 markings, 33622358 edges, 39366 markings/sec, 85 secs
lola: 4495042 markings, 35471289 edges, 46016 markings/sec, 90 secs
lola: 4694128 markings, 37264628 edges, 39817 markings/sec, 95 secs
lola: 4904475 markings, 39062005 edges, 42069 markings/sec, 100 secs
lola: 5112278 markings, 40906587 edges, 41561 markings/sec, 105 secs
lola: 5304722 markings, 42690146 edges, 38489 markings/sec, 110 secs
lola: 5492153 markings, 44446018 edges, 37486 markings/sec, 115 secs
lola: 5669742 markings, 46170995 edges, 35518 markings/sec, 120 secs
lola: 5836484 markings, 47868458 edges, 33348 markings/sec, 125 secs
lola: 6135370 markings, 49501621 edges, 59777 markings/sec, 130 secs
lola: 6605036 markings, 51336990 edges, 93933 markings/sec, 135 secs
lola: 7054127 markings, 53190915 edges, 89818 markings/sec, 140 secs
lola: 7461135 markings, 55065389 edges, 81402 markings/sec, 145 secs
lola: 7953160 markings, 57003545 edges, 98405 markings/sec, 150 secs
lola: 8348405 markings, 58864464 edges, 79049 markings/sec, 155 secs
lola: 8827551 markings, 60760334 edges, 95829 markings/sec, 160 secs
lola: 9234256 markings, 62608789 edges, 81341 markings/sec, 165 secs
lola: 9663429 markings, 64426213 edges, 85835 markings/sec, 170 secs
lola: 10069838 markings, 66247245 edges, 81282 markings/sec, 175 secs
lola: 10461219 markings, 68055039 edges, 78276 markings/sec, 180 secs
lola: 10844647 markings, 69852226 edges, 76686 markings/sec, 185 secs
lola: 11207718 markings, 71620696 edges, 72614 markings/sec, 190 secs
lola: 11537092 markings, 73297064 edges, 65875 markings/sec, 195 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11610900 markings, 73692150 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p325) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10)))) AND (((p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505 <= p324) AND (1 <= p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10 <= p45) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p325) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p11 + p10))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p482 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p482 <= 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: subprocess 7 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p190 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 <= p190 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33))
lola: processed formula length: 303
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 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 <= p201) AND (p516 <= 0) AND ((1 <= p45) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33) OR (p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= p326))) AND A (((p22 + p21 + p20 + p19 + p18 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 <= p201) AND (p516 <= 0) AND ((1 <= p45) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33) OR (p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= p326)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 <= p201) AND (p516 <= 0) AND ((1 <= p45) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p33) OR (p538 + p537 + p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 <= p326)))
lola: processed formula length: 356
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 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 <= p323) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 <= p323) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505)))
lola: processed formula: A (((p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 <= p323) U (p504 + p503 + p502 + p501 + p500 + p499 + p498 + p497 + p496 + p495 + p494 <= p515 + p514 + p513 + p512 + p511 + p510 + p509 + p508 + p507 + p506 + p505)))
lola: processed formula length: 236
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: 284698 markings, 1737404 edges, 56940 markings/sec, 0 secs
lola: 529890 markings, 3467517 edges, 49038 markings/sec, 5 secs
lola: 749288 markings, 5119810 edges, 43880 markings/sec, 10 secs
lola: 989472 markings, 6747170 edges, 48037 markings/sec, 15 secs
lola: 1194735 markings, 8402909 edges, 41053 markings/sec, 20 secs
lola: 1426380 markings, 9979296 edges, 46329 markings/sec, 25 secs
lola: 1609976 markings, 11482059 edges, 36719 markings/sec, 30 secs
lola: 1825673 markings, 13045824 edges, 43139 markings/sec, 35 secs
lola: 2022711 markings, 14615326 edges, 39408 markings/sec, 40 secs
lola: 2209738 markings, 16140393 edges, 37405 markings/sec, 45 secs
lola: 2397109 markings, 17693436 edges, 37474 markings/sec, 50 secs
lola: 2579877 markings, 19240041 edges, 36554 markings/sec, 55 secs
lola: 2740701 markings, 20695523 edges, 32165 markings/sec, 60 secs
lola: 2889247 markings, 22082027 edges, 29709 markings/sec, 65 secs
lola: 3058227 markings, 23835590 edges, 33796 markings/sec, 70 secs
lola: 3388453 markings, 25109406 edges, 66045 markings/sec, 75 secs
lola: 3682777 markings, 26417008 edges, 58865 markings/sec, 80 secs
lola: 3951191 markings, 27704619 edges, 53683 markings/sec, 85 secs
lola: 4201317 markings, 29036303 edges, 50025 markings/sec, 90 secs
lola: 4436097 markings, 30347909 edges, 46956 markings/sec, 95 secs
lola: 4661492 markings, 31700569 edges, 45079 markings/sec, 100 secs
lola: 4869361 markings, 33033698 edges, 41574 markings/sec, 105 secs
lola: 5091896 markings, 34471786 edges, 44507 markings/sec, 110 secs
lola: 5303070 markings, 35906417 edges, 42235 markings/sec, 115 secs
lola: 5497787 markings, 37328400 edges, 38943 markings/sec, 120 secs
lola: 5690950 markings, 38723409 edges, 38633 markings/sec, 125 secs
lola: 5863734 markings, 40081932 edges, 34557 markings/sec, 130 secs
lola: 6052329 markings, 41671853 edges, 37719 markings/sec, 135 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 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p323 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (p482 <= 2)) OR (2 <= p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p323 + 1 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) AND (p482 <= 2)) OR (2 <= p460 + p449 + p438 + p427 + p416 + p405 + p394 + p383 + p372 + p361 + p360 + p359 + p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p384 +... (shortened)
lola: processed formula length: 953
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 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p45 <= p349) AND (p201 <= p325))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p45 <= p349) AND (p201 <= p325)))
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 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p326) OR (1 <= p482))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((1 <= p326) OR (1 <= p482))))
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: 355394 markings, 1241601 edges, 3689329903141912576 markings/sec, 0 secs
lola: 679605 markings, 2486475 edges, 64842 markings/sec, 5 secs
lola: 975741 markings, 3680786 edges, 59227 markings/sec, 10 secs
lola: 1245883 markings, 4912618 edges, 54028 markings/sec, 15 secs
lola: 1567834 markings, 6191805 edges, 64390 markings/sec, 20 secs
lola: 1886499 markings, 7434349 edges, 63733 markings/sec, 25 secs
lola: 2171369 markings, 8656397 edges, 56974 markings/sec, 30 secs
lola: 2458231 markings, 9936809 edges, 57372 markings/sec, 35 secs
lola: 2768795 markings, 11188209 edges, 62113 markings/sec, 40 secs
lola: 3045266 markings, 12391040 edges, 55294 markings/sec, 45 secs
lola: 3311678 markings, 13593589 edges, 53282 markings/sec, 50 secs
lola: 3588568 markings, 14743101 edges, 55378 markings/sec, 55 secs
lola: 3831419 markings, 15919756 edges, 48570 markings/sec, 60 secs
lola: 4118013 markings, 17113342 edges, 57319 markings/sec, 65 secs
lola: 4346573 markings, 18238330 edges, 45712 markings/sec, 70 secs
lola: 4600782 markings, 19346618 edges, 50842 markings/sec, 75 secs
lola: 4843550 markings, 20512528 edges, 48554 markings/sec, 80 secs
lola: 5081992 markings, 21678899 edges, 47688 markings/sec, 85 secs
lola: 5316313 markings, 22838549 edges, 46864 markings/sec, 90 secs
lola: 5538203 markings, 23952894 edges, 44378 markings/sec, 95 secs
lola: 5759816 markings, 25062210 edges, 44323 markings/sec, 100 secs
lola: 6160802 markings, 26518557 edges, 80197 markings/sec, 105 secs
lola: 6533337 markings, 27981243 edges, 74507 markings/sec, 110 secs
lola: 6874169 markings, 29411038 edges, 68166 markings/sec, 115 secs
lola: 7171008 markings, 30792752 edges, 59368 markings/sec, 120 secs
lola: 7562569 markings, 32282053 edges, 78312 markings/sec, 125 secs
lola: 7911664 markings, 33738573 edges, 69819 markings/sec, 130 secs
lola: 8207933 markings, 35121759 edges, 59254 markings/sec, 135 secs
lola: 8574004 markings, 36570138 edges, 73214 markings/sec, 140 secs
lola: 8895365 markings, 37989919 edges, 64272 markings/sec, 145 secs
lola: 9225302 markings, 39417470 edges, 65987 markings/sec, 150 secs
lola: 9545171 markings, 40828350 edges, 63974 markings/sec, 155 secs
lola: 9862017 markings, 42244275 edges, 63369 markings/sec, 160 secs
lola: 10148693 markings, 43612404 edges, 57335 markings/sec, 165 secs
lola: 10460484 markings, 44994050 edges, 62358 markings/sec, 170 secs
lola: 10748654 markings, 46355398 edges, 57634 markings/sec, 175 secs
lola: 11023998 markings, 47712791 edges, 55069 markings/sec, 180 secs
lola: 11284885 markings, 49045588 edges, 52177 markings/sec, 185 secs
lola: 11570502 markings, 50263446 edges, 57123 markings/sec, 190 secs
lola: 11907714 markings, 51338100 edges, 67442 markings/sec, 195 secs
lola: 12211821 markings, 52368031 edges, 60821 markings/sec, 200 secs
lola: 12483846 markings, 53434181 edges, 54405 markings/sec, 205 secs
lola: 12758851 markings, 54534407 edges, 55001 markings/sec, 210 secs
lola: 13080511 markings, 55584267 edges, 64332 markings/sec, 215 secs
lola: 13374333 markings, 56591826 edges, 58764 markings/sec, 220 secs
lola: 13628953 markings, 57647513 edges, 50924 markings/sec, 225 secs
lola: 13909935 markings, 58696870 edges, 56196 markings/sec, 230 secs
lola: 14206160 markings, 59701418 edges, 59245 markings/sec, 235 secs
lola: 14474961 markings, 60692300 edges, 53760 markings/sec, 240 secs
lola: 14711860 markings, 61735188 edges, 47380 markings/sec, 245 secs
lola: 15012814 markings, 62748674 edges, 60191 markings/sec, 250 secs
lola: 15287887 markings, 63732005 edges, 55015 markings/sec, 255 secs
lola: 15528479 markings, 64752554 edges, 48118 markings/sec, 260 secs
lola: 15798689 markings, 65745331 edges, 54042 markings/sec, 265 secs
lola: 16067408 markings, 66708524 edges, 53744 markings/sec, 270 secs
lola: 16300894 markings, 67705470 edges, 46697 markings/sec, 275 secs
lola: 16561984 markings, 68682283 edges, 52218 markings/sec, 280 secs
lola: 16819430 markings, 69649227 edges, 51489 markings/sec, 285 secs
lola: 17038526 markings, 70622770 edges, 43819 markings/sec, 290 secs
lola: 17307714 markings, 71573946 edges, 53838 markings/sec, 295 secs
lola: 17536137 markings, 72540143 edges, 45685 markings/sec, 300 secs
lola: 17780497 markings, 73499661 edges, 48872 markings/sec, 305 secs
lola: 18016474 markings, 74447496 edges, 47195 markings/sec, 310 secs
lola: 18242758 markings, 75400411 edges, 45257 markings/sec, 315 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 -----
----- Kill lola and sara stderr -----
----- 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="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-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 r138-qhx2-152673580400024"
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 ;