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 300K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-qhx2-152732127400115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528208613571

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-PT-0015 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Referendum-PT-0015 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Referendum-PT-0015 @ 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: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 46
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0015-LTLCardinality.task
lola: always true
lola: A ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) : A (G (G (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))))) : A (G ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))) : A ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)) : A ((F (F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))) U X ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))) : A (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) : A (G ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) : A (G (F (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) : A ((G ((voting_3 <= voted_no_13)) U F (X ((voting_3 <= voted_no_13))))) : A (G (F (((voted_yes_1 <= voting_7) U (voted_yes_12 <= voting_6))))) : A (G ((voted_no_14 <= voting_11))) : A ((G (F (TRUE)) U (voting_5 <= voting_3))) : A (X (((voted_yes_15 <= voted_no_13) U X ((voted_no_7 <= voted_no_3))))) : A ((voting_11 <= voting_15)) : A (((voted_no_12 <= voted_yes_10) U X (F ((voted_yes_10 <= voted_yes_4))))) : A ((voting_5 <= voted_no_7))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: processed formula length: 175
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)
lola: processed formula length: 179
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (voting_11 <= voting_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (voting_11 <= voting_15)
lola: processed formula length: 24
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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 Referendum-PT-0015-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (voting_5 <= voted_no_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (voting_5 <= voted_no_7)
lola: processed formula length: 24
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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

FORMULA Referendum-PT-0015-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((voting_3 <= voted_no_13))) OR (G ((voting_3 <= voted_no_13)) AND X (F ((voting_3 <= voted_no_13))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((voting_3 <= voted_no_13))) OR (G ((voting_3 <= voted_no_13)) AND X (F ((voting_3 <= voted_no_13))))))
lola: processed formula length: 112
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 1491927 markings, 4362627 edges, 298385 markings/sec, 0 secs
lola: 2830872 markings, 8566795 edges, 267789 markings/sec, 5 secs
lola: 4072924 markings, 12689725 edges, 248410 markings/sec, 10 secs
lola: 5400412 markings, 16890320 edges, 265498 markings/sec, 15 secs
lola: 6616110 markings, 20977118 edges, 243140 markings/sec, 20 secs
lola: 7804995 markings, 25016551 edges, 237777 markings/sec, 25 secs
lola: 8965963 markings, 29039928 edges, 232194 markings/sec, 30 secs
lola: 10092301 markings, 33003328 edges, 225268 markings/sec, 35 secs
lola: 11073296 markings, 36784003 edges, 196199 markings/sec, 40 secs
lola: 12301149 markings, 40504798 edges, 245571 markings/sec, 45 secs
lola: 13511421 markings, 44217642 edges, 242054 markings/sec, 50 secs
lola: 14589383 markings, 47797144 edges, 215592 markings/sec, 55 secs
lola: 15439715 markings, 51954113 edges, 170066 markings/sec, 60 secs
lola: 16120685 markings, 56215527 edges, 136194 markings/sec, 65 secs
lola: 16851157 markings, 60558948 edges, 146094 markings/sec, 70 secs
lola: 17508067 markings, 64766341 edges, 131382 markings/sec, 75 secs
lola: 18138922 markings, 68896582 edges, 126171 markings/sec, 80 secs
lola: 18783253 markings, 72769510 edges, 128866 markings/sec, 85 secs
lola: 19972490 markings, 76500075 edges, 237847 markings/sec, 90 secs
lola: 21027471 markings, 80072509 edges, 210996 markings/sec, 95 secs
lola: 21779276 markings, 84439169 edges, 150361 markings/sec, 100 secs
lola: 22447307 markings, 88710748 edges, 133606 markings/sec, 105 secs
lola: 23091076 markings, 92942642 edges, 128754 markings/sec, 110 secs
lola: 23748538 markings, 96920662 edges, 131492 markings/sec, 115 secs
lola: 24858869 markings, 100549460 edges, 222066 markings/sec, 120 secs
lola: 25656034 markings, 104574548 edges, 159433 markings/sec, 125 secs
lola: 26300254 markings, 108792048 edges, 128844 markings/sec, 130 secs
lola: 26857937 markings, 112806774 edges, 111537 markings/sec, 135 secs
lola: 27891581 markings, 116350920 edges, 206729 markings/sec, 140 secs
lola: 28561665 markings, 120522145 edges, 134017 markings/sec, 145 secs
lola: 29166023 markings, 124530819 edges, 120872 markings/sec, 150 secs
lola: 30024501 markings, 128239325 edges, 171696 markings/sec, 155 secs
lola: 30611787 markings, 132230106 edges, 117457 markings/sec, 160 secs
lola: 31355432 markings, 136017963 edges, 148729 markings/sec, 165 secs
lola: 32021449 markings, 139759604 edges, 133203 markings/sec, 170 secs
lola: 32615127 markings, 143466467 edges, 118736 markings/sec, 175 secs
lola: 33226328 markings, 146993482 edges, 122240 markings/sec, 180 secs
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: 33480783 markings, 148803452 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((voted_yes_15 <= voted_no_13) U X ((voted_no_7 <= voted_no_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((voted_yes_15 <= voted_no_13) U X ((voted_no_7 <= voted_no_3)))))
lola: processed formula length: 72
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 23 markings, 23 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) U X ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) U X ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 ... (shortened)
lola: processed formula length: 431
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 3 markings, 2 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((voted_no_12 <= voted_yes_10) U X (F ((voted_yes_10 <= voted_yes_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((voted_no_12 <= voted_yes_10) U X (F ((voted_yes_10 <= voted_yes_4)))))
lola: processed formula length: 75
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 2 markings, 1 edges
lola:
FORMULA Referendum-PT-0015-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: processed formula length: 183
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 2 markings, 1 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((voted_no_14 <= voting_11)))
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 ((voted_no_14 <= voting_11)))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: (voting_11 + 1 <= voted_no_14)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-PT-0015-LTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
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 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: processed formula length: 183
lola: 18 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))
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 ((ready <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))
lola: processed formula length: 217
lola: 18 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 845 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((voting_5 <= voting_3)))
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: (voting_3 + 1 <= voting_5)
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file Referendum-PT-0015-LTLCardinality.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: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((voted_yes_12 <= voting_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((voted_yes_12 <= voting_6))))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 19 markings, 20 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + ... (shortened)
lola: processed formula length: 429
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 17 markings, 17 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula length: 384
lola: 16 rewrites
lola: closed formula file Referendum-PT-0015-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: 17 markings, 17 edges
lola: ========================================

FORMULA Referendum-PT-0015-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no yes no no yes no yes yes yes
lola:
preliminary result: no no no no yes yes no no yes no no yes no yes yes yes
lola: memory consumption: 18912 KB
lola: time consumption: 188 seconds

BK_STOP 1528208822803

--------------------
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="Referendum-PT-0015"
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/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 Referendum-PT-0015, 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 r184-qhx2-152732127400115"
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 ;