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 irma4mcc-structural
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 r139-qhx2-152673581100024
=====================================================================

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


BK_STOP 1527781469486

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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': 'itstools'}].
CTLCardinality lola QuasiCertifProtocol-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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 <= p337) OR (p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p145) OR (p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p279) OR (1 <= p146))))) : (E (G (((p302 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) OR ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p279) AND (2 <= p279))))) OR NOT(A (G (((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280) OR (p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 <= p493)))))) : E ((A (G ((1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133))) U A (F ((2 <= p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504))))) : E (F ((E (G ((p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 <= p145))) AND ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 + 1 <= p303) AND (p337 + 1 <= p0))))) : (E (X ((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))) OR ((A (G ((p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p79 + p68 + p57 + p46 + p35 + p24 + p13 + p109 + p110 + p111 + p112 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p10 + p11 + p12 + p108 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p107 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p106 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p105 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p104 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p103 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p102 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) AND A (G ((1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133)))) OR E (((p146 <= p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291) U (3 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471))))) : ((A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p338) AND (3 <= p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268)))) AND (((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p1) AND (1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) AND ((p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 <= p538) OR (p1 <= p279))) AND A (G ((1 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304))))) OR (E (X ((p145 <= 0))) AND E (((p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537))))) : ((((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p493) AND (p302 <= 0) AND ((1 <= p538) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537) OR (p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p146))) AND A (((p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 <= p0) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516)))) AND ((((p0 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) AND (p145 <= 2)) OR (2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p265 + p266 + p267 + p264 + p263 + p262 + p261 + p260 + 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 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159)) OR E (X (((p538 <= p337) AND (p493 <= p338)))))) : A (F (A (X (((1 <= p146) OR (1 <= p145)))))) : A (F ((1 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304))) : E (((3 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) U E (G ((p146 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492))))) : E (G (E (X (((1 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515) AND (p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p1)))))) : NOT(A (G (A (G ((p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 <= p338)))))) : A (G (E (G (((1 <= p146) OR (p538 <= p145)))))) : A (F (E (G (((1 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) AND (p493 <= p338)))))) : A (F (((1 <= p146) AND (2 <= p279) AND (3 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471) AND ((1 <= p493) OR (p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))) : NOT(NOT(E (F (((3 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 + p304) OR (1 <= p538))))))
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 <= p337) OR (p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p145) OR (p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p279) OR (1 <= p146)))))
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: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p302 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) OR ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p279) AND (2 <= p279))))) OR NOT(A (G (((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280) OR (p278 + p277 + p276 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p302 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) OR ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p279) AND (2 <= p279)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p302) AND ((p279 + 1 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516) OR (p279 <= 1)))))
lola: processed formula length: 212
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)
sara: try reading problem file QuasiCertifProtocol-COL-10-CTLCardinality.sara.
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 (((p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 + 1 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516) AND (p493 + 1 <= p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268))))
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
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 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133))) U A (F ((2 <= p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 <= 0))) U A(TRUE U (2 <= p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504)))
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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280 <= p145))) AND ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 + 1 <= p303) AND (p337 + 1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p145 + 1 <= p290 + p289 + p288 + p287 + p286 + p285 + p284 + p283 + p282 + p281 + p280))) AND ((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 + 1 <= p303) AND (p337 + 1 <= p0))))
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: 352696 markings, 3131733 edges, 3225752436249460736 markings/sec, 0 secs
lola: 678436 markings, 6205086 edges, 65148 markings/sec, 5 secs
lola: 996507 markings, 9235054 edges, 63614 markings/sec, 10 secs
lola: 1292331 markings, 12150320 edges, 59165 markings/sec, 15 secs
lola: 1579228 markings, 15047506 edges, 57379 markings/sec, 20 secs
lola: 1888997 markings, 18043414 edges, 61954 markings/sec, 25 secs
lola: 2184501 markings, 20993808 edges, 59101 markings/sec, 30 secs
lola: 2468574 markings, 23873076 edges, 56815 markings/sec, 35 secs
lola: 2747076 markings, 26747607 edges, 55700 markings/sec, 40 secs
lola: 3008097 markings, 29566048 edges, 52204 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3065007 markings, 30016114 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))) OR ((A (G ((p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p79 + p68 + p57 + p46 + p35 + p24 + p13 + p109 + p110 + p111 + p112 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p10 + p11 + p12 + p108 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))
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 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p79 + p68 + p57 + p46 + p35 + p24 + p13 + p109 + p110 + p111 + p112 + p122 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p10 + p11 + p12 + p108 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p107 + p25 + p26 + p27 + p28 + p29 +... (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: 82 markings, 81 edges
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p146 <= p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291) U (3 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p146 <= p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291) U (3 <= p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471))
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: 441799 markings, 2996894 edges, 2933637760394723328 markings/sec, 0 secs
lola: 834729 markings, 5950678 edges, 78586 markings/sec, 5 secs
lola: 1207786 markings, 8806643 edges, 74611 markings/sec, 10 secs
lola: 1553867 markings, 11615858 edges, 69216 markings/sec, 15 secs
lola: 1934740 markings, 14508262 edges, 76175 markings/sec, 20 secs
lola: 2279394 markings, 17344132 edges, 68931 markings/sec, 25 secs
lola: 2626186 markings, 20132288 edges, 69358 markings/sec, 30 secs
lola: 2947077 markings, 22890244 edges, 64178 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3043369 markings, 23786353 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p338) AND (3 <= p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268)))) AND (((p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516 <= p1) AND (1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) AND ((p278 + p277 + p276 + p275 + p274 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p338) AND (3 <= p278 + p277 + p276 + p275 + p274 + p273 + p272 + p271 + p270 + p269 + p268))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p145 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p145 <= 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 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461 + p460 <= p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537))
lola: processed formula length: 314
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 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p493) AND (p302 <= 0) AND ((1 <= p538) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537) OR (p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p146))) AND A (((p134 + p135 + p136 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p493) AND (p302 <= 0) AND ((1 <= p538) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537) OR (p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p146)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p493) AND (p302 <= 0) AND ((1 <= p538) OR (p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= p536 + p535 + p534 + p533 + p532 + p531 + p530 + p529 + p528 + p527 + p537) OR (p481 + p480 + p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 <= p146)))
lola: processed formula length: 368
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 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 <= p0) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 <= p0) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516)))
lola: processed formula: A (((p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 <= p0) U (p301 + p300 + p299 + p298 + p297 + p296 + p295 + p294 + p293 + p292 + p291 <= p526 + p525 + p524 + p523 + p522 + p521 + p520 + p519 + p518 + p517 + p516)))
lola: processed formula length: 245
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: 339392 markings, 2268343 edges, 67878 markings/sec, 0 secs
lola: 650790 markings, 4559813 edges, 62280 markings/sec, 5 secs
lola: 959334 markings, 6882991 edges, 61709 markings/sec, 10 secs
lola: 1260433 markings, 9221890 edges, 60220 markings/sec, 15 secs
lola: 1541263 markings, 11532960 edges, 56166 markings/sec, 20 secs
lola: 1856116 markings, 13891256 edges, 62971 markings/sec, 25 secs
lola: 2152725 markings, 16246183 edges, 59322 markings/sec, 30 secs
lola: 2441428 markings, 18594696 edges, 57741 markings/sec, 35 secs
lola: 2720947 markings, 20924952 edges, 55904 markings/sec, 40 secs
lola: 2987766 markings, 23251387 edges, 53364 markings/sec, 45 secs
lola: 3359406 markings, 25472234 edges, 74328 markings/sec, 50 secs
lola: 3737379 markings, 27645820 edges, 75595 markings/sec, 55 secs
lola: 4110013 markings, 29807797 edges, 74527 markings/sec, 60 secs
lola: 4458522 markings, 31917293 edges, 69702 markings/sec, 65 secs
lola: 4824379 markings, 34071673 edges, 73171 markings/sec, 70 secs
lola: 5180212 markings, 36215623 edges, 71167 markings/sec, 75 secs
lola: 5528807 markings, 38355591 edges, 69719 markings/sec, 80 secs
lola: 5867524 markings, 40481610 edges, 67743 markings/sec, 85 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 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p0 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) AND (p145 <= 2)) OR (2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p265 + p266 + p267 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p0 + 1 <= p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492) AND (p145 <= 2)) OR (2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p265 + p266 + p267 + p264 + p263 + p262 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247... (shortened)
lola: processed formula length: 962
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 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p538 <= p337) AND (p493 <= p338))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p538 <= p337) AND (p493 <= p338)))
lola: processed formula length: 39
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 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p146) OR (1 <= p145))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((1 <= p146) OR (1 <= p145))))
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: 427259 markings, 1329799 edges, 3689329903141912576 markings/sec, 0 secs
lola: 813079 markings, 2647610 edges, 77164 markings/sec, 5 secs
lola: 1140631 markings, 3977072 edges, 65510 markings/sec, 10 secs
lola: 1527608 markings, 5333032 edges, 77395 markings/sec, 15 secs
lola: 1903556 markings, 6610873 edges, 75190 markings/sec, 20 secs
lola: 2233985 markings, 7912451 edges, 66086 markings/sec, 25 secs
lola: 2601151 markings, 9264965 edges, 73433 markings/sec, 30 secs
lola: 2972148 markings, 10532609 edges, 74199 markings/sec, 35 secs
lola: 3286996 markings, 11831043 edges, 62970 markings/sec, 40 secs
lola: 3649274 markings, 13124902 edges, 72456 markings/sec, 45 secs
lola: 3986972 markings, 14352417 edges, 67540 markings/sec, 50 secs
lola: 4295829 markings, 15658112 edges, 61771 markings/sec, 55 secs
lola: 4652938 markings, 16888100 edges, 71422 markings/sec, 60 secs
lola: 4952838 markings, 18161172 edges, 59980 markings/sec, 65 secs
lola: 5301808 markings, 19424065 edges, 69794 markings/sec, 70 secs
lola: 5608023 markings, 20688071 edges, 61243 markings/sec, 75 secs
lola: 5937854 markings, 21928092 edges, 65966 markings/sec, 80 secs
lola: 6234364 markings, 23183987 edges, 59302 markings/sec, 85 secs
lola: 6557982 markings, 24411173 edges, 64724 markings/sec, 90 secs
lola: 6849815 markings, 25685583 edges, 58367 markings/sec, 95 secs
lola: 7157018 markings, 26925050 edges, 61441 markings/sec, 100 secs
lola: 7469696 markings, 28154613 edges, 62536 markings/sec, 105 secs
lola: 7749467 markings, 29404695 edges, 55954 markings/sec, 110 secs
lola: 8046450 markings, 30618982 edges, 59397 markings/sec, 115 secs
lola: 8342520 markings, 31823738 edges, 59214 markings/sec, 120 secs
lola: 8609637 markings, 33045768 edges, 53423 markings/sec, 125 secs
lola: 8853339 markings, 34316591 edges, 48740 markings/sec, 130 secs
lola: 9101915 markings, 35609458 edges, 49715 markings/sec, 135 secs
lola: 9360141 markings, 36874588 edges, 51645 markings/sec, 140 secs
lola: 9614745 markings, 38180291 edges, 50921 markings/sec, 145 secs
lola: 9871340 markings, 39447308 edges, 51319 markings/sec, 150 secs
lola: 10109679 markings, 40794327 edges, 47668 markings/sec, 155 secs
lola: 10517250 markings, 42261791 edges, 81514 markings/sec, 160 secs
lola: 10894121 markings, 43532709 edges, 75374 markings/sec, 165 secs
lola: 11228974 markings, 44779227 edges, 66971 markings/sec, 170 secs
lola: 11561776 markings, 46105931 edges, 66560 markings/sec, 175 secs
lola: 11937405 markings, 47366255 edges, 75126 markings/sec, 180 secs
lola: 12262412 markings, 48620267 edges, 65001 markings/sec, 185 secs
lola: 12597345 markings, 49919276 edges, 66987 markings/sec, 190 secs
lola: 12956057 markings, 51157180 edges, 71742 markings/sec, 195 secs
lola: 13253008 markings, 52429117 edges, 59390 markings/sec, 200 secs
lola: 13607218 markings, 53681511 edges, 70842 markings/sec, 205 secs
lola: 13924851 markings, 54933557 edges, 63527 markings/sec, 210 secs
lola: 14253378 markings, 56206840 edges, 65705 markings/sec, 215 secs
lola: 14572250 markings, 57434923 edges, 63774 markings/sec, 220 secs
lola: 14884768 markings, 58700405 edges, 62504 markings/sec, 225 secs
lola: 15199666 markings, 59922351 edges, 62980 markings/sec, 230 secs
lola: 15510262 markings, 61167890 edges, 62119 markings/sec, 235 secs
lola: 15804186 markings, 62387045 edges, 58785 markings/sec, 240 secs
lola: 16109831 markings, 63604742 edges, 61129 markings/sec, 245 secs
lola: 16399523 markings, 64851590 edges, 57938 markings/sec, 250 secs
lola: 16690563 markings, 66044576 edges, 58208 markings/sec, 255 secs
lola: 16983017 markings, 67241035 edges, 58491 markings/sec, 260 secs
lola: 17266307 markings, 68447914 edges, 56658 markings/sec, 265 secs
lola: 17551766 markings, 69608865 edges, 57092 markings/sec, 270 secs
lola: 17797747 markings, 70867923 edges, 49196 markings/sec, 275 secs
lola: 18047032 markings, 72116462 edges, 49857 markings/sec, 280 secs
lola: 18297540 markings, 73384027 edges, 50102 markings/sec, 285 secs
lola: 18533747 markings, 74670499 edges, 47241 markings/sec, 290 secs
lola: 18801072 markings, 75916271 edges, 53465 markings/sec, 295 secs
lola: 19037459 markings, 77203198 edges, 47277 markings/sec, 300 secs
lola: 19330565 markings, 78572303 edges, 58621 markings/sec, 305 secs
lola: 19701516 markings, 79818747 edges, 74190 markings/sec, 310 secs
lola: 20032630 markings, 81044869 edges, 66223 markings/sec, 315 secs
lola: 20350929 markings, 82344495 edges, 63660 markings/sec, 320 secs
lola: 20711597 markings, 83579581 edges, 72134 markings/sec, 325 secs
lola: 21017379 markings, 84826941 edges, 61156 markings/sec, 330 secs
----- Kill lola and sara stderr -----
lola: 21351536 markings, 86067632 edges, 66831 markings/sec, 335 secs
lola: 21677975 markings, 87274441 edges, 65288 markings/sec, 340 secs
lola: 21984523 markings, 88542850 edges, 61310 markings/sec, 345 secs
lola: 22317369 markings, 89744060 edges, 66569 markings/sec, 350 secs
lola: 22607642 markings, 90997844 edges, 58055 markings/sec, 355 secs
lola: 22934955 markings, 92194448 edges, 65463 markings/sec, 360 secs
lola: 23225121 markings, 93446235 edges, 58033 markings/sec, 365 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="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r139-qhx2-152673581100024"
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 ;