About the Execution of Irma.struct for PolyORBLF-COL-S02J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15908.310 | 671730.00 | 1114827.00 | 3308.40 | ???????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-COL-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673528900010
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526800129231
BK_STOP 1526800800961
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-COL-S02J04T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1927320, 'Memory': 15943.41, 'Tool': 'lola'}, {'Time': 2745747, 'Memory': 15946.89, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S02J04T06...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 1396/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: A (F (((3 <= p105) AND (p237 + p238 + p239 + p240 + p241 + p242 <= p409 + p410 + p411 + p412 + p413 + p414) AND (p140 + p141 + p142 + p143 + p144 + p145 <= p342 + p343 + p344 + p345 + p346 + p347) AND (p403 + p404 + p405 + p406 + p407 + p408 <= p261 + p262 + p263 + p264 + p265 + p266) AND (p335 + p336 + p337 + p338 + p339 + p340 + 1 <= p49) AND (1 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p85)))) : NOT(A (G ((((3 <= p231 + p232 + p233 + p234 + p235 + p236) AND (3 <= p462)) OR ((p253 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))))) : E ((((p122 + p123 + p124 + p125 + p126 + p127 <= p323 + p324 + p325 + p326 + p327 + p328) OR (1 <= p469)) U ((p355 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200) AND (1 <= p317 + p318 + p319 + p320 + p321 + p322) AND (p49 <= p378) AND (p471 + p472 + p473 + p474 + p475 <= p392 + p393 + p394 + p395 + p396 + p397)))) : A (G ((((p254 + 1 <= p293 + p294 + p295 + p296 + p297 + p298) OR ((p0 + p1 + p2 + p3 + p4 + p5 <= p243 + p244 + p245 + p246 + p247 + p248) AND (p311 + p312 + p313 + p314 + p315 + p316 <= p355))) AND (((p341 <= p54 + p50 + p51 + p52 + p53 + p55) AND (2 <= p365)) OR ((p237 + p238 + p239 + p240 + p241 + p242 <= p426 + p427 + p428 + p429 + p430 + p431) AND (p323 + p324 + p325 + p326 + p327 + p328 <= p358 + p359 + p360 + p361 + p362 + p363)))))) : ((NOT(E (G ((p335 + p336 + p337 + p338 + p339 + p340 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)))) AND (A (G ((p100 + p101 + p102 + p103 + p104 + p99 <= p335 + p336 + p337 + p338 + p339 + p340))) OR E (G ((3 <= p237 + p238 + p239 + p240 + p241 + p242))))) AND (p122 + p123 + p124 + p125 + p126 + p127 <= p354)) : (E (G (E (X ((p323 + p324 + p325 + p326 + p327 + p328 <= p455 + p454 + p453 + p452 + p451 + p450))))) AND (NOT(E (X ((2 <= p311 + p312 + p313 + p314 + p315 + p316)))) OR (A (X ((p438 + p439 + p440 + p441 + p442 + p443 <= p354))) AND A (F ((p6 <= p252)))))) : (A (F (A (X ((3 <= p416 + p415))))) AND ((A (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p403 + p404 + p405 + p406 + p407 + p408))) OR A (G ((3 <= p462)))) AND (2 <= p391 + p390))) : E (G (A (F (((p254 <= p249 + p250) OR (p140 + p141 + p142 + p143 + p144 + p145 <= p462)))))) : (NOT((((p416 + p415 <= 1) OR (p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p91 + p90 + p89 + p88 + p87 + p92)) AND E (F ((2 <= p254))))) OR (((p261 + p262 + p263 + p264 + p265 + p266 + 1 <= p6) AND (1 <= p249 + p250)) AND E (F (((p392 + p393 + p394 + p395 + p396 + p397 <= p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310) AND (p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 <= p335 + p336 + p337 + p338 + p339 + p340)))))) : E (F (E (G (((1 <= p403 + p404 + p405 + p406 + p407 + p408) OR (p384 + p383 + p382 + p381 + p380 + p379 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)))))) : A (F (E (G (((p159 + p160 + p161 + p162 + p163 + p164 <= p91 + p90 + p89 + p88 + p87 + p92) OR (3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292)))))) : A (G (((((p0 + p1 + p2 + p3 + p4 + p5 <= p94 + p95 + p96 + p97 + p98) AND (2 <= p391 + p390)) OR ((p323 + p324 + p325 + p326 + p327 + p328 <= p426 + p427 + p428 + p429 + p430 + p431) AND (1 <= p444 + p445 + p446 + p447 + p448 + p449))) OR E (F ((p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 <= p231 + p232 + p233 + p234 + p235 + p236)))))) : ((E (G ((p471 + p472 + p473 + p474 + p475 + 1 <= p268))) OR E (G (((1 <= p146) OR (1 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p85))))) OR A (X ((3 <= p341)))) : ((p122 + p123 + p124 + p125 + p126 + p127 + 1 <= p416 + p415) OR E (F (((1 <= p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280) OR ((p342 + p343 + p344 + p345 + p346 + p347 <= p425) AND (p392 + p393 + p394 + p395 + p396 + p397 <= p341)))))) : ((((((3 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121) OR (1 <= p335 + p336 + p337 + p338 + p339 + p340)) AND (3 <= p54 + p50 + p51 + p52 + p53 + p55)) OR A (F ((1 <= p268)))) AND A (G (((p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 <= p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (p432 + p433 + p434 + p435 + p436 + p437 <= p471 + p472 + p473 + p474 + p475))))) OR E ((((p438 + p439 + p440 + p441 + p442 + p443 <= p463 + p464 + p465 + p466 + p467 + p468) AND (1 <= p122 + p123 + p124 + p125 + p126 + p127)) U ((p317 + p318 + p319 + p320 + p321 + p322 <= p364) AND (1 <= p425))))) : A (((p0 + p1 + p2 + p3 + p4 + p5 <= p243 + p244 + p245 + p246 + p247 + p248) U ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p385 + p386 + p387 + p388 + p389) AND (2 <= p378) AND (p358 + p359 + p360 + p361 + p362 + p363 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p105) AND (p237 + p238 + p239 + p240 + p241 + p242 <= p409 + p410 + p411 + p412 + p413 + p414) AND (p140 + p141 + p142 + p143 + p144 + p145 <= p342 + p343 + p344 + p345 + p346 + p347) AND (p403 + p404 + p405 + p406 + p407 + p408 <= p261 + p262 + p263 + p264 + p265 + p266) AND (p335 + p336 + p337 + p338 + p339 + p340 + 1 <= p49) AND (1 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p105) AND (p237 + p238 + p239 + p240 + p241 + p242 <= p409 + p410 + p411 + p412 + p413 + p414) AND (p140 + p141 + p142 + p143 + p144 + p145 <= p342 + p343 + p344 + p345 + p346 + p347) AND (p403 + p404 + p405 + p406 + p407 + p408 <= p261 + p262 + p263 + p264 + p265 + p266) AND (p335 + p336 + p337 + p338 + p339 + p340 + 1 <= p49) AND (1 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p85))))
lola: processed formula: A (F (((3 <= p105) AND (p237 + p238 + p239 + p240 + p241 + p242 <= p409 + p410 + p411 + p412 + p413 + p414) AND (p140 + p141 + p142 + p143 + p144 + p145 <= p342 + p343 + p344 + p345 + p346 + p347) AND (p403 + p404 + p405 + p406 + p407 + p408 <= p261 + p262 + p263 + p264 + p265 + p266) AND (p335 + p336 + p337 + p338 + p339 + p340 + 1 <= p49) AND (1 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 +... (shortened)
lola: processed formula length: 534
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 362 markings, 362 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((3 <= p231 + p232 + p233 + p234 + p235 + p236) AND (3 <= p462)) OR ((p253 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p122 + p123 + p124 + p125 + p126 + p127 <= p323 + p324 + p325 + p326 + p327 + p328) OR (1 <= p469)) U ((p355 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200) AND (1 <= p317 + p318 + p319 + p320 + p321 + p322) AND (p49 <= p378) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p122 + p123 + p124 + p125 + p126 + p127 <= p323 + p324 + p325 + p326 + p327 + p328) OR (1 <= p469)) U ((p355 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200) AND (1 <= p317 + p318 + p319 + p320 + p321 + p322) AND (p49 <= p378) AND (... (shortened)
lola: processed formula length: 478
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p254 + 1 <= p293 + p294 + p295 + p296 + p297 + p298) OR ((p0 + p1 + p2 + p3 + p4 + p5 <= p243 + p244 + p245 + p246 + p247 + p248) AND (p311 + p312 + p313 + p314 + p315 + p316 <= p355))) AND (((p341 <= p54 + p50 + p51 + p52 + p53 + p55) AND (2 <= p365)) OR ((p237 + p238 + p239 + p240 + p241 + p242 <= p426 + p427 + p428 + p429 + p430 + p431) AND (p323 + p324 + p325 + p326 + p327 + p328 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((p335 + p336 + p337 + p338 + p339 + p340 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)))) AND (A (G ((p100 + p101 + p102 + p103 + p104 + p99 <= p335 + p336 + p337 + p338 + p339 + p340))) OR E (G ((3 <= p237 + p238 + p239 + p240 + p241 + p242))))) AND (p122 + p123 + p124 + p125 + p126 + p127 <= p354))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + 1 <= p335 + p336 + p337 + p338 + p339 + p340)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + 1 <= p335 + p336 + p337 + p338 + p339 + p340)))
lola: processed formula: A (F ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + 1 <= p335 + p336 + p337 + p338 + p339 + p340)))
lola: processed formula length: 138
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 33573 markings, 41721 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p100 + p101 + p102 + p103 + p104 + p99 <= p335 + p336 + p337 + p338 + p339 + p340)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p237 + p238 + p239 + p240 + p241 + p242)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p237 + p238 + p239 + p240 + p241 + p242 <= 2)))
lola: processed formula length: 61
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((p323 + p324 + p325 + p326 + p327 + p328 <= p455 + p454 + p453 + p452 + p451 + p450))))) AND (NOT(E (X ((2 <= p311 + p312 + p313 + p314 + p315 + p316)))) OR (A (X ((p438 + p439 + p440 + p441 + p442 + p443 <= p354))) AND A (F ((p6 <= p252))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p323 + p324 + p325 + p326 + p327 + p328 <= p455 + p454 + p453 + p452 + p451 + p450)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p323 + p324 + p325 + p326 + p327 + p328 <= p455 + p454 + p453 + p452 + p451 + p450)))))
lola: processed formula length: 108
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 362 markings, 362 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p311 + p312 + p313 + p314 + p315 + p316 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p311 + p312 + p313 + p314 + p315 + p316 <= 1)))
lola: processed formula: A (X ((p311 + p312 + p313 + p314 + p315 + p316 <= 1)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p416 + p415))))) AND ((A (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p403 + p404 + p405 + p406 + p407 + p408))) OR A (G ((3 <= p462)))) AND (2 <= p391 + p390)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p416 + p415)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p416 + p415)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 362 markings, 362 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p254 <= p249 + p250) OR (p140 + p141 + p142 + p143 + p144 + p145 <= p462))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p254 <= p249 + p250) OR (p140 + p141 + p142 + p143 + p144 + p145 <= p462))))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 362 markings, 724 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((p416 + p415 <= 1) OR (p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p91 + p90 + p89 + p88 + p87 + p92)) AND E (F ((2 <= p254))))) OR (((p261 + p262 + p263 + p264 + p265 + p266 + 1 <= p6) AND (1 <= p249 + p250)) AND E (F (((p392 + p393 + p394 + p395 + p396 + p397 <= p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310) AND (p299 + p300 + p301 + p302 + p303 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p416 + p415) AND (p91 + p90 + p89 + p88 + p87 + p92 <= p329 + p330 + p331 + p332 + p333 + p334))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p416 + p415) AND (p91 + p90 + p89 + p88 + p87 + p92 <= p329 + p330 + p331 + p332 + p333 + p334))
lola: processed formula length: 103
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p254 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 144896 markings, 170524 edges, 28979 markings/sec, 0 secs
lola: sara is running 5 secs || 289752 markings, 343164 edges, 28971 markings/sec, 5 secs
lola: sara is running 10 secs || 431645 markings, 513040 edges, 28379 markings/sec, 10 secs
lola: sara is running 15 secs || 574823 markings, 684466 edges, 28636 markings/sec, 15 secs
lola: sara is running 20 secs || 717473 markings, 857084 edges, 28530 markings/sec, 20 secs
lola: sara is running 25 secs || 860264 markings, 1029396 edges, 28558 markings/sec, 25 secs
lola: sara is running 30 secs || 1002031 markings, 1200781 edges, 28353 markings/sec, 30 secs
lola: sara is running 35 secs || 1142631 markings, 1371582 edges, 28120 markings/sec, 35 secs
lola: sara is running 40 secs || 1280769 markings, 1539738 edges, 27628 markings/sec, 40 secs
lola: sara is running 45 secs || 1421971 markings, 1711820 edges, 28240 markings/sec, 45 secs
lola: sara is running 50 secs || 1563720 markings, 1884057 edges, 28350 markings/sec, 50 secs
lola: sara is running 55 secs || 1703348 markings, 2054744 edges, 27926 markings/sec, 55 secs
lola: sara is running 60 secs || 1842569 markings, 2225325 edges, 27844 markings/sec, 60 secs
lola: sara is running 65 secs || 1982623 markings, 2396339 edges, 28011 markings/sec, 65 secs
lola: sara is running 70 secs || 2122450 markings, 2567151 edges, 27965 markings/sec, 70 secs
lola: sara is running 75 secs || 2262317 markings, 2737915 edges, 27973 markings/sec, 75 secs
lola: sara is running 80 secs || 2402201 markings, 2907995 edges, 27977 markings/sec, 80 secs
lola: sara is running 85 secs || 2541031 markings, 3076713 edges, 27766 markings/sec, 85 secs
lola: sara is running 90 secs || 2680019 markings, 3244413 edges, 27798 markings/sec, 90 secs
lola: sara is running 95 secs || 2818238 markings, 3410368 edges, 27644 markings/sec, 95 secs
lola: sara is running 100 secs || 2956360 markings, 3576067 edges, 27624 markings/sec, 100 secs
lola: sara is running 105 secs || 3093684 markings, 3739938 edges, 27465 markings/sec, 105 secs
lola: sara is running 110 secs || 3232064 markings, 3905146 edges, 27676 markings/sec, 110 secs
lola: sara is running 115 secs || 3371515 markings, 4069645 edges, 27890 markings/sec, 115 secs
lola: sara is running 120 secs || 3510498 markings, 4234730 edges, 27797 markings/sec, 120 secs
lola: sara is running 125 secs || 3649427 markings, 4398408 edges, 27786 markings/sec, 125 secs
lola: sara is running 130 secs || 3788040 markings, 4562264 edges, 27723 markings/sec, 130 secs
lola: sara is running 135 secs || 3926205 markings, 4726088 edges, 27633 markings/sec, 135 secs
lola: sara is running 140 secs || 4064492 markings, 4889197 edges, 27657 markings/sec, 140 secs
lola: sara is running 145 secs || 4202407 markings, 5052382 edges, 27583 markings/sec, 145 secs
lola: sara is running 150 secs || 4340206 markings, 5218375 edges, 27560 markings/sec, 150 secs
lola: sara is running 155 secs || 4478180 markings, 5383818 edges, 27595 markings/sec, 155 secs
lola: sara is running 160 secs || 4613272 markings, 5544169 edges, 27018 markings/sec, 160 secs
lola: sara is running 165 secs || 4746632 markings, 5705407 edges, 26672 markings/sec, 165 secs
lola: sara is running 170 secs || 4880393 markings, 5868618 edges, 26752 markings/sec, 170 secs
lola: sara is running 175 secs || 5014474 markings, 6029318 edges, 26816 markings/sec, 175 secs
lola: sara is running 180 secs || 5148521 markings, 6193059 edges, 26809 markings/sec, 180 secs
lola: sara is running 185 secs || 5282402 markings, 6356706 edges, 26776 markings/sec, 185 secs
lola: sara is running 190 secs || 5416422 markings, 6519206 edges, 26804 markings/sec, 190 secs
lola: sara is running 195 secs || 5549895 markings, 6684290 edges, 26695 markings/sec, 195 secs
lola: sara is running 200 secs || 5683548 markings, 6847598 edges, 26731 markings/sec, 200 secs
lola: sara is running 205 secs || 5817370 markings, 7012993 edges, 26764 markings/sec, 205 secs
lola: sara is running 210 secs || 5950607 markings, 7179178 edges, 26647 markings/sec, 210 secs
lola: sara is running 215 secs || 6083565 markings, 7344303 edges, 26592 markings/sec, 215 secs
lola: sara is running 220 secs || 6217499 markings, 7510638 edges, 26787 markings/sec, 220 secs
lola: sara is running 225 secs || 6351237 markings, 7678362 edges, 26748 markings/sec, 225 secs
lola: sara is running 230 secs || 6485992 markings, 7843911 edges, 26951 markings/sec, 230 secs
lola: sara is running 235 secs || 6620063 markings, 8011097 edges, 26814 markings/sec, 235 secs
lola: sara is running 240 secs || 6754977 markings, 8176818 edges, 26983 markings/sec, 240 secs
lola: sara is running 245 secs || 6889863 markings, 8342009 edges, 26977 markings/sec, 245 secs
lola: sara is running 250 secs || 7024701 markings, 8507719 edges, 26968 markings/sec, 250 secs
lola: sara is running 255 secs || 7158746 markings, 8672594 edges, 26809 markings/sec, 255 secs
lola: sara is running 260 secs || 7293041 markings, 8835840 edges, 26859 markings/sec, 260 secs
lola: sara is running 265 secs || 7427357 markings, 8995726 edges, 26863 markings/sec, 265 secs
lola: sara is running 270 secs || 7563278 markings, 9160851 edges, 27184 markings/sec, 270 secs
lola: sara is running 275 secs || 7697373 markings, 9323129 edges, 26819 markings/sec, 275 secs
lola: sara is running 280 secs || 7831130 markings, 9486830 edges, 26751 markings/sec, 280 secs
lola: sara is running 285 secs || 7965452 markings, 9645901 edges, 26864 markings/sec, 285 secs
lola: sara is running 290 secs || 8100198 markings, 9805698 edges, 26949 markings/sec, 290 secs
lola: sara is running 295 secs || 8233803 markings, 9966259 edges, 26721 markings/sec, 295 secs
lola: sara is running 300 secs || 8369077 markings, 10130940 edges, 27055 markings/sec, 300 secs
lola: sara is running 305 secs || 8503566 markings, 10299968 edges, 26898 markings/sec, 305 secs
lola: sara is running 310 secs || 8640557 markings, 10464799 edges, 27398 markings/sec, 310 secs
lola: sara is running 315 secs || 8774264 markings, 10627140 edges, 26741 markings/sec, 315 secs
lola: sara is running 320 secs || 8913531 markings, 10796587 edges, 27853 markings/sec, 320 secs
lola: sara is running 325 secs || 9050536 markings, 10982661 edges, 27401 markings/sec, 325 secs
lola: sara is running 330 secs || 9188810 markings, 11154488 edges, 27655 markings/sec, 330 secs
lola: sara is running 335 secs || 9323435 markings, 11334263 edges, 26925 markings/sec, 335 secs
lola: sara is running 340 secs || 9457323 markings, 11493838 edges, 26778 markings/sec, 340 secs
lola: sara is running 345 secs || 9592191 markings, 11658628 edges, 26974 markings/sec, 345 secs
lola: sara is running 350 secs || 9730435 markings, 11844478 edges, 27649 markings/sec, 350 secs
lola: sara is running 355 secs || 9860624 markings, 12033230 edges, 26038 markings/sec, 355 secs
lola: sara is running 360 secs || 9994424 markings, 12192961 edges, 26760 markings/sec, 360 secs
lola: sara is running 365 secs || 10131461 markings, 12369605 edges, 27407 markings/sec, 365 secs
lola: sara is running 370 secs || 10264829 markings, 12531409 edges, 26674 markings/sec, 370 secs
lola: sara is running 375 secs || 10404190 markings, 12704204 edges, 27872 markings/sec, 375 secs
lola: sara is running 380 secs || 10537766 markings, 12897852 edges, 26715 markings/sec, 380 secs
lola: sara is running 385 secs || 10677986 markings, 13078162 edges, 28044 markings/sec, 385 secs
lola: sara is running 390 secs || 10812835 markings, 13268878 edges, 26970 markings/sec, 390 secs
lola: sara is running 395 secs || 10944889 markings, 13453198 edges, 26411 markings/sec, 395 secs
lola: sara is running 400 secs || 11076691 markings, 13620806 edges, 26360 markings/sec, 400 secs
lola: sara is running 405 secs || 11212915 markings, 13793109 edges, 27245 markings/sec, 405 secs
lola: sara is running 410 secs || 11344717 markings, 13959672 edges, 26360 markings/sec, 410 secs
lola: sara is running 415 secs || 11473378 markings, 14130042 edges, 25732 markings/sec, 415 secs
lola: sara is running 420 secs || 11597663 markings, 14315306 edges, 24857 markings/sec, 420 secs
lola: sara is running 425 secs || 11724478 markings, 14489123 edges, 25363 markings/sec, 425 secs
lola: sara is running 430 secs || 11857304 markings, 14652892 edges, 26565 markings/sec, 430 secs
lola: sara is running 435 secs || 11985415 markings, 14827319 edges, 25622 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p403 + p404 + p405 + p406 + p407 + p408) OR (p384 + p383 + p382 + p381 + p380 + p379 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((p403 + p404 + p405 + p406 + p407 + p408 <= 0) AND (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + 1 <= p384 + p383 + p382 + p381 + p380 + p379)))))
lola: processed formula length: 208
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5625 markings, 6564 edges
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p159 + p160 + p161 + p162 + p163 + p164 <= p91 + p90 + p89 + p88 + p87 + p92) OR (3 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p91 + p90 + p89 + p88 + p87 + p92 + 1 <= p159 + p160 + p161 + p162 + p163 + p164) AND (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 <= 2)))))
lola: processed formula length: 202
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 451322 markings, 879566 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p0 + p1 + p2 + p3 + p4 + p5 <= p94 + p95 + p96 + p97 + p98) AND (2 <= p391 + p390)) OR ((p323 + p324 + p325 + p326 + p327 + p328 <= p426 + p427 + p428 + p429 + p430 + p431) AND (1 <= p444 + p445 + p446 + p447 + p448 + p449))) OR E (F ((p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((((p94 + p95 + p96 + p97 + p98 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) OR (p391 + p390 <= 1)) AND ((p426 + p427 + p428 + p429 + p430 + p431 + 1 <= p323 + p324 + p325 + p326 + p327 + p328) OR (p444 + p445 + p446 + p447 + p448 + p449 <= 0))) AND NOT(E(TRUE U (p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189... (shortened)
lola: processed formula length: 526
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 687363 markings, 1470230 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1330946 markings, 2890324 edges, 128717 markings/sec, 5 secs
lola: 1935852 markings, 4250515 edges, 120981 markings/sec, 10 secs
lola: 2551668 markings, 5638624 edges, 123163 markings/sec, 15 secs
lola: 3167790 markings, 7032229 edges, 123224 markings/sec, 20 secs
lola: 3760520 markings, 8391128 edges, 118546 markings/sec, 25 secs
lola: 4333596 markings, 9732225 edges, 114615 markings/sec, 30 secs
lola: 4942245 markings, 11191019 edges, 121730 markings/sec, 35 secs
lola: 5560395 markings, 12706184 edges, 123630 markings/sec, 40 secs
lola: 6172398 markings, 14201252 edges, 122401 markings/sec, 45 secs
lola: 6751301 markings, 15627571 edges, 115781 markings/sec, 50 secs
lola: 7281539 markings, 16951951 edges, 106048 markings/sec, 55 secs
lola: 7814931 markings, 18283776 edges, 106678 markings/sec, 60 secs
lola: 8376523 markings, 19669835 edges, 112318 markings/sec, 65 secs
lola: 8938496 markings, 21049659 edges, 112395 markings/sec, 70 secs
lola: 9512454 markings, 22457194 edges, 114792 markings/sec, 75 secs
lola: 10078853 markings, 23860878 edges, 113280 markings/sec, 80 secs
lola: 10639041 markings, 25236699 edges, 112038 markings/sec, 85 secs
lola: 11212499 markings, 26637682 edges, 114692 markings/sec, 90 secs
lola: 11782223 markings, 28028194 edges, 113945 markings/sec, 95 secs
lola: 12350279 markings, 29407611 edges, 113611 markings/sec, 100 secs
lola: 12926242 markings, 30810738 edges, 115193 markings/sec, 105 secs
lola: 13499788 markings, 32202869 edges, 114709 markings/sec, 110 secs
lola: 14060734 markings, 33590693 edges, 112189 markings/sec, 115 secs
lola: 14612443 markings, 34948467 edges, 110342 markings/sec, 120 secs
lola: 15167332 markings, 36328730 edges, 110978 markings/sec, 125 secs
lola: 15735891 markings, 37724494 edges, 113712 markings/sec, 130 secs
lola: 16297250 markings, 39120632 edges, 112272 markings/sec, 135 secs
lola: 16873497 markings, 40529109 edges, 115249 markings/sec, 140 secs
lola: 17454225 markings, 41946180 edges, 116146 markings/sec, 145 secs
lola: 18036731 markings, 43373743 edges, 116501 markings/sec, 150 secs
lola: 18614520 markings, 44770290 edges, 115558 markings/sec, 155 secs
lola: 19172500 markings, 46149848 edges, 111596 markings/sec, 160 secs
lola: 19742106 markings, 47551772 edges, 113921 markings/sec, 165 secs
lola: 20312113 markings, 48950037 edges, 114001 markings/sec, 170 secs
lola: 20876857 markings, 50346700 edges, 112949 markings/sec, 175 secs
lola: 21440946 markings, 51736525 edges, 112818 markings/sec, 180 secs
lola: 22000489 markings, 53108774 edges, 111909 markings/sec, 185 secs
lola: 22555694 markings, 54511119 edges, 111041 markings/sec, 190 secs
lola: 23118662 markings, 55917921 edges, 112594 markings/sec, 195 secs
lola: 23689079 markings, 57369015 edges, 114083 markings/sec, 200 secs
lola: 24259672 markings, 58790087 edges, 114119 markings/sec, 205 secs
lola: 24807760 markings, 60147620 edges, 109618 markings/sec, 210 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: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PolyORBLF-COL-S02J04T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r127-smll-152673528900010"
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 '
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 ;