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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is NeoElection-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484800264
=====================================================================

--------------------
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-COL-2-CTLCardinality-0
FORMULA_NAME NeoElection-COL-2-CTLCardinality-1
FORMULA_NAME NeoElection-COL-2-CTLCardinality-10
FORMULA_NAME NeoElection-COL-2-CTLCardinality-11
FORMULA_NAME NeoElection-COL-2-CTLCardinality-12
FORMULA_NAME NeoElection-COL-2-CTLCardinality-13
FORMULA_NAME NeoElection-COL-2-CTLCardinality-14
FORMULA_NAME NeoElection-COL-2-CTLCardinality-15
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2
FORMULA_NAME NeoElection-COL-2-CTLCardinality-3
FORMULA_NAME NeoElection-COL-2-CTLCardinality-4
FORMULA_NAME NeoElection-COL-2-CTLCardinality-5
FORMULA_NAME NeoElection-COL-2-CTLCardinality-6
FORMULA_NAME NeoElection-COL-2-CTLCardinality-7
FORMULA_NAME NeoElection-COL-2-CTLCardinality-8
FORMULA_NAME NeoElection-COL-2-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494638240911


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ NeoElection-PT-2 @ 3540 seconds
----- 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-COL-2-CTLCardinality.task
lola: E (G (E (G (((2 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2) AND (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM)))))) : A (((P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + 1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2) U E (G ((P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))))) : NOT(((((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 + 1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) AND (P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2)) OR E (G ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= P-dead_2 + P-dead_1 + P-dead_0)))) OR (3 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1))) : E (G (E (F (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)))))) : A (F ((((2 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) AND (2 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE) AND (2 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)))) : E (G ((A (F ((P-dead_2 + P-dead_1 + P-dead_0 <= P-polling_0 + P-polling_1 + P-polling_2))) OR (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= 2)))) : (E (G (((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) OR (2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) OR (3 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2)))) OR ((E (F ((1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2))) AND ((P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2 + 1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) AND (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 <= 2))) AND (3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))) : (A (((P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= 2) U ((3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) AND (P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE)))) AND A ((((P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) AND (P-polling_0 + P-polling_1 + P-polling_2 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE)) U (P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 + 1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)))) : NOT(E (G (((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) OR (P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) OR (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= 2))))) : ((A (((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= P-polling_0 + P-polling_1 + P-polling_2) U (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2))) AND (((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) OR (2 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)) AND (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))) AND ((2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) OR (E (G ((3 <= P-dead_2 + P-dead_1 + P-dead_0))) OR ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) AND (1 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2))))) : ((E (G ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0))) AND ((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + 1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR (3 <= P-dead_2 + P-dead_1 + P-dead_0))) AND NOT((E (G ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0))) AND (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2)))) : A ((E (F ((1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2))) U ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (2 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) AND ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2) OR (P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2))))) : NOT(NOT((((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0)) AND A (F ((3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))))) : ((((P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) OR (P-polling_0 + P-polling_1 + P-polling_2 <= P-dead_2 + P-dead_1 + P-dead_0)) AND (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + 1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) OR E (G ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= 0)))) : (NOT((A (F ((2 <= P-polling_0 + P-polling_1 + P-polling_2))) AND ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2) OR (P-dead_2 + P-dead_1 + P-dead_0 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) OR ((P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= P-dead_2 + P-dead_1 + P-dead_0))))) AND (1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)) : (E ((((P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE)) U ((3 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (3 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2)))) OR (A (F (((P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) AND (1 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2)))) OR E (G (((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) OR (3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_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 (G (E (G (((2 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 ... (shortened)
lola: processed formula length: 628
lola: 4 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + 1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + 1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 +... (shortened)
lola: processed formula length: 5087
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 + 1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) AND (P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broad... (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: ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_... (shortened)
lola: processed formula length: 848
lola: 8 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((P-dead_2 + P-dead_1 + P-dead_0 + 1 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (P-dead_2 + P-dead_1 + P-dead_0 + 1 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))
lola: processed formula length: 110
lola: 9 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0))))))
lola: processed formula length: 382
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((2 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((2 <= P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1) OR (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterSta... (shortened)
lola: processed formula length: 1412
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((P-dead_2 + P-dead_1 + P-dead_0 <= P-polling_0 + P-polling_1 + P-polling_2))) OR (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (P-dead_2 + P-dead_1 + P-dead_0 <= P-polling_0 + P-polling_1 + P-polling_2))) AND (3 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2))))
lola: processed formula length: 173
lola: 4 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) OR (2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) OR (3 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) OR (2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) OR (3 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((P-crashed_2 + P-crashed_1 + P-crashed_0 + 1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2) AND (P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= 1) AND (P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-networ... (shortened)
lola: processed formula length: 3849
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)lola:
========================================
lola: ========================================
lola: ...considering subproblem: (A (((P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 ... (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 (((P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= ... (shortened)
lola: processed formula length: 1284
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) OR (P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) OR (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= 2))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + 1 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) AND (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + 1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) AND (3 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessag... (shortened)
lola: processed formula length: 406
lola: 4 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= P-polling_0 + P-polling_1 + P-polling_2) U (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= P-polling_0 + P-polling_1 + P-polling_2) U (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= P-polling_0 + P-polling_1 + P-polling_2) U (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0... (shortened)
lola: processed formula length: 699
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0))) AND ((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR (P-electionInit_1 + P-electionIni... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)))
lola: processed formula length: 100
lola: 8 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + 1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR (P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + 1 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2) OR... (shortened)
lola: processed formula length: 440
lola: 6 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((P-crashed_2 + P-crashed_1 + P-crashed_0 + 1 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (P-crashed_2 + P-crashed_1 + P-crashed_0 + 1 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))
lola: processed formula length: 119
lola: 7 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_An... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_An... (shortened)
lola: processed formula length: 4582
lola: 6 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterSt... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (1 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterS... (shortened)
lola: processed formula length: 4609
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0)) AND A (F ((3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 <= 0))
lola: processed formula length: 177
lola: 10 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))
lola: processed formula length: 77
lola: 11 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_... (shortened)
lola: processed formula length: 4845
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((A (F ((2 <= P-polling_0 + P-polling_1 + P-polling_2))) AND ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-polling_0 + P-polling_1 + P-polling_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= P-polling_0 + P-polling_1 + P-polling_2)))
lola: processed formula length: 61
lola: 7 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: processed formula length: 61
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiati... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiatio... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_... (shortened)
lola: processed formula length: 1487
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
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: E (G (((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) OR (3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= 1) AND (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= 2))))
lola: processed formula length: 156
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes yes no no no no no no yes yes unknown
lola: ========================================
FORMULA NeoElection-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494638241107

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is NeoElection-PT-2, 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 r038-blw7-149440484800264"
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 ;