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 276K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 94K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBNT-COL-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673533000283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526985754586


BK_STOP 1526986467614

--------------------
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 PolyORBNT-COL-S05J60 as instance name.
Using PolyORBNT 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': 882504, 'Memory': 15948.29, 'Tool': 'lola'}, {'Time': 1994092, 'Memory': 15949.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J60...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBNT-COL-S05J60: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J60: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S05J60 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2999/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 969 places, 2030 transitions, 827 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1728 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-CTLCardinality.task
lola: ((p567 <= p570) AND NOT(E (F ((p74 + 1 <= p444))))) : A (G (A (((p888 <= p3) U (p570 <= p954))))) : E ((((p959 + p958 + p957 + p956 + p955 <= 1) AND (p968 <= 2)) U E (F ((1 <= p67))))) : (E (X (E (X ((1 <= p963 + p964 + p965 + p966 + p967))))) AND NOT(E (G (((p953 <= p758) OR (3 <= p68)))))) : NOT(E (F (((p443 + 1 <= p66) AND ((p887 <= p953) OR (p69 + p70 + p71 + p72 + p73 <= p3)))))) : ((E (G ((p960 + 1 <= p959 + p958 + p957 + p956 + p955))) AND ((p569 <= 0) AND ((3 <= p0) OR (p66 <= p137) OR (p959 + p958 + p957 + p956 + p955 + 1 <= p4)))) AND ((((p960 <= 1) AND ((p695 <= p568) OR (p570 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566))) OR E (F ((3 <= p951)))) OR NOT(A (X ((p443 <= p693)))))) : (A (G (E (X ((3 <= p569))))) OR NOT(A (G ((p695 <= 2))))) : (E (((2 <= p74) U ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 + p831 + p830 + p829 + p828 + p827 + p826 <= p74) OR (p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + 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 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + 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 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + 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 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 <= p137)))) AND A (F ((1 <= p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))) : ((E (G (())) AND A (((2 <= p953) U (1 <= p694)))) OR (((3 <= p570) AND (2 <= p68)) OR E (G (((p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p952) OR (p67 <= p960)))))) : E (F ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 + p831 + p830 + p829 + p828 + p827 + p826 <= 2))) : E (G ((((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 + p831 + p830 + p829 + p828 + p827 + p826 <= 2) AND (p67 <= p889)) OR (p443 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + 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 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + 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 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + 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 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442)))) : E (G (A (F ((p568 <= p570))))) : NOT(E (X (E (F ((3 <= p567)))))) : NOT(E (G (E (F ((p968 <= p1)))))) : E (G (A (((p694 <= p1) U (p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566))))) : E (G ((p960 <= 0)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p567 <= p570) AND NOT(E (F ((p74 + 1 <= p444)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p567 <= p570)
lola: ========================================
----- Kill lola and sara stderr -----
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p567 <= p570)
lola: processed formula length: 14
lola: 3 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p444 <= p74)))
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 3308 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 PolyORBNT-COL-S05J60-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p888 <= p3) U (p570 <= p954)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((p888 <= p3) U (p570 <= p954)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 409601 markings, 1293938 edges, 3689330178019819520 markings/sec, 0 secs
lola: 808439 markings, 2555531 edges, 79768 markings/sec, 5 secs
lola: 1205870 markings, 3812859 edges, 79486 markings/sec, 10 secs
lola: 1600977 markings, 5063183 edges, 79021 markings/sec, 15 secs
lola: 1988843 markings, 6291670 edges, 77573 markings/sec, 20 secs
lola: 2405953 markings, 7615779 edges, 83422 markings/sec, 25 secs
lola: 2835659 markings, 8977858 edges, 85941 markings/sec, 30 secs
lola: 3014849 markings, 9987030 edges, 35838 markings/sec, 35 secs
lola: 3322548 markings, 10966471 edges, 61540 markings/sec, 40 secs
lola: 3639389 markings, 11966084 edges, 63368 markings/sec, 45 secs
lola: 3961960 markings, 12990356 edges, 64514 markings/sec, 50 secs
lola: 4293705 markings, 14042266 edges, 66349 markings/sec, 55 secs
lola: 4617728 markings, 15063488 edges, 64805 markings/sec, 60 secs
lola: 4972185 markings, 16191353 edges, 70891 markings/sec, 65 secs
lola: 5327204 markings, 17313447 edges, 71004 markings/sec, 70 secs
lola: 5707967 markings, 18520468 edges, 76153 markings/sec, 75 secs
lola: 5851357 markings, 19418736 edges, 28678 markings/sec, 80 secs
lola: 6150560 markings, 20368286 edges, 59841 markings/sec, 85 secs
lola: 6439054 markings, 21282398 edges, 57699 markings/sec, 90 secs
lola: 6760366 markings, 22295433 edges, 64262 markings/sec, 95 secs
lola: 7088137 markings, 23335388 edges, 65554 markings/sec, 100 secs
lola: 7427941 markings, 24411534 edges, 67961 markings/sec, 105 secs
lola: 7786437 markings, 25544104 edges, 71699 markings/sec, 110 secs
lola: 8151719 markings, 26704605 edges, 73056 markings/sec, 115 secs
lola: 8535551 markings, 27920945 edges, 76766 markings/sec, 120 secs
lola: 8693595 markings, 28866433 edges, 31609 markings/sec, 125 secs
lola: 8994800 markings, 29818874 edges, 60241 markings/sec, 130 secs
lola: 9307602 markings, 30806278 edges, 62560 markings/sec, 135 secs
lola: 9621891 markings, 31805613 edges, 62858 markings/sec, 140 secs
lola: 9945357 markings, 32832603 edges, 64693 markings/sec, 145 secs
lola: 10281116 markings, 33889153 edges, 67152 markings/sec, 150 secs
lola: 10632221 markings, 35006905 edges, 70221 markings/sec, 155 secs
lola: 11001861 markings, 36173007 edges, 73928 markings/sec, 160 secs
lola: 11380992 markings, 37375182 edges, 75826 markings/sec, 165 secs
lola: 11551558 markings, 38358348 edges, 34113 markings/sec, 170 secs
lola: 11846568 markings, 39292144 edges, 59002 markings/sec, 175 secs
lola: 12150151 markings, 40259271 edges, 60717 markings/sec, 180 secs
lola: 12462959 markings, 41246669 edges, 62562 markings/sec, 185 secs
lola: 12782294 markings, 42261203 edges, 63867 markings/sec, 190 secs
lola: 13112102 markings, 43305749 edges, 65962 markings/sec, 195 secs
lola: 13461264 markings, 44411666 edges, 69832 markings/sec, 200 secs
lola: 13828260 markings, 45569845 edges, 73399 markings/sec, 205 secs
lola: 14209145 markings, 46777350 edges, 76177 markings/sec, 210 secs
lola: 14398103 markings, 47823481 edges, 37792 markings/sec, 215 secs
lola: 14681488 markings, 48722227 edges, 56677 markings/sec, 220 secs
lola: 14990032 markings, 49696724 edges, 61709 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p959 + p958 + p957 + p956 + p955 <= 1) AND (p968 <= 2)) U E (F ((1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p959 + p958 + p957 + p956 + p955 <= 1) AND (p968 <= 2)) U E(TRUE U (1 <= p67)))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (X ((1 <= p963 + p964 + p965 + p966 + p967))))) AND NOT(E (G (((p953 <= p758) OR (3 <= p68))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((1 <= p963 + p964 + p965 + p966 + p967)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((1 <= p963 + p964 + p965 + p966 + p967)))
lola: processed formula length: 47
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p758 + 1 <= p953) AND (p68 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p758 + 1 <= p953) AND (p68 <= 2))))
lola: processed formula: A (F (((p758 + 1 <= p953) AND (p68 <= 2))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 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: 35 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((p443 + 1 <= p66) AND ((p887 <= p953) OR (p69 + p70 + p71 + p72 + p73 <= p3))))))
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 3308 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: state equation: write sara problem file to PolyORBNT-COL-S05J60-CTLCardinality-4.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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p960 + 1 <= p959 + p958 + p957 + p956 + p955))) AND ((p569 <= 0) AND ((3 <= p0) OR (p66 <= p137) OR (p959 + p958 + p957 + p956 + p955 + 1 <= p4)))) AND ((((p960 <= 1) AND ((p695 <= p568) OR (p570 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p960 + 1 <= p959 + p958 + p957 + p956 + p955)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p959 + p958 + p957 + p956 + p955 <= p960)))
lola: processed formula length: 57
lola: 7 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 35 markings, 34 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p569 <= 0) AND ((3 <= p0) OR (p66 <= p137) OR (p959 + p958 + p957 + p956 + p955 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p569 <= 0) AND ((3 <= p0) OR (p66 <= p137) OR (p959 + p958 + p957 + p956 + p955 + 1 <= p4)))
lola: processed formula length: 96
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p960 <= 1) AND ((p695 <= p568) OR (p570 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p960 <= 1) AND ((p695 <= p568) OR (p570 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556... (shortened)
lola: processed formula length: 473
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((3 <= p569))))) OR NOT(A (G ((p695 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((3 <= p569)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((3 <= p569)))))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p695)))
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 3308 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 PolyORBNT-COL-S05J60-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((2 <= p74) U ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p74) U ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p83... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p74) U ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 ... (shortened)
lola: processed formula length: 2598
lola: 1 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
lola: processed formula: A (F ((1 <= p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
lola: processed formula length: 373
lola: 0 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 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: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (())) AND A (((2 <= p953) U (1 <= p694)))) OR (((3 <= p570) AND (2 <= p68)) OR E (G (((p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p953) U (1 <= p694)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p953) U (1 <= p694)))
lola: processed formula: A (((2 <= p953) U (1 <= p694)))
lola: processed formula length: 31
lola: 4 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3312 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p570) AND (2 <= p68))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p570) AND (2 <= p68))
lola: processed formula length: 28
lola: 4 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-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 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p952) OR (p67 <= p960))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p952 + 1 <= p5 + p6 + p7 + p8 + p9 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65) AND (p960 + 1... (shortened)
lola: processed formula length: 411
lola: 6 rewrites
lola: formula mentions 0 of 969 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3308 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: 35 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p886 + p885 + p884 + p883 + p882 + p881 + p880 + p879 + p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860 + p859 + p858 + p857 + p856 + p855 + p854 + p853 + p852 + p851 + p850 + p849 + p848 + p847 + p846 + p845 + p844 + p843 + p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833 + p832 + p831 + p... (shortened)
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 3308 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 PolyORBNT-COL-S05J60-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 25113 markings, 51092 edges, 5023 markings/sec, 0 secs
lola: sara is running 5 secs || 50503 markings, 110348 edges, 5078 markings/sec, 5 secs
lola: sara is running 10 secs || 75331 markings, 168488 edges, 4966 markings/sec, 10 secs
lola: sara is running 15 secs || 100522 markings, 219837 edges, 5038 markings/sec, 15 secs
lola: sara is running 20 secs || 125989 markings, 279298 edges, 5093 markings/sec, 20 secs
lola: sara is running 25 secs || 151175 markings, 338046 edges, 5037 markings/sec, 25 secs
lola: sara is running 30 secs || 176316 markings, 389401 edges, 5028 markings/sec, 30 secs
lola: sara is running 35 secs || 201452 markings, 448183 edges, 5027 markings/sec, 35 secs
lola: sara is running 40 secs || 226697 markings, 507040 edges, 5049 markings/sec, 40 secs
lola: sara is running 45 secs || 251929 markings, 565963 edges, 5046 markings/sec, 45 secs
lola: sara is running 50 secs || 277492 markings, 618230 edges, 5113 markings/sec, 50 secs
lola: sara is running 55 secs || 302869 markings, 677432 edges, 5075 markings/sec, 55 secs
lola: sara is running 60 secs || 328114 markings, 736296 edges, 5049 markings/sec, 60 secs
lola: sara is running 65 secs || 353453 markings, 788054 edges, 5068 markings/sec, 65 secs
lola: sara is running 70 secs || 378775 markings, 847113 edges, 5064 markings/sec, 70 secs
lola: sara is running 75 secs || 403965 markings, 905950 edges, 5038 markings/sec, 75 secs
lola: sara is running 80 secs || 429143 markings, 957352 edges, 5036 markings/sec, 80 secs
lola: sara is running 85 secs || 454452 markings, 1016449 edges, 5062 markings/sec, 85 secs
lola: sara is running 90 secs || 479613 markings, 1075212 edges, 5032 markings/sec, 90 secs
lola: sara is running 95 secs || 504620 markings, 1133689 edges, 5001 markings/sec, 95 secs
lola: sara is running 100 secs || 529917 markings, 1185292 edges, 5059 markings/sec, 100 secs
lola: sara is running 105 secs || 555058 markings, 1244059 edges, 5028 markings/sec, 105 secs
lola: sara is running 110 secs || 580067 markings, 1302501 edges, 5002 markings/sec, 110 secs
lola: sara is running 115 secs || 605221 markings, 1353871 edges, 5031 markings/sec, 115 secs
lola: sara is running 120 secs || 630362 markings, 1412527 edges, 5028 markings/sec, 120 secs
lola: sara is running 125 secs || 655357 markings, 1471063 edges, 4999 markings/sec, 125 secs
lola: sara is running 130 secs || 680384 markings, 1522031 edges, 5005 markings/sec, 130 secs
lola: sara is running 135 secs || 705468 markings, 1580705 edges, 5017 markings/sec, 135 secs
lola: sara is running 140 secs || 730460 markings, 1639060 edges, 4998 markings/sec, 140 secs
lola: sara is running 145 secs || 755278 markings, 1697144 edges, 4964 markings/sec, 145 secs
lola: sara is running 150 secs || 780437 markings, 1748505 edges, 5032 markings/sec, 150 secs
lola: sara is running 155 secs || 805384 markings, 1806864 edges, 4989 markings/sec, 155 secs
lola: sara is running 160 secs || 830171 markings, 1864878 edges, 4957 markings/sec, 160 secs
lola: sara is running 165 secs || 855135 markings, 1915831 edges, 4993 markings/sec, 165 secs
lola: sara is running 170 secs || 880084 markings, 1974114 edges, 4990 markings/sec, 170 secs
lola: sara is running 175 secs || 904890 markings, 2032183 edges, 4961 markings/sec, 175 secs
lola: sara is running 180 secs || 929778 markings, 2083073 edges, 4978 markings/sec, 180 secs
lola: sara is running 185 secs || 954709 markings, 2141329 edges, 4986 markings/sec, 185 secs
lola: sara is running 190 secs || 979323 markings, 2199037 edges, 4923 markings/sec, 190 secs
lola: sara is running 195 secs || 1003850 markings, 2249075 edges, 4905 markings/sec, 195 secs
lola: sara is running 200 secs || 1028578 markings, 2306937 edges, 4946 markings/sec, 200 secs
lola: sara is running 205 secs || 1053070 markings, 2364325 edges, 4898 markings/sec, 205 secs
lola: sara is running 210 secs || 1077430 markings, 2421440 edges, 4872 markings/sec, 210 secs
lola: sara is running 215 secs || 1102100 markings, 2471808 edges, 4934 markings/sec, 215 secs
lola: sara is running 220 secs || 1126516 markings, 2529093 edges, 4883 markings/sec, 220 secs
lola: sara is running 225 secs || 1150727 markings, 2585912 edges, 4842 markings/sec, 225 secs
lola: sara is running 230 secs || 1175323 markings, 2636122 edges, 4919 markings/sec, 230 secs
lola: sara is running 235 secs || 1199685 markings, 2693193 edges, 4872 markings/sec, 235 secs
lola: sara is running 240 secs || 1223863 markings, 2749961 edges, 4836 markings/sec, 240 secs
lola: sara is running 245 secs || 1248337 markings, 2799965 edges, 4895 markings/sec, 245 secs
lola: sara is running 250 secs || 1272675 markings, 2856999 edges, 4868 markings/sec, 250 secs
lola: sara is running 255 secs || 1296820 markings, 2913696 edges, 4829 markings/sec, 255 secs
lola: sara is running 260 secs || 1321233 markings, 2963595 edges, 4883 markings/sec, 260 secs
lola: sara is running 265 secs || 1345527 markings, 3020560 edges, 4859 markings/sec, 265 secs
lola: sara is running 270 secs || 1369651 markings, 3077229 edges, 4825 markings/sec, 270 secs
lola: sara is running 275 secs || 1393986 markings, 3126949 edges, 4867 markings/sec, 275 secs
lola: sara is running 280 secs || 1418209 markings, 3183854 edges, 4845 markings/sec, 280 secs
lola: sara is running 285 secs || 1442292 markings, 3240391 edges, 4817 markings/sec, 285 secs
lola: sara is running 290 secs || 1466563 markings, 3289876 edges, 4854 markings/sec, 290 secs
lola: sara is running 295 secs || 1490770 markings, 3346691 edges, 4841 markings/sec, 295 secs
lola: sara is running 300 secs || 1514792 markings, 3403174 edges, 4804 markings/sec, 300 secs
lola: sara is running 305 secs || 1538997 markings, 3452520 edges, 4841 markings/sec, 305 secs
lola: sara is running 310 secs || 1563193 markings, 3509299 edges, 4839 markings/sec, 310 secs
lola: sara is running 315 secs || 1587209 markings, 3565798 edges, 4803 markings/sec, 315 secs
lola: sara is running 320 secs || 1611401 markings, 3615098 edges, 4838 markings/sec, 320 secs
lola: sara is running 325 secs || 1635538 markings, 3671787 edges, 4827 markings/sec, 325 secs
lola: sara is running 330 secs || 1659136 markings, 3727390 edges, 4720 markings/sec, 330 secs
lola: sara is running 335 secs || 1683106 markings, 3776281 edges, 4794 markings/sec, 335 secs
lola: sara is running 340 secs || 1707111 markings, 3832772 edges, 4801 markings/sec, 340 secs
lola: sara is running 345 secs || 1730950 markings, 3888857 edges, 4768 markings/sec, 345 secs
lola: sara is running 350 secs || 1754945 markings, 3937796 edges, 4799 markings/sec, 350 secs
lola: sara is running 355 secs || 1778912 markings, 3994122 edges, 4793 markings/sec, 355 secs
lola: sara is running 360 secs || 1802671 markings, 4050083 edges, 4752 markings/sec, 360 secs
lola: sara is running 365 secs || 1826567 markings, 4098769 edges, 4779 markings/sec, 365 secs
lola: sara is running 370 secs || 1850414 markings, 4154962 edges, 4769 markings/sec, 370 secs
lola: sara is running 375 secs || 1874195 markings, 4210845 edges, 4756 markings/sec, 375 secs
lola: sara is running 380 secs || 1898154 markings, 4259755 edges, 4792 markings/sec, 380 secs
lola: sara is running 385 secs || 1922052 markings, 4316077 edges, 4780 markings/sec, 385 secs
lola: sara is running 390 secs || 1945761 markings, 4371786 edges, 4742 markings/sec, 390 secs
lola: sara is running 395 secs || 1969654 markings, 4420610 edges, 4779 markings/sec, 395 secs
lola: sara is running 400 secs || 1993506 markings, 4476585 edges, 4770 markings/sec, 400 secs
lola: sara is running 405 secs || 2017134 markings, 4532269 edges, 4726 markings/sec, 405 secs
lola: sara is running 410 secs || 2041006 markings, 4580983 edges, 4774 markings/sec, 410 secs
lola: sara is running 415 secs || 2064785 markings, 4636995 edges, 4756 markings/sec, 415 secs
lola: sara is running 420 secs || 2088331 markings, 4692481 edges, 4709 markings/sec, 420 secs
lola: sara is running 425 secs || 2112198 markings, 4741094 edges, 4773 markings/sec, 425 secs
lola: sara is running 430 secs || 2123039 markings, 5197344 edges, 2168 markings/sec, 430 secs
lola: sara is running 435 secs || 2147907 markings, 5266198 edges, 4974 markings/sec, 435 secs
lola: sara is running 440 secs || 2173075 markings, 5325112 edges, 5034 markings/sec, 440 secs
lola: sara is running 445 secs || 2197741 markings, 5383366 edges, 4933 markings/sec, 445 secs
lola: sara is running 450 secs || 2222649 markings, 5434645 edges, 4982 markings/sec, 450 secs
lola: sara is running 455 secs || 2247526 markings, 5493346 edges, 4975 markings/sec, 455 secs
lola: sara is running 460 secs || 2272270 markings, 5551654 edges, 4949 markings/sec, 460 secs
lola: sara is running 465 secs || 2297155 markings, 5602872 edges, 4977 markings/sec, 465 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PolyORBNT-COL-S05J60, 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 r130-smll-152673533000283"
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 ;