About the Execution of M4M.struct for NeoElection-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 545.330 | 44072.00 | 6460.00 | 157.60 | FFFFFFFFFTFTFTFF | normal |
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 820K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is NeoElection-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r119-csrt-152666479700291
=====================================================================
--------------------
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 NeoElection-PT-2-CTLFireability-00
FORMULA_NAME NeoElection-PT-2-CTLFireability-01
FORMULA_NAME NeoElection-PT-2-CTLFireability-02
FORMULA_NAME NeoElection-PT-2-CTLFireability-03
FORMULA_NAME NeoElection-PT-2-CTLFireability-04
FORMULA_NAME NeoElection-PT-2-CTLFireability-05
FORMULA_NAME NeoElection-PT-2-CTLFireability-06
FORMULA_NAME NeoElection-PT-2-CTLFireability-07
FORMULA_NAME NeoElection-PT-2-CTLFireability-08
FORMULA_NAME NeoElection-PT-2-CTLFireability-09
FORMULA_NAME NeoElection-PT-2-CTLFireability-10
FORMULA_NAME NeoElection-PT-2-CTLFireability-11
FORMULA_NAME NeoElection-PT-2-CTLFireability-12
FORMULA_NAME NeoElection-PT-2-CTLFireability-13
FORMULA_NAME NeoElection-PT-2-CTLFireability-14
FORMULA_NAME NeoElection-PT-2-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527323037519
BK_STOP 1527323081591
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeoElection-PT-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 178, 'Memory': 111.26, 'Tool': 'lola'}, {'Time': 307, 'Memory': 111.4, 'Tool': 'lola'}, {'Time': 1985, 'Memory': 1820.92, 'Tool': 'marcie'}, {'Time': 1991, 'Memory': 1944.27, 'Tool': 'marcie'}, {'Time': 5138, 'Memory': 433.68, 'Tool': 'itstools'}, {'Time': 5226, 'Memory': 431.62, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola NeoElection-PT-2...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
NeoElection-PT-2: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
NeoElection-PT-2: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ NeoElection-PT-2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-CTLFireability.task
lola: (((NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT FIREABLE(T-poll__handleRP_9) AND NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__end_2) AND NOT FIREABLE(T-poll__end_3)) AND A (X (A (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3))))))) OR ((((NOT FIREABLE(T-poll__handleAnsP1_1) AND NOT FIREABLE(T-poll__handleAnsP1_2) AND NOT FIREABLE(T-poll__handleAnsP1_3) AND NOT FIREABLE(T-poll__handleAnsP1_4) AND NOT FIREABLE(T-poll__handleAnsP1_5) AND NOT FIREABLE(T-poll__handleAnsP1_6) AND NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP1_8) AND NOT FIREABLE(T-poll__handleAnsP1_9)) OR (NOT FIREABLE(T-poll__start_1) AND NOT FIREABLE(T-poll__start_2) AND NOT FIREABLE(T-poll__start_3)) OR (NOT FIREABLE(T-sendAnnPs__send_1) AND NOT FIREABLE(T-sendAnnPs__send_2) AND NOT FIREABLE(T-sendAnnPs__send_3) AND NOT FIREABLE(T-sendAnnPs__send_7) AND NOT FIREABLE(T-sendAnnPs__send_8) AND NOT FIREABLE(T-sendAnnPs__send_9) AND NOT FIREABLE(T-sendAnnPs__send_13) AND NOT FIREABLE(T-sendAnnPs__send_14) AND NOT FIREABLE(T-sendAnnPs__send_15)) OR (NOT FIREABLE(T-poll__handleAI1_1) AND NOT FIREABLE(T-poll__handleAI1_2) AND NOT FIREABLE(T-poll__handleAI1_3) AND NOT FIREABLE(T-poll__handleAI1_10) AND NOT FIREABLE(T-poll__handleAI1_11) AND NOT FIREABLE(T-poll__handleAI1_12) AND NOT FIREABLE(T-poll__handleAI1_13) AND NOT FIREABLE(T-poll__handleAI1_14) AND NOT FIREABLE(T-poll__handleAI1_15) AND NOT FIREABLE(T-poll__handleAI1_19) AND NOT FIREABLE(T-poll__handleAI1_20) AND NOT FIREABLE(T-poll__handleAI1_21) AND NOT FIREABLE(T-poll__handleAI1_22) AND NOT FIREABLE(T-poll__handleAI1_23) AND NOT FIREABLE(T-poll__handleAI1_24) AND NOT FIREABLE(T-poll__handleAI1_25) AND NOT FIREABLE(T-poll__handleAI1_26) AND NOT FIREABLE(T-poll__handleAI1_27))) AND E (G ((FIREABLE(T-poll__handleAnsP2_3) OR FIREABLE(T-poll__handleAnsP2_4) OR FIREABLE(T-poll__handleAnsP2_5) OR FIREABLE(T-poll__handleAnsP2_6) OR FIREABLE(T-poll__handleAnsP2_9) OR FIREABLE(T-poll__handleAnsP2_10) OR FIREABLE(T-poll__handleAnsP2_11) OR FIREABLE(T-poll__handleAnsP2_12) OR FIREABLE(T-poll__handleAnsP2_15) OR FIREABLE(T-poll__handleAnsP2_16) OR FIREABLE(T-poll__handleAnsP2_17) OR FIREABLE(T-poll__handleAnsP2_18) OR FIREABLE(T-poll__handleAnsP2_21) OR FIREABLE(T-poll__handleAnsP2_22) OR FIREABLE(T-poll__handleAnsP2_23) OR FIREABLE(T-poll__handleAnsP2_24) OR FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAnsP2_28) OR FIREABLE(T-poll__handleAnsP2_29) OR FIREABLE(T-poll__handleAnsP2_30) OR FIREABLE(T-poll__handleAnsP2_33) OR FIREABLE(T-poll__handleAnsP2_34) OR FIREABLE(T-poll__handleAnsP2_35) OR FIREABLE(T-poll__handleAnsP2_36) OR FIREABLE(T-poll__handleAnsP2_39) OR FIREABLE(T-poll__handleAnsP2_40) OR FIREABLE(T-poll__handleAnsP2_41) OR FIREABLE(T-poll__handleAnsP2_42) OR FIREABLE(T-poll__handleAnsP2_45) OR FIREABLE(T-poll__handleAnsP2_46) OR FIREABLE(T-poll__handleAnsP2_47) OR FIREABLE(T-poll__handleAnsP2_48) OR FIREABLE(T-poll__handleAnsP2_51) OR FIREABLE(T-poll__handleAnsP2_52) OR FIREABLE(T-poll__handleAnsP2_53) OR FIREABLE(T-poll__handleAnsP2_54) OR FIREABLE(T-poll__handleAnsP1_1) OR FIREABLE(T-poll__handleAnsP1_2) OR FIREABLE(T-poll__handleAnsP1_3) OR FIREABLE(T-poll__handleAnsP1_4) OR FIREABLE(T-poll__handleAnsP1_5) OR FIREABLE(T-poll__handleAnsP1_6) OR FIREABLE(T-poll__handleAnsP1_7) OR FIREABLE(T-poll__handleAnsP1_8) OR FIREABLE(T-poll__handleAnsP1_9))))) AND (FIREABLE(T-poll__handleAnsP2_3) OR FIREABLE(T-poll__handleAnsP2_4) OR FIREABLE(T-poll__handleAnsP2_5) OR FIREABLE(T-poll__handleAnsP2_6) OR FIREABLE(T-poll__handleAnsP2_9) OR FIREABLE(T-poll__handleAnsP2_10) OR FIREABLE(T-poll__handleAnsP2_11) OR FIREABLE(T-poll__handleAnsP2_12) OR FIREABLE(T-poll__handleAnsP2_15) OR FIREABLE(T-poll__handleAnsP2_16) OR FIREABLE(T-poll__handleAnsP2_17) OR FIREABLE(T-poll__handleAnsP2_18) OR FIREABLE(T-poll__handleAnsP2_21) OR FIREABLE(T-poll__handleAnsP2_22) OR FIREABLE(T-poll__handleAnsP2_23) OR FIREABLE(T-poll__handleAnsP2_24) OR FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAnsP2_28) OR FIREABLE(T-poll__handleAnsP2_29) OR FIREABLE(T-poll__handleAnsP2_30) OR FIREABLE(T-poll__handleAnsP2_33) OR FIREABLE(T-poll__handleAnsP2_34) OR FIREABLE(T-poll__handleAnsP2_35) OR FIREABLE(T-poll__handleAnsP2_36) OR FIREABLE(T-poll__handleAnsP2_39) OR FIREABLE(T-poll__handleAnsP2_40) OR FIREABLE(T-poll__handleAnsP2_41) OR FIREABLE(T-poll__handleAnsP2_42) OR FIREABLE(T-poll__handleAnsP2_45) OR FIREABLE(T-poll__handleAnsP2_46) OR FIREABLE(T-poll__handleAnsP2_47) OR FIREABLE(T-poll__handleAnsP2_48) OR FIREABLE(T-poll__handleAnsP2_51) OR FIREABLE(T-poll__handleAnsP2_52) OR FIREABLE(T-poll__handleAnsP2_53) OR FIREABLE(T-poll__handleAnsP2_54)))) : A (F (E (G ((FIREABLE(T-poll__handleAnsP1_1) OR FIREABLE(T-poll__handleAnsP1_2) OR FIREABLE(T-poll__handleAnsP1_3) OR FIREABLE(T-poll__handleAnsP1_4) OR FIREABLE(T-poll__handleAnsP1_5) OR FIREABLE(T-poll__handleAnsP1_6) OR FIREABLE(T-poll__handleAnsP1_7) OR FIREABLE(T-poll__handleAnsP1_8) OR FIREABLE(T-poll__handleAnsP1_9)))))) : (E (F (A (((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)) U (FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15)))))) OR (A (F ((FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15)))) OR (FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__handleAI1_21) OR FIREABLE(T-poll__handleAI1_22) OR FIREABLE(T-poll__handleAI1_23) OR FIREABLE(T-poll__handleAI1_24) OR FIREABLE(T-poll__handleAI1_25) OR FIREABLE(T-poll__handleAI1_26) OR FIREABLE(T-poll__handleAI1_27)))) : A (F (NOT(NOT(E (G ((FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_11) OR FIREABLE(T-poll__handleAskP_12) OR FIREABLE(T-poll__handleAskP_13) OR FIREABLE(T-poll__handleAskP_14) OR FIREABLE(T-poll__handleAskP_15) OR FIREABLE(T-poll__handleAskP_16) OR FIREABLE(T-poll__handleAskP_17) OR FIREABLE(T-poll__handleAskP_18) OR FIREABLE(T-poll__handleAskP_19) OR FIREABLE(T-poll__handleAskP_20) OR FIREABLE(T-poll__handleAskP_21) OR FIREABLE(T-poll__handleAskP_22) OR FIREABLE(T-poll__handleAskP_23) OR FIREABLE(T-poll__handleAskP_24) OR FIREABLE(T-poll__handleAskP_25) OR FIREABLE(T-poll__handleAskP_26) OR FIREABLE(T-poll__handleAskP_27) OR FIREABLE(T-poll__handleAskP_28) OR FIREABLE(T-poll__handleAskP_29) OR FIREABLE(T-poll__handleAskP_30) OR FIREABLE(T-poll__handleAskP_31) OR FIREABLE(T-poll__handleAskP_32) OR FIREABLE(T-poll__handleAskP_33) OR FIREABLE(T-poll__handleAskP_34) OR FIREABLE(T-poll__handleAskP_35) OR FIREABLE(T-poll__handleAskP_36) OR FIREABLE(T-poll__handleAskP_37) OR FIREABLE(T-poll__handleAskP_38) OR FIREABLE(T-poll__handleAskP_39) OR FIREABLE(T-poll__handleAskP_40) OR FIREABLE(T-poll__handleAskP_41) OR FIREABLE(T-poll__handleAskP_42) OR FIREABLE(T-poll__handleAskP_43) OR FIREABLE(T-poll__handleAskP_44) OR FIREABLE(T-poll__handleAskP_45) OR FIREABLE(T-poll__handleAskP_46) OR FIREABLE(T-poll__handleAskP_47) OR FIREABLE(T-poll__handleAskP_48) OR FIREABLE(T-poll__handleAskP_49) OR FIREABLE(T-poll__handleAskP_50) OR FIREABLE(T-poll__handleAskP_51) OR FIREABLE(T-poll__handleAskP_52) OR FIREABLE(T-poll__handleAskP_53) OR FIREABLE(T-poll__handleAskP_54)))))))) : A (F (E (F (A (G ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53)))))))) : E (G (((FIREABLE(T-poll__handleAnsP2_3) OR FIREABLE(T-poll__handleAnsP2_4) OR FIREABLE(T-poll__handleAnsP2_5) OR FIREABLE(T-poll__handleAnsP2_6) OR FIREABLE(T-poll__handleAnsP2_9) OR FIREABLE(T-poll__handleAnsP2_10) OR FIREABLE(T-poll__handleAnsP2_11) OR FIREABLE(T-poll__handleAnsP2_12) OR FIREABLE(T-poll__handleAnsP2_15) OR FIREABLE(T-poll__handleAnsP2_16) OR FIREABLE(T-poll__handleAnsP2_17) OR FIREABLE(T-poll__handleAnsP2_18) OR FIREABLE(T-poll__handleAnsP2_21) OR FIREABLE(T-poll__handleAnsP2_22) OR FIREABLE(T-poll__handleAnsP2_23) OR FIREABLE(T-poll__handleAnsP2_24) OR FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAnsP2_28) OR FIREABLE(T-poll__handleAnsP2_29) OR FIREABLE(T-poll__handleAnsP2_30) OR FIREABLE(T-poll__handleAnsP2_33) OR FIREABLE(T-poll__handleAnsP2_34) OR FIREABLE(T-poll__handleAnsP2_35) OR FIREABLE(T-poll__handleAnsP2_36) OR FIREABLE(T-poll__handleAnsP2_39) OR FIREABLE(T-poll__handleAnsP2_40) OR FIREABLE(T-poll__handleAnsP2_41) OR FIREABLE(T-poll__handleAnsP2_42) OR FIREABLE(T-poll__handleAnsP2_45) OR FIREABLE(T-poll__handleAnsP2_46) OR FIREABLE(T-poll__handleAnsP2_47) OR FIREABLE(T-poll__handleAnsP2_48) OR FIREABLE(T-poll__handleAnsP2_51) OR FIREABLE(T-poll__handleAnsP2_52) OR FIREABLE(T-poll__handleAnsP2_53) OR FIREABLE(T-poll__handleAnsP2_54)) OR ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53)) OR A (F ((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)))))))) : A (((NOT FIREABLE(T-sendAnnPs__start_1) AND NOT FIREABLE(T-sendAnnPs__start_2) AND NOT FIREABLE(T-sendAnnPs__start_3)) U (E (X ((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)))) OR A (G ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53))))))) : (A (F (E (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3)))))) AND (NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT FIREABLE(T-poll__handleRP_9))) : A (X (A (F ((FIREABLE(T-poll__handleRI_5) AND FIREABLE(T-poll__handleAnsP4_52) AND FIREABLE(T-poll__handleAnsP3_66) AND FIREABLE(T-poll__handleAskP_36)))))) : E (G (NOT FIREABLE(T-poll__handleAnnP1_40))) : NOT(A (F (E (G (NOT FIREABLE(T-poll__handleAI2_27)))))) : E (X (E (G ((NOT FIREABLE(T-poll__handleAnsP4_40) OR FIREABLE(T-poll__handleAskP_35)))))) : ((FIREABLE(T-poll__handleAnsP4_29) OR (FIREABLE(T-poll__iAmSecondary_9) AND (FIREABLE(T-poll__handleAI2_11) OR E (F (FIREABLE(T-poll__handleAnnP1_46)))))) OR (A ((NOT FIREABLE(T-poll__iAmPrimary_2) U (FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAskP_49)))) OR FIREABLE(T-poll__handleAI2_25))) : (NOT((A (G (NOT FIREABLE(T-poll__handleAI1_22))) AND A (X ((FIREABLE(T-poll__handleAnsP1_7) OR FIREABLE(T-poll__handleAnsP4_27)))))) AND NOT(((E (G (FIREABLE(T-poll__handleAI2_12))) OR (NOT FIREABLE(T-poll__handleAI2_33) OR NOT FIREABLE(T-poll__handleRI_7))) AND (((FIREABLE(T-poll__handleAnsP2_22) OR FIREABLE(T-poll__handleAnnP1_19)) AND NOT FIREABLE(T-poll__handleAskP_52)) OR A (F (FIREABLE(T-poll__handleAnsP3_71))))))) : A (F (E (((FIREABLE(T-poll__handleAI2_34) OR FIREABLE(T-poll__handleRP_8)) U (FIREABLE(T-poll__handleRP_4) AND FIREABLE(T-poll__handleAI1_23)))))) : A (F (E ((NOT FIREABLE(T-poll__handleAskP_30) U (FIREABLE(T-poll__handleAskP_5) AND FIREABLE(T-poll__handleAI2_34))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT FIREABLE(T-poll__handleRP_9) AND NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__end_2) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT FIREABLE(T-poll__handleRP_9) AND NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__end_2) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT FIREABLE(T-poll__handleRP_9) AND NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__end_2) AND NO... (shortened)
lola: processed formula length: 426
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3))))
lola: processed formula length: 92
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(T-poll__handleAnsP1_1) AND NOT FIREABLE(T-poll__handleAnsP1_2) AND NOT FIREABLE(T-poll__handleAnsP1_3) AND NOT FIREABLE(T-poll__handleAnsP1_4) AND NOT FIREABLE(T-poll__handleAnsP1_5) AND NOT FIREABLE(T-poll__handleAnsP1_6) AND NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP1_8) AND NOT FIREABLE(T-poll__handleAnsP1_9)) OR (NOT FIREABLE(T-poll__start_1) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(T-poll__handleAnsP1_1) AND NOT FIREABLE(T-poll__handleAnsP1_2) AND NOT FIREABLE(T-poll__handleAnsP1_3) AND NOT FIREABLE(T-poll__handleAnsP1_4) AND NOT FIREABLE(T-poll__handleAnsP1_5) AND NOT FIREABLE(T-poll__handleAnsP1_6) AND NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP1_8) AND NOT FIREABLE(T-poll__handleAnsP1_9)) OR (NOT FIREABLE(T-poll__start_1) AND NO... (shortened)
lola: processed formula length: 1511
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(T-poll__handleAnsP2_3) OR FIREABLE(T-poll__handleAnsP2_4) OR FIREABLE(T-poll__handleAnsP2_5) OR FIREABLE(T-poll__handleAnsP2_6) OR FIREABLE(T-poll__handleAnsP2_9) OR FIREABLE(T-poll__handleAnsP2_10) OR FIREABLE(T-poll__handleAnsP2_11) OR FIREABLE(T-poll__handleAnsP2_12) OR FIREABLE(T-poll__handleAnsP2_15) OR FIREABLE(T-poll__handleAnsP2_16) OR FIREABLE(T-poll__handleAnsP2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(T-poll__handleAnsP2_3) AND NOT FIREABLE(T-poll__handleAnsP2_4) AND NOT FIREABLE(T-poll__handleAnsP2_5) AND NOT FIREABLE(T-poll__handleAnsP2_6) AND NOT FIREABLE(T-poll__handleAnsP2_9) AND NOT FIREABLE(T-poll__handleAnsP2_10) AND NOT FIREABLE(T-poll__handleAnsP2_11) AND NOT FIREABLE(T-poll__handleAnsP2_12) AND NOT FIREABLE(T-poll__handleAnsP2_15) AND NOT FIREABLE(T-poll__h... (shortened)
lola: processed formula length: 1843
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((FIREABLE(T-poll__handleAnsP1_1) OR FIREABLE(T-poll__handleAnsP1_2) OR FIREABLE(T-poll__handleAnsP1_3) OR FIREABLE(T-poll__handleAnsP1_4) OR FIREABLE(T-poll__handleAnsP1_5) OR FIREABLE(T-poll__handleAnsP1_6) OR FIREABLE(T-poll__handleAnsP1_7) OR FIREABLE(T-poll__handleAnsP1_8) OR FIREABLE(T-poll__handleAnsP1_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(T-poll__handleAnsP1_1) AND NOT FIREABLE(T-poll__handleAnsP1_2) AND NOT FIREABLE(T-poll__handleAnsP1_3) AND NOT FIREABLE(T-poll__handleAnsP1_4) AND NOT FIREABLE(T-poll__handleAnsP1_5) AND NOT FIREABLE(T-poll__handleAnsP1_6) AND NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP1_8) AND NOT FIREABLE(T-poll__handleAnsP1_9)))))
lola: processed formula length: 382
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 56 markings, 92 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)) U (FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-send... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)) U (FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)) U (FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-send... (shortened)
lola: processed formula length: 418
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 123 markings, 274 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15))))
lola: processed formula: A (F ((FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15))))
lola: processed formula length: 314
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 6 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__... (shortened)
lola: processed formula length: 624
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(NOT(E (G ((FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(T-poll__handleAskP_1) AND NOT FIREABLE(T-poll__handleAskP_2) AND NOT FIREABLE(T-poll__handleAskP_3) AND NOT FIREABLE(T-poll__handleAskP_4) AND NOT FIREABLE(T-poll__handleAskP_5) AND NOT FIREABLE(T-poll__handleAskP_6) AND NOT FIREABLE(T-poll__handleAskP_7) AND NOT FIREABLE(T-poll__handleAskP_8) AND NOT FIREABLE(T-poll__handleAskP_9) AND NOT FIREABLE(T-poll__handl... (shortened)
lola: processed formula length: 2173
lola: 9 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 46 markings, 85 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (A (G ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U NOT(E(TRUE U (NOT FIREABLE(T-poll__handleAnnP1_2) AND NOT FIREABLE(T-poll__handleAnnP1_3) AND NOT FIREABLE(T-poll__handleAnnP1_5) AND NOT FIREABLE(T-poll__handleAnnP1_6) AND NOT FIREABLE(T-poll__handleAnnP1_8) AND NOT FIREABLE(T-poll__handleAnnP1_9) AND NOT FIREABLE(T-poll__handleAnnP1_11) AND NOT FIREABLE(T-poll__handleAnnP1_12) AND NOT FIREABLE(T-poll__handleAnnP1_14) AND NOT F... (shortened)
lola: processed formula length: 1502
lola: 4 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 212 markings, 621 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((FIREABLE(T-poll__handleAnsP2_3) OR FIREABLE(T-poll__handleAnsP2_4) OR FIREABLE(T-poll__handleAnsP2_5) OR FIREABLE(T-poll__handleAnsP2_6) OR FIREABLE(T-poll__handleAnsP2_9) OR FIREABLE(T-poll__handleAnsP2_10) OR FIREABLE(T-poll__handleAnsP2_11) OR FIREABLE(T-poll__handleAnsP2_12) OR FIREABLE(T-poll__handleAnsP2_15) OR FIREABLE(T-poll__handleAnsP2_16) OR FIREABLE(T-poll__handleAnsP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((NOT FIREABLE(T-poll__handleAnsP2_3) AND NOT FIREABLE(T-poll__handleAnsP2_4) AND NOT FIREABLE(T-poll__handleAnsP2_5) AND NOT FIREABLE(T-poll__handleAnsP2_6) AND NOT FIREABLE(T-poll__handleAnsP2_9) AND NOT FIREABLE(T-poll__handleAnsP2_10) AND NOT FIREABLE(T-poll__handleAnsP2_11) AND NOT FIREABLE(T-poll__handleAnsP2_12) AND NOT FIREABLE(T-poll__handleAnsP2_15) AND NOT FIREABLE(T-poll__... (shortened)
lola: processed formula length: 3075
lola: 6 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(T-sendAnnPs__start_1) AND NOT FIREABLE(T-sendAnnPs__start_2) AND NOT FIREABLE(T-sendAnnPs__start_3)) U (E (X ((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3)))) OR A (G ((FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__ha... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT FIREABLE(T-sendAnnPs__start_1) AND NOT FIREABLE(T-sendAnnPs__start_2) AND NOT FIREABLE(T-sendAnnPs__start_3)) U (EX((FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3))) OR NOT(E(TRUE U (NOT FIREABLE(T-poll__handleAnnP1_2) AND NOT FIREABLE(T-poll__handleAnnP1_3) AND NOT FIREABLE(T-poll__handleAnnP1_5) AND NOT FIREABLE(T-poll__handleAnnP1_6) AND NO... (shortened)
lola: processed formula length: 1708
lola: 4 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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 2 significant temporal operators and needs 9 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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3)))))) AND (NOT FIREABLE(T-poll__handleRP_1) AND NOT FIREABLE(T-poll__handleRP_2) AND NOT FIREABLE(T-poll__handleRP_3) AND NOT FIREABLE(T-poll__handleRP_4) AND NOT FIREABLE(T-poll__handleRP_5) AND NOT FIREABLE(T-poll__handleRP_6) AND NOT FIREABLE(T-poll__handleRP_7) AND NOT FIREABLE(T-poll__handleRP_8) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3))))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 123 markings, 216 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(T-poll__handleRI_5) AND FIREABLE(T-poll__handleAnsP4_52) AND FIREABLE(T-poll__handleAnsP3_66) AND FIREABLE(T-poll__handleAskP_36))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(T-poll__handleRI_5) AND FIREABLE(T-poll__handleAnsP4_52) AND FIREABLE(T-poll__handleAnsP3_66) AND FIREABLE(T-poll__handleAskP_36))))
lola: processed formula length: 154
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(T-poll__handleAnnP1_40)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(T-poll__handleAnnP1_40)))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G (NOT FIREABLE(T-poll__handleAI2_27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U FIREABLE(T-poll__handleAI2_27)))))
lola: processed formula length: 60
lola: 7 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((NOT FIREABLE(T-poll__handleAnsP4_40) OR FIREABLE(T-poll__handleAskP_35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (FIREABLE(T-poll__handleAnsP4_40) AND NOT FIREABLE(T-poll__handleAskP_35)))))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(T-poll__handleAnsP4_29) OR (FIREABLE(T-poll__iAmSecondary_9) AND (FIREABLE(T-poll__handleAI2_11) OR E (F (FIREABLE(T-poll__handleAnnP1_46)))))) OR (A ((NOT FIREABLE(T-poll__iAmPrimary_2) U (FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAskP_49)))) OR FIREABLE(T-poll__handleAI2_25)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-poll__handleAnsP4_29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-poll__handleAnsP4_29)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-poll__iAmSecondary_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-poll__iAmSecondary_9)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(T-poll__iAmPrimary_2) U (FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAskP_49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((NOT FIREABLE(T-poll__iAmPrimary_2) U (FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAskP_49))))
lola: processed formula: A ((NOT FIREABLE(T-poll__iAmPrimary_2) U (FIREABLE(T-poll__handleAnsP2_27) OR FIREABLE(T-poll__handleAskP_49))))
lola: processed formula length: 113
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 5 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T-poll__handleAI2_25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T-poll__handleAI2_25)
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((A (G (NOT FIREABLE(T-poll__handleAI1_22))) AND A (X ((FIREABLE(T-poll__handleAnsP1_7) OR FIREABLE(T-poll__handleAnsP4_27)))))) AND NOT(((E (G (FIREABLE(T-poll__handleAI2_12))) OR (NOT FIREABLE(T-poll__handleAI2_33) OR NOT FIREABLE(T-poll__handleRI_7))) AND (((FIREABLE(T-poll__handleAnsP2_22) OR FIREABLE(T-poll__handleAnnP1_19)) AND NOT FIREABLE(T-poll__handleAskP_52)) OR A (F (FIREABLE(T-... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-poll__handleAI1_22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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 unreachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP4_27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT FIREABLE(T-poll__handleAnsP1_7) AND NOT FIREABLE(T-poll__handleAnsP4_27)))
lola: processed formula length: 82
lola: 19 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(T-poll__handleAI2_12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (NOT FIREABLE(T-poll__handleAI2_12)))
lola: processed formula: A (F (NOT FIREABLE(T-poll__handleAI2_12)))
lola: processed formula length: 42
lola: 18 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 6 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(T-poll__handleAnsP2_22) AND NOT FIREABLE(T-poll__handleAnnP1_19)) OR FIREABLE(T-poll__handleAskP_52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(T-poll__handleAnsP2_22) AND NOT FIREABLE(T-poll__handleAnnP1_19)) OR FIREABLE(T-poll__handleAskP_52))
lola: processed formula length: 117
lola: 18 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.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 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(T-poll__handleAnsP3_71)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(T-poll__handleAnsP3_71)))
lola: processed formula length: 47
lola: 20 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((FIREABLE(T-poll__handleAI2_34) OR FIREABLE(T-poll__handleRP_8)) U (FIREABLE(T-poll__handleRP_4) AND FIREABLE(T-poll__handleAI1_23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((FIREABLE(T-poll__handleAI2_34) OR FIREABLE(T-poll__handleRP_8)) U (FIREABLE(T-poll__handleRP_4) AND FIREABLE(T-poll__handleAI1_23))))
lola: processed formula length: 146
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33 markings, 65 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E ((NOT FIREABLE(T-poll__handleAskP_30) U (FIREABLE(T-poll__handleAskP_5) AND FIREABLE(T-poll__handleAI2_34))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(NOT FIREABLE(T-poll__handleAskP_30) U (FIREABLE(T-poll__handleAskP_5) AND FIREABLE(T-poll__handleAI2_34))))
lola: processed formula length: 118
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 53 markings, 118 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no yes no yes no no
FORMULA NeoElection-PT-2-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLFireability-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="NeoElection-PT-2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-structural"
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/NeoElection-PT-2.tgz
mv NeoElection-PT-2 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-structural"
echo " Input is NeoElection-PT-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r119-csrt-152666479700291"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
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 ;