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 332K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K 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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-COL-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528200010
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526800305264


BK_STOP 1526801114542

--------------------
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 PolyORBLF-COL-S02J04T06 as instance name.
Using PolyORBLF 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1927320, 'Memory': 15943.41, 'Tool': 'lola'}, {'Time': 2745747, 'Memory': 15946.89, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S02J04T06...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
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: 1396/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: A (F (((3 <= p37) AND (p225 + p226 + p227 + p228 + p229 + p230 <= p357 + p358 + p359 + p360 + p361 + p362) AND (p244 + p245 + p246 + p247 + p248 + p249 <= p181 + p182 + p183 + p184 + p185 + p186) AND (p124 + p125 + p126 + p127 + p128 + p129 <= p201 + p202 + p203 + p204 + p205 + p206) AND (p174 + p175 + p176 + p177 + p178 + p179 + 1 <= p304) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p95 + p96 + p97 + p98 + p99)))) : NOT(A (G ((((3 <= p75 + p74 + p73 + p72 + p71 + p76) AND (3 <= p180)) OR ((p167 <= p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412)))))) : E ((((p431 + p432 + p433 + p434 + p435 + p436 <= p455 + p456 + p457 + p458 + p459 + p460) OR (1 <= p69)) U ((p462 <= p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (1 <= p377 + p378 + p379 + p380 + p381 + p382) AND (p304 <= p344) AND (p252 + p253 + p254 + p255 + p256 <= p308 + p309 + p310 + p311 + p312 + p313)))) : A (G ((((p305 + 1 <= p44 + p45 + p46 + p47 + p48 + p49) OR ((p54 + p55 + p53 + p52 + p51 + p50 <= p38 + p39 + p40 + p41 + p42 + p43) AND (p314 + p315 + p316 + p317 + p318 + p319 <= p462))) AND (((p68 <= p470 + p471 + p472 + p473 + p474 + p475) AND (2 <= p70)) OR ((p225 + p226 + p227 + p228 + p229 + p230 <= p117 + p118 + p119 + p120 + p121 + p122) AND (p455 + p456 + p457 + p458 + p459 + p460 <= p449 + p450 + p451 + p452 + p453 + p454)))))) : ((NOT(E (G ((p174 + p175 + p176 + p177 + p178 + p179 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430)))) AND (A (G ((p168 + p169 + p170 + p171 + p172 + p173 <= p174 + p175 + p176 + p177 + p178 + p179))) OR E (G ((3 <= p225 + p226 + p227 + p228 + p229 + p230))))) AND (p431 + p432 + p433 + p434 + p435 + p436 <= p370)) : (E (G (E (X ((p455 + p456 + p457 + p458 + p459 + p460 <= p24 + p25 + p26 + p27 + p28 + p29))))) AND (NOT(E (X ((2 <= p314 + p315 + p316 + p317 + p318 + p319)))) OR (A (X ((p443 + p444 + p445 + p446 + p447 + p448 <= p370))) AND A (F ((p461 <= p30)))))) : (A (F (A (X ((3 <= p130 + p131))))) AND ((A (X ((p54 + p55 + p53 + p52 + p51 + p50 <= p124 + p125 + p126 + p127 + p128 + p129))) OR A (G ((3 <= p180)))) AND (2 <= p258 + p259))) : E (G (A (F (((p305 <= p261 + p260) OR (p244 + p245 + p246 + p247 + p248 + p249 <= p180)))))) : (NOT((((p130 + p131 <= 1) OR (p31 + p32 + p33 + p34 + p35 + p36 + 1 <= p207 + p208 + p209 + p210 + p211 + p212)) AND E (F ((2 <= p305))))) OR (((p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p461) AND (1 <= p261 + p260)) AND E (F (((p308 + p309 + p310 + p311 + p312 + p313 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p17 + p16) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p17 + p16 <= p174 + p175 + p176 + p177 + p178 + p179)))))) : E (F (E (G (((1 <= p124 + p125 + p126 + p127 + p128 + p129) OR (p218 + p217 + p216 + p215 + p214 + p213 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430)))))) : A (F (E (G (((p18 + p19 + p20 + p21 + p22 + p23 <= p207 + p208 + p209 + p210 + p211 + p212) OR (3 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)))))) : A (G (((((p54 + p55 + p53 + p52 + p51 + p50 <= p321 + p322 + p323 + p324 + p325) AND (2 <= p258 + p259)) OR ((p455 + p456 + p457 + p458 + p459 + p460 <= p117 + p118 + p119 + p120 + p121 + p122) AND (1 <= p268 + p269 + p270 + p271 + p272 + p273))) OR E (F ((p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p75 + p74 + p73 + p72 + p71 + p76)))))) : ((E (G ((p252 + p253 + p254 + p255 + p256 + 1 <= p250))) OR E (G (((1 <= p0) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p95 + p96 + p97 + p98 + p99))))) OR A (X ((3 <= p68)))) : ((p431 + p432 + p433 + p434 + p435 + p436 + 1 <= p130 + p131) OR E (F (((1 <= p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356) OR ((p181 + p182 + p183 + p184 + p185 + p186 <= p306) AND (p308 + p309 + p310 + p311 + p312 + p313 <= p68)))))) : ((((((3 <= p107 + p109 + p111 + p113 + p115 + p116 + p114 + p112 + p110 + p108) OR (1 <= p174 + p175 + p176 + p177 + p178 + p179)) AND (3 <= p470 + p471 + p472 + p473 + p474 + p475)) OR A (F ((1 <= p250)))) AND A (G (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p17 + p16 <= p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242) OR (p371 + p372 + p373 + p374 + p375 + p376 <= p252 + p253 + p254 + p255 + p256))))) OR E ((((p443 + p444 + p445 + p446 + p447 + p448 <= p464 + p465 + p466 + p467 + p468 + p469) AND (1 <= p431 + p432 + p433 + p434 + p435 + p436)) U ((p377 + p378 + p379 + p380 + p381 + p382 <= p243) AND (1 <= p306))))) : A (((p54 + p55 + p53 + p52 + p51 + p50 <= p38 + p39 + p40 + p41 + p42 + p43) U ((p107 + p109 + p111 + p113 + p115 + p116 + p114 + p112 + p110 + p108 <= p162 + p163 + p164 + p165 + p166) AND (2 <= p344) AND (p449 + p450 + p451 + p452 + p453 + p454 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p37) AND (p225 + p226 + p227 + p228 + p229 + p230 <= p357 + p358 + p359 + p360 + p361 + p362) AND (p244 + p245 + p246 + p247 + p248 + p249 <= p181 + p182 + p183 + p184 + p185 + p186) AND (p124 + p125 + p126 + p127 + p128 + p129 <= p201 + p202 + p203 + p204 + p205 + p206) AND (p174 + p175 + p176 + p177 + p178 + p179 + 1 <= p304) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p37) AND (p225 + p226 + p227 + p228 + p229 + p230 <= p357 + p358 + p359 + p360 + p361 + p362) AND (p244 + p245 + p246 + p247 + p248 + p249 <= p181 + p182 + p183 + p184 + p185 + p186) AND (p124 + p125 + p126 + p127 + p128 + p129 <= p201 + p202 + p203 + p204 + p205 + p206) AND (p174 + p175 + p176 + p177 + p178 + p179 + 1 <= p304) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p95 + p96 + p97 + p98 + p99))))
lola: processed formula: A (F (((3 <= p37) AND (p225 + p226 + p227 + p228 + p229 + p230 <= p357 + p358 + p359 + p360 + p361 + p362) AND (p244 + p245 + p246 + p247 + p248 + p249 <= p181 + p182 + p183 + p184 + p185 + p186) AND (p124 + p125 + p126 + p127 + p128 + p129 <= p201 + p202 + p203 + p204 + p205 + p206) AND (p174 + p175 + p176 + p177 + p178 + p179 + 1 <= p304) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 ... (shortened)
lola: processed formula length: 541
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 618 markings, 618 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((3 <= p75 + p74 + p73 + p72 + p71 + p76) AND (3 <= p180)) OR ((p167 <= p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412))))))
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 1720 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p431 + p432 + p433 + p434 + p435 + p436 <= p455 + p456 + p457 + p458 + p459 + p460) OR (1 <= p69)) U ((p462 <= p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (1 <= p377 + p378 + p379 + p380 + p381 + p382) AND (p304 <= p344) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p431 + p432 + p433 + p434 + p435 + p436 <= p455 + p456 + p457 + p458 + p459 + p460) OR (1 <= p69)) U ((p462 <= p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) AND (1 <= p377 + p378 + p379 + p380 + p381 + p382) AND (p304 <= p344) AND (... (shortened)
lola: processed formula length: 478
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p305 + 1 <= p44 + p45 + p46 + p47 + p48 + p49) OR ((p54 + p55 + p53 + p52 + p51 + p50 <= p38 + p39 + p40 + p41 + p42 + p43) AND (p314 + p315 + p316 + p317 + p318 + p319 <= p462))) AND (((p68 <= p470 + p471 + p472 + p473 + p474 + p475) AND (2 <= p70)) OR ((p225 + p226 + p227 + p228 + p229 + p230 <= p117 + p118 + p119 + p120 + p121 + p122) AND (p455 + p456 + p457 + p458 + p459 + p460 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((p174 + p175 + p176 + p177 + p178 + p179 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430)))) AND (A (G ((p168 + p169 + p170 + p171 + p172 + p173 <= p174 + p175 + p176 + p177 + p178 + p179))) OR E (G ((3 <= p225 + p226 + p227 + p228 + p229 + p230))))) AND (p431 + p432 + p433 + p434 + p435 + p436 <= p370))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + 1 <= p174 + p175 + p176 + p177 + p178 + p179)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + 1 <= p174 + p175 + p176 + p177 + p178 + p179)))
lola: processed formula: A (F ((p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + 1 <= p174 + p175 + p176 + p177 + p178 + p179)))
lola: processed formula length: 138
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31178 markings, 36290 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p168 + p169 + p170 + p171 + p172 + p173 <= p174 + p175 + p176 + p177 + p178 + p179)))
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 1720 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p225 + p226 + p227 + p228 + p229 + p230)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p225 + p226 + p227 + p228 + p229 + p230 <= 2)))
lola: processed formula length: 61
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((p455 + p456 + p457 + p458 + p459 + p460 <= p24 + p25 + p26 + p27 + p28 + p29))))) AND (NOT(E (X ((2 <= p314 + p315 + p316 + p317 + p318 + p319)))) OR (A (X ((p443 + p444 + p445 + p446 + p447 + p448 <= p370))) AND A (F ((p461 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p455 + p456 + p457 + p458 + p459 + p460 <= p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p455 + p456 + p457 + p458 + p459 + p460 <= p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 102
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 414 markings, 418 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p314 + p315 + p316 + p317 + p318 + p319 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p314 + p315 + p316 + p317 + p318 + p319 <= 1)))
lola: processed formula: A (X ((p314 + p315 + p316 + p317 + p318 + p319 <= 1)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p130 + p131))))) AND ((A (X ((p54 + p55 + p53 + p52 + p51 + p50 <= p124 + p125 + p126 + p127 + p128 + p129))) OR A (G ((3 <= p180)))) AND (2 <= p258 + p259)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p130 + p131)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p130 + p131)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 386 markings, 386 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p305 <= p261 + p260) OR (p244 + p245 + p246 + p247 + p248 + p249 <= p180))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
----- Kill lola and sara stderr -----
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p305 <= p261 + p260) OR (p244 + p245 + p246 + p247 + p248 + p249 <= p180))))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 618 markings, 1236 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((p130 + p131 <= 1) OR (p31 + p32 + p33 + p34 + p35 + p36 + 1 <= p207 + p208 + p209 + p210 + p211 + p212)) AND E (F ((2 <= p305))))) OR (((p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p461) AND (1 <= p261 + p260)) AND E (F (((p308 + p309 + p310 + p311 + p312 + p313 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p17 + p16) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p130 + p131) AND (p207 + p208 + p209 + p210 + p211 + p212 <= p31 + p32 + p33 + p34 + p35 + p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p130 + p131) AND (p207 + p208 + p209 + p210 + p211 + p212 <= p31 + p32 + p33 + p34 + p35 + p36))
lola: processed formula length: 103
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 2 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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p305 <= 1)))
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 1720 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 PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 181189 markings, 186853 edges, 36238 markings/sec, 0 secs
lola: sara is running 5 secs || 359084 markings, 373377 edges, 35579 markings/sec, 5 secs
lola: sara is running 10 secs || 536170 markings, 561054 edges, 35417 markings/sec, 10 secs
lola: sara is running 15 secs || 712602 markings, 750449 edges, 35286 markings/sec, 15 secs
lola: sara is running 20 secs || 887005 markings, 938760 edges, 34881 markings/sec, 20 secs
lola: sara is running 25 secs || 1059145 markings, 1125726 edges, 34428 markings/sec, 25 secs
lola: sara is running 30 secs || 1230529 markings, 1313034 edges, 34277 markings/sec, 30 secs
lola: sara is running 35 secs || 1398292 markings, 1497417 edges, 33553 markings/sec, 35 secs
lola: sara is running 40 secs || 1563551 markings, 1680764 edges, 33052 markings/sec, 40 secs
lola: sara is running 45 secs || 1725234 markings, 1865062 edges, 32337 markings/sec, 45 secs
lola: sara is running 50 secs || 1887333 markings, 2047305 edges, 32420 markings/sec, 50 secs
lola: sara is running 55 secs || 2049807 markings, 2231213 edges, 32495 markings/sec, 55 secs
lola: sara is running 60 secs || 2210650 markings, 2413321 edges, 32169 markings/sec, 60 secs
lola: sara is running 65 secs || 2372194 markings, 2595814 edges, 32309 markings/sec, 65 secs
lola: sara is running 70 secs || 2530925 markings, 2775135 edges, 31746 markings/sec, 70 secs
lola: sara is running 75 secs || 2691136 markings, 2959291 edges, 32042 markings/sec, 75 secs
lola: sara is running 80 secs || 2851055 markings, 3143122 edges, 31984 markings/sec, 80 secs
lola: sara is running 85 secs || 3010973 markings, 3327901 edges, 31984 markings/sec, 85 secs
lola: sara is running 90 secs || 3170520 markings, 3512619 edges, 31909 markings/sec, 90 secs
lola: sara is running 95 secs || 3330262 markings, 3694757 edges, 31948 markings/sec, 95 secs
lola: sara is running 100 secs || 3492856 markings, 3878322 edges, 32519 markings/sec, 100 secs
lola: sara is running 105 secs || 3653690 markings, 4064301 edges, 32167 markings/sec, 105 secs
lola: sara is running 110 secs || 3814178 markings, 4249315 edges, 32098 markings/sec, 110 secs
lola: sara is running 115 secs || 3974868 markings, 4436066 edges, 32138 markings/sec, 115 secs
lola: sara is running 120 secs || 4132872 markings, 4620052 edges, 31601 markings/sec, 120 secs
lola: sara is running 125 secs || 4293596 markings, 4805351 edges, 32145 markings/sec, 125 secs
lola: sara is running 130 secs || 4454609 markings, 4991481 edges, 32203 markings/sec, 130 secs
lola: sara is running 135 secs || 4615118 markings, 5174807 edges, 32102 markings/sec, 135 secs
lola: sara is running 140 secs || 4774963 markings, 5358547 edges, 31969 markings/sec, 140 secs
lola: sara is running 145 secs || 4935941 markings, 5541263 edges, 32196 markings/sec, 145 secs
lola: sara is running 150 secs || 5092982 markings, 5721492 edges, 31408 markings/sec, 150 secs
lola: sara is running 155 secs || 5251035 markings, 5901914 edges, 31611 markings/sec, 155 secs
lola: sara is running 160 secs || 5405255 markings, 6079075 edges, 30844 markings/sec, 160 secs
lola: sara is running 165 secs || 5565077 markings, 6261382 edges, 31964 markings/sec, 165 secs
lola: sara is running 170 secs || 5722823 markings, 6442236 edges, 31549 markings/sec, 170 secs
lola: sara is running 175 secs || 5881042 markings, 6622965 edges, 31644 markings/sec, 175 secs
lola: sara is running 180 secs || 6042194 markings, 6805883 edges, 32230 markings/sec, 180 secs
lola: sara is running 185 secs || 6205366 markings, 6992844 edges, 32634 markings/sec, 185 secs
lola: sara is running 190 secs || 6369656 markings, 7180128 edges, 32858 markings/sec, 190 secs
lola: sara is running 195 secs || 6534250 markings, 7367801 edges, 32919 markings/sec, 195 secs
lola: sara is running 200 secs || 6696121 markings, 7554701 edges, 32374 markings/sec, 200 secs
lola: sara is running 205 secs || 6863279 markings, 7742528 edges, 33432 markings/sec, 205 secs
lola: sara is running 210 secs || 7023744 markings, 7926613 edges, 32093 markings/sec, 210 secs
lola: sara is running 215 secs || 7186351 markings, 8110748 edges, 32521 markings/sec, 215 secs
lola: sara is running 220 secs || 7348329 markings, 8291976 edges, 32396 markings/sec, 220 secs
lola: sara is running 225 secs || 7510501 markings, 8474559 edges, 32434 markings/sec, 225 secs
lola: sara is running 230 secs || 7672960 markings, 8656704 edges, 32492 markings/sec, 230 secs
lola: sara is running 235 secs || 7834825 markings, 8838534 edges, 32373 markings/sec, 235 secs
lola: sara is running 240 secs || 7996861 markings, 9020395 edges, 32407 markings/sec, 240 secs
lola: sara is running 245 secs || 8159692 markings, 9202488 edges, 32566 markings/sec, 245 secs
lola: sara is running 250 secs || 8322064 markings, 9385742 edges, 32474 markings/sec, 250 secs
lola: sara is running 255 secs || 8486706 markings, 9570339 edges, 32928 markings/sec, 255 secs
lola: sara is running 260 secs || 8653317 markings, 9757702 edges, 33322 markings/sec, 260 secs
lola: sara is running 265 secs || 8821557 markings, 9946372 edges, 33648 markings/sec, 265 secs
lola: sara is running 270 secs || 8988699 markings, 10134226 edges, 33428 markings/sec, 270 secs
lola: sara is running 275 secs || 9154421 markings, 10321787 edges, 33144 markings/sec, 275 secs
lola: sara is running 280 secs || 9321193 markings, 10508409 edges, 33354 markings/sec, 280 secs
lola: sara is running 285 secs || 9486854 markings, 10695391 edges, 33132 markings/sec, 285 secs
lola: sara is running 290 secs || 9653515 markings, 10882931 edges, 33332 markings/sec, 290 secs
lola: sara is running 295 secs || 9818716 markings, 11068963 edges, 33040 markings/sec, 295 secs
lola: sara is running 300 secs || 9984192 markings, 11255609 edges, 33095 markings/sec, 300 secs
lola: sara is running 305 secs || 10148540 markings, 11443904 edges, 32870 markings/sec, 305 secs
lola: sara is running 310 secs || 10314043 markings, 11632080 edges, 33101 markings/sec, 310 secs
lola: sara is running 315 secs || 10476850 markings, 11817428 edges, 32561 markings/sec, 315 secs
lola: sara is running 320 secs || 10639765 markings, 12002232 edges, 32583 markings/sec, 320 secs
lola: sara is running 325 secs || 10803528 markings, 12189163 edges, 32753 markings/sec, 325 secs
lola: sara is running 330 secs || 10967678 markings, 12376519 edges, 32830 markings/sec, 330 secs
lola: sara is running 335 secs || 11130584 markings, 12562846 edges, 32581 markings/sec, 335 secs
lola: sara is running 340 secs || 11292783 markings, 12747916 edges, 32440 markings/sec, 340 secs
lola: sara is running 345 secs || 11455367 markings, 12933342 edges, 32517 markings/sec, 345 secs
lola: sara is running 350 secs || 11616161 markings, 13116536 edges, 32159 markings/sec, 350 secs
lola: sara is running 355 secs || 11776153 markings, 13301127 edges, 31998 markings/sec, 355 secs
lola: sara is running 360 secs || 11936459 markings, 13485102 edges, 32061 markings/sec, 360 secs
lola: sara is running 365 secs || 12095953 markings, 13667858 edges, 31899 markings/sec, 365 secs
lola: sara is running 370 secs || 12256327 markings, 13851721 edges, 32075 markings/sec, 370 secs
lola: sara is running 375 secs || 12415132 markings, 14033179 edges, 31761 markings/sec, 375 secs
lola: sara is running 380 secs || 12574408 markings, 14215963 edges, 31855 markings/sec, 380 secs
lola: sara is running 385 secs || 12734769 markings, 14401365 edges, 32072 markings/sec, 385 secs
lola: sara is running 390 secs || 12892920 markings, 14593203 edges, 31630 markings/sec, 390 secs
lola: sara is running 395 secs || 13051160 markings, 14774784 edges, 31648 markings/sec, 395 secs
lola: sara is running 400 secs || 13205284 markings, 14964249 edges, 30825 markings/sec, 400 secs
lola: sara is running 405 secs || 13364322 markings, 15147413 edges, 31808 markings/sec, 405 secs
lola: sara is running 410 secs || 13522133 markings, 15329927 edges, 31562 markings/sec, 410 secs
lola: sara is running 415 secs || 13676217 markings, 15515332 edges, 30817 markings/sec, 415 secs
lola: sara is running 420 secs || 13832954 markings, 15704504 edges, 31347 markings/sec, 420 secs
lola: sara is running 425 secs || 13986828 markings, 15893033 edges, 30775 markings/sec, 425 secs
lola: sara is running 430 secs || 14147507 markings, 16078024 edges, 32136 markings/sec, 430 secs
lola: sara is running 435 secs || 14307937 markings, 16263867 edges, 32086 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p124 + p125 + p126 + p127 + p128 + p129) OR (p218 + p217 + p216 + p215 + p214 + p213 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p124 + p125 + p126 + p127 + p128 + p129 <= 0) AND (p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + 1 <= p218 + p217 + p216 + p215 + p214 + p213)))))
lola: processed formula length: 208
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5749 markings, 6699 edges
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p18 + p19 + p20 + p21 + p22 + p23 <= p207 + p208 + p209 + p210 + p211 + p212) OR (3 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p207 + p208 + p209 + p210 + p211 + p212 + 1 <= p18 + p19 + p20 + p21 + p22 + p23) AND (p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 <= 2)))))
lola: processed formula length: 202
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 515577 markings, 942753 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p54 + p55 + p53 + p52 + p51 + p50 <= p321 + p322 + p323 + p324 + p325) AND (2 <= p258 + p259)) OR ((p455 + p456 + p457 + p458 + p459 + p460 <= p117 + p118 + p119 + p120 + p121 + p122) AND (1 <= p268 + p269 + p270 + p271 + p272 + p273))) OR E (F ((p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((((p321 + p322 + p323 + p324 + p325 + 1 <= p54 + p55 + p53 + p52 + p51 + p50) OR (p258 + p259 <= 1)) AND ((p117 + p118 + p119 + p120 + p121 + p122 + 1 <= p455 + p456 + p457 + p458 + p459 + p460) OR (p268 + p269 + p270 + p271 + p272 + p273 <= 0))) AND NOT(E(TRUE U (p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + ... (shortened)
lola: processed formula length: 531
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 707693 markings, 1563542 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1356829 markings, 3040337 edges, 129827 markings/sec, 5 secs
lola: 1985774 markings, 4481936 edges, 125789 markings/sec, 10 secs
lola: 2598530 markings, 5884896 edges, 122551 markings/sec, 15 secs
lola: 3214061 markings, 7277929 edges, 123106 markings/sec, 20 secs
lola: 3816393 markings, 8657251 edges, 120466 markings/sec, 25 secs
lola: 4429254 markings, 10050675 edges, 122572 markings/sec, 30 secs
lola: 5050660 markings, 11490569 edges, 124281 markings/sec, 35 secs
lola: 5670887 markings, 12959248 edges, 124045 markings/sec, 40 secs
lola: 6281960 markings, 14411448 edges, 122215 markings/sec, 45 secs
lola: 6896171 markings, 15864673 edges, 122842 markings/sec, 50 secs
lola: 7496943 markings, 17281378 edges, 120154 markings/sec, 55 secs
lola: 8084978 markings, 18659184 edges, 117607 markings/sec, 60 secs
lola: 8673308 markings, 20049042 edges, 117666 markings/sec, 65 secs
lola: 9258576 markings, 21439485 edges, 117054 markings/sec, 70 secs
lola: 9838834 markings, 22819083 edges, 116052 markings/sec, 75 secs
lola: 10425585 markings, 24228166 edges, 117350 markings/sec, 80 secs
lola: 11009688 markings, 25622616 edges, 116821 markings/sec, 85 secs
lola: 11603320 markings, 27053458 edges, 118726 markings/sec, 90 secs
lola: 12192118 markings, 28468876 edges, 117760 markings/sec, 95 secs
lola: 12756183 markings, 29829282 edges, 112813 markings/sec, 100 secs
lola: 13340970 markings, 31231829 edges, 116957 markings/sec, 105 secs
lola: 13921243 markings, 32635087 edges, 116055 markings/sec, 110 secs
lola: 14506921 markings, 34053506 edges, 117136 markings/sec, 115 secs
lola: 15089179 markings, 35456121 edges, 116452 markings/sec, 120 secs
lola: 15672671 markings, 36875635 edges, 116698 markings/sec, 125 secs
lola: 16254417 markings, 38296796 edges, 116349 markings/sec, 130 secs
lola: 16833694 markings, 39715432 edges, 115855 markings/sec, 135 secs
lola: 17414815 markings, 41144893 edges, 116224 markings/sec, 140 secs
lola: 17999500 markings, 42575850 edges, 116937 markings/sec, 145 secs
lola: 18580244 markings, 43996610 edges, 116149 markings/sec, 150 secs
lola: 19143057 markings, 45375858 edges, 112563 markings/sec, 155 secs
lola: 19732359 markings, 46832291 edges, 117860 markings/sec, 160 secs
lola: 20332783 markings, 48298282 edges, 120085 markings/sec, 165 secs
lola: 20932284 markings, 49775931 edges, 119900 markings/sec, 170 secs
lola: 21526055 markings, 51236813 edges, 118754 markings/sec, 175 secs
lola: 22120546 markings, 52701996 edges, 118898 markings/sec, 180 secs
lola: 22715418 markings, 54165272 edges, 118974 markings/sec, 185 secs
lola: 23309142 markings, 55632751 edges, 118745 markings/sec, 190 secs
lola: 23906613 markings, 57114980 edges, 119494 markings/sec, 195 secs
lola: 24503911 markings, 58593094 edges, 119460 markings/sec, 200 secs
lola: 25100114 markings, 60076569 edges, 119241 markings/sec, 205 secs
lola: 25698046 markings, 61573467 edges, 119586 markings/sec, 210 secs
lola: 26245988 markings, 62959894 edges, 109588 markings/sec, 215 secs
lola: 26252982 markings, 62976635 edges, 1399 markings/sec, 220 secs
lola: 26256342 markings, 62984491 edges, 672 markings/sec, 225 secs
lola: 26258100 markings, 62989349 edges, 352 markings/sec, 230 secs
lola: 26258342 markings, 62990059 edges, 48 markings/sec, 235 secs
lola: 26258367 markings, 62990135 edges, 5 markings/sec, 240 secs
lola: 26258724 markings, 62991124 edges, 71 markings/sec, 245 secs
lola: 26258733 markings, 62991152 edges, 2 markings/sec, 250 secs
lola: 26258749 markings, 62991195 edges, 3 markings/sec, 255 secs
lola: 26258770 markings, 62991252 edges, 4 markings/sec, 260 secs
lola: 26258781 markings, 62991280 edges, 2 markings/sec, 265 secs
lola: 26258797 markings, 62991328 edges, 3 markings/sec, 270 secs
lola: 26258817 markings, 62991379 edges, 4 markings/sec, 275 secs
lola: 26258830 markings, 62991416 edges, 3 markings/sec, 280 secs
lola: 26258839 markings, 62991441 edges, 2 markings/sec, 285 secs
lola: 26258850 markings, 62991470 edges, 2 markings/sec, 290 secs
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: 'p'
Aborted (core dumped)
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T06"
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/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 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 PolyORBLF-COL-S02J04T06, 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 r126-smll-152673528200010"
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 ;