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 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 lola
Input is PolyORBLF-COL-S02J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526800031
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526834108506

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S02J06T06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1600/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17152
lola: finding significant places
lola: 536 places, 1064 transitions, 486 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1483 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: LP says that atomic proposition is always false: (p528 <= p150)
lola: LP says that atomic proposition is always true: (1 <= p511)
lola: LP says that atomic proposition is always false: (3 <= p526 + p527)
lola: LP says that atomic proposition is always true: (2 <= p528)
lola: LP says that atomic proposition is always true: (1 <= p34 + p33 + p32 + p31 + p30 + p29 + p28)
lola: LP says that atomic proposition is always false: (2 <= p273 + p274 + p275 + p276 + p277 + p278)
lola: LP says that atomic proposition is always false: (3 <= p304)
lola: LP says that atomic proposition is always false: (2 <= p105)
lola: LP says that atomic proposition is always false: (3 <= p151)
lola: LP says that atomic proposition is always false: (2 <= p349 + p350 + p351 + p352 + p353 + p354)
lola: LP says that atomic proposition is always false: (3 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440)
lola: LP says that atomic proposition is always false: (2 <= p183 + p184 + p185 + p186 + p187 + p188)
lola: LP says that atomic proposition is always false: (2 <= p303)
lola: LP says that atomic proposition is always false: (3 <= p104)
lola: LP says that atomic proposition is always false: (3 <= p477 + p478 + p479 + p480 + p481 + p482 + p483)
lola: LP says that atomic proposition is always false: (3 <= p477 + p478 + p479 + p480 + p481 + p482 + p483)
lola: LP says that atomic proposition is always false: (3 <= p305)
lola: NOT((E (F (())) OR (((p27 <= 0)) AND (p183 + p184 + p185 + p186 + p187 + p188 + 1 <= p387 + p388 + p389 + p390 + p391 + p392)))) : (E (G (A (X ((p104 <= p106))))) AND A (((p183 + p184 + p185 + p186 + p187 + p188 + 1 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248) U (p107 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))) : A (G (((p261 + p262 + p263 + p264 + p265 + p266 <= p189 + p190 + p191 + p192 + p193 + p194) OR (1 <= p279 + p280 + p281 + p282 + p283 + p284) OR (p249 + p250 + p251 + p252 + p253 + p254 + 1 <= p151) OR (p25 + 1 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525) OR (p305 + 1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440)))) : (E (G (())) AND E (G (E (X ((p107 <= p464 + p465 + p466 + p467 + p468 + p469 + p470)))))) : E (F (E (G ((p151 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483))))) : (A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170)))) OR A ((() U (p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + 1 <= p305)))) : E (F (E (((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 <= p471 + p472 + p473 + p474 + p475 + p476) U FALSE)))) : NOT(E (F (A (G ((1 <= p27)))))) : ((A (F (())) AND ((p151 <= p106))) AND (((p453 + p454 + 1 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) OR (p53 <= 0)) OR NOT(E (G ((p90 + p89 + p88 + p87 + p86 + p91 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248)))))) : E (F ((((p51 + p50 + p47 + p48 + p49 + p52 <= 0) OR (p464 + p465 + p466 + p467 + p468 + p469 + p470 + 1 <= p171 + p172 + p173 + p174 + p175 + p176)) AND ((p90 + p89 + p88 + p87 + p86 + p91 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483) OR (p453 + p454 + 1 <= p455 + p456 + p457 + p458 + p459 + p460))))) : E (G (((p491 + p492 + p493 + p494 + p495 + p496 <= 0)))) : NOT(E (F (FALSE))) : (NOT((E (F (FALSE)) OR E (G ((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= p25))))) AND E (G ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 <= p107)))) : E (G (E (X (TRUE)))) : E (((p152 + p153 + p154 + p155 + p156 + p157 <= 0) U ())) : A (F (((p499 + p500 + p501 + p502 + p503 + p504 + 1 <= p297 + p298 + p299 + p300 + p301 + p302) AND ((p355 + p356 + p357 + p358 + p359 + p360 + 1 <= p152 + p153 + p154 + p155 + p156 + p157) OR (p529 + 1 <= p535 + p534 + p533 + p532 + p531 + p530)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p27)) OR (p387 + p388 + p389 + p390 + p391 + p392 <= p183 + p184 + p185 + p186 + p187 + p188))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p27)) OR (p387 + p388 + p389 + p390 + p391 + p392 <= p183 + p184 + p185 + p186 + p187 + p188))
lola: processed formula length: 103
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
check_solution: Constraint R17 = 0 is above its equality of -1
check_solution: Constraint R18 = 0 is above its equality of -10
check_solution: Constraint R62 = 0 is above its equality of -1
check_solution: Constraint R90 = 0 is above its equality of -1
check_solution: Constraint R91 = 0 is above its equality of -1
check_solution: Constraint R92 = 0 is above its equality of -1
check_solution: Constraint R93 = 0 is above its equality of -1
check_solution: Constraint R94 = 0 is above its equality of -1
check_solution: Constraint R305 = 0 is above its equality of -1
check_solution: Constraint R365 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((p104 <= p106))))) AND A (((p183 + p184 + p185 + p186 + p187 + p188 + 1 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248) U (p107 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p183 + p184 + p185 + p186 + p187 + p188 + 1 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248) U (p107 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p183 + p184 + p185 + p186 + p187 + p188 + 1 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248) U (p107 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))
lola: processed formula length: 218
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p104 <= p106)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((p104 <= p106)))))
lola: processed formula length: 38
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 225837 markings, 613410 edges, 45167 markings/sec, 0 secs
lola: 563222 markings, 1283115 edges, 67477 markings/sec, 5 secs
lola: 896466 markings, 1979881 edges, 66649 markings/sec, 10 secs
lola: 1197094 markings, 2668164 edges, 60126 markings/sec, 15 secs
lola: 1584997 markings, 3396949 edges, 77581 markings/sec, 20 secs
lola: 2012797 markings, 4135542 edges, 85560 markings/sec, 25 secs
lola: 2272794 markings, 4907884 edges, 51999 markings/sec, 30 secs
lola: 2560910 markings, 5716469 edges, 57623 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2570886 markings, 5742892 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p107 <= p464 + p465 + p466 + p467 + p468 + p469 + p470)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((p107 <= p464 + p465 + p466 + p467 + p468 + p469 + p470)))))
lola: processed formula length: 80
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 3459 markings, 6884 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p51 + p50 + p47 + p48 + p49 + p52 <= 0) OR (p464 + p465 + p466 + p467 + p468 + p469 + p470 + 1 <= p171 + p172 + p173 + p174 + p175 + p176)) AND ((p90 + p89 + p88 + p87 + p86 + p91 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483) OR (p453 + p454 + 1 <= p455 + p456 + p457 + p458 + p459 + p460)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((p51 + p50 + p47 + p48 + p49 + p52 <= 0) OR (p464 + p465 + p466 + p467 + p468 + p469 + p470 + 1 <= p171 + p172 + p173 + p174 + p175 + p176)) AND ((p90 + p89 + p88 + p87 + p86 + p91 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483) OR (p453 + p454 + 1 <= p455 + p456 + p457 + p458 + p459 + p460)))))
lola: processed formula length: 313
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((p51 + p50 + p47 + p48 + p49 + p52 <= 0) OR (p464 + p465 + p466 + p467 + p468 + p469 + p470 + 1 <= p171 + p172 + p173 + p174 + p175 + p176)) AND ((p90 + p89 + p88 + p87 + p86 + p91 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483) OR (p453 + p454 + 1 <= p455 + p456 + p457 + p458 + p459 + p460)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T06-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p261 + p262 + p263 + p264 + p265 + p266 <= p189 + p190 + p191 + p192 + p193 + p194) OR (1 <= p279 + p280 + p281 + p282 + p283 + p284) OR (p249 + p250 + p251 + p252 + p253 + p254 + 1 <= p151) OR (p25 + 1 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525) OR (p305 + 1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p261 + p262 + p263 + p264 + p265 + p266 <= p189 + p190 + p191 + p192 + p193 + p194) OR (1 <= p279 + p280 + p281 + p282 + p283 + p284) OR (p249 + p250 + p251 + p252 + p253 + p254 + 1 <= p151) OR (p25 + 1 <= p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525) OR (p305 + 1 <= p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 +... (shortened)
lola: processed formula length: 626
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p189 + p190 + p191 + p192 + p193 + p194 + 1 <= p261 + p262 + p263 + p264 + p265 + p266) AND (p279 + p280 + p281 + p282 + p283 + p284 <= 0) AND (p151 <= p249 + p250 + p251 + p252 + p253 + p254) AND (p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 <= p25) AND (p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 <= p305))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T06-CTLCardinality-8-0.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: 70 markings, 69 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT DEADLOCK))
lola: processed formula length: 20
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 307 markings, 307 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p27 <= 0)
lola: processed formula length: 10
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 174776 markings, 186761 edges, 34955 markings/sec, 0 secs
lola: 357813 markings, 395082 edges, 36607 markings/sec, 5 secs
lola: 536358 markings, 602947 edges, 35709 markings/sec, 10 secs
lola: 715718 markings, 812280 edges, 35872 markings/sec, 15 secs
lola: 891355 markings, 1020293 edges, 35127 markings/sec, 20 secs
lola: 1064095 markings, 1226443 edges, 34548 markings/sec, 25 secs
lola: 1232129 markings, 1428889 edges, 33607 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 1325575 markings, 1541945 edges

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
subprocess 11 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p491 + p492 + p493 + p494 + p495 + p496 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p491 + p492 + p493 + p494 + p495 + p496 <= 0))))
lola: processed formula length: 56
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 19249 markings, 24963 edges
lola:
FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 787 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p151 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p151 + 1 <= p477 + p478 + p479 + p480 + p481 + p482 + p483)
lola: processed formula length: 60
lola: 46 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 160349 markings, 166682 edges, 32070 markings/sec, 0 secs
lola: 318015 markings, 334793 edges, 31533 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 413196 markings, 437656 edges

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p499 + p500 + p501 + p502 + p503 + p504 + 1 <= p297 + p298 + p299 + p300 + p301 + p302) AND ((p355 + p356 + p357 + p358 + p359 + p360 + 1 <= p152 + p153 + p154 + p155 + p156 + p157) OR (p529 + 1 <= p535 + p534 + p533 + p532 + p531 + p530)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p297 + p298 + p299 + p300 + p301 + p302 <= p499 + p500 + p501 + p502 + p503 + p504) OR ((p152 + p153 + p154 + p155 + p156 + p157 <= p355 + p356 + p357 + p358 + p359 + p360) AND (p535 + p534 + p533 + p532 + p531 + p530 <= p529)))
lola: processed formula length: 231
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1216 markings, 1393 edges

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p25 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) AND E (G ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
========================================lola:
subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 <= p107)))
lola: processed formula length: 99
lola: 45 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 55549 markings, 67703 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170)))) OR A (F ((p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + 1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170))))
lola: processed formula length: 88
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p177 + p178 + p179 + p180 + p181 + p182 <= 2) AND (p106 <= 0) AND (p170 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T06-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 141 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170)))) OR A (F ((p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + 1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= p177 + p178 + p179 + p180 + p181 + p182) OR (1 <= p106) OR (1 <= p170))))
lola: processed formula length: 88
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p177 + p178 + p179 + p180 + p181 + p182 <= 2) AND (p106 <= 0) AND (p170 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T06-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 141 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + 1 <= p305)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p305 <= p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236)
lola: processed formula length: 301
lola: 47 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 2085 markings, 2255 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no no no yes no yes no yes no no
lola:
preliminary result: yes yes no yes yes yes no no no yes no yes no yes no no
lola: ========================================
lola: memory consumption: 29476 KB
lola: time consumption: 437 seconds

BK_STOP 1526834545589

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 lola"
echo " Input is PolyORBLF-COL-S02J06T06, 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 r124-smll-152673526800031"
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 ;