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 mcc4mcc-full
Input is Referendum-PT-0015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583900269
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527968400553


BK_STOP 1527969502499

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Referendum-PT-0015 as instance name.
Using Referendum as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 2616, 'Memory': 152.89, 'Tool': 'gspn'}, {'Time': 3950, 'Memory': 212.37, 'Tool': 'itstools'}, {'Time': 645082, 'Memory': 1707.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 246.59097859327218x far from the best tool gspn.
CTLCardinality lola Referendum-PT-0015...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Referendum-PT-0015: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
Referendum-PT-0015: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Referendum-PT-0015 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 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: 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-CTLCardinality.task
lola: E (F ((A (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 <= ready))) AND ((2 <= ready) AND (3 <= ready) AND (1 <= 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 (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) AND (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 <= 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)) AND E (F ((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 <= 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)))))) : E (X (E (((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 <= 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 (2 <= ready))))) : A (F ((3 <= ready))) : (A (G (((1 <= ready) OR (2 <= 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) OR ((2 <= 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) AND (2 <= 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))))) OR (E (X (((3 <= ready) AND (3 <= ready)))) AND ((((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) AND (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))) OR E (F (TRUE))))) : E (G (TRUE)) : E (G (A (X (())))) : E (F (NOT(E (F ((1 <= ready)))))) : ((((1 <= voting_11) AND A (X ((2 <= voted_yes_11)))) OR NOT(E (F ((3 <= voted_no_6))))) OR A (G (((voted_no_15 <= voted_yes_7) AND ((voted_no_14 <= voting_15) OR (voted_yes_12 <= ready)))))) : E (((((voting_3 <= voted_no_6) AND (1 <= voted_no_4)) OR ((2 <= voted_no_4) AND (voting_2 <= voting_11))) U E (F ((3 <= voted_yes_2))))) : A ((((voted_no_3 <= 2) OR (voted_no_14 + 1 <= voting_1)) U A (G ((voted_no_3 <= voting_12))))) : (((((voted_no_13 <= 0) AND (voting_8 + 1 <= voted_no_8)) OR (3 <= voted_yes_11)) OR E (((voted_no_15 <= voted_yes_9) U (2 <= voting_1)))) AND NOT((E (F ((2 <= voting_1))) OR (1 <= voted_yes_13)))) : NOT(E (F (((voted_yes_5 <= voting_6) AND (2 <= voting_3) AND (voted_yes_8 <= voted_yes_12))))) : A ((E (G ((voted_no_3 <= voting_12))) U (1 <= voting_14))) : A (X (E (((ready <= voted_no_3) U (3 <= voting_1))))) : E (F (((2 <= voted_no_4) AND (voted_yes_3 <= 1) AND ((voted_no_10 <= voting_6) OR (1 <= voted_no_7) OR ((1 <= voted_yes_15) AND (voted_yes_4 <= voting_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (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 <= ready))) AND ((2 <= ready) AND (3 <= ready) AND (1 <= 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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U (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 <= ready)) AND ((2 <= ready) AND (3 <= ready) AND (1 <= 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_y... (shortened)
lola: processed formula length: 492
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 462758 markings, 4503542 edges, 3225298337947189248 markings/sec, 0 secs
lola: 870250 markings, 8762357 edges, 81498 markings/sec, 5 secs
lola: 1261506 markings, 12978227 edges, 78251 markings/sec, 10 secs
lola: 1595698 markings, 17007154 edges, 66838 markings/sec, 15 secs
lola: 2019309 markings, 21343697 edges, 84722 markings/sec, 20 secs
lola: 2397395 markings, 25491900 edges, 75617 markings/sec, 25 secs
lola: 2739650 markings, 29502563 edges, 68451 markings/sec, 30 secs
lola: 3109017 markings, 33562130 edges, 73873 markings/sec, 35 secs
lola: 3444951 markings, 37525589 edges, 67187 markings/sec, 40 secs
lola: 3783321 markings, 41468917 edges, 67674 markings/sec, 45 secs
lola: 4111610 markings, 45408199 edges, 65658 markings/sec, 50 secs
lola: 4416533 markings, 49219356 edges, 60985 markings/sec, 55 secs
lola: 4699330 markings, 52909948 edges, 56559 markings/sec, 60 secs
lola: 5061690 markings, 56959631 edges, 72472 markings/sec, 65 secs
lola: 5455967 markings, 61216799 edges, 78855 markings/sec, 70 secs
lola: 5800455 markings, 65236781 edges, 68898 markings/sec, 75 secs
lola: 6185399 markings, 69474894 edges, 76989 markings/sec, 80 secs
lola: 6530517 markings, 73547161 edges, 69024 markings/sec, 85 secs
lola: 6892614 markings, 77699360 edges, 72419 markings/sec, 90 secs
lola: 7227645 markings, 81705508 edges, 67006 markings/sec, 95 secs
lola: 7542224 markings, 85629075 edges, 62916 markings/sec, 100 secs
lola: 7839309 markings, 89470665 edges, 59417 markings/sec, 105 secs
lola: 8175103 markings, 93494163 edges, 67159 markings/sec, 110 secs
lola: 8543684 markings, 97669795 edges, 73716 markings/sec, 115 secs
lola: 8891054 markings, 101707242 edges, 69474 markings/sec, 120 secs
lola: 9223689 markings, 105688620 edges, 66527 markings/sec, 125 secs
lola: 9547055 markings, 109615089 edges, 64673 markings/sec, 130 secs
lola: 9849276 markings, 113451059 edges, 60444 markings/sec, 135 secs
lola: 10127514 markings, 117180996 edges, 55648 markings/sec, 140 secs
lola: 10476722 markings, 121186956 edges, 69842 markings/sec, 145 secs
lola: 10807023 markings, 125140966 edges, 66060 markings/sec, 150 secs
lola: 11115350 markings, 128990579 edges, 61665 markings/sec, 155 secs
lola: 11403437 markings, 132725163 edges, 57617 markings/sec, 160 secs
lola: 11705024 markings, 136545986 edges, 60317 markings/sec, 165 secs
lola: 12014477 markings, 140358392 edges, 61891 markings/sec, 170 secs
lola: 12303397 markings, 144094041 edges, 57784 markings/sec, 175 secs
lola: 12578781 markings, 147731041 edges, 55077 markings/sec, 180 secs
lola: 12869261 markings, 151423814 edges, 58096 markings/sec, 185 secs
lola: 13135168 markings, 155066043 edges, 53181 markings/sec, 190 secs
lola: 13418479 markings, 158745500 edges, 56662 markings/sec, 195 secs
lola: 13680012 markings, 162332879 edges, 52307 markings/sec, 200 secs
lola: 13933875 markings, 165873888 edges, 50773 markings/sec, 205 secs
lola: 14178918 markings, 169377301 edges, 49009 markings/sec, 210 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 172121351 edges
lola: ========================================
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
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) AND (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
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) AND (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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-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) AND (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 <= 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: 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) AND (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_... (shortened)
lola: processed formula length: 607
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((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 <= 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 CTL
lola: processed formula: AX(E(TRUE U (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 <= 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: 386
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((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 <= 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 CTL
lola: processed formula: EX(E((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 <= 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 + vote... (shortened)
lola: processed formula length: 439
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 530464 markings, 4017527 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1022502 markings, 7954586 edges, 98408 markings/sec, 5 secs
lola: 1483119 markings, 11733547 edges, 92123 markings/sec, 10 secs
lola: 1964102 markings, 15619350 edges, 96197 markings/sec, 15 secs
lola: 2415868 markings, 19363704 edges, 90353 markings/sec, 20 secs
lola: 2858319 markings, 23084534 edges, 88490 markings/sec, 25 secs
lola: 3298241 markings, 26779529 edges, 87984 markings/sec, 30 secs
lola: 3713233 markings, 30333643 edges, 82998 markings/sec, 35 secs
lola: 4227222 markings, 34388597 edges, 102798 markings/sec, 40 secs
lola: 4695909 markings, 38329826 edges, 93737 markings/sec, 45 secs
lola: 5183834 markings, 42353325 edges, 97585 markings/sec, 50 secs
lola: 5629592 markings, 46122717 edges, 89152 markings/sec, 55 secs
lola: 6066057 markings, 49829447 edges, 87293 markings/sec, 60 secs
lola: 6535010 markings, 53676873 edges, 93791 markings/sec, 65 secs
lola: 6991181 markings, 57525097 edges, 91234 markings/sec, 70 secs
lola: 7426408 markings, 61233559 edges, 87045 markings/sec, 75 secs
lola: 7864706 markings, 64894867 edges, 87660 markings/sec, 80 secs
lola: 8292938 markings, 68553202 edges, 85646 markings/sec, 85 secs
lola: 8714665 markings, 72117137 edges, 84345 markings/sec, 90 secs
lola: 9136335 markings, 75687044 edges, 84334 markings/sec, 95 secs
lola: 9548104 markings, 79169498 edges, 82354 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9772767 markings, 80987940 edges
lola: ========================================
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ready)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= ready)))
lola: processed formula: A (F ((3 <= ready)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= ready) OR (2 <= 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) OR ((2 <= 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) AND (2 <= voting_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= ready) OR (2 <= 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) OR ((2 <= 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) AND (2 <= voting_10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((3 <= ready) AND (3 <= ready))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((3 <= ready) AND (3 <= ready)))
lola: processed formula length: 35
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((1 <= ready))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (1 <= ready))))
lola: processed formula length: 37
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 536055 markings, 4277063 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1041979 markings, 8471179 edges, 101185 markings/sec, 5 secs
lola: 1471619 markings, 12479725 edges, 85928 markings/sec, 10 secs
lola: 1926799 markings, 16524877 edges, 91036 markings/sec, 15 secs
lola: 2379276 markings, 20549965 edges, 90495 markings/sec, 20 secs
lola: 2789362 markings, 24455488 edges, 82017 markings/sec, 25 secs
lola: 3221541 markings, 28446184 edges, 86436 markings/sec, 30 secs
lola: 3622896 markings, 32323106 edges, 80271 markings/sec, 35 secs
lola: 4006647 markings, 36135684 edges, 76750 markings/sec, 40 secs
lola: 4361051 markings, 39849026 edges, 70881 markings/sec, 45 secs
lola: 4698386 markings, 43517111 edges, 67467 markings/sec, 50 secs
lola: 5131364 markings, 47516643 edges, 86596 markings/sec, 55 secs
lola: 5589385 markings, 51571316 edges, 91604 markings/sec, 60 secs
lola: 6013002 markings, 55582348 edges, 84723 markings/sec, 65 secs
lola: 6445655 markings, 59618142 edges, 86531 markings/sec, 70 secs
lola: 6856208 markings, 63574363 edges, 82111 markings/sec, 75 secs
lola: 7240217 markings, 67407243 edges, 76802 markings/sec, 80 secs
lola: 7596867 markings, 71149735 edges, 71330 markings/sec, 85 secs
lola: 7921043 markings, 74759055 edges, 64835 markings/sec, 90 secs
lola: 8351714 markings, 78769049 edges, 86134 markings/sec, 95 secs
lola: 8757803 markings, 82716406 edges, 81218 markings/sec, 100 secs
lola: 9151144 markings, 86619842 edges, 78668 markings/sec, 105 secs
lola: 9537341 markings, 90467353 edges, 77239 markings/sec, 110 secs
lola: 9885063 markings, 94150190 edges, 69544 markings/sec, 115 secs
lola: 10229201 markings, 97858693 edges, 68828 markings/sec, 120 secs
lola: 10621045 markings, 101726405 edges, 78369 markings/sec, 125 secs
lola: 10999391 markings, 105553051 edges, 75669 markings/sec, 130 secs
lola: 11340308 markings, 109234114 edges, 68183 markings/sec, 135 secs
lola: 11682244 markings, 112930975 edges, 68387 markings/sec, 140 secs
lola: 12039115 markings, 116679036 edges, 71374 markings/sec, 145 secs
lola: 12377783 markings, 120356262 edges, 67734 markings/sec, 150 secs
lola: 12714530 markings, 124058757 edges, 67349 markings/sec, 155 secs
lola: 13037446 markings, 127651396 edges, 64583 markings/sec, 160 secs
lola: 13358328 markings, 131257344 edges, 64176 markings/sec, 165 secs
lola: 13659230 markings, 134780730 edges, 60180 markings/sec, 170 secs
lola: 13950627 markings, 138261730 edges, 58279 markings/sec, 175 secs
lola: 14229190 markings, 141749213 edges, 55713 markings/sec, 180 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 143489073 edges
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= voting_11) AND A (X ((2 <= voted_yes_11)))) OR NOT(E (F ((3 <= voted_no_6))))) OR A (G (((voted_no_15 <= voted_yes_7) AND ((voted_no_14 <= voting_15) OR (voted_yes_12 <= ready))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= voting_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= voting_11)
lola: processed formula length: 16
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-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: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((voted_no_6 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-PT-0015-CTLCardinality-9.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((voting_3 <= voted_no_6) AND (1 <= voted_no_4)) OR ((2 <= voted_no_4) AND (voting_2 <= voting_11))) U E (F ((3 <= voted_yes_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((voting_3 <= voted_no_6) AND (1 <= voted_no_4)) OR ((2 <= voted_no_4) AND (voting_2 <= voting_11))) U E(TRUE U (3 <= voted_yes_2)))
lola: processed formula length: 136
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 528487 markings, 4210079 edges, 2822845471221874688 markings/sec, 0 secs
lola: 1030152 markings, 8373259 edges, 100333 markings/sec, 5 secs
lola: 1463421 markings, 12398781 edges, 86654 markings/sec, 10 secs
lola: 1919268 markings, 16458953 edges, 91169 markings/sec, 15 secs
lola: 2373982 markings, 20498332 edges, 90943 markings/sec, 20 secs
lola: 2784002 markings, 24399918 edges, 82004 markings/sec, 25 secs
lola: 3213597 markings, 28356920 edges, 85919 markings/sec, 30 secs
lola: 3614394 markings, 32231115 edges, 80159 markings/sec, 35 secs
lola: 4004241 markings, 36108585 edges, 77969 markings/sec, 40 secs
lola: 4367971 markings, 39918039 edges, 72746 markings/sec, 45 secs
lola: 4708084 markings, 43634688 edges, 68023 markings/sec, 50 secs
lola: 5159597 markings, 47749294 edges, 90303 markings/sec, 55 secs
lola: 5622244 markings, 51876765 edges, 92529 markings/sec, 60 secs
lola: 6051714 markings, 55936241 edges, 85894 markings/sec, 65 secs
lola: 6475689 markings, 59925883 edges, 84795 markings/sec, 70 secs
lola: 6886594 markings, 63889214 edges, 82181 markings/sec, 75 secs
lola: 7278756 markings, 67818525 edges, 78432 markings/sec, 80 secs
lola: 7644278 markings, 71628361 edges, 73104 markings/sec, 85 secs
lola: 7963171 markings, 75325433 edges, 63779 markings/sec, 90 secs
lola: 8417466 markings, 79374531 edges, 90859 markings/sec, 95 secs
lola: 8825764 markings, 83352057 edges, 81660 markings/sec, 100 secs
lola: 9225469 markings, 87289522 edges, 79941 markings/sec, 105 secs
lola: 9597778 markings, 91058134 edges, 74462 markings/sec, 110 secs
lola: 9929040 markings, 94651024 edges, 66252 markings/sec, 115 secs
lola: 10289112 markings, 98432513 edges, 72014 markings/sec, 120 secs
lola: 10681412 markings, 102320578 edges, 78460 markings/sec, 125 secs
lola: 11056979 markings, 106139190 edges, 75113 markings/sec, 130 secs
lola: 11395260 markings, 109869495 edges, 67656 markings/sec, 135 secs
lola: 11755423 markings, 113668086 edges, 72033 markings/sec, 140 secs
lola: 12109136 markings, 117372905 edges, 70743 markings/sec, 145 secs
lola: 12431495 markings, 121033388 edges, 64472 markings/sec, 150 secs
lola: 12790261 markings, 124851828 edges, 71753 markings/sec, 155 secs
lola: 13104297 markings, 128511112 edges, 62807 markings/sec, 160 secs
lola: 13440851 markings, 132211245 edges, 67311 markings/sec, 165 secs
lola: 13750456 markings, 135842924 edges, 61921 markings/sec, 170 secs
lola: 14044252 markings, 139403939 edges, 58759 markings/sec, 175 secs
lola: 14311338 markings, 142871612 edges, 53417 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 143489072 edges
lola: ========================================
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((voted_no_3 <= 2) OR (voted_no_14 + 1 <= voting_1)) U A (G ((voted_no_3 <= voting_12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((voted_no_3 <= 2) OR (voted_no_14 + 1 <= voting_1)) U A (G ((voted_no_3 <= voting_12)))))
lola: processed formula: A ((((voted_no_3 <= 2) OR (voted_no_14 + 1 <= voting_1)) U A (G ((voted_no_3 <= voting_12)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((voted_no_13 <= 0) AND (voting_8 + 1 <= voted_no_8)) OR (3 <= voted_yes_11)) OR E (((voted_no_15 <= voted_yes_9) U (2 <= voting_1)))) AND NOT((E (F ((2 <= voting_1))) OR (1 <= voted_yes_13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((voted_no_13 <= 0) AND (voting_8 + 1 <= voted_no_8)) OR (3 <= voted_yes_11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((voted_no_13 <= 0) AND (voting_8 + 1 <= voted_no_8)) OR (3 <= voted_yes_11))
lola: processed formula length: 79
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 709 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((voted_no_15 <= voted_yes_9) U (2 <= voting_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((voted_no_15 <= voted_yes_9) U (2 <= voting_1))
lola: processed formula length: 49
lola: 6 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 691960 markings, 3799560 edges, 2977812014430158848 markings/sec, 0 secs
lola: 1298891 markings, 7506274 edges, 121386 markings/sec, 5 secs
lola: 1842844 markings, 11188413 edges, 108791 markings/sec, 10 secs
lola: 2363148 markings, 15010253 edges, 104061 markings/sec, 15 secs
lola: 2840641 markings, 18738857 edges, 95499 markings/sec, 20 secs
lola: 3313217 markings, 22446191 edges, 94515 markings/sec, 25 secs
lola: 3772575 markings, 26113473 edges, 91872 markings/sec, 30 secs
lola: 4201004 markings, 29704013 edges, 85686 markings/sec, 35 secs
lola: 4590381 markings, 33158151 edges, 77875 markings/sec, 40 secs
lola: 5072857 markings, 36684707 edges, 96495 markings/sec, 45 secs
lola: 5649499 markings, 40271553 edges, 115328 markings/sec, 50 secs
lola: 6215251 markings, 43901946 edges, 113150 markings/sec, 55 secs
lola: 6762054 markings, 47531189 edges, 109361 markings/sec, 60 secs
lola: 7269867 markings, 51008117 edges, 101563 markings/sec, 65 secs
lola: 7748519 markings, 54487086 edges, 95730 markings/sec, 70 secs
lola: 8227719 markings, 58149308 edges, 95840 markings/sec, 75 secs
lola: 8710689 markings, 61999731 edges, 96594 markings/sec, 80 secs
lola: 9182548 markings, 65791128 edges, 94372 markings/sec, 85 secs
lola: 9619469 markings, 69433096 edges, 87384 markings/sec, 90 secs
lola: 10006026 markings, 72990260 edges, 77311 markings/sec, 95 secs
lola: 10459099 markings, 76696710 edges, 90615 markings/sec, 100 secs
lola: 10891092 markings, 80358379 edges, 86399 markings/sec, 105 secs
lola: 11306279 markings, 83977086 edges, 83037 markings/sec, 110 secs
lola: 11711059 markings, 87590485 edges, 80956 markings/sec, 115 secs
lola: 12132423 markings, 91249774 edges, 84273 markings/sec, 120 secs
lola: 12507947 markings, 94769508 edges, 75105 markings/sec, 125 secs
lola: 12913371 markings, 98373472 edges, 81085 markings/sec, 130 secs
lola: 13287631 markings, 101872452 edges, 74852 markings/sec, 135 secs
lola: 13645826 markings, 105328230 edges, 71639 markings/sec, 140 secs
lola: 13982777 markings, 108699465 edges, 67390 markings/sec, 145 secs
lola: 14288341 markings, 112026874 edges, 61113 markings/sec, 150 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 112665493 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 670 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((voted_yes_5 <= voting_6) AND (2 <= voting_3) AND (voted_yes_8 <= voted_yes_12)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to Referendum-PT-0015-CTLCardinality-12.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 893 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((voted_no_3 <= voting_12))) U (1 <= voting_14)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (voting_12 + 1 <= voted_no_3))) U (1 <= voting_14))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2204 markings, 4395 edges
sara: try reading problem file Referendum-PT-0015-CTLCardinality-12.sara.
lola: ========================================
lola: sara: subprocess 14 will run for 1340 seconds at most (--localtimelimit=-1)place or transition ordering is non-deterministic

lola: ========================================
lola: ...considering subproblem: A (X (E (((ready <= voted_no_3) U (3 <= voting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((ready <= voted_no_3) U (3 <= voting_1)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 514501 markings, 4057005 edges, 102900 markings/sec, 0 secs
lola: 991399 markings, 8037954 edges, 95380 markings/sec, 5 secs
lola: 1413302 markings, 11899969 edges, 84381 markings/sec, 10 secs
lola: 1837749 markings, 15725188 edges, 84889 markings/sec, 15 secs
lola: 2280582 markings, 19624618 edges, 88567 markings/sec, 20 secs
lola: 2655412 markings, 23353549 edges, 74966 markings/sec, 25 secs
lola: 3098216 markings, 27248717 edges, 88561 markings/sec, 30 secs
lola: 3476490 markings, 30945673 edges, 75655 markings/sec, 35 secs
lola: 3849742 markings, 34655102 edges, 74650 markings/sec, 40 secs
lola: 4224490 markings, 38396826 edges, 74950 markings/sec, 45 secs
lola: 4568358 markings, 42045003 edges, 68774 markings/sec, 50 secs
lola: 4917138 markings, 45654036 edges, 69756 markings/sec, 55 secs
lola: 5399708 markings, 49838817 edges, 96514 markings/sec, 60 secs
lola: 5814588 markings, 53820494 edges, 82976 markings/sec, 65 secs
lola: 6268844 markings, 57911470 edges, 90851 markings/sec, 70 secs
lola: 6677393 markings, 61876127 edges, 81710 markings/sec, 75 secs
lola: 7076930 markings, 65814178 edges, 79907 markings/sec, 80 secs
lola: 7456963 markings, 69657630 edges, 76007 markings/sec, 85 secs
lola: 7799932 markings, 73361538 edges, 68594 markings/sec, 90 secs
lola: 8180815 markings, 77219873 edges, 76177 markings/sec, 95 secs
lola: 8601274 markings, 81181143 edges, 84092 markings/sec, 100 secs
lola: 9008353 markings, 85093997 edges, 81416 markings/sec, 105 secs
lola: 9393542 markings, 88947275 edges, 77038 markings/sec, 110 secs
lola: 9749841 markings, 92679880 edges, 71260 markings/sec, 115 secs
lola: 10065699 markings, 96265854 edges, 63172 markings/sec, 120 secs
lola: 10468203 markings, 100159461 edges, 80501 markings/sec, 125 secs
lola: 10849678 markings, 104001995 edges, 76295 markings/sec, 130 secs
lola: 11213278 markings, 107817658 edges, 72720 markings/sec, 135 secs
lola: 11520361 markings, 111406902 edges, 61417 markings/sec, 140 secs
lola: 11906448 markings, 115247547 edges, 77217 markings/sec, 145 secs
lola: 12256304 markings, 118983758 edges, 69971 markings/sec, 150 secs
lola: 12576775 markings, 122591003 edges, 64094 markings/sec, 155 secs
lola: 12919249 markings, 126286362 edges, 68495 markings/sec, 160 secs
lola: 13236204 markings, 129921466 edges, 63391 markings/sec, 165 secs
lola: 13546284 markings, 133499367 edges, 62016 markings/sec, 170 secs
lola: 13849939 markings, 137079849 edges, 60731 markings/sec, 175 secs
lola: 14134675 markings, 140523994 edges, 56947 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348907 markings, 143489070 edges
lola: ========================================
lola: subprocess 15 will run for 2491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= voted_no_4) AND (voted_yes_3 <= 1) AND ((voted_no_10 <= voting_6) OR (1 <= voted_no_7) OR ((1 <= voted_yes_15) AND (voted_yes_4 <= voting_2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes yes yes no no no yes yes no no
FORMULA Referendum-PT-0015-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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 mcc4mcc-full"
echo " Input is Referendum-PT-0015, 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 r142-qhx2-152673583900269"
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 ;