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 316K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K 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 12K 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-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526800038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526841841940

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T08 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ PolyORBLF-COL-S02J06T08 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2124/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 22080
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409)
lola: LP says that atomic proposition is always false: (3 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312)
lola: LP says that atomic proposition is always false: (3 <= p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450)
lola: LP says that atomic proposition is always false: (3 <= p486)
lola: LP says that atomic proposition is always false: (3 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551)
lola: LP says that atomic proposition is always false: (p24 <= p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294)
lola: LP says that atomic proposition is always true: (3 <= p24)
lola: LP says that atomic proposition is always false: (3 <= p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250)
lola: LP says that atomic proposition is always false: (2 <= p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303)
lola: LP says that atomic proposition is always false: (2 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)
lola: LP says that atomic proposition is always false: (3 <= p259 + p260)
lola: LP says that atomic proposition is always false: (2 <= p69)
lola: LP says that atomic proposition is always false: (3 <= p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607)
lola: LP says that atomic proposition is always false: (3 <= p295)
lola: LP says that atomic proposition is always false: (3 <= p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518)
lola: LP says that atomic proposition is always true: (p69 <= p216 + p215 + p214 + p213 + p212 + p211 + p210)
lola: LP says that atomic proposition is always true: (p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 <= p51)
lola: LP says that atomic proposition is always false: (3 <= p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418)
lola: A ((A (F (FALSE)) U ())) : (((((2 <= p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294)) AND (p527 + 1 <= p295) AND ((1 <= p67 + p66 + p65 + p64 + p63 + p62 + p61 + p68))) OR E (F ((p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)))) OR E (X (A (G ((p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))))) : E ((A (X ((p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 <= p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543))) U A (F (FALSE)))) : A (G ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p295))) : A ((A (X ((2 <= p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233))) U E (F ((1 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551))))) : A (X (E (F (((p209 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551)))))) : NOT(((p217 <= p484 + p485) OR A ((TRUE U (p378 <= p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98))))) : (FALSE OR A (((p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U ((1 <= p519 + p520 + p521 + p522 + p523 + p524 + p525))))) : (E (F (E (F (FALSE)))) OR E (X (()))) : E (F ((FALSE OR A (G (FALSE))))) : A (X (E (F (FALSE)))) : NOT(A (G (TRUE))) : (TRUE AND A (F (A (G ((p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))) : (((p526 <= 0) OR E (F (((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))))) AND A (F (((p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 <= 0) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (1 <= p51)))))) : A (F (A (((1 <= p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502) U FALSE)))) : NOT(A (F ((((p81 + p82 <= p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688) OR (p304 <= p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518)) AND (p60 + 1 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 222 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 256 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 303 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 333 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: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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-S02J06T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((p209 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U ((p209 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551))))
lola: processed formula length: 79
lola: 57 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: 26 markings, 26 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294)) AND (p527 + 1 <= p295) AND ((1 <= p67 + p66 + p65 + p64 + p63 + p62 + p61 + p68))) OR (E (F ((p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258))) OR E (X (A (G ((p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)))
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 ((p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)))
lola: processed formula length: 124
lola: 56 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: (p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T08-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551)))
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 ((1 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551)))
lola: processed formula length: 68
lola: 56 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: (1 <= p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p295)))
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 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p295)))
lola: processed formula length: 127
lola: 57 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: (p295 + 1 <= p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T08-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T08-CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4549 markings, 5006 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + 1 <= p81 + p82) AND (p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + 1 <= p304)) OR (p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + 1 <= p81 + p82) AND (p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + 1 <= p304)) OR (p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 <= p60))))
lola: processed formula length: 335
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: 255 markings, 255 edges

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p484 + p485 + 1 <= p217) AND E (G ((p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + 1 <= p378))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p484 + p485 + 1 <= p217)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p484 + p485 + 1 <= p217)
lola: processed formula length: 25
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + 1 <= p378)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + 1 <= p378)))
lola: processed formula length: 67
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: 517 markings, 855 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U ((1 <= p519 + p520 + p521 + p522 + p523 + p524 + p525))))
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 (((p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 <= p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225) U ((1 <= p519 + p520 + p521 + p522 + p523 + p524 + p525))))
lola: processed formula length: 176
lola: 59 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 54 markings, 53 edges

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + 1 <= p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494)
lola: processed formula length: 106
lola: 57 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 534 markings, 534 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p526 <= 0) OR E (F (((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))))) AND A (F (((p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 <= 0) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p526 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p526 <= 0)
lola: processed formula length: 11
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 <= 0) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (1 <= p51)))))
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: ((1 <= p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433) AND ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99) OR (p51 <= 0)))
lola: processed formula length: 191
lola: 57 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p526 <= 0) OR E (F (((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))))) AND A (F (((p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 <= 0) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p526 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p526 <= 0)
lola: processed formula length: 11
lola: 55 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: E (F (((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))))
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 (((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))))
lola: processed formula length: 86
lola: 56 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: ((p304 <= p70 + p71) AND (1 <= p50 + p49 + p48 + p47 + p46 + p43 + p44 + p45))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T08-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T08-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 70 markings, 69 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 <= 0) OR ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (1 <= p51)))))
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: ((1 <= p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433) AND ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99) OR (p51 <= 0)))
lola: processed formula length: 191
lola: 57 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T08-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no no no no no no no yes no yes
lola:
preliminary result: no yes no no yes yes no no no no no no no yes no yes
lola: memory consumption: 27708 KB
lola: time consumption: 232 seconds

BK_STOP 1526842074267

--------------------
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-S02J06T08"
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-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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-S02J06T08, 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-152673526800038"
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 ;