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 256K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-COL-S05J20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534300262
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527002331168


BK_STOP 1527002950228

--------------------
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 PolyORBNT-COL-S05J20 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': 3540213, 'Memory': 15951.99, 'Tool': 'lola'}, {'Time': 3540352, 'Memory': 15952.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S05J20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBNT-COL-S05J20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S05J20 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1599/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 369 places, 1230 transitions, 307 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 688 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J20-CTLCardinality.task
lola: NOT(E (F (((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 + 1 <= p208) OR (p263 + 1 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262))))) : NOT(E (G (A (F ((p64 <= p206)))))) : (A (F (((p6 + 1 <= p151 + p152 + p153 + p154 + p155) AND (2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p37 + p36 + p35 + p34 + p33 + p32)))) AND (((p53 <= 0) OR (p64 <= 1) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p99 + 1 <= p3) AND (p55 + 1 <= p4))) AND ((p63 <= p238 + p237 + p236 + p235 + p234) AND A (F ((1 <= p151 + p152 + p153 + p154 + p155)))))) : E (F (NOT(E (F ((3 <= p3)))))) : A (G ((p2 <= p6))) : A (F (NOT(E (F ((2 <= p55)))))) : (E (X (A (X ((3 <= p3))))) OR A (F ((1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))) : (E (G ((((p2 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262) AND (2 <= p238 + p237 + p236 + p235 + p234)) OR ((3 <= p263) AND (p238 + p237 + p236 + p235 + p234 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p99))))) OR ((3 <= p31) AND (E (X ((2 <= 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))) OR (2 <= p151 + p152 + p153 + p154 + p155)))) : A (F (A (G (((p207 <= p56) AND (3 <= p3)))))) : ((A (G ((p209 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))) AND E (G ((p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p6)))) AND ((((p233 <= 2) OR (p62 <= 0)) AND ((p29 + 1 <= p1) OR (p151 + p152 + p153 + p154 + p155 + 1 <= p206))) OR NOT(A (X ((3 <= p0)))))) : E (F ((A (G ((p206 <= p207))) OR A (G ((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 <= p4)))))) : E (G (((p231 <= 0) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= p55)))) : A (F (E (G (((p56 <= p240) AND (p232 <= p209)))))) : A ((((1 <= p29) AND (2 <= p4) AND ((3 <= p232) OR (p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p2))) U E (F ((1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))))) : A (F ((A (G ((p56 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262))) AND (p5 <= p238 + p237 + p236 + p235 + p234)))) : A (G ((p149 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((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 + p31... (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 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p64 <= p206))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p64 <= p206))))
lola: processed formula length: 38
lola: 8 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 35 markings, 69 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p6 + 1 <= p151 + p152 + p153 + p154 + p155) AND (2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p37 + p36 + p35 + p34 + p33 + p32)))) AND (((p53 <= 0) OR (p64 <= 1) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p6 + 1 <= p151 + p152 + p153 + p154 + p155) AND (2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p37 + p36 + p35 + p34 + p33 + p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p6 + 1 <= p151 + p152 + p153 + p154 + p155) AND (2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p37 + p36 + p35 + p34 + p33 + p32))))
lola: processed formula: A (F (((p6 + 1 <= p151 + p152 + p153 + p154 + p155) AND (2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p37 + p36 + p35 + p34 + p33 + p32))))
lola: processed formula length: 189
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= p3))))
lola: processed formula length: 34
lola: 6 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: 492474 markings, 888776 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1002732 markings, 1770412 edges, 102052 markings/sec, 5 secs
lola: 1506288 markings, 2640967 edges, 100711 markings/sec, 10 secs
lola: 2010932 markings, 3513258 edges, 100929 markings/sec, 15 secs
lola: 2519106 markings, 4399853 edges, 101635 markings/sec, 20 secs
lola: 3196463 markings, 5861949 edges, 135471 markings/sec, 25 secs
lola: 3927787 markings, 7307397 edges, 146265 markings/sec, 30 secs
lola: 4626725 markings, 8693823 edges, 139788 markings/sec, 35 secs
lola: 5304526 markings, 10042019 edges, 135560 markings/sec, 40 secs
lola: 5981597 markings, 11357770 edges, 135414 markings/sec, 45 secs
lola: 6643394 markings, 12675279 edges, 132359 markings/sec, 50 secs
lola: 7313925 markings, 14008452 edges, 134106 markings/sec, 55 secs
lola: 7687535 markings, 15367375 edges, 74722 markings/sec, 60 secs
lola: 8358841 markings, 16701393 edges, 134261 markings/sec, 65 secs
lola: 9013635 markings, 18006858 edges, 130959 markings/sec, 70 secs
lola: 9676279 markings, 19296881 edges, 132529 markings/sec, 75 secs
lola: 10305448 markings, 20552731 edges, 125834 markings/sec, 80 secs
lola: 10940631 markings, 21821166 edges, 127037 markings/sec, 85 secs
lola: 11591723 markings, 23088877 edges, 130218 markings/sec, 90 secs
lola: 12229036 markings, 24361156 edges, 127463 markings/sec, 95 secs
lola: 12551164 markings, 25623899 edges, 64426 markings/sec, 100 secs
lola: 13141405 markings, 26808603 edges, 118048 markings/sec, 105 secs
lola: 13798123 markings, 28086050 edges, 131344 markings/sec, 110 secs
lola: 14414334 markings, 29320319 edges, 123242 markings/sec, 115 secs
lola: 15037253 markings, 30566082 edges, 124584 markings/sec, 120 secs
lola: 15655379 markings, 31772181 edges, 123625 markings/sec, 125 secs
lola: 16270625 markings, 33003155 edges, 123049 markings/sec, 130 secs
lola: 16903695 markings, 34236669 edges, 126614 markings/sec, 135 secs
lola: 17249703 markings, 35464036 edges, 69202 markings/sec, 140 secs
lola: 17754000 markings, 36570928 edges, 100859 markings/sec, 145 secs
lola: 18345699 markings, 37726666 edges, 118340 markings/sec, 150 secs
lola: 18962379 markings, 38961725 edges, 123336 markings/sec, 155 secs
lola: 19586946 markings, 40178934 edges, 124913 markings/sec, 160 secs
lola: 20183299 markings, 41375742 edges, 119271 markings/sec, 165 secs
lola: 20795302 markings, 42571304 edges, 122401 markings/sec, 170 secs
lola: 21397526 markings, 43778293 edges, 120445 markings/sec, 175 secs
lola: 22019794 markings, 44991530 edges, 124454 markings/sec, 180 secs
lola: 22288111 markings, 46155286 edges, 53663 markings/sec, 185 secs
lola: 22828580 markings, 47217951 edges, 108094 markings/sec, 190 secs
lola: 23380393 markings, 48331739 edges, 110363 markings/sec, 195 secs
lola: 24000659 markings, 49541547 edges, 124053 markings/sec, 200 secs
lola: 24589057 markings, 50723004 edges, 117680 markings/sec, 205 secs
lola: 25193039 markings, 51903176 edges, 120796 markings/sec, 210 secs
lola: 25784813 markings, 53092121 edges, 118355 markings/sec, 215 secs
lola: 26397566 markings, 54287418 edges, 122551 markings/sec, 220 secs
lola: 26956907 markings, 55489184 edges, 111868 markings/sec, 225 secs
lola: 27261004 markings, 56645864 edges, 60819 markings/sec, 230 secs
lola: 27786514 markings, 57679632 edges, 105102 markings/sec, 235 secs
lola: 28277051 markings, 58649867 edges, 98107 markings/sec, 240 secs
lola: 28897827 markings, 59860520 edges, 124155 markings/sec, 245 secs
lola: 29482704 markings, 61035999 edges, 116975 markings/sec, 250 secs
lola: 30093231 markings, 62227422 edges, 122105 markings/sec, 255 secs
lola: 30683745 markings, 63414227 edges, 118103 markings/sec, 260 secs
lola: 31301393 markings, 64617962 edges, 123530 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 <= p6)))
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 1228 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-S05J20-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((2 <= p55))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p55 <= 1)))))
lola: processed formula: A (F (A (G ((p55 <= 1)))))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 61975 markings, 93228 edges, 12395 markings/sec, 0 secs
lola: 124019 markings, 190708 edges, 12409 markings/sec, 5 secs
lola: 177366 markings, 277165 edges, 10669 markings/sec, 10 secs
lola: 246198 markings, 377584 edges, 13766 markings/sec, 15 secs
lola: 296366 markings, 467505 edges, 10034 markings/sec, 20 secs
lola: 362305 markings, 564564 edges, 13188 markings/sec, 25 secs
lola: 414660 markings, 652308 edges, 10471 markings/sec, 30 secs
lola: 475622 markings, 748429 edges, 12192 markings/sec, 35 secs
lola: 540049 markings, 848578 edges, 12885 markings/sec, 40 secs
lola: 593018 markings, 938202 edges, 10594 markings/sec, 45 secs
lola: 664199 markings, 1039581 edges, 14236 markings/sec, 50 secs
lola: 714416 markings, 1129645 edges, 10043 markings/sec, 55 secs
lola: 781083 markings, 1228351 edges, 13333 markings/sec, 60 secs
lola: 837110 markings, 1321618 edges, 11205 markings/sec, 65 secs
lola: 898017 markings, 1416744 edges, 12181 markings/sec, 70 secs
lola: 961873 markings, 1516330 edges, 12771 markings/sec, 75 secs
lola: 1014636 markings, 1605605 edges, 10553 markings/sec, 80 secs
lola: 1084901 markings, 1706563 edges, 14053 markings/sec, 85 secs
lola: 1134967 markings, 1795383 edges, 10013 markings/sec, 90 secs
lola: 1201045 markings, 1893316 edges, 13216 markings/sec, 95 secs
lola: 1257326 markings, 1986640 edges, 11256 markings/sec, 100 secs
lola: 1316795 markings, 2080348 edges, 11894 markings/sec, 105 secs
lola: 1381337 markings, 2179964 edges, 12908 markings/sec, 110 secs
lola: 1432386 markings, 2266051 edges, 10210 markings/sec, 115 secs
lola: 1501861 markings, 2367535 edges, 13895 markings/sec, 120 secs
lola: 1552541 markings, 2456780 edges, 10136 markings/sec, 125 secs
lola: 1616997 markings, 2552184 edges, 12891 markings/sec, 130 secs
lola: 1674816 markings, 2646424 edges, 11564 markings/sec, 135 secs
lola: 1731612 markings, 2738149 edges, 11359 markings/sec, 140 secs
lola: 1798072 markings, 2839030 edges, 13292 markings/sec, 145 secs
lola: 1847816 markings, 2923021 edges, 9949 markings/sec, 150 secs
lola: 1915223 markings, 3022102 edges, 13481 markings/sec, 155 secs
lola: 1967046 markings, 3112476 edges, 10365 markings/sec, 160 secs
lola: 2029308 markings, 3206407 edges, 12452 markings/sec, 165 secs
lola: 2089790 markings, 3302198 edges, 12096 markings/sec, 170 secs
lola: 2142734 markings, 3390689 edges, 10589 markings/sec, 175 secs
lola: 2211110 markings, 3490283 edges, 13675 markings/sec, 180 secs
lola: 2259830 markings, 3575934 edges, 9744 markings/sec, 185 secs
lola: 2324459 markings, 3671161 edges, 12926 markings/sec, 190 secs
lola: 2379903 markings, 3762602 edges, 11089 markings/sec, 195 secs
lola: 2437095 markings, 3854463 edges, 11438 markings/sec, 200 secs
lola: 2501145 markings, 3951975 edges, 12810 markings/sec, 205 secs
lola: 2549805 markings, 4034005 edges, 9732 markings/sec, 210 secs
lola: 2616373 markings, 4131391 edges, 13314 markings/sec, 215 secs
lola: 2668159 markings, 4219824 edges, 10357 markings/sec, 220 secs
lola: 2729657 markings, 4315235 edges, 12300 markings/sec, 225 secs
lola: 2791169 markings, 4412219 edges, 12302 markings/sec, 230 secs
lola: 2835917 markings, 4657183 edges, 8950 markings/sec, 235 secs
lola: 2887874 markings, 4828855 edges, 10391 markings/sec, 240 secs
lola: 2957212 markings, 4929619 edges, 13868 markings/sec, 245 secs
lola: 3008225 markings, 5021189 edges, 10203 markings/sec, 250 secs
lola: 3070184 markings, 5114581 edges, 12392 markings/sec, 255 secs
lola: 3127082 markings, 5207938 edges, 11380 markings/sec, 260 secs
lola: 3184523 markings, 5300034 edges, 11488 markings/sec, 265 secs
lola: 3250060 markings, 5400098 edges, 13107 markings/sec, 270 secs
lola: 3303176 markings, 5489612 edges, 10623 markings/sec, 275 secs
lola: 3373951 markings, 5590051 edges, 14155 markings/sec, 280 secs
lola: 3423231 markings, 5679074 edges, 9856 markings/sec, 285 secs
lola: 3489670 markings, 5777213 edges, 13288 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((3 <= p3))))) OR A (F ((1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((3 <= p3)))
lola: processed formula length: 17
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: processed formula: A (F ((1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: processed formula length: 159
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p2 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262) AND (2 <= p238 + p237 + p236 + p235 + p234)) OR ((3 <= p263) AND (p238 + p237 + p236 + p235 + p234 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p2 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262) AND (2 <= p238 + p237 + p236 + p235 + p234)) OR ((3 <= p263) AND (p238 + p237 + p236 + p235 + p234 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p66... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + 1 <= p2) OR (p238 + p237 + p236 + p235 + p234 <= 1)) AND ((p263 <= 2) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p65 + p66 + p67 + p68 + p69 + p70 ... (shortened)
lola: processed formula length: 540
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p207 <= p56) AND (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p207 <= p56) AND (3 <= p3))))))
lola: processed formula: A (F (A (G (((p207 <= p56) AND (3 <= p3))))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 36 markings, 37 edges
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p209 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))) AND E (G ((p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p6)))) AND ((((p233 <= 2) OR (p62 <= 0)) AND ((p29 + 1 <= p1) OR (p151 + p152 + p153 + p154 + p155... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p209 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148)))
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 1228 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-S05J20-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p206 <= p207))) OR A (G ((p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p206 <= p207)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p207 + 1 <= p206))))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: 2193 markings, 5614 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p231 <= 0) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p231) AND (p55 + 1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))))
lola: processed formula length: 190
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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 12 will run for 742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p56 <= p240) AND (p232 <= p209))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p240 + 1 <= p56) OR (p209 + 1 <= p232)))))
lola: processed formula length: 67
lola: 3 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: 156 markings, 156 edges
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p29) AND (2 <= p4) AND ((3 <= p232) OR (p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p2))) U E (F ((1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p29) AND (2 <= p4) AND ((3 <= p232) OR (p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p2))) U E(TRUE U (1 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148)))
lola: processed formula length: 368
lola: 2 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1228 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: 2190 markings, 5933 edges
lola: ========================================
lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p56 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262))) AND (p5 <= p238 + p237 + p236 + p235 + p234))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p56 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262))) AND (p5 <= p238 + p237 + p236 + p235 + p234))))
lola: processed formula: A (F ((A (G ((p56 <= p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262))) AND (p5 <= p238 + p237 + p236 + p235 + p234))))
lola: processed formula length: 216
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 52388 markings, 97670 edges
lola: ========================================
lola: subprocess 15 will run for 2967 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p149 <= 2)))
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 1228 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-S05J20-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown no unknown no yes no no yes yes yes yes no no
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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