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 irma4mcc-full
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 r126-smll-152673528600262
=====================================================================

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


BK_STOP 1526855378309

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S05J20 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 (((p221 + p222 + p223 + p224 + p226 + p227 + p228 + p229 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + 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 + p325 + p324 + p323 + p322 + p321 + p240 + p235 + p230 + p225 + 1 <= p28) OR (p125 + 1 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51))))) : NOT(E (G (A (F ((p79 <= p52)))))) : (A (F (((p81 + 1 <= p177 + p178 + p179 + p180 + p181) AND (2 <= p6 + p7 + p8 + p9 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))) AND (((p151 <= 0) OR (p79 <= 1) OR ((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 + 1 <= p27) AND (p218 + 1 <= p56))) AND ((p149 <= p185 + p186 + p187 + p188 + p189) AND A (F ((1 <= p177 + p178 + p179 + p180 + p181)))))) : E (F (NOT(E (F ((3 <= p27)))))) : A (G ((p220 <= p81))) : A (F (NOT(E (F ((2 <= p218)))))) : (E (X (A (X ((3 <= p27))))) OR A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77)))) : (E (G ((((p220 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51) AND (2 <= p185 + p186 + p187 + p188 + p189)) OR ((3 <= p125) AND (p185 + p186 + p187 + p188 + p189 <= 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))))) OR ((3 <= p54) AND (E (X ((2 <= p221 + p222 + p223 + p224 + p226 + p227 + p228 + p229 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + 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 + p325 + p324 + p323 + p322 + p321 + p240 + p235 + p230 + p225))) OR (2 <= p177 + p178 + p179 + p180 + p181)))) : A (F (A (G (((p184 <= p183) AND (3 <= p27)))))) : ((A (G ((p217 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))) AND E (G ((p100 + p101 + p102 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p81)))) AND ((((p126 <= 2) OR (p55 <= 0)) AND ((p78 + 1 <= p150) OR (p177 + p178 + p179 + p180 + p181 + 1 <= p52))) OR NOT(A (X ((3 <= p30)))))) : E (F ((A (G ((p52 <= p184))) OR A (G ((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51 <= p56)))))) : E (G (((p153 <= 0) OR (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= p218)))) : A (F (E (G (((p183 <= p368) AND (p53 <= p217)))))) : A ((((1 <= p78) AND (2 <= p56) AND ((3 <= p53) OR (p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77 <= p220))) U E (F ((1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))))) : A (F ((A (G ((p183 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51))) AND (p80 <= p185 + p186 + p187 + p188 + p189)))) : A (G ((p175 <= 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 (((p221 + p222 + p223 + p224 + p226 + p227 + p228 + p229 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + 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 + p28... (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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p79 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p79 <= p52))))
lola: processed formula length: 37
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: 13 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p81 + 1 <= p177 + p178 + p179 + p180 + p181) AND (2 <= p6 + p7 + p8 + p9 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))) AND (((p151 <= 0) OR (p79 <= 1) OR ((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 ... (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 (((p81 + 1 <= p177 + p178 + p179 + p180 + p181) AND (2 <= p6 + p7 + p8 + p9 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p81 + 1 <= p177 + p178 + p179 + p180 + p181) AND (2 <= p6 + p7 + p8 + p9 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))))
lola: processed formula: A (F (((p81 + 1 <= p177 + p178 + p179 + p180 + p181) AND (2 <= p6 + p7 + p8 + p9 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))))
lola: processed formula length: 186
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 <= p27))))))
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 <= p27))))
lola: processed formula length: 35
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: 740676 markings, 1597307 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1288993 markings, 3357591 edges, 109663 markings/sec, 5 secs
lola: 1973856 markings, 4952871 edges, 136973 markings/sec, 10 secs
lola: 2617739 markings, 6425572 edges, 128777 markings/sec, 15 secs
lola: 3232631 markings, 7884931 edges, 122978 markings/sec, 20 secs
lola: 3877724 markings, 9378801 edges, 129019 markings/sec, 25 secs
lola: 4473290 markings, 10766638 edges, 119113 markings/sec, 30 secs
lola: 4845179 markings, 12202492 edges, 74378 markings/sec, 35 secs
lola: 5380130 markings, 13677172 edges, 106990 markings/sec, 40 secs
lola: 5948720 markings, 15250421 edges, 113718 markings/sec, 45 secs
lola: 6487928 markings, 16577853 edges, 107842 markings/sec, 50 secs
lola: 6945506 markings, 17845044 edges, 91516 markings/sec, 55 secs
lola: 7416912 markings, 19187180 edges, 94281 markings/sec, 60 secs
lola: 8029050 markings, 20596514 edges, 122428 markings/sec, 65 secs
lola: 8619255 markings, 21982814 edges, 118041 markings/sec, 70 secs
lola: 9207864 markings, 23355003 edges, 117722 markings/sec, 75 secs
lola: 9829236 markings, 24794030 edges, 124274 markings/sec, 80 secs
lola: 10452138 markings, 26243375 edges, 124580 markings/sec, 85 secs
lola: 10764320 markings, 27521663 edges, 62436 markings/sec, 90 secs
lola: 11274589 markings, 28932914 edges, 102054 markings/sec, 95 secs
lola: 11825252 markings, 30455361 edges, 110133 markings/sec, 100 secs
lola: 12291925 markings, 31677825 edges, 93335 markings/sec, 105 secs
lola: 12777732 markings, 32909657 edges, 97161 markings/sec, 110 secs
lola: 13185403 markings, 34156206 edges, 81534 markings/sec, 115 secs
lola: 13726433 markings, 35436761 edges, 108206 markings/sec, 120 secs
lola: 14298087 markings, 36769207 edges, 114331 markings/sec, 125 secs
lola: 14890685 markings, 38124607 edges, 118520 markings/sec, 130 secs
lola: 15474701 markings, 39505855 edges, 116803 markings/sec, 135 secs
lola: 16099146 markings, 40942070 edges, 124889 markings/sec, 140 secs
lola: 16682330 markings, 42336959 edges, 116637 markings/sec, 145 secs
lola: 16963944 markings, 43618843 edges, 56323 markings/sec, 150 secs
lola: 17479667 markings, 45047107 edges, 103145 markings/sec, 155 secs
lola: 17965768 markings, 46495216 edges, 97220 markings/sec, 160 secs
lola: 18500567 markings, 47654285 edges, 106960 markings/sec, 165 secs
lola: 18879249 markings, 48751850 edges, 75736 markings/sec, 170 secs
lola: 19293499 markings, 49940072 edges, 82850 markings/sec, 175 secs
lola: 19764545 markings, 51049524 edges, 94209 markings/sec, 180 secs
lola: 20257343 markings, 52205166 edges, 98560 markings/sec, 185 secs
lola: 20792267 markings, 53448454 edges, 106985 markings/sec, 190 secs
lola: 21350470 markings, 54735635 edges, 111641 markings/sec, 195 secs
lola: 21931785 markings, 56093051 edges, 116263 markings/sec, 200 secs
lola: 22499948 markings, 57415162 edges, 113633 markings/sec, 205 secs
lola: 22763669 markings, 58611027 edges, 52744 markings/sec, 210 secs
lola: 23250317 markings, 59952785 edges, 97330 markings/sec, 215 secs
lola: 23788316 markings, 61442869 edges, 107600 markings/sec, 220 secs
lola: 24241850 markings, 62617351 edges, 90707 markings/sec, 225 secs
lola: 24691615 markings, 63759892 edges, 89953 markings/sec, 230 secs
lola: 25082476 markings, 64886237 edges, 78172 markings/sec, 235 secs
lola: 25514696 markings, 66001827 edges, 86444 markings/sec, 240 secs
lola: 25958618 markings, 67021610 edges, 88784 markings/sec, 245 secs
lola: 26422627 markings, 68114006 edges, 92802 markings/sec, 250 secs
lola: 26913438 markings, 69258868 edges, 98162 markings/sec, 255 secs
lola: 27437670 markings, 70478927 edges, 104846 markings/sec, 260 secs
lola: 28012574 markings, 71808483 edges, 114981 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 ((p220 <= p81)))
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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((2 <= p218))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p218 <= 1)))))
lola: processed formula: A (F (A (G ((p218 <= 1)))))
lola: processed formula length: 27
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: 73627 markings, 96383 edges, 14725 markings/sec, 0 secs
lola: 175024 markings, 228698 edges, 20279 markings/sec, 5 secs
lola: 268287 markings, 346861 edges, 18653 markings/sec, 10 secs
lola: 358428 markings, 465177 edges, 18028 markings/sec, 15 secs
lola: 441408 markings, 574278 edges, 16596 markings/sec, 20 secs
lola: 528856 markings, 689052 edges, 17490 markings/sec, 25 secs
lola: 616411 markings, 803951 edges, 17511 markings/sec, 30 secs
lola: 704392 markings, 919363 edges, 17596 markings/sec, 35 secs
lola: 792941 markings, 1035461 edges, 17710 markings/sec, 40 secs
lola: 881082 markings, 1151243 edges, 17628 markings/sec, 45 secs
lola: 970595 markings, 1268613 edges, 17903 markings/sec, 50 secs
lola: 1059207 markings, 1384784 edges, 17722 markings/sec, 55 secs
lola: 1147704 markings, 1500962 edges, 17699 markings/sec, 60 secs
lola: 1239708 markings, 1621555 edges, 18401 markings/sec, 65 secs
lola: 1336125 markings, 1747601 edges, 19283 markings/sec, 70 secs
lola: 1426075 markings, 1865591 edges, 17990 markings/sec, 75 secs
lola: 1506506 markings, 1976522 edges, 16086 markings/sec, 80 secs
lola: 1580690 markings, 2082735 edges, 14837 markings/sec, 85 secs
lola: 1660236 markings, 2195002 edges, 15909 markings/sec, 90 secs
lola: 1740743 markings, 2308517 edges, 16101 markings/sec, 95 secs
lola: 1821715 markings, 2422696 edges, 16194 markings/sec, 100 secs
lola: 1903364 markings, 2537784 edges, 16330 markings/sec, 105 secs
lola: 1987780 markings, 2656580 edges, 16883 markings/sec, 110 secs
lola: 2051832 markings, 2774918 edges, 12810 markings/sec, 115 secs
lola: 2122845 markings, 2877924 edges, 14203 markings/sec, 120 secs
lola: 2174255 markings, 2970724 edges, 10282 markings/sec, 125 secs
lola: 2235249 markings, 3060946 edges, 12199 markings/sec, 130 secs
lola: 2294971 markings, 3157871 edges, 11944 markings/sec, 135 secs
lola: 2353872 markings, 3252596 edges, 11780 markings/sec, 140 secs
lola: 2420708 markings, 3354873 edges, 13367 markings/sec, 145 secs
lola: 2472486 markings, 3440833 edges, 10356 markings/sec, 150 secs
lola: 2543424 markings, 3543829 edges, 14188 markings/sec, 155 secs
lola: 2595181 markings, 3637112 edges, 10351 markings/sec, 160 secs
lola: 2661291 markings, 3734567 edges, 13222 markings/sec, 165 secs
lola: 2717127 markings, 3826242 edges, 11167 markings/sec, 170 secs
lola: 2772912 markings, 3916490 edges, 11157 markings/sec, 175 secs
lola: 2838002 markings, 4014995 edges, 13018 markings/sec, 180 secs
lola: 2886688 markings, 4097346 edges, 9737 markings/sec, 185 secs
lola: 2954816 markings, 4196921 edges, 13626 markings/sec, 190 secs
lola: 3008688 markings, 4290454 edges, 10774 markings/sec, 195 secs
lola: 3071823 markings, 4386296 edges, 12627 markings/sec, 200 secs
lola: 3133109 markings, 4483989 edges, 12257 markings/sec, 205 secs
lola: 3181885 markings, 4566174 edges, 9755 markings/sec, 210 secs
lola: 3252435 markings, 4665011 edges, 14110 markings/sec, 215 secs
lola: 3302706 markings, 4756481 edges, 10054 markings/sec, 220 secs
lola: 3368634 markings, 4853350 edges, 13186 markings/sec, 225 secs
lola: 3424731 markings, 4946928 edges, 11219 markings/sec, 230 secs
lola: 3484154 markings, 5040826 edges, 11885 markings/sec, 235 secs
lola: 3548248 markings, 5140208 edges, 12819 markings/sec, 240 secs
lola: 3599303 markings, 5227419 edges, 10211 markings/sec, 245 secs
lola: 3669083 markings, 5325483 edges, 13956 markings/sec, 250 secs
lola: 3717632 markings, 5414148 edges, 9710 markings/sec, 255 secs
lola: 3780973 markings, 5507824 edges, 12668 markings/sec, 260 secs
lola: 3837794 markings, 5599696 edges, 11364 markings/sec, 265 secs
lola: 3892499 markings, 5689565 edges, 10941 markings/sec, 270 secs
lola: 3958375 markings, 5787760 edges, 13175 markings/sec, 275 secs
lola: 4005040 markings, 5868346 edges, 9333 markings/sec, 280 secs
lola: 4067475 markings, 5960264 edges, 12487 markings/sec, 285 secs
lola: 4124291 markings, 6053906 edges, 11363 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 <= p27))))) OR A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77))))
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 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((3 <= p27)))
lola: processed formula length: 18
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 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77)))
lola: processed formula: A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77)))
lola: processed formula length: 138
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: 41709 markings, 52038 edges, 8342 markings/sec, 0 secs
lola: 105961 markings, 133548 edges, 12850 markings/sec, 5 secs
lola: 170566 markings, 215324 edges, 12921 markings/sec, 10 secs
lola: 235398 markings, 293779 edges, 12966 markings/sec, 15 secs
lola: 299513 markings, 375004 edges, 12823 markings/sec, 20 secs
lola: 363730 markings, 456562 edges, 12843 markings/sec, 25 secs
lola: 427160 markings, 537096 edges, 12686 markings/sec, 30 secs
lola: 491014 markings, 618054 edges, 12771 markings/sec, 35 secs
lola: 555746 markings, 699970 edges, 12946 markings/sec, 40 secs
lola: 620257 markings, 781925 edges, 12902 markings/sec, 45 secs
lola: 685800 markings, 864847 edges, 13109 markings/sec, 50 secs
lola: 751280 markings, 947844 edges, 13096 markings/sec, 55 secs
lola: 817792 markings, 1032067 edges, 13302 markings/sec, 60 secs
lola: 885399 markings, 1117511 edges, 13521 markings/sec, 65 secs
lola: 955901 markings, 1206624 edges, 14100 markings/sec, 70 secs
lola: 1027124 markings, 1296622 edges, 14245 markings/sec, 75 secs
lola: 1090672 markings, 1379277 edges, 12710 markings/sec, 80 secs
lola: 1151303 markings, 1466232 edges, 12126 markings/sec, 85 secs
lola: 1211491 markings, 1550525 edges, 12038 markings/sec, 90 secs
lola: 1272217 markings, 1633860 edges, 12145 markings/sec, 95 secs
lola: 1333975 markings, 1719808 edges, 12352 markings/sec, 100 secs
lola: 1397777 markings, 1808429 edges, 12760 markings/sec, 105 secs
lola: 1465350 markings, 1902124 edges, 13515 markings/sec, 110 secs
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: 1508361 markings, 1988848 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p220 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51) AND (2 <= p185 + p186 + p187 + p188 + p189)) OR ((3 <= p125) AND (p185 + p186 + p187 + p188 + p189 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p220 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51) AND (2 <= p185 + p186 + p187 + p188 + p189)) OR ((3 <= p125) AND (p185 + p186 + p187 + p188 + p189 <= p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51 + 1 <= p220) OR (p185 + p186 + p187 + p188 + p189 <= 1)) AND ((p125 <= 2) OR (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 ... (shortened)
lola: processed formula length: 556
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: 107 markings, 106 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p184 <= p183) AND (3 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p184 <= p183) AND (3 <= p27))))))
lola: processed formula: A (F (A (G (((p184 <= p183) AND (3 <= p27))))))
lola: processed formula length: 47
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p217 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))) AND E (G ((p100 + p101 + p102 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p81)))) AND ((((p126 <= 2) OR (p55 <= 0)) AND ((p78 + 1 <= p150) OR (p177 + p178 + p179 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p217 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))
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: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-CTLCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 454 markings, 571 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p52 <= p184))) OR A (G ((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p52 <= p184)))))
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 (p184 + 1 <= p52))))
lola: processed formula length: 42
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: 777141 markings, 1673498 edges, 155428 markings/sec, 0 secs
lola: 1298643 markings, 3377163 edges, 104300 markings/sec, 5 secs
lola: 1959565 markings, 4919272 edges, 132184 markings/sec, 10 secs
lola: 2570256 markings, 6331351 edges, 122138 markings/sec, 15 secs
lola: 3179004 markings, 7755516 edges, 121750 markings/sec, 20 secs
lola: 3793926 markings, 9178984 edges, 122984 markings/sec, 25 secs
lola: 4416365 markings, 10635008 edges, 124488 markings/sec, 30 secs
lola: 4782529 markings, 11977315 edges, 73233 markings/sec, 35 secs
lola: 5288805 markings, 13424218 edges, 101255 markings/sec, 40 secs
lola: 5824758 markings, 14904182 edges, 107191 markings/sec, 45 secs
lola: 6330876 markings, 16238560 edges, 101224 markings/sec, 50 secs
lola: 6834902 markings, 17524760 edges, 100805 markings/sec, 55 secs
lola: 7266154 markings, 18831521 edges, 86250 markings/sec, 60 secs
lola: 7837532 markings, 20156572 edges, 114276 markings/sec, 65 secs
lola: 8410716 markings, 21485885 edges, 114637 markings/sec, 70 secs
lola: 8977572 markings, 22821348 edges, 113371 markings/sec, 75 secs
lola: 9558460 markings, 24170499 edges, 116178 markings/sec, 80 secs
lola: 10167058 markings, 25578445 edges, 121720 markings/sec, 85 secs
lola: 10718604 markings, 26925619 edges, 110309 markings/sec, 90 secs
lola: 11025549 markings, 28240743 edges, 61389 markings/sec, 95 secs
lola: 11541573 markings, 29669322 edges, 103205 markings/sec, 100 secs
lola: 12017793 markings, 31086089 edges, 95244 markings/sec, 105 secs
lola: 12575933 markings, 32291636 edges, 111628 markings/sec, 110 secs
lola: 12961281 markings, 33439301 edges, 77070 markings/sec, 115 secs
lola: 13403353 markings, 34679956 edges, 88414 markings/sec, 120 secs
lola: 13916787 markings, 35881410 edges, 102687 markings/sec, 125 secs
lola: 14461440 markings, 37147441 edges, 108931 markings/sec, 130 secs
lola: 15025917 markings, 38452914 edges, 112895 markings/sec, 135 secs
lola: 15605755 markings, 39802140 edges, 115968 markings/sec, 140 secs
lola: 16200582 markings, 41190874 edges, 118965 markings/sec, 145 secs
lola: 16690538 markings, 42474986 edges, 97991 markings/sec, 150 secs
lola: 17024283 markings, 43785982 edges, 66749 markings/sec, 155 secs
lola: 17520297 markings, 45153541 edges, 99203 markings/sec, 160 secs
lola: 17973217 markings, 46514874 edges, 90584 markings/sec, 165 secs
lola: 18502443 markings, 47657760 edges, 105845 markings/sec, 170 secs
lola: 18881242 markings, 48757939 edges, 75760 markings/sec, 175 secs
lola: 19289190 markings, 49926339 edges, 81590 markings/sec, 180 secs
lola: 19745924 markings, 51012164 edges, 91347 markings/sec, 185 secs
lola: 20257456 markings, 52206998 edges, 102306 markings/sec, 190 secs
lola: 20778876 markings, 53417462 edges, 104284 markings/sec, 195 secs
lola: 21311291 markings, 54658013 edges, 106483 markings/sec, 200 secs
lola: 21877518 markings, 55961183 edges, 113245 markings/sec, 205 secs
lola: 22430587 markings, 57238844 edges, 110614 markings/sec, 210 secs
lola: 22693075 markings, 58413885 edges, 52498 markings/sec, 215 secs
lola: 23163369 markings, 59715419 edges, 94059 markings/sec, 220 secs
lola: 23668946 markings, 61109957 edges, 101115 markings/sec, 225 secs
lola: 24108782 markings, 62332424 edges, 87967 markings/sec, 230 secs
lola: 24651421 markings, 63509606 edges, 108528 markings/sec, 235 secs
lola: 24971167 markings, 64567084 edges, 63949 markings/sec, 240 secs
lola: 25378387 markings, 65682245 edges, 81444 markings/sec, 245 secs
lola: 25826115 markings, 66731173 edges, 89546 markings/sec, 250 secs
lola: 26332367 markings, 67902252 edges, 101250 markings/sec, 255 secs
lola: 26831730 markings, 69048110 edges, 99873 markings/sec, 260 secs
lola: 27342512 markings, 70238709 edges, 102156 markings/sec, 265 secs
lola: 27853796 markings, 71433346 edges, 102257 markings/sec, 270 secs
lola: 28395457 markings, 72687890 edges, 108332 markings/sec, 275 secs
lola: 28647347 markings, 73790664 edges, 50378 markings/sec, 280 secs
lola: 29080238 markings, 75031613 edges, 86578 markings/sec, 285 secs
lola: 29587782 markings, 76436457 edges, 101509 markings/sec, 290 secs
lola: 30019797 markings, 77664744 edges, 86403 markings/sec, 295 secs
lola: 30545868 markings, 78800852 edges, 105214 markings/sec, 300 secs
lola: 30869946 markings, 79824516 edges, 64816 markings/sec, 305 secs
lola: 31263087 markings, 80945785 edges, 78628 markings/sec, 310 secs
lola: 31716565 markings, 81992082 edges, 90696 markings/sec, 315 secs
lola: 32180642 markings, 83083823 edges, 92815 markings/sec, 320 secs
lola: 32683062 markings, 84257365 edges, 100484 markings/sec, 325 secs
lola: 33200040 markings, 85458145 edges, 103396 markings/sec, 330 secs
lola: 33742020 markings, 86712274 edges, 108396 markings/sec, 335 secs
lola: 34265180 markings, 87929492 edges, 104632 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p153 <= 0) OR (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= p218))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p153) AND (p218 + 1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))))
lola: processed formula length: 191
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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 626 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p183 <= p368) AND (p53 <= p217))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p368 + 1 <= p183) OR (p217 + 1 <= p53)))))
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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p78) AND (2 <= p56) AND ((3 <= p53) OR (p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77 <= p220))) U E (F ((1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p78) AND (2 <= p56) AND ((3 <= p53) OR (p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p74 + p75 + p76 + p77 <= p220))) U E(TRUE U (1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))
lola: processed formula length: 349
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: 24 markings, 28 edges
lola: ========================================
lola: subprocess 14 will run for 1252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p183 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51))) AND (p80 <= p185 + p186 + p187 + p188 + p189))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p183 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51))) AND (p80 <= p185 + p186 + p187 + p188 + p189))))
lola: processed formula: A (F ((A (G ((p183 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p51))) AND (p80 <= p185 + p186 + p187 + p188 + p189))))
lola: processed formula length: 197
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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 15 will run for 2505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p175 <= 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 unknown 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 CANNOT_COMPUTE 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 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-S05J20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-full"
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 r126-smll-152673528600262"
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 ;