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-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 r130-smll-152673532900262
=====================================================================

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


BK_STOP 1526971830832

--------------------
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...
----- 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 stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S05J20 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p93 + p92 + p91 + p90 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p65) OR (p13 + 1 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))))) : NOT(E (G (A (F ((p342 <= p14)))))) : (A (F (((p9 + 1 <= p3 + p4 + p5 + p6 + p7) AND (2 <= p16 + p17 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)))) AND (((p10 <= 0) OR (p342 <= 1) OR ((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 + 1 <= p37) AND (p287 + 1 <= p8))) AND ((p367 <= p239 + p240 + p241 + p242 + p243) AND A (F ((1 <= p3 + p4 + p5 + p6 + p7)))))) : E (F (NOT(E (F ((3 <= p37)))))) : A (G ((p238 <= p9))) : A (F (NOT(E (F ((2 <= p287)))))) : (E (X (A (X ((3 <= p37))))) OR A (F ((1 <= p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38)))) : (E (G ((((p238 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309) AND (2 <= p239 + p240 + p241 + p242 + p243)) OR ((3 <= p13) AND (p239 + p240 + p241 + p242 + p243 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285))))) OR ((3 <= p89) AND (E (X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p93 + p92 + p91 + p90 + p94 + p95 + p96 + p97 + p98 + p99))) OR (2 <= p3 + p4 + p5 + p6 + p7)))) : A (F (A (G (((p15 <= p11) AND (3 <= p37)))))) : ((A (G ((p310 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364))) AND E (G ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p9)))) AND ((((p317 <= 2) OR (p64 <= 0)) AND ((p12 + 1 <= p195) OR (p3 + p4 + p5 + p6 + p7 + 1 <= p14))) OR NOT(A (X ((3 <= p0)))))) : E (F ((A (G ((p14 <= p15))) OR A (G ((p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 <= p8)))))) : E (G (((p2 <= 0) OR (p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 <= p287)))) : A (F (E (G (((p11 <= p88) AND (p366 <= p310)))))) : A ((((1 <= p12) AND (2 <= p8) AND ((3 <= p366) OR (p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 <= p238))) U E (F ((1 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364))))) : A (F ((A (G ((p11 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))) AND (p286 <= p239 + p240 + p241 + p242 + p243)))) : A (G ((p341 <= 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 (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p342 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p342 <= p14))))
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: 13 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((p9 + 1 <= p3 + p4 + p5 + p6 + p7) AND (2 <= p16 + p17 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18)))) AND (((p10 <= 0) OR (p342 <= 1) OR ((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 ... (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 (((p9 + 1 <= p3 + p4 + p5 + p6 + p7) AND (2 <= p16 + p17 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p9 + 1 <= p3 + p4 + p5 + p6 + p7) AND (2 <= p16 + p17 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18))))
lola: processed formula: A (F (((p9 + 1 <= p3 + p4 + p5 + p6 + p7) AND (2 <= p16 + p17 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18))))
lola: processed formula length: 179
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 <= p37))))))
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 <= p37))))
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: 1063449 markings, 2090458 edges, 2948049334177890304 markings/sec, 0 secs
lola: 2106985 markings, 4146670 edges, 208707 markings/sec, 5 secs
lola: 3148081 markings, 6228584 edges, 208219 markings/sec, 10 secs
lola: 4223493 markings, 8342927 edges, 215082 markings/sec, 15 secs
lola: 4897506 markings, 10318039 edges, 134803 markings/sec, 20 secs
lola: 5821972 markings, 12121903 edges, 184893 markings/sec, 25 secs
lola: 6747949 markings, 13960554 edges, 185195 markings/sec, 30 secs
lola: 7688753 markings, 15825790 edges, 188161 markings/sec, 35 secs
lola: 8653054 markings, 17734347 edges, 192860 markings/sec, 40 secs
lola: 9586134 markings, 19584378 edges, 186616 markings/sec, 45 secs
lola: 10214282 markings, 21445829 edges, 125630 markings/sec, 50 secs
lola: 11128298 markings, 23261310 edges, 182803 markings/sec, 55 secs
lola: 12061949 markings, 25112197 edges, 186730 markings/sec, 60 secs
lola: 13018134 markings, 27006744 edges, 191237 markings/sec, 65 secs
lola: 14000512 markings, 28948060 edges, 196476 markings/sec, 70 secs
lola: 14620361 markings, 30800962 edges, 123970 markings/sec, 75 secs
lola: 15545465 markings, 32629803 edges, 185021 markings/sec, 80 secs
lola: 16475249 markings, 34474024 edges, 185957 markings/sec, 85 secs
lola: 17418254 markings, 36342730 edges, 188601 markings/sec, 90 secs
lola: 18387259 markings, 38261014 edges, 193801 markings/sec, 95 secs
lola: 19331290 markings, 40131400 edges, 188806 markings/sec, 100 secs
lola: 19974689 markings, 42021053 edges, 128680 markings/sec, 105 secs
lola: 20900322 markings, 43856218 edges, 185127 markings/sec, 110 secs
lola: 21842459 markings, 45725004 edges, 188427 markings/sec, 115 secs
lola: 22806229 markings, 47632542 edges, 192754 markings/sec, 120 secs
lola: 23790849 markings, 49577829 edges, 196924 markings/sec, 125 secs
lola: 24396147 markings, 51428069 edges, 121060 markings/sec, 130 secs
lola: 25331204 markings, 53261359 edges, 187011 markings/sec, 135 secs
lola: 26271671 markings, 55115813 edges, 188093 markings/sec, 140 secs
lola: 27225158 markings, 57004169 edges, 190697 markings/sec, 145 secs
lola: 28196970 markings, 58927233 edges, 194362 markings/sec, 150 secs
lola: 29064992 markings, 60657107 edges, 173604 markings/sec, 155 secs
lola: 29705602 markings, 62540002 edges, 128122 markings/sec, 160 secs
lola: 30659222 markings, 64428512 edges, 190724 markings/sec, 165 secs
lola: 30910204 markings, 64924327 edges, 50196 markings/sec, 170 secs
lola: 30912942 markings, 64929051 edges, 548 markings/sec, 175 secs
lola: 30913495 markings, 64930061 edges, 111 markings/sec, 180 secs
lola: 30916122 markings, 64936093 edges, 525 markings/sec, 185 secs
lola: 30916131 markings, 64936112 edges, 2 markings/sec, 190 secs
lola: 30916135 markings, 64936128 edges, 1 markings/sec, 195 secs
lola: 30916154 markings, 64936160 edges, 4 markings/sec, 200 secs
lola: 30916167 markings, 64936182 edges, 3 markings/sec, 205 secs
lola: 30916173 markings, 64936194 edges, 1 markings/sec, 210 secs
lola: 30916182 markings, 64936210 edges, 2 markings/sec, 215 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 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p238 <= p9)))
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 <= p287))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p287 <= 1)))))
lola: processed formula: A (F (A (G ((p287 <= 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: 62425 markings, 93902 edges, 12485 markings/sec, 0 secs
lola: 125175 markings, 192760 edges, 12550 markings/sec, 5 secs
lola: 179654 markings, 280312 edges, 10896 markings/sec, 10 secs
lola: 250374 markings, 388879 edges, 14144 markings/sec, 15 secs
lola: 301294 markings, 474849 edges, 10184 markings/sec, 20 secs
lola: 371319 markings, 577307 edges, 14005 markings/sec, 25 secs
lola: 424298 markings, 671258 edges, 10596 markings/sec, 30 secs
lola: 489514 markings, 768288 edges, 13043 markings/sec, 35 secs
lola: 550062 markings, 865960 edges, 12110 markings/sec, 40 secs
lola: 608797 markings, 960383 edges, 11747 markings/sec, 45 secs
lola: 676460 markings, 1063810 edges, 13533 markings/sec, 50 secs
lola: 728090 markings, 1150313 edges, 10326 markings/sec, 55 secs
lola: 798564 markings, 1253458 edges, 14095 markings/sec, 60 secs
lola: 849882 markings, 1344483 edges, 10264 markings/sec, 65 secs
lola: 915624 markings, 1442083 edges, 13148 markings/sec, 70 secs
lola: 973583 markings, 1536897 edges, 11592 markings/sec, 75 secs
lola: 1031797 markings, 1629897 edges, 11643 markings/sec, 80 secs
lola: 1098132 markings, 1731295 edges, 13267 markings/sec, 85 secs
lola: 1149238 markings, 1816457 edges, 10221 markings/sec, 90 secs
lola: 1218796 markings, 1919354 edges, 13912 markings/sec, 95 secs
lola: 1270466 markings, 2010405 edges, 10334 markings/sec, 100 secs
lola: 1336350 markings, 2108074 edges, 13177 markings/sec, 105 secs
lola: 1395260 markings, 2204487 edges, 11782 markings/sec, 110 secs
lola: 1454161 markings, 2298306 edges, 11780 markings/sec, 115 secs
lola: 1520791 markings, 2400588 edges, 13326 markings/sec, 120 secs
lola: 1572587 markings, 2486453 edges, 10359 markings/sec, 125 secs
lola: 1643473 markings, 2591604 edges, 14177 markings/sec, 130 secs
lola: 1694840 markings, 2681877 edges, 10273 markings/sec, 135 secs
lola: 1761050 markings, 2779552 edges, 13242 markings/sec, 140 secs
lola: 1818618 markings, 2874911 edges, 11514 markings/sec, 145 secs
lola: 1878229 markings, 2969116 edges, 11922 markings/sec, 150 secs
lola: 1943665 markings, 3070188 edges, 13087 markings/sec, 155 secs
lola: 1995416 markings, 3155618 edges, 10350 markings/sec, 160 secs
lola: 2066227 markings, 3260682 edges, 14162 markings/sec, 165 secs
lola: 2116982 markings, 3350077 edges, 10151 markings/sec, 170 secs
lola: 2182971 markings, 3447424 edges, 13198 markings/sec, 175 secs
lola: 2240214 markings, 3541683 edges, 11449 markings/sec, 180 secs
lola: 2299550 markings, 3635982 edges, 11867 markings/sec, 185 secs
lola: 2364810 markings, 3736615 edges, 13052 markings/sec, 190 secs
lola: 2417897 markings, 3824817 edges, 10617 markings/sec, 195 secs
lola: 2478641 markings, 3915463 edges, 12149 markings/sec, 200 secs
lola: 2537353 markings, 4015647 edges, 11742 markings/sec, 205 secs
lola: 2603088 markings, 4112540 edges, 13147 markings/sec, 210 secs
lola: 2661023 markings, 4207594 edges, 11587 markings/sec, 215 secs
lola: 2718944 markings, 4300416 edges, 11584 markings/sec, 220 secs
lola: 2784666 markings, 4400988 edges, 13144 markings/sec, 225 secs
lola: 2831242 markings, 4618982 edges, 9315 markings/sec, 230 secs
lola: 2885039 markings, 4827027 edges, 10759 markings/sec, 235 secs
lola: 2956453 markings, 4933463 edges, 14283 markings/sec, 240 secs
lola: 3009738 markings, 5023590 edges, 10657 markings/sec, 245 secs
lola: 3075245 markings, 5121592 edges, 13101 markings/sec, 250 secs
lola: 3134207 markings, 5221998 edges, 11792 markings/sec, 255 secs
lola: 3194942 markings, 5315826 edges, 12147 markings/sec, 260 secs
lola: 3260613 markings, 5418360 edges, 13134 markings/sec, 265 secs
lola: 3319381 markings, 5511723 edges, 11754 markings/sec, 270 secs
lola: 3387112 markings, 5616585 edges, 13546 markings/sec, 275 secs
lola: 3439291 markings, 5704519 edges, 10436 markings/sec, 280 secs
lola: 3509976 markings, 5806154 edges, 14137 markings/sec, 285 secs
lola: 3561493 markings, 5898113 edges, 10303 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 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((3 <= p37))))) OR A (F ((1 <= p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((3 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((3 <= p37)))
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 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38)))
lola: processed formula: A (F ((1 <= p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38)))
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: 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 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p238 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309) AND (2 <= p239 + p240 + p241 + p242 + p243)) OR ((3 <= p13) AND (p239 + p240 + p241 + p242 + p243 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p238 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309) AND (2 <= p239 + p240 + p241 + p242 + p243)) OR ((3 <= p13) AND (p239 + p240 + p241 + p242 + p243 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + 1 <= p238) OR (p239 + p240 + p241 + p242 + p243 <= 1)) AND ((p13 <= 2) OR (p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 +... (shortened)
lola: processed formula length: 576
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: 87 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p15 <= p11) AND (3 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p15 <= p11) AND (3 <= p37))))))
lola: processed formula: A (F (A (G (((p15 <= p11) AND (3 <= p37))))))
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p310 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364))) AND E (G ((p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 <= p9)))) AND ((((p317 <= 2) OR (p64 <= 0)) AND ((p12 + 1 <= p195) OR (p3 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p310 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364)))
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: 3469 markings, 7624 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p14 <= p15))) OR A (G ((p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p14 <= p15)))))
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 (p15 + 1 <= p14))))
lola: processed formula length: 41
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: 1002960 markings, 1979834 edges, 3689320832170983424 markings/sec, 0 secs
lola: 1991909 markings, 3934015 edges, 197790 markings/sec, 5 secs
lola: 2927088 markings, 5787631 edges, 187036 markings/sec, 10 secs
lola: 3967659 markings, 7838700 edges, 208114 markings/sec, 15 secs
lola: 4833032 markings, 9737758 edges, 173075 markings/sec, 20 secs
lola: 5541299 markings, 11571520 edges, 141653 markings/sec, 25 secs
lola: 6432499 markings, 13346131 edges, 178240 markings/sec, 30 secs
lola: 7343951 markings, 15155597 edges, 182290 markings/sec, 35 secs
lola: 8276163 markings, 17005665 edges, 186442 markings/sec, 40 secs
lola: 9224237 markings, 18884711 edges, 189615 markings/sec, 45 secs
lola: 9788786 markings, 20626940 edges, 112910 markings/sec, 50 secs
lola: 10692967 markings, 22392452 edges, 180836 markings/sec, 55 secs
lola: 11588888 markings, 24175175 edges, 179184 markings/sec, 60 secs
lola: 12487309 markings, 25962268 edges, 179684 markings/sec, 65 secs
lola: 13410574 markings, 27793652 edges, 184653 markings/sec, 70 secs
lola: 14323996 markings, 29604972 edges, 182684 markings/sec, 75 secs
lola: 14915108 markings, 31400960 edges, 118222 markings/sec, 80 secs
lola: 15799714 markings, 33131260 edges, 176921 markings/sec, 85 secs
lola: 16682267 markings, 34887761 edges, 176511 markings/sec, 90 secs
lola: 17587387 markings, 36687583 edges, 181024 markings/sec, 95 secs
lola: 18512843 markings, 38523100 edges, 185091 markings/sec, 100 secs
lola: 19410095 markings, 40276685 edges, 179450 markings/sec, 105 secs
lola: 20003415 markings, 42104777 edges, 118664 markings/sec, 110 secs
lola: 20894190 markings, 43845686 edges, 178155 markings/sec, 115 secs
lola: 21788797 markings, 45625504 edges, 178921 markings/sec, 120 secs
lola: 22709317 markings, 47452795 edges, 184104 markings/sec, 125 secs
lola: 23648161 markings, 49314352 edges, 187769 markings/sec, 130 secs
lola: 24349479 markings, 51109763 edges, 140264 markings/sec, 135 secs
lola: 25143814 markings, 52904779 edges, 158867 markings/sec, 140 secs
lola: 26034608 markings, 54645608 edges, 178159 markings/sec, 145 secs
lola: 26927422 markings, 56421350 edges, 178563 markings/sec, 150 secs
lola: 27852774 markings, 58258001 edges, 185070 markings/sec, 155 secs
lola: 28785084 markings, 60108247 edges, 186462 markings/sec, 160 secs
lola: 29379426 markings, 61905011 edges, 118868 markings/sec, 165 secs
lola: 30286303 markings, 63708294 edges, 181375 markings/sec, 170 secs
lola: 30932829 markings, 64997919 edges, 129305 markings/sec, 175 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 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2 <= 0) OR (p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 <= p287))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p2) AND (p287 + 1 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364))))
lola: processed formula length: 189
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 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p11 <= p88) AND (p366 <= p310))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p88 + 1 <= p11) OR (p310 + 1 <= p366)))))
lola: processed formula length: 66
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 924 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p12) AND (2 <= p8) AND ((3 <= p366) OR (p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 <= p238))) U E (F ((1 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p12) AND (2 <= p8) AND ((3 <= p366) OR (p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 <= p238))) U E(TRUE U (1 <= p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364)))
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: 32 markings, 37 edges
lola: ========================================
lola: subprocess 14 will run for 1386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p11 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))) AND (p286 <= p239 + p240 + p241 + p242 + p243))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p11 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))) AND (p286 <= p239 + p240 + p241 + p242 + p243))))
lola: processed formula: A (F ((A (G ((p11 <= p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))) AND (p286 <= p239 + p240 + p241 + p242 + p243))))
lola: processed formula length: 218
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 2772 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p341 <= 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="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-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-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 r130-smll-152673532900262"
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 ;