Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................................................
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
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 r115-csrt-152666473800290
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-PT-2-CTLCardinality-00
FORMULA_NAME NeoElection-PT-2-CTLCardinality-01
FORMULA_NAME NeoElection-PT-2-CTLCardinality-02
FORMULA_NAME NeoElection-PT-2-CTLCardinality-03
FORMULA_NAME NeoElection-PT-2-CTLCardinality-04
FORMULA_NAME NeoElection-PT-2-CTLCardinality-05
FORMULA_NAME NeoElection-PT-2-CTLCardinality-06
FORMULA_NAME NeoElection-PT-2-CTLCardinality-07
FORMULA_NAME NeoElection-PT-2-CTLCardinality-08
FORMULA_NAME NeoElection-PT-2-CTLCardinality-09
FORMULA_NAME NeoElection-PT-2-CTLCardinality-10
FORMULA_NAME NeoElection-PT-2-CTLCardinality-11
FORMULA_NAME NeoElection-PT-2-CTLCardinality-12
FORMULA_NAME NeoElection-PT-2-CTLCardinality-13
FORMULA_NAME NeoElection-PT-2-CTLCardinality-14
FORMULA_NAME NeoElection-PT-2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527152383309


BK_STOP 1527152427414

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeoElection-PT-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 196, 'Memory': 112.45, 'Tool': 'lola'}, {'Time': 328, 'Memory': 112.51, 'Tool': 'lola'}, {'Time': 3221, 'Memory': 2209.29, 'Tool': 'marcie'}, {'Time': 3448, 'Memory': 2209.26, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola NeoElection-PT-2...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
NeoElection-PT-2: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ NeoElection-PT-2 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-CTLCardinality.task
lola: A (X (E (G ((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))))) : NOT((E (G (((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-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-dead_2 + P-dead_1 + P-dead_0 <= 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 (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= 1) 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 <= 0)) AND ((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 + 1 <= 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) OR (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= 0))))) : (E (G (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= 1) AND ((2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) OR (1 <= 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 ((1 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2))) : E (G (A (F (((3 <= P-polling_0 + P-polling_1 + P-polling_2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_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)))))) : (E (G ((((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) 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-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)) AND (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= 0)))) OR E (G (((1 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) AND (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-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) AND (3 <= P-crashed_2 + P-crashed_1 + P-crashed_0))))) : A (X (A (F ((3 <= 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))))) : E (G (NOT(A (F ((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-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)))))) : E (G (((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-electionInit_1 + P-electionInit_0 + P-electionInit_2) OR (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 <= 1) OR (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)))) : ((A (((P-crashed_2 <= P-polling_2) U (3 <= P-poll__networl_1_2_AskP_0))) OR (((P-poll__networl_1_1_AnsP_2 + 1 <= P-polling_2) AND ((1 <= P-network_2_2_RP_2) OR (P-network_1_2_AI_2 <= P-network_2_2_RI_2))) OR A (F ((3 <= P-poll__networl_1_2_AnsP_2))))) OR (3 <= P-poll__networl_0_1_RP_0)) : A (F ((((P-sendAnnPs__broadcasting_0_1 <= 0) OR (P-network_1_1_RI_2 <= P-network_2_2_RI_0)) AND A (F ((3 <= P-poll__networl_2_0_RP_1)))))) : A (F ((((P-negotiation_1_0_CO <= P-poll__networl_1_2_AI_0) OR ((P-network_2_2_AskP_0 <= P-poll__networl_1_2_AnnP_0) AND (P-network_0_0_AnsP_2 <= P-network_0_0_RP_2))) AND (2 <= P-network_2_2_AnsP_0)))) : ((1 <= P-network_0_1_AskP_2) OR E (G ((P-network_2_2_RI_1 <= P-network_2_0_RP_1)))) : A (X (A (((P-poll__networl_1_2_AnnP_1 <= P-network_2_1_AnsP_2) U (1 <= P-poll__networl_2_2_AI_1))))) : (A (((P-poll__networl_1_0_AI_1 <= P-poll__networl_0_1_AskP_0) U (P-network_2_1_AnsP_2 + 1 <= P-masterState_1_F_1))) OR (((P-network_0_2_RI_0 + 1 <= P-stage_0_NEG) AND (P-network_0_2_AI_0 + 1 <= P-poll__networl_1_0_RI_1)
AND ((1 <= P-masterState_1_F_0) OR (P-network_1_1_AskP_1 <= P-network_0_1_RI_1) OR ((1 <= P-poll__networl_2_1_RI_2) AND (P-network_0_1_AskP_0 <= P-poll__networl_2_2_AnnP_1)))) AND E (((P-network_0_2_AnnP_0 <= P-network_0_1_AskP_2) U (1 <= P-dead_1))))) : (((P-poll__networl_0_1_AI_2 <= 0) AND (P-electedPrimary_0 <= 0) AND (P-poll__networl_2_0_AI_2 + 1 <= P-poll__networl_1_1_RI_2) AND (2 <= P-poll__networl_1_0_AnnP_2)) OR E (G (A (X ((P-poll__networl_0_0_AnnP_2 <= P-dead_2)))))) : A (F (E (((P-poll__networl_1_1_RP_0 <= P-network_0_0_AnnP_1) U (2 <= P-crashed_0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((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)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(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))))
lola: processed formula length: 215
lola: 3 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 39 markings, 39 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((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-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-... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((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 + 1 <= 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) OR (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 + 1 <= P-dead_2 + P-dead_1 + P-dead_0))))
lola: processed formula: A (F (((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_... (shortened)
lola: processed formula length: 1295
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= 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-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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) AND (1 <= 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-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... (shortened)
lola: processed formula length: 855
lola: 5 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= 1) AND ((2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) OR (1 <= 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 ((1 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((P-crashed_2 + P-crashed_1 + P-crashed_0 <= 1) AND ((2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) OR (1 <= 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)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0) OR ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= 1) 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 <= 0)))))
lola: processed formula length: 314
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((3 <= P-polling_0 + P-polling_1 + P-polling_2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_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-negotiati... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((3 <= P-polling_0 + P-polling_1 + P-polling_2) OR (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_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... (shortened)
lola: processed formula length: 821
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) 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-masterSt... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) 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-masterSta... (shortened)
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-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 <= 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-mast... (shortened)
lola: processed formula length: 716
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((3 <= 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-pol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (3 <= 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-pol... (shortened)
lola: processed formula length: 4554
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((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: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE 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-m... (shortened)
lola: processed formula length: 502
lola: 7 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 97 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((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-electionInit_1 + P-electionInit_0 + P-electionInit_2) OR (P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((P-electionInit_1 + P-electionInit_0 + P-electionInit_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) AND (2 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-... (shortened)
lola: processed formula length: 5006
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((P-crashed_2 <= P-polling_2) U (3 <= P-poll__networl_1_2_AskP_0))) OR (((P-poll__networl_1_1_AnsP_2 + 1 <= P-polling_2) AND ((1 <= P-network_2_2_RP_2) OR (P-network_1_2_AI_2 <= P-network_2_2_RI_2))) OR A (F ((3 <= P-poll__networl_1_2_AnsP_2))))) OR (3 <= P-poll__networl_0_1_RP_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P-crashed_2 <= P-polling_2) U (3 <= P-poll__networl_1_2_AskP_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P-crashed_2 <= P-polling_2) U (3 <= P-poll__networl_1_2_AskP_0)))
lola: processed formula: A (((P-crashed_2 <= P-polling_2) U (3 <= P-poll__networl_1_2_AskP_0)))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-poll__networl_1_1_AnsP_2 + 1 <= P-polling_2) AND ((1 <= P-network_2_2_RP_2) OR (P-network_1_2_AI_2 <= P-network_2_2_RI_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-poll__networl_1_1_AnsP_2 + 1 <= P-polling_2) AND ((1 <= P-network_2_2_RP_2) OR (P-network_1_2_AI_2 <= P-network_2_2_RI_2)))
lola: processed formula length: 128
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= P-poll__networl_1_2_AnsP_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= P-poll__networl_1_2_AnsP_2)))
lola: processed formula: A (F ((3 <= P-poll__networl_1_2_AnsP_2)))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-poll__networl_0_1_RP_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-poll__networl_0_1_RP_0)
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((P-sendAnnPs__broadcasting_0_1 <= 0) OR (P-network_1_1_RI_2 <= P-network_2_2_RI_0)) AND A (F ((3 <= P-poll__networl_2_0_RP_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((P-sendAnnPs__broadcasting_0_1 <= 0) OR (P-network_1_1_RI_2 <= P-network_2_2_RI_0)) AND A(TRUE U (3 <= P-poll__networl_2_0_RP_1))))
lola: processed formula length: 143
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 97 edges
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: A (F ((((P-negotiation_1_0_CO <= P-poll__networl_1_2_AI_0) OR ((P-network_2_2_AskP_0 <= P-poll__networl_1_2_AnnP_0) AND (P-network_0_0_AnsP_2 <= P-network_0_0_RP_2))) AND (2 <= P-network_2_2_AnsP_0))))========================================

lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((P-negotiation_1_0_CO <= P-poll__networl_1_2_AI_0) OR ((P-network_2_2_AskP_0 <= P-poll__networl_1_2_AnnP_0) AND (P-network_0_0_AnsP_2 <= P-network_0_0_RP_2))) AND (2 <= P-network_2_2_AnsP_0))))
lola: processed formula: A (F ((((P-negotiation_1_0_CO <= P-poll__networl_1_2_AI_0) OR ((P-network_2_2_AskP_0 <= P-poll__networl_1_2_AnnP_0) AND (P-network_0_0_AnsP_2 <= P-network_0_0_RP_2))) AND (2 <= P-network_2_2_AnsP_0))))
lola: processed formula length: 202
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= P-network_0_1_AskP_2) OR E (G ((P-network_2_2_RI_1 <= P-network_2_0_RP_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= P-network_0_1_AskP_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-network_0_1_AskP_2)
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P-network_2_2_RI_1 <= P-network_2_0_RP_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (P-network_2_0_RP_1 + 1 <= P-network_2_2_RI_1)))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (((P-poll__networl_1_2_AnnP_1 <= P-network_2_1_AnsP_2) U (1 <= P-poll__networl_2_2_AI_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A((P-poll__networl_1_2_AnnP_1 <= P-network_2_1_AnsP_2) U (1 <= P-poll__networl_2_2_AI_1)))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((P-poll__networl_1_0_AI_1 <= P-poll__networl_0_1_AskP_0) U (P-network_2_1_AnsP_2 + 1 <= P-masterState_1_F_1))) OR (((P-network_0_2_RI_0 + 1 <= P-stage_0_NEG) AND (P-network_0_2_AI_0 + 1 <= P-poll__networl_1_0_RI_1) AND ((1 <= P-masterState_1_F_0) OR (P-network_1_1_AskP_1 <= P-network_0_1_RI_1) OR ((1 <= P-poll__networl_2_1_RI_2) AND (P-network_0_1_AskP_0 <= P-poll__networl_2_2_AnnP_1)))) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P-poll__networl_1_0_AI_1 <= P-poll__networl_0_1_AskP_0) U (P-network_2_1_AnsP_2 + 1 <= P-masterState_1_F_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P-poll__networl_1_0_AI_1 <= P-poll__networl_0_1_AskP_0) U (P-network_2_1_AnsP_2 + 1 <= P-masterState_1_F_1)))
lola: processed formula: A (((P-poll__networl_1_0_AI_1 <= P-poll__networl_0_1_AskP_0) U (P-network_2_1_AnsP_2 + 1 <= P-masterState_1_F_1)))
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-network_0_2_RI_0 + 1 <= P-stage_0_NEG) AND (P-network_0_2_AI_0 + 1 <= P-poll__networl_1_0_RI_1) AND ((1 <= P-masterState_1_F_0) OR (P-network_1_1_AskP_1 <= P-network_0_1_RI_1) OR ((1 <= P-poll__networl_2_1_RI_2) AND (P-network_0_1_AskP_0 <= P-poll__networl_2_2_AnnP_1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-network_0_2_RI_0 + 1 <= P-stage_0_NEG) AND (P-network_0_2_AI_0 + 1 <= P-poll__networl_1_0_RI_1) AND ((1 <= P-masterState_1_F_0) OR (P-network_1_1_AskP_1 <= P-network_0_1_RI_1) OR ((1 <= P-poll__networl_2_1_RI_2) AND (P-network_0_1_AskP_0 <= P-poll__networl_2_2_AnnP_1))))
lola: processed formula length: 277
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-poll__networl_0_1_AI_2 <= 0) AND (P-electedPrimary_0 <= 0) AND (P-poll__networl_2_0_AI_2 + 1 <= P-poll__networl_1_1_RI_2) AND (2 <= P-poll__networl_1_0_AnnP_2)) OR E (G (A (X ((P-poll__networl_0_0_AnnP_2 <= P-dead_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-poll__networl_0_1_AI_2 <= 0) AND (P-electedPrimary_0 <= 0) AND (P-poll__networl_2_0_AI_2 + 1 <= P-poll__networl_1_1_RI_2) AND (2 <= P-poll__networl_1_0_AnnP_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-poll__networl_0_1_AI_2 <= 0) AND (P-electedPrimary_0 <= 0) AND (P-poll__networl_2_0_AI_2 + 1 <= P-poll__networl_1_1_RI_2) AND (2 <= P-poll__networl_1_0_AnnP_2))
lola: processed formula length: 164
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-2-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((P-poll__networl_0_0_AnnP_2 <= P-dead_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((P-poll__networl_0_0_AnnP_2 <= P-dead_2)))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P-poll__networl_1_1_RP_0 <= P-network_0_0_AnnP_1) U (2 <= P-crashed_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((P-poll__networl_1_1_RP_0 <= P-network_0_0_AnnP_1) U (2 <= P-crashed_0)))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-PT-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: 123 markings, 216 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes no no no yes no no yes no
FORMULA NeoElection-PT-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
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 r115-csrt-152666473800290"
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 ;