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 324K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.7K 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 lola
Input is PolyORBLF-COL-S02J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257600357
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527967817553

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S02J04T10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S02J04T10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J04T10 @ 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: 2324/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 24064
lola: finding significant places
lola: 752 places, 1572 transitions, 698 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2143 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p371)
lola: LP says that atomic proposition is always false: (2 <= p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533)
lola: A (F (G (G (X ((p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543)))))) : A (F (F (X (X ((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))))) : A (X ((p554 <= p327))) : A (X (G (G ((p493 <= p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689))))) : A (F (X (G (X (FALSE))))) : A ((p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)) : A (X (G (X (X ((p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 <= p349)))))) : A ((((p349 <= p556) U (1 <= p5)) U F (X ((p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 <= p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710))))) : A (F (F (F (G ((2 <= p6)))))) : A (F (F (FALSE))) : A ((p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p207 + p208 + p209 + p210 + p211)) : A ((((p554 <= p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381) U (p19 + p18 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543)) U X (G ((2 <= p243 + p244))))) : A (G (X (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326) U (p350 <= p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679))))) : A (G ((X ((2 <= p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741)) U G ((p6 <= p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667))))) : A (F (X (F (X ((p555 <= p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)))))) : A (F (F (F (G ((p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 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: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.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

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: processed formula length: 140
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
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-S02J04T10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 243 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: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.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-S02J04T10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p207 + p208 + p209 + p210 + p211)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p207 + p208 + p209 + p210 + p211)
lola: processed formula length: 105
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.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: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p554 <= p327)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p554 <= p327)))
lola: processed formula length: 22
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 <= p349))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 <= p349))))))
lola: processed formula length: 97
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 598 markings, 598 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p349 <= p556) U (1 <= p5)) U X (F ((p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 <= p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p349 <= p556) U (1 <= p5)) U X (F ((p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 <= p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710)))))
lola: processed formula length: 185
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 5 markings, 4 edges

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p493 <= p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p493 <= p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689))))
lola: processed formula length: 89
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 598 markings, 598 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))))
lola: processed formula length: 156
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 6 markings, 6 edges

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p554 <= p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381) U (p19 + p18 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543)) U X (G ((2 <= p243 + p244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p554 <= p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381) U (p19 + p18 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543)) U X (G ((2 <= p243 + p244)))))
lola: processed formula length: 199
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 674 markings, 674 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p350 <= p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326) OR (p350 <= p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p350 <= p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) AND ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326) OR (p350 <= p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679))))))
lola: processed formula length: 323
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 423118 markings, 566061 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p6 <= p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667)))) AND A (G ((X ((2 <= p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741)) OR G ((p6 <= p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p6 <= p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p6 <= p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667))))
lola: processed formula length: 87
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 600 markings, 601 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p555 <= p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p555 <= p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337)))))
lola: processed formula length: 93
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 6 markings, 6 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p6))))
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 600 markings, 601 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p750 + p749 + p748 + p747 + p746 + p745 + p744 + p743 + p742 + p741 <= p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543))))
lola: processed formula length: 152
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2998 markings, 3096 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523))))
lola: processed formula length: 152
lola: 40 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1029 markings, 1042 edges

FORMULA PolyORBLF-COL-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes no no yes no no no yes no
lola:
preliminary result: no yes yes no no yes no yes no no yes no no no yes no
lola: ========================================
lola: memory consumption: 22516 KB
lola: time consumption: 166 seconds

BK_STOP 1527967983592

--------------------
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-S02J04T10"
export BK_EXAMINATION="LTLCardinality"
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-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 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-S02J04T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257600357"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;