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 mcc4mcc-structural
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 r131-smll-152673533900010
=====================================================================

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


BK_STOP 1526859470765

--------------------
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 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 stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
make: [verify] Error 134 (ignored)
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
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
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 <= p120) AND (p385 + p386 + p387 + p388 + p389 + p390 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p384 + p383 + p382 + p381 + p380 + p379 <= p174 + p175 + p176 + p177 + p178 + p179) AND (p398 + p399 + p400 + p401 + p402 + p403 <= p244 + p245 + p246 + p247 + p248 + p249) AND (p268 + p269 + p270 + p271 + p272 + p273 + 1 <= p289) AND (1 <= p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363)))) : NOT(A (G ((((3 <= p327 + p328 + p329 + p330 + p331 + p332) AND (3 <= p234)) OR ((p451 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38)))))) : E ((((p434 + p435 + p436 + p437 + p438 + p439 <= p106 + p107 + p108 + p109 + p110 + p111) OR (1 <= p173)) U ((p227 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p75) AND (1 <= p167 + p168 + p169 + p170 + p171 + p172) AND (p289 <= p112) AND (p423 + p424 + p425 + p426 + p427 <= p40 + p41 + p42 + p43 + p44 + p45)))) : A (G ((((p279 + 1 <= p192 + p193 + p194 + p195 + p196 + p197) OR ((p250 + p251 + p252 + p253 + p254 + p255 <= p452 + p453 + p454 + p455 + p456 + p457) AND (p204 + p205 + p206 + p207 + p208 + p209 <= p227))) AND (((p288 <= p198 + p199 + p200 + p201 + p202 + p203) AND (2 <= p378)) OR ((p385 + p386 + p387 + p388 + p389 + p390 <= p309 + p310 + p311 + p312 + p313 + p314) AND (p106 + p107 + p108 + p109 + p110 + p111 <= p282 + p283 + p284 + p285 + p286 + p287)))))) : ((NOT(E (G ((p268 + p269 + p270 + p271 + p272 + p273 <= p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))) AND (A (G ((p137 + p138 + p139 + p140 + p141 + p142 <= p268 + p269 + p270 + p271 + p272 + p273))) OR E (G ((3 <= p385 + p386 + p387 + p388 + p389 + p390))))) AND (p434 + p435 + p436 + p437 + p438 + p439 <= p302)) : (E (G (E (X ((p106 + p107 + p108 + p109 + p110 + p111 <= p256 + p257 + p258 + p259 + p260 + p261))))) AND (NOT(E (X ((2 <= p204 + p205 + p206 + p207 + p208 + p209)))) OR (A (X ((p321 + p322 + p323 + p324 + p325 + p326 <= p302))) AND A (F ((p39 <= p416)))))) : (A (F (A (X ((3 <= p280 + p281))))) AND ((A (X ((p250 + p251 + p252 + p253 + p254 + p255 <= p398 + p399 + p400 + p401 + p402 + p403))) OR A (G ((3 <= p234)))) AND (2 <= p122 + p121))) : E (G (A (F (((p279 <= p1 + p2) OR (p384 + p383 + p382 + p381 + p380 + p379 <= p234)))))) : (NOT((((p280 + p281 <= 1) OR (p417 + p418 + p419 + p420 + p421 + p422 + 1 <= p428 + p429 + p430 + p431 + p432 + p433)) AND E (F ((2 <= p279))))) OR (((p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p39) AND (1 <= p1 + p2)) AND E (F (((p40 + p41 + p42 + p43 + p44 + p45 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p469 + p468) AND (p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p469 + p468 <= p268 + p269 + p270 + p271 + p272 + p273)))))) : E (F (E (G (((1 <= p398 + p399 + p400 + p401 + p402 + p403) OR (p445 + p444 + p443 + p442 + p441 + p440 <= p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))))) : A (F (E (G (((p153 + p154 + p155 + p156 + p157 + p158 <= p428 + p429 + p430 + p431 + p432 + p433) OR (3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))) : A (G (((((p250 + p251 + p252 + p253 + p254 + p255 <= p222 + p223 + p224 + p225 + p226) AND (2 <= p122 + p121)) OR ((p106 + p107 + p108 + p109 + p110 + p111 <= p309 + p310 + p311 + p312 + p313 + p314) AND (1 <= p372 + p373 + p374 + p375 + p376 + p377))) OR E (F ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p75 <= p327 + p328 + p329 + p330 + p331 + p332)))))) : ((E (G ((p423 + p424 + p425 + p426 + p427 + 1 <= p165))) OR E (G (((1 <= p136) OR (1 <= p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363))))) OR A (X ((3 <= p288)))) : ((p434 + p435 + p436 + p437 + p438 + p439 + 1 <= p280 + p281) OR E (F (((1 <= p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415) OR ((p174 + p175 + p176 + p177 + p178 + p179 <= p397) AND (p40 + p41 + p42 + p43 + p44 + p45 <= p288)))))) : ((((((3 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152) OR (1 <= p268 + p269 + p270 + p271 + p272 + p273)) AND (3 <= p198 + p199 + p200 + p201 + p202 + p203)) OR A (F ((1 <= p165)))) AND A (G (((p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p469 + p468 <= p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221) OR (p366 + p367 + p368 + p369 + p370 + p371 <= p423 + p424 + p425 + p426 + p427))))) OR E ((((p321 + p322 + p323 + p324 + p325 + p326 <= p470 + p471 + p472 + p473 + p474 + p475) AND (1 <= p434 + p435 + p436 + p437 + p438 + p439)) U ((p167 + p168 + p169 + p170 + p171 + p172 <= p129) AND (1 <= p397))))) : A (((p250 + p251 + p252 + p253 + p254 + p255 <= p452 + p453 + p454 + p455 + p456 + p457) U ((p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p446 + p447 + p448 + p449 + p450) AND (2 <= p112) AND (p282 + p283 + p284 + p285 + p286 + p287 <= 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 <= p120) AND (p385 + p386 + p387 + p388 + p389 + p390 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p384 + p383 + p382 + p381 + p380 + p379 <= p174 + p175 + p176 + p177 + p178 + p179) AND (p398 + p399 + p400 + p401 + p402 + p403 <= p244 + p245 + p246 + p247 + p248 + p249) AND (p268 + p269 + p270 + p271 + p272 + p273 + 1 <= p289) AND (1 <= p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p120) AND (p385 + p386 + p387 + p388 + p389 + p390 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p384 + p383 + p382 + p381 + p380 + p379 <= p174 + p175 + p176 + p177 + p178 + p179) AND (p398 + p399 + p400 + p401 + p402 + p403 <= p244 + p245 + p246 + p247 + p248 + p249) AND (p268 + p269 + p270 + p271 + p272 + p273 + 1 <= p289) AND (1 <= p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363))))
lola: processed formula: A (F (((3 <= p120) AND (p385 + p386 + p387 + p388 + p389 + p390 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p384 + p383 + p382 + p381 + p380 + p379 <= p174 + p175 + p176 + p177 + p178 + p179) AND (p398 + p399 + p400 + p401 + p402 + p403 <= p244 + p245 + p246 + p247 + p248 + p249) AND (p268 + p269 + p270 + p271 + p272 + p273 + 1 <= p289) AND (1 <= p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p3... (shortened)
lola: processed formula length: 553
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: 362 markings, 362 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((3 <= p327 + p328 + p329 + p330 + p331 + p332) AND (3 <= p234)) OR ((p451 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38))))))
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: 54 markings, 53 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p434 + p435 + p436 + p437 + p438 + p439 <= p106 + p107 + p108 + p109 + p110 + p111) OR (1 <= p173)) U ((p227 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p75) AND (1 <= p167 + p168 + p169 + p170 + p171 + p172) AND (p289 <= p112) AND (p423 + p424 + p425 + p426 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p434 + p435 + p436 + p437 + p438 + p439 <= p106 + p107 + p108 + p109 + p110 + p111) OR (1 <= p173)) U ((p227 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p75) AND (1 <= p167 + p168 + p169 + p170 + p171 + p172) AND (p289 <= p112) AND (p423 + p424 + p425 + p426 + p... (shortened)
lola: processed formula length: 443
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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p279 + 1 <= p192 + p193 + p194 + p195 + p196 + p197) OR ((p250 + p251 + p252 + p253 + p254 + p255 <= p452 + p453 + p454 + p455 + p456 + p457) AND (p204 + p205 + p206 + p207 + p208 + p209 <= p227))) AND (((p288 <= p198 + p199 + p200 + p201 + p202 + p203) AND (2 <= p378)) OR ((p385 + p386 + p387 + p388 + p389 + p390 <= p309 + p310 + p311 + p312 + p313 + p314) AND (p106 + p107 + p108 + p10... (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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((p268 + p269 + p270 + p271 + p272 + p273 <= p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))) AND (A (G ((p137 + p138 + p139 + p140 + p141 + p142 <= p268 + p269 + p270 + p271 + p272 + p273))) OR E (G ((3 <= p385 + p386 + p387 + p388 + p389 + p390))))) AND (p434 + p435 + p436 + p437 + p438 + p439 <= p302))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 1 <= p268 + p269 + p270 + p271 + p272 + p273)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 1 <= p268 + p269 + p270 + p271 + p272 + p273)))
lola: processed formula: A (F ((p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 1 <= p268 + p269 + p270 + p271 + p272 + p273)))
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: 33429 markings, 40589 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p137 + p138 + p139 + p140 + p141 + p142 <= p268 + p269 + p270 + p271 + p272 + p273)))
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-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p385 + p386 + p387 + p388 + p389 + p390)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p385 + p386 + p387 + p388 + p389 + p390 <= 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 ((p106 + p107 + p108 + p109 + p110 + p111 <= p256 + p257 + p258 + p259 + p260 + p261))))) AND (NOT(E (X ((2 <= p204 + p205 + p206 + p207 + p208 + p209)))) OR (A (X ((p321 + p322 + p323 + p324 + p325 + p326 <= p302))) AND A (F ((p39 <= p416))))))
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 ((p106 + p107 + p108 + p109 + p110 + p111 <= p256 + p257 + p258 + p259 + p260 + p261)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p106 + p107 + p108 + p109 + p110 + p111 <= p256 + p257 + p258 + p259 + p260 + p261)))))
lola: processed formula length: 108
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: 335 markings, 335 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p204 + p205 + p206 + p207 + p208 + p209 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p204 + p205 + p206 + p207 + p208 + p209 <= 1)))
lola: processed formula: A (X ((p204 + p205 + p206 + p207 + p208 + p209 <= 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 <= p280 + p281))))) AND ((A (X ((p250 + p251 + p252 + p253 + p254 + p255 <= p398 + p399 + p400 + p401 + p402 + p403))) OR A (G ((3 <= p234)))) AND (2 <= p122 + p121)))
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 <= p280 + p281)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p280 + p281)))
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: 335 markings, 335 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 (((p279 <= p1 + p2) OR (p384 + p383 + p382 + p381 + p380 + p379 <= p234))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p279 <= p1 + p2) OR (p384 + p383 + p382 + p381 + p380 + p379 <= p234))))))
lola: processed formula length: 103
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: 593 markings, 1186 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((p280 + p281 <= 1) OR (p417 + p418 + p419 + p420 + p421 + p422 + 1 <= p428 + p429 + p430 + p431 + p432 + p433)) AND E (F ((2 <= p279))))) OR (((p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p39) AND (1 <= p1 + p2)) AND E (F (((p40 + p41 + p42 + p43 + p44 + p45 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p469 + p468) AND (p458 + p459 + p460 + p461 + p462 + p463... (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 <= p280 + p281) AND (p428 + p429 + p430 + p431 + p432 + p433 <= p417 + p418 + p419 + p420 + p421 + p422))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p280 + p281) AND (p428 + p429 + p430 + p431 + p432 + p433 <= p417 + p418 + p419 + p420 + p421 + p422))
lola: processed formula length: 109
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 ((p279 <= 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 || 151823 markings, 179831 edges, 30365 markings/sec, 0 secs
lola: sara is running 5 secs || 300471 markings, 358634 edges, 29730 markings/sec, 5 secs
lola: sara is running 10 secs || 448499 markings, 535218 edges, 29606 markings/sec, 10 secs
lola: sara is running 15 secs || 595938 markings, 712239 edges, 29488 markings/sec, 15 secs
lola: sara is running 20 secs || 742581 markings, 888913 edges, 29329 markings/sec, 20 secs
lola: sara is running 25 secs || 888857 markings, 1064058 edges, 29255 markings/sec, 25 secs
lola: sara is running 30 secs || 1034528 markings, 1240064 edges, 29134 markings/sec, 30 secs
lola: sara is running 35 secs || 1179302 markings, 1415380 edges, 28955 markings/sec, 35 secs
lola: sara is running 40 secs || 1324699 markings, 1590598 edges, 29079 markings/sec, 40 secs
lola: sara is running 45 secs || 1469324 markings, 1766321 edges, 28925 markings/sec, 45 secs
lola: sara is running 50 secs || 1614342 markings, 1942256 edges, 29004 markings/sec, 50 secs
lola: sara is running 55 secs || 1759017 markings, 2117640 edges, 28935 markings/sec, 55 secs
lola: sara is running 60 secs || 1903354 markings, 2293177 edges, 28867 markings/sec, 60 secs
lola: sara is running 65 secs || 2047482 markings, 2469170 edges, 28826 markings/sec, 65 secs
lola: sara is running 70 secs || 2191265 markings, 2644981 edges, 28757 markings/sec, 70 secs
lola: sara is running 75 secs || 2335383 markings, 2819708 edges, 28824 markings/sec, 75 secs
lola: sara is running 80 secs || 2479197 markings, 2995292 edges, 28763 markings/sec, 80 secs
lola: sara is running 85 secs || 2622876 markings, 3169865 edges, 28736 markings/sec, 85 secs
lola: sara is running 90 secs || 2766656 markings, 3344654 edges, 28756 markings/sec, 90 secs
lola: sara is running 95 secs || 2910183 markings, 3518540 edges, 28705 markings/sec, 95 secs
lola: sara is running 100 secs || 3053704 markings, 3693334 edges, 28704 markings/sec, 100 secs
lola: sara is running 105 secs || 3197583 markings, 3867312 edges, 28776 markings/sec, 105 secs
lola: sara is running 110 secs || 3341516 markings, 4040692 edges, 28787 markings/sec, 110 secs
lola: sara is running 115 secs || 3485303 markings, 4213982 edges, 28757 markings/sec, 115 secs
lola: sara is running 120 secs || 3628779 markings, 4387430 edges, 28695 markings/sec, 120 secs
lola: sara is running 125 secs || 3773369 markings, 4560119 edges, 28918 markings/sec, 125 secs
lola: sara is running 130 secs || 3917091 markings, 4733662 edges, 28744 markings/sec, 130 secs
lola: sara is running 135 secs || 4060892 markings, 4907988 edges, 28760 markings/sec, 135 secs
lola: sara is running 140 secs || 4205093 markings, 5080969 edges, 28840 markings/sec, 140 secs
lola: sara is running 145 secs || 4348887 markings, 5254014 edges, 28759 markings/sec, 145 secs
lola: sara is running 150 secs || 4492425 markings, 5426159 edges, 28708 markings/sec, 150 secs
lola: sara is running 155 secs || 4636672 markings, 5597079 edges, 28849 markings/sec, 155 secs
lola: sara is running 160 secs || 4780502 markings, 5769485 edges, 28766 markings/sec, 160 secs
lola: sara is running 165 secs || 4924013 markings, 5942109 edges, 28702 markings/sec, 165 secs
lola: sara is running 170 secs || 5068133 markings, 6114147 edges, 28824 markings/sec, 170 secs
lola: sara is running 175 secs || 5211484 markings, 6286165 edges, 28670 markings/sec, 175 secs
lola: sara is running 180 secs || 5354869 markings, 6458219 edges, 28677 markings/sec, 180 secs
lola: sara is running 185 secs || 5497994 markings, 6629957 edges, 28625 markings/sec, 185 secs
lola: sara is running 190 secs || 5641328 markings, 6801676 edges, 28667 markings/sec, 190 secs
lola: sara is running 195 secs || 5784068 markings, 6970987 edges, 28548 markings/sec, 195 secs
lola: sara is running 200 secs || 5926567 markings, 7142800 edges, 28500 markings/sec, 200 secs
lola: sara is running 205 secs || 6068152 markings, 7315833 edges, 28317 markings/sec, 205 secs
lola: sara is running 210 secs || 6211749 markings, 7489791 edges, 28719 markings/sec, 210 secs
lola: sara is running 215 secs || 6354002 markings, 7661829 edges, 28451 markings/sec, 215 secs
lola: sara is running 220 secs || 6496388 markings, 7833897 edges, 28477 markings/sec, 220 secs
lola: sara is running 225 secs || 6637764 markings, 8006749 edges, 28275 markings/sec, 225 secs
lola: sara is running 230 secs || 6779561 markings, 8178345 edges, 28359 markings/sec, 230 secs
lola: sara is running 235 secs || 6920636 markings, 8352220 edges, 28215 markings/sec, 235 secs
lola: sara is running 240 secs || 7061590 markings, 8525625 edges, 28191 markings/sec, 240 secs
lola: sara is running 245 secs || 7202801 markings, 8699973 edges, 28242 markings/sec, 245 secs
lola: sara is running 250 secs || 7343172 markings, 8874333 edges, 28074 markings/sec, 250 secs
lola: sara is running 255 secs || 7483165 markings, 9048234 edges, 27999 markings/sec, 255 secs
lola: sara is running 260 secs || 7623205 markings, 9222662 edges, 28008 markings/sec, 260 secs
lola: sara is running 265 secs || 7763425 markings, 9395726 edges, 28044 markings/sec, 265 secs
lola: sara is running 270 secs || 7904471 markings, 9569795 edges, 28209 markings/sec, 270 secs
lola: sara is running 275 secs || 8044380 markings, 9744333 edges, 27982 markings/sec, 275 secs
lola: sara is running 280 secs || 8184272 markings, 9919187 edges, 27978 markings/sec, 280 secs
lola: sara is running 285 secs || 8324189 markings, 10094886 edges, 27983 markings/sec, 285 secs
lola: sara is running 290 secs || 8464008 markings, 10269797 edges, 27964 markings/sec, 290 secs
lola: sara is running 295 secs || 8603526 markings, 10445332 edges, 27904 markings/sec, 295 secs
lola: sara is running 300 secs || 8743250 markings, 10619878 edges, 27945 markings/sec, 300 secs
lola: sara is running 305 secs || 8883018 markings, 10794950 edges, 27954 markings/sec, 305 secs
lola: sara is running 310 secs || 9016794 markings, 10963072 edges, 26755 markings/sec, 310 secs
lola: sara is running 315 secs || 9148871 markings, 11129033 edges, 26415 markings/sec, 315 secs
lola: sara is running 320 secs || 9281162 markings, 11294950 edges, 26458 markings/sec, 320 secs
lola: sara is running 325 secs || 9413767 markings, 11460286 edges, 26521 markings/sec, 325 secs
lola: sara is running 330 secs || 9545668 markings, 11626984 edges, 26380 markings/sec, 330 secs
lola: sara is running 335 secs || 9678797 markings, 11792880 edges, 26626 markings/sec, 335 secs
lola: sara is running 340 secs || 9812060 markings, 11957367 edges, 26653 markings/sec, 340 secs
lola: sara is running 345 secs || 9944614 markings, 12121516 edges, 26511 markings/sec, 345 secs
lola: sara is running 350 secs || 10077090 markings, 12284087 edges, 26495 markings/sec, 350 secs
lola: sara is running 355 secs || 10210797 markings, 12448689 edges, 26741 markings/sec, 355 secs
lola: sara is running 360 secs || 10345133 markings, 12610910 edges, 26867 markings/sec, 360 secs
lola: sara is running 365 secs || 10478424 markings, 12774214 edges, 26658 markings/sec, 365 secs
lola: sara is running 370 secs || 10612965 markings, 12940795 edges, 26908 markings/sec, 370 secs
lola: sara is running 375 secs || 10746003 markings, 13100345 edges, 26608 markings/sec, 375 secs
lola: sara is running 380 secs || 10879745 markings, 13262741 edges, 26748 markings/sec, 380 secs
lola: sara is running 385 secs || 11014083 markings, 13427667 edges, 26868 markings/sec, 385 secs
lola: sara is running 390 secs || 11147962 markings, 13588673 edges, 26776 markings/sec, 390 secs
lola: sara is running 395 secs || 11284291 markings, 13760866 edges, 27266 markings/sec, 395 secs
lola: sara is running 400 secs || 11422669 markings, 13932582 edges, 27676 markings/sec, 400 secs
lola: sara is running 405 secs || 11557895 markings, 14099041 edges, 27045 markings/sec, 405 secs
lola: sara is running 410 secs || 11692063 markings, 14263627 edges, 26834 markings/sec, 410 secs
lola: sara is running 415 secs || 11826928 markings, 14436214 edges, 26973 markings/sec, 415 secs
lola: sara is running 420 secs || 11959780 markings, 14606481 edges, 26570 markings/sec, 420 secs
lola: sara is running 425 secs || 12094730 markings, 14772424 edges, 26990 markings/sec, 425 secs
lola: sara is running 430 secs || 12227789 markings, 14933024 edges, 26612 markings/sec, 430 secs
lola: sara is running 435 secs || 12362113 markings, 15099920 edges, 26865 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 <= p398 + p399 + p400 + p401 + p402 + p403) OR (p445 + p444 + p443 + p442 + p441 + p440 <= p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p398 + p399 + p400 + p401 + p402 + p403 <= 0) AND (p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + 1 <= p445 + p444 + p443 + p442 + p441 + p440)))))
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: 1696 markings, 1890 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p153 + p154 + p155 + p156 + p157 + p158 <= p428 + p429 + p430 + p431 + p432 + p433) OR (3 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p428 + p429 + p430 + p431 + p432 + p433 + 1 <= p153 + p154 + p155 + p156 + p157 + p158) AND (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= 2)))))
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: 634366 markings, 1432960 edges, 2976872481744224256 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 878303 markings, 1987310 edges
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p250 + p251 + p252 + p253 + p254 + p255 <= p222 + p223 + p224 + p225 + p226) AND (2 <= p122 + p121)) OR ((p106 + p107 + p108 + p109 + p110 + p111 <= p309 + p310 + p311 + p312 + p313 + p314) AND (1 <= p372 + p373 + p374 + p375 + p376 + p377))) OR E (F ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p46 + p47 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((((p222 + p223 + p224 + p225 + p226 + 1 <= p250 + p251 + p252 + p253 + p254 + p255) OR (p122 + p121 <= 1)) AND ((p309 + p310 + p311 + p312 + p313 + p314 + 1 <= p106 + p107 + p108 + p109 + p110 + p111) OR (p372 + p373 + p374 + p375 + p376 + p377 <= 0))) AND NOT(E(TRUE U (p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 +... (shortened)
lola: processed formula length: 513
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: 664648 markings, 1415006 edges, 2936885442865266688 markings/sec, 0 secs
lola: 1254604 markings, 2704933 edges, 117991 markings/sec, 5 secs
lola: 1826175 markings, 3963305 edges, 114314 markings/sec, 10 secs
lola: 2377720 markings, 5186606 edges, 110309 markings/sec, 15 secs
lola: 2916266 markings, 6397834 edges, 107709 markings/sec, 20 secs
lola: 3452863 markings, 7609538 edges, 107319 markings/sec, 25 secs
lola: 3984214 markings, 8805665 edges, 106270 markings/sec, 30 secs
lola: 4504147 markings, 9985364 edges, 103987 markings/sec, 35 secs
lola: 5034330 markings, 11220651 edges, 106037 markings/sec, 40 secs
lola: 5575701 markings, 12493883 edges, 108274 markings/sec, 45 secs
lola: 6118006 markings, 13795261 edges, 108461 markings/sec, 50 secs
lola: 6665683 markings, 15124507 edges, 109535 markings/sec, 55 secs
lola: 7213673 markings, 16479543 edges, 109598 markings/sec, 60 secs
lola: 7780725 markings, 17873936 edges, 113410 markings/sec, 65 secs
lola: 8328800 markings, 19237063 edges, 109615 markings/sec, 70 secs
lola: 8888403 markings, 20660645 edges, 111921 markings/sec, 75 secs
lola: 9421147 markings, 22013526 edges, 106549 markings/sec, 80 secs
lola: 9976267 markings, 23447315 edges, 111024 markings/sec, 85 secs
lola: 10524776 markings, 24825099 edges, 109702 markings/sec, 90 secs
lola: 11055833 markings, 26157688 edges, 106211 markings/sec, 95 secs
lola: 11568496 markings, 27511970 edges, 102533 markings/sec, 100 secs
lola: 12068472 markings, 28802937 edges, 99995 markings/sec, 105 secs
lola: 12566553 markings, 30058260 edges, 99616 markings/sec, 110 secs
lola: 13053967 markings, 31320038 edges, 97483 markings/sec, 115 secs
lola: 13515891 markings, 32529911 edges, 92385 markings/sec, 120 secs
lola: 13958704 markings, 33675387 edges, 88563 markings/sec, 125 secs
lola: 14403290 markings, 34830862 edges, 88917 markings/sec, 130 secs
lola: 14914384 markings, 36132819 edges, 102219 markings/sec, 135 secs
lola: 15055571 markings, 36479203 edges, 28237 markings/sec, 140 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 -----

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="mcc4mcc-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/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 mcc4mcc-structural"
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 r131-smll-152673533900010"
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 ;