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-2979
Executing tool itstools
Input is S_NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444112401049
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464715524118


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X("2<=((((((((P_stage_0_NEG+P_stage_0_PRIM)+P_stage_0_SEC)+P_stage_1_NEG)+P_stage_1_PRIM)+P_stage_1_SEC)+P_stage_2_NEG)+P_stage_2_PRIM)+P_stage_2_SEC)")))
Formula 0 simplified : !X"2<=((((((((P_stage_0_NEG+P_stage_0_PRIM)+P_stage_0_SEC)+P_stage_1_NEG)+P_stage_1_PRIM)+P_stage_1_SEC)+P_stage_2_NEG)+P_stage_2_PRIM)+P_stage_2_SEC)"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
40 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.477638,35684,1,0,53,14816,382,24,4972,8708,373
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("0<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)"))
Formula 1 simplified : !"0<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.480564,35812,1,0,53,14816,385,24,5000,8708,375
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((G(F("2<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network_0_0_AskP_0+P_network_0_0_AnsP_0)+P_network_0_0_AnsP_1)+P_network_0_0_AnsP_2)+P_network_0_0_RI_0)+P_network_0_0_AI_0)+P_network_0_0_AnnP_0)+P_network_0_0_RP_0)+P_network_0_1_AskP_0)+P_network_0_1_AnsP_0)+P_network_0_1_AnsP_1)+P_network_0_1_AnsP_2)+P_network_0_1_RI_0)+P_network_0_1_AI_0)+P_network_0_1_AnnP_0)+P_network_0_1_RP_0)+P_network_0_2_AskP_0)+P_network_0_2_AnsP_0)+P_network_0_2_AnsP_1)+P_network_0_2_AnsP_2)+P_network_0_2_RI_0)+P_network_0_2_AI_0)+P_network_0_2_AnnP_0)+P_network_0_2_RP_0)+P_network_1_0_AskP_0)+P_network_1_0_AnsP_0)+P_network_1_0_AnsP_1)+P_network_1_0_AnsP_2)+P_network_1_0_RI_0)+P_network_1_0_AI_0)+P_network_1_0_AnnP_0)+P_network_1_0_RP_0)+P_network_1_1_AskP_0)+P_network_1_1_AnsP_0)+P_network_1_1_AnsP_1)+P_network_1_1_AnsP_2)+P_network_1_1_RI_0)+P_network_1_1_AI_0)+P_network_1_1_AnnP_0)+P_network_1_1_RP_0)+P_network_1_2_AskP_0)+P_network_1_2_AnsP_0)+P_network_1_2_AnsP_1)+P_network_1_2_AnsP_2)+P_network_1_2_RI_0)+P_network_1_2_AI_0)+P_network_1_2_AnnP_0)+P_network_1_2_RP_0)+P_network_2_0_AskP_0)+P_network_2_0_AnsP_0)+P_network_2_0_AnsP_1)+P_network_2_0_AnsP_2)+P_network_2_0_RI_0)+P_network_2_0_AI_0)+P_network_2_0_AnnP_0)+P_network_2_0_RP_0)+P_network_2_1_AskP_0)+P_network_2_1_AnsP_0)+P_network_2_1_AnsP_1)+P_network_2_1_AnsP_2)+P_network_2_1_RI_0)+P_network_2_1_AI_0)+P_network_2_1_AnnP_0)+P_network_2_1_RP_0)+P_network_2_2_AskP_0)+P_network_2_2_AnsP_0)+P_network_2_2_AnsP_1)+P_network_2_2_AnsP_2)+P_network_2_2_RI_0)+P_network_2_2_AI_0)+P_network_2_2_AnnP_0)+P_network_2_2_RP_0)")))U(F(F("((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)")))))
Formula 2 simplified : !(GF"2<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network_0_0_AskP_0+P_network_0_0_AnsP_0)+P_network_0_0_AnsP_1)+P_network_0_0_AnsP_2)+P_network_0_0_RI_0)+P_network_0_0_AI_0)+P_network_0_0_AnnP_0)+P_network_0_0_RP_0)+P_network_0_1_AskP_0)+P_network_0_1_AnsP_0)+P_network_0_1_AnsP_1)+P_network_0_1_AnsP_2)+P_network_0_1_RI_0)+P_network_0_1_AI_0)+P_network_0_1_AnnP_0)+P_network_0_1_RP_0)+P_network_0_2_AskP_0)+P_network_0_2_AnsP_0)+P_network_0_2_AnsP_1)+P_network_0_2_AnsP_2)+P_network_0_2_RI_0)+P_network_0_2_AI_0)+P_network_0_2_AnnP_0)+P_network_0_2_RP_0)+P_network_1_0_AskP_0)+P_network_1_0_AnsP_0)+P_network_1_0_AnsP_1)+P_network_1_0_AnsP_2)+P_network_1_0_RI_0)+P_network_1_0_AI_0)+P_network_1_0_AnnP_0)+P_network_1_0_RP_0)+P_network_1_1_AskP_0)+P_network_1_1_AnsP_0)+P_network_1_1_AnsP_1)+P_network_1_1_AnsP_2)+P_network_1_1_RI_0)+P_network_1_1_AI_0)+P_network_1_1_AnnP_0)+P_network_1_1_RP_0)+P_network_1_2_AskP_0)+P_network_1_2_AnsP_0)+P_network_1_2_AnsP_1)+P_network_1_2_AnsP_2)+P_network_1_2_RI_0)+P_network_1_2_AI_0)+P_network_1_2_AnnP_0)+P_network_1_2_RP_0)+P_network_2_0_AskP_0)+P_network_2_0_AnsP_0)+P_network_2_0_AnsP_1)+P_network_2_0_AnsP_2)+P_network_2_0_RI_0)+P_network_2_0_AI_0)+P_network_2_0_AnnP_0)+P_network_2_0_RP_0)+P_network_2_1_AskP_0)+P_network_2_1_AnsP_0)+P_network_2_1_AnsP_1)+P_network_2_1_AnsP_2)+P_network_2_1_RI_0)+P_network_2_1_AI_0)+P_network_2_1_AnnP_0)+P_network_2_1_RP_0)+P_network_2_2_AskP_0)+P_network_2_2_AnsP_0)+P_network_2_2_AnsP_1)+P_network_2_2_AnsP_2)+P_network_2_2_RI_0)+P_network_2_2_AI_0)+P_network_2_2_AnnP_0)+P_network_2_2_RP_0)" U F"((P_poll__waitingMessage_0+P_poll__waitingMessage_1)+P_poll__waitingMessage_2)<=((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.482486,36664,1,0,53,14817,394,24,5008,8708,379
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(G("2<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)"))))
Formula 3 simplified : !FG"2<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.833679,44356,1,0,144,43462,407,151,5014,40850,871
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("1<=((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)"))
Formula 4 simplified : !"1<=((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.890323,44972,1,0,144,44266,416,151,5181,43063,883
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((G("((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)"))U(X(X("1<=(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)")))))
Formula 5 simplified : !(G"((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)" U XX"1<=(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)")
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.937391,48012,1,0,171,45957,433,177,5253,46917,997
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("3<=((P_polling_0+P_polling_1)+P_polling_2)"))
Formula 6 simplified : !"3<=((P_polling_0+P_polling_1)+P_polling_2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.93836,48016,1,0,171,45957,436,177,5257,46917,999
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F((F("((P_poll__handlingMessage_0+P_poll__handlingMessage_1)+P_poll__handlingMessage_2)<=2"))U(G(false)))))
Formula 7 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.940626,48144,1,0,171,45995,436,178,5257,46997,1004
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G(("(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)")U("0<=(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)")))))
Formula 8 simplified : !XG("(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)" U "0<=(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)")
33 unique states visited
0 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.08131,50268,1,0,200,46357,452,269,5511,60017,1380
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(G("(((((((((((((((((P_masterState_0_F_0+P_masterState_0_F_1)+P_masterState_0_F_2)+P_masterState_0_T_0)+P_masterState_0_T_1)+P_masterState_0_T_2)+P_masterState_1_F_0)+P_masterState_1_F_1)+P_masterState_1_F_2)+P_masterState_1_T_0)+P_masterState_1_T_1)+P_masterState_1_T_2)+P_masterState_2_F_0)+P_masterState_2_F_1)+P_masterState_2_F_2)+P_masterState_2_T_0)+P_masterState_2_T_1)+P_masterState_2_T_2)<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)")))))
Formula 9 simplified : !FG"(((((((((((((((((P_masterState_0_F_0+P_masterState_0_F_1)+P_masterState_0_F_2)+P_masterState_0_T_0)+P_masterState_0_T_1)+P_masterState_0_T_2)+P_masterState_1_F_0)+P_masterState_1_F_1)+P_masterState_1_F_2)+P_masterState_1_T_0)+P_masterState_1_T_1)+P_masterState_1_T_2)+P_masterState_2_F_0)+P_masterState_2_F_1)+P_masterState_2_F_2)+P_masterState_2_T_0)+P_masterState_2_T_1)+P_masterState_2_T_2)<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.29363,55516,1,0,317,66795,465,413,5615,103269,1823
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(G(G(X("(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)"))))))
Formula 10 simplified : !GX"(((((P_sendAnnPs__broadcasting_0_1+P_sendAnnPs__broadcasting_0_2)+P_sendAnnPs__broadcasting_1_1)+P_sendAnnPs__broadcasting_1_2)+P_sendAnnPs__broadcasting_2_1)+P_sendAnnPs__broadcasting_2_2)<=((P_electedPrimary_0+P_electedPrimary_1)+P_electedPrimary_2)"
33 unique states visited
0 strongly connected components in search stack
33 transitions explored
33 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.31936,56536,1,0,317,66795,471,413,5635,103270,2045
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("3<=((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)"))
Formula 11 simplified : !"3<=((P_electedSecondary_0+P_electedSecondary_1)+P_electedSecondary_2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.32019,56540,1,0,317,66795,474,413,5639,103270,2047
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F(X(F("3<=((P_electionInit_0+P_electionInit_1)+P_electionInit_2)"))))))
Formula 12 simplified : !XFXF"3<=((P_electionInit_0+P_electionInit_1)+P_electionInit_2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.37366,57244,1,0,345,67015,483,472,5645,105738,2262
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(X(("0<=((P_electionInit_0+P_electionInit_1)+P_electionInit_2)")U("3<=((P_polling_0+P_polling_1)+P_polling_2)")))))
Formula 13 simplified : !GX("0<=((P_electionInit_0+P_electionInit_1)+P_electionInit_2)" U "3<=((P_polling_0+P_polling_1)+P_polling_2)")
34 unique states visited
34 strongly connected components in search stack
35 transitions explored
34 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.40407,57984,1,0,345,67015,493,472,5655,110613,2356
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((((false)U("2<=(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)"))U(("(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)")U("1<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)"))))
Formula 14 simplified : !("2<=(((((P_startNeg__broadcasting_0_1+P_startNeg__broadcasting_0_2)+P_startNeg__broadcasting_1_1)+P_startNeg__broadcasting_1_2)+P_startNeg__broadcasting_2_1)+P_startNeg__broadcasting_2_2)" U ("(((((((((((((((((P_poll__networl_0_0_AnsP_1+P_poll__networl_0_0_AnsP_2)+P_poll__networl_0_1_AnsP_1)+P_poll__networl_0_1_AnsP_2)+P_poll__networl_0_2_AnsP_1)+P_poll__networl_0_2_AnsP_2)+P_poll__networl_1_0_AnsP_1)+P_poll__networl_1_0_AnsP_2)+P_poll__networl_1_1_AnsP_1)+P_poll__networl_1_1_AnsP_2)+P_poll__networl_1_2_AnsP_1)+P_poll__networl_1_2_AnsP_2)+P_poll__networl_2_0_AnsP_1)+P_poll__networl_2_0_AnsP_2)+P_poll__networl_2_1_AnsP_1)+P_poll__networl_2_1_AnsP_2)+P_poll__networl_2_2_AnsP_1)+P_poll__networl_2_2_AnsP_2)<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)" U "1<=((((((((((((((((((((((((((P_negotiation_0_0_NONE+P_negotiation_0_0_CO)+P_negotiation_0_0_DONE)+P_negotiation_0_1_NONE)+P_negotiation_0_1_CO)+P_negotiation_0_1_DONE)+P_negotiation_0_2_NONE)+P_negotiation_0_2_CO)+P_negotiation_0_2_DONE)+P_negotiation_1_0_NONE)+P_negotiation_1_0_CO)+P_negotiation_1_0_DONE)+P_negotiation_1_1_NONE)+P_negotiation_1_1_CO)+P_negotiation_1_1_DONE)+P_negotiation_1_2_NONE)+P_negotiation_1_2_CO)+P_negotiation_1_2_DONE)+P_negotiation_2_0_NONE)+P_negotiation_2_0_CO)+P_negotiation_2_0_DONE)+P_negotiation_2_1_NONE)+P_negotiation_2_1_CO)+P_negotiation_2_1_DONE)+P_negotiation_2_2_NONE)+P_negotiation_2_2_CO)+P_negotiation_2_2_DONE)"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41125,57984,1,0,345,67015,512,472,5704,110613,2362
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X("2<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)"))))
Formula 15 simplified : !GX"2<=((P_poll__pollEnd_0+P_poll__pollEnd_1)+P_poll__pollEnd_2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41303,58096,1,0,345,67015,518,472,5710,110614,2370
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464715531724

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 31, 2016 5:25:27 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2016 5:25:28 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 139 ms
May 31, 2016 5:25:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 438 places.
May 31, 2016 5:25:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 357 transitions.
May 31, 2016 5:25:28 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 261 fixed domain variables (out of 438 variables) in GAL type NeoElection_PT_2
May 31, 2016 5:25:28 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 261 constant array cells/variables (out of 438 variables) in type NeoElection_PT_2
May 31, 2016 5:25:28 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: P_network_1_2_RP_1,P_poll__networl_1_1_AskP_1,P_network_2_0_AskP_1,P_network_1_2_AI_2,P_poll__networl_1_1_RP_1,P_network_1_0_AskP_1,P_poll__networl_0_1_RP_0,P_poll__networl_1_0_AskP_1,P_network_2_0_AnnP_2,P_network_2_2_AskP_1,P_poll__networl_2_1_RI_2,P_network_0_1_AnnP_2,P_network_2_1_AI_1,P_network_2_0_RI_2,P_poll__networl_1_2_AskP_1,P_network_1_1_AnnP_2,P_masterList_0_2_2,P_poll__networl_1_0_AskP_0,P_poll__networl_2_1_RP_0,P_network_0_1_AskP_1,P_network_0_2_RP_2,P_poll__networl_1_0_RP_0,P_poll__networl_1_2_AI_2,P_poll__networl_0_1_RI_1,P_electionFailed_2,P_poll__networl_0_1_AI_1,P_network_1_2_AskP_1,P_network_2_0_RP_1,P_poll__networl_1_0_RI_1,P_network_1_1_RP_2,P_network_2_2_RI_2,P_poll__networl_1_2_AnsP_0,P_poll__networl_0_2_AI_1,P_poll__networl_1_2_AskP_2,P_poll__networl_1_0_AnnP_2,P_poll__networl_0_0_RI_1,P_network_0_2_RP_1,P_poll__networl_1_1_AnsP_0,P_network_0_2_AnnP_2,P_poll__networl_1_2_AnnP_1,P_poll__networl_1_1_AI_0,P_poll__networl_0_0_AI_2,P_network_2_1_RP_2,P_network_2_0_AI_1,P_poll__networl_0_1_RP_1,P_network_1_2_AnnP_2,P_network_2_0_AskP_2,P_poll__networl_1_2_RI_0,P_poll__networl_2_0_RI_0,P_network_2_2_AI_2,P_poll__networl_0_2_AI_2,P_network_0_1_AnnP_1,P_poll__networl_1_1_AI_2,P_poll__networl_0_1_AnnP_1,P_network_0_0_AskP_1,P_network_2_2_RP_1,P_poll__networl_0_0_RI_0,P_network_0_1_RP_2,P_poll__networl_0_1_RI_2,P_poll__networl_2_0_AnnP_2,P_masterList_0_1_0,P_masterList_2_1_2,P_poll__networl_0_1_AskP_0,P_electionFailed_0,P_poll__networl_0_0_AnsP_0,P_poll__networl_0_2_AskP_2,P_network_1_1_AI_2,P_masterList_0_1_1,P_network_2_2_RI_1,P_network_1_1_RP_1,P_network_1_0_RP_2,P_poll__networl_2_0_AnnP_0,P_poll__networl_1_1_AnnP_1,P_network_0_2_AskP_1,P_poll__networl_0_0_RP_1,P_network_1_2_AnnP_1,P_masterList_2_1_0,P_network_2_0_RP_2,P_poll__networl_2_1_AI_1,P_poll__networl_1_0_AI_2,P_network_2_1_RI_2,P_poll__networl_2_2_AI_2,P_network_1_2_RI_2,P_poll__networl_2_1_AskP_1,P_poll__networl_0_1_AnnP_2,P_poll__networl_2_0_RI_2,P_poll__networl_2_2_AnnP_0,P_poll__networl_2_2_AskP_2,P_poll__networl_0_1_AnsP_0,P_poll__networl_2_0_RP_2,P_poll__networl_0_0_AskP_2,P_poll__networl_1_1_AnnP_0,P_poll__networl_1_2_RP_2,P_network_2_0_RI_1,P_poll__networl_2_2_AnnP_2,P_poll__networl_1_2_AskP_0,P_poll__networl_2_2_RP_1,P_poll__networl_0_2_AnnP_0,P_network_2_1_AskP_2,P_poll__networl_1_0_RI_2,P_poll__networl_1_1_AnnP_2,P_network_0_0_RP_1,P_dead_1,P_network_1_2_AI_1,P_poll__networl_0_1_AskP_2,P_network_1_0_AI_1,P_poll__networl_0_1_AnnP_0,P_poll__networl_1_0_AnnP_0,P_poll__networl_0_2_RP_2,P_poll__networl_1_1_AI_1,P_network_1_0_AnnP_2,P_poll__networl_2_2_AI_0,P_poll__networl_2_1_AnnP_2,P_network_1_0_RI_1,P_poll__networl_0_0_AnnP_0,P_network_1_0_RI_2,P_poll__networl_0_0_AnnP_1,P_network_0_1_RI_2,P_network_0_0_AnnP_1,P_poll__networl_0_2_RP_1,P_network_1_1_RI_1,P_network_0_2_RI_1,P_network_2_2_AskP_2,P_masterList_1_1_2,P_network_1_1_RI_2,P_poll__networl_1_1_RP_2,P_network_0_2_RI_2,P_poll__networl_0_2_AnnP_2,P_poll__networl_2_1_AnnP_1,P_network_2_1_RI_1,P_poll__networl_2_1_RP_2,P_poll__networl_0_0_RP_2,P_poll__networl_1_1_RP_0,P_poll__networl_2_2_RI_1,P_crashed_2,P_crashed_1,P_network_1_2_RI_1,P_network_0_1_AI_2,P_poll__networl_1_1_AskP_0,P_dead_0,P_poll__networl_2_0_RP_0,P_network_2_1_AnnP_1,P_poll__networl_2_2_AskP_0,P_poll__networl_2_0_AskP_0,P_poll__networl_1_2_AnnP_0,P_masterList_1_2_2,P_masterList_0_1_2,P_poll__networl_2_1_AI_2,P_poll__networl_0_1_AI_2,P_poll__networl_2_0_AnsP_0,P_poll__networl_1_0_AI_0,P_masterList_0_2_0,P_poll__networl_2_2_AI_1,P_poll__networl_2_1_AskP_0,P_poll__networl_1_0_AnnP_1,P_network_0_0_RP_2,P_network_2_1_AI_2,P_network_0_0_RI_1,P_network_2_2_AnnP_2,P_poll__networl_2_1_AnnP_0,P_masterList_2_1_1,P_poll__networl_1_1_AskP_2,P_masterList_1_2_1,P_network_2_2_AI_1,P_network_0_1_AI_1,P_poll__networl_0_0_AskP_0,P_poll__networl_0_1_AI_0,P_poll__networl_2_0_AnnP_1,P_network_1_1_AnnP_1,P_poll__networl_2_0_AI_2,P_network_1_0_AnnP_1,P_poll__networl_2_0_RP_1,P_poll__networl_0_2_AnnP_1,P_network_0_1_AskP_2,P_poll__networl_2_1_AnsP_0,P_poll__networl_2_2_RI_2,P_poll__networl_1_1_RI_1,P_masterList_2_2_0,P_masterList_2_2_1,P_poll__networl_2_2_AnsP_0,P_poll__networl_0_2_RP_0,P_poll__networl_2_2_RI_0,P_network_1_2_AskP_2,P_network_2_1_AnnP_2,P_poll__networl_2_1_RI_0,P_poll__networl_0_0_AskP_1,P_poll__networl_1_2_RI_2,P_network_1_1_AskP_1,P_network_1_0_AskP_2,P_poll__networl_1_0_RP_2,P_poll__networl_0_2_RI_0,P_poll__networl_0_1_AskP_1,P_network_1_0_AI_2,P_poll__networl_1_0_AI_1,P_poll__networl_1_2_AnnP_2,P_network_2_1_AskP_1,P_network_1_1_AI_1,P_poll__networl_2_0_AI_0,P_poll__networl_2_2_RP_2,P_electionFailed_1,P_poll__networl_0_2_RI_1,P_poll__networl_1_1_RI_0,P_poll__networl_0_2_AI_0,P_network_0_0_RI_2,P_poll__networl_1_2_RI_1,P_network_2_2_RP_2,P_poll__networl_1_0_AnsP_0,P_poll__networl_2_0_AskP_2,P_network_1_1_AskP_2,P_network_0_0_AnnP_2,P_poll__networl_2_0_AskP_1,P_poll__networl_2_1_AI_0,P_network_2_2_AnnP_1,P_poll__networl_2_2_RP_0,P_poll__networl_0_2_RI_2,P_poll__networl_1_2_AI_0,P_poll__networl_0_0_AnnP_2,P_network_2_0_AnnP_1,P_poll__networl_2_2_AnnP_1,P_poll__networl_1_0_AskP_2,P_poll__networl_2_2_AskP_1,P_poll__networl_1_1_RI_2,P_network_0_0_AskP_2,P_poll__networl_0_0_AI_0,P_poll__networl_2_0_AI_1,P_network_2_0_AI_2,P_masterList_0_2_1,P_poll__networl_2_1_RI_1,P_masterList_1_1_1,P_poll__networl_1_2_AI_1,P_network_1_2_RP_2,P_masterList_1_2_0,P_poll__networl_0_0_RP_0,P_network_2_1_RP_1,P_network_0_2_AI_2,P_network_0_0_AI_2,P_poll__networl_2_1_AskP_2,P_poll__networl_0_1_RI_0,P_network_0_2_AskP_2,P_crashed_0,P_network_0_2_AI_1,P_poll__networl_0_1_RP_2,P_poll__networl_1_0_RI_0,P_poll__networl_1_2_RP_1,P_poll__networl_1_0_RP_1,P_network_0_0_AI_1,P_network_0_1_RP_1,P_poll__networl_2_0_RI_1,P_poll__networl_0_0_AI_1,P_masterList_1_1_0,P_network_1_0_RP_1,P_network_0_2_AnnP_1,P_poll__networl_0_2_AskP_1,P_network_0_1_RI_1,P_poll__networl_1_2_RP_0,P_poll__networl_0_0_RI_2,P_masterList_2_2_2,P_poll__networl_2_1_RP_1,P_poll__networl_0_2_AnsP_0,P_dead_2,P_poll__networl_0_2_AskP_0,
May 31, 2016 5:25:29 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 261 constant variables :P_network_1_2_RP_1, P_poll__networl_1_1_AskP_1, P_network_2_0_AskP_1, P_network_1_2_AI_2, P_poll__networl_1_1_RP_1, P_network_1_0_AskP_1, P_poll__networl_0_1_RP_0, P_poll__networl_1_0_AskP_1, P_network_2_0_AnnP_2, P_network_2_2_AskP_1, P_poll__networl_2_1_RI_2, P_network_0_1_AnnP_2, P_network_2_1_AI_1, P_network_2_0_RI_2, P_poll__networl_1_2_AskP_1, P_network_1_1_AnnP_2, P_masterList_0_2_2, P_poll__networl_1_0_AskP_0, P_poll__networl_2_1_RP_0, P_network_0_1_AskP_1, P_network_0_2_RP_2, P_poll__networl_1_0_RP_0, P_poll__networl_1_2_AI_2, P_poll__networl_0_1_RI_1, P_electionFailed_2, P_poll__networl_0_1_AI_1, P_network_1_2_AskP_1, P_network_2_0_RP_1, P_poll__networl_1_0_RI_1, P_network_1_1_RP_2, P_network_2_2_RI_2, P_poll__networl_1_2_AnsP_0, P_poll__networl_0_2_AI_1, P_poll__networl_1_2_AskP_2, P_poll__networl_1_0_AnnP_2, P_poll__networl_0_0_RI_1, P_network_0_2_RP_1, P_poll__networl_1_1_AnsP_0, P_network_0_2_AnnP_2, P_poll__networl_1_2_AnnP_1, P_poll__networl_1_1_AI_0, P_poll__networl_0_0_AI_2, P_network_2_1_RP_2, P_network_2_0_AI_1, P_poll__networl_0_1_RP_1, P_network_1_2_AnnP_2, P_network_2_0_AskP_2, P_poll__networl_1_2_RI_0, P_poll__networl_2_0_RI_0, P_network_2_2_AI_2, P_poll__networl_0_2_AI_2, P_network_0_1_AnnP_1, P_poll__networl_1_1_AI_2, P_poll__networl_0_1_AnnP_1, P_network_0_0_AskP_1, P_network_2_2_RP_1, P_poll__networl_0_0_RI_0, P_network_0_1_RP_2, P_poll__networl_0_1_RI_2, P_poll__networl_2_0_AnnP_2, P_masterList_0_1_0, P_masterList_2_1_2, P_poll__networl_0_1_AskP_0, P_electionFailed_0, P_poll__networl_0_0_AnsP_0, P_poll__networl_0_2_AskP_2, P_network_1_1_AI_2, P_masterList_0_1_1, P_network_2_2_RI_1, P_network_1_1_RP_1, P_network_1_0_RP_2, P_poll__networl_2_0_AnnP_0, P_poll__networl_1_1_AnnP_1, P_network_0_2_AskP_1, P_poll__networl_0_0_RP_1, P_network_1_2_AnnP_1, P_masterList_2_1_0, P_network_2_0_RP_2, P_poll__networl_2_1_AI_1, P_poll__networl_1_0_AI_2, P_network_2_1_RI_2, P_poll__networl_2_2_AI_2, P_network_1_2_RI_2, P_poll__networl_2_1_AskP_1, P_poll__networl_0_1_AnnP_2, P_poll__networl_2_0_RI_2, P_poll__networl_2_2_AnnP_0, P_poll__networl_2_2_AskP_2, P_poll__networl_0_1_AnsP_0, P_poll__networl_2_0_RP_2, P_poll__networl_0_0_AskP_2, P_poll__networl_1_1_AnnP_0, P_poll__networl_1_2_RP_2, P_network_2_0_RI_1, P_poll__networl_2_2_AnnP_2, P_poll__networl_1_2_AskP_0, P_poll__networl_2_2_RP_1, P_poll__networl_0_2_AnnP_0, P_network_2_1_AskP_2, P_poll__networl_1_0_RI_2, P_poll__networl_1_1_AnnP_2, P_network_0_0_RP_1, P_dead_1, P_network_1_2_AI_1, P_poll__networl_0_1_AskP_2, P_network_1_0_AI_1, P_poll__networl_0_1_AnnP_0, P_poll__networl_1_0_AnnP_0, P_poll__networl_0_2_RP_2, P_poll__networl_1_1_AI_1, P_network_1_0_AnnP_2, P_poll__networl_2_2_AI_0, P_poll__networl_2_1_AnnP_2, P_network_1_0_RI_1, P_poll__networl_0_0_AnnP_0, P_network_1_0_RI_2, P_poll__networl_0_0_AnnP_1, P_network_0_1_RI_2, P_network_0_0_AnnP_1, P_poll__networl_0_2_RP_1, P_network_1_1_RI_1, P_network_0_2_RI_1, P_network_2_2_AskP_2, P_masterList_1_1_2, P_network_1_1_RI_2, P_poll__networl_1_1_RP_2, P_network_0_2_RI_2, P_poll__networl_0_2_AnnP_2, P_poll__networl_2_1_AnnP_1, P_network_2_1_RI_1, P_poll__networl_2_1_RP_2, P_poll__networl_0_0_RP_2, P_poll__networl_1_1_RP_0, P_poll__networl_2_2_RI_1, P_crashed_2, P_crashed_1, P_network_1_2_RI_1, P_network_0_1_AI_2, P_poll__networl_1_1_AskP_0, P_dead_0, P_poll__networl_2_0_RP_0, P_network_2_1_AnnP_1, P_poll__networl_2_2_AskP_0, P_poll__networl_2_0_AskP_0, P_poll__networl_1_2_AnnP_0, P_masterList_1_2_2, P_masterList_0_1_2, P_poll__networl_2_1_AI_2, P_poll__networl_0_1_AI_2, P_poll__networl_2_0_AnsP_0, P_poll__networl_1_0_AI_0, P_masterList_0_2_0, P_poll__networl_2_2_AI_1, P_poll__networl_2_1_AskP_0, P_poll__networl_1_0_AnnP_1, P_network_0_0_RP_2, P_network_2_1_AI_2, P_network_0_0_RI_1, P_network_2_2_AnnP_2, P_poll__networl_2_1_AnnP_0, P_masterList_2_1_1, P_poll__networl_1_1_AskP_2, P_masterList_1_2_1, P_network_2_2_AI_1, P_network_0_1_AI_1, P_poll__networl_0_0_AskP_0, P_poll__networl_0_1_AI_0, P_poll__networl_2_0_AnnP_1, P_network_1_1_AnnP_1, P_poll__networl_2_0_AI_2, P_network_1_0_AnnP_1, P_poll__networl_2_0_RP_1, P_poll__networl_0_2_AnnP_1, P_network_0_1_AskP_2, P_poll__networl_2_1_AnsP_0, P_poll__networl_2_2_RI_2, P_poll__networl_1_1_RI_1, P_masterList_2_2_0, P_masterList_2_2_1, P_poll__networl_2_2_AnsP_0, P_poll__networl_0_2_RP_0, P_poll__networl_2_2_RI_0, P_network_1_2_AskP_2, P_network_2_1_AnnP_2, P_poll__networl_2_1_RI_0, P_poll__networl_0_0_AskP_1, P_poll__networl_1_2_RI_2, P_network_1_1_AskP_1, P_network_1_0_AskP_2, P_poll__networl_1_0_RP_2, P_poll__networl_0_2_RI_0, P_poll__networl_0_1_AskP_1, P_network_1_0_AI_2, P_poll__networl_1_0_AI_1, P_poll__networl_1_2_AnnP_2, P_network_2_1_AskP_1, P_network_1_1_AI_1, P_poll__networl_2_0_AI_0, P_poll__networl_2_2_RP_2, P_electionFailed_1, P_poll__networl_0_2_RI_1, P_poll__networl_1_1_RI_0, P_poll__networl_0_2_AI_0, P_network_0_0_RI_2, P_poll__networl_1_2_RI_1, P_network_2_2_RP_2, P_poll__networl_1_0_AnsP_0, P_poll__networl_2_0_AskP_2, P_network_1_1_AskP_2, P_network_0_0_AnnP_2, P_poll__networl_2_0_AskP_1, P_poll__networl_2_1_AI_0, P_network_2_2_AnnP_1, P_poll__networl_2_2_RP_0, P_poll__networl_0_2_RI_2, P_poll__networl_1_2_AI_0, P_poll__networl_0_0_AnnP_2, P_network_2_0_AnnP_1, P_poll__networl_2_2_AnnP_1, P_poll__networl_1_0_AskP_2, P_poll__networl_2_2_AskP_1, P_poll__networl_1_1_RI_2, P_network_0_0_AskP_2, P_poll__networl_0_0_AI_0, P_poll__networl_2_0_AI_1, P_network_2_0_AI_2, P_masterList_0_2_1, P_poll__networl_2_1_RI_1, P_masterList_1_1_1, P_poll__networl_1_2_AI_1, P_network_1_2_RP_2, P_masterList_1_2_0, P_poll__networl_0_0_RP_0, P_network_2_1_RP_1, P_network_0_2_AI_2, P_network_0_0_AI_2, P_poll__networl_2_1_AskP_2, P_poll__networl_0_1_RI_0, P_network_0_2_AskP_2, P_crashed_0, P_network_0_2_AI_1, P_poll__networl_0_1_RP_2, P_poll__networl_1_0_RI_0, P_poll__networl_1_2_RP_1, P_poll__networl_1_0_RP_1, P_network_0_0_AI_1, P_network_0_1_RP_1, P_poll__networl_2_0_RI_1, P_poll__networl_0_0_AI_1, P_masterList_1_1_0, P_network_1_0_RP_1, P_network_0_2_AnnP_1, P_poll__networl_0_2_AskP_1, P_network_0_1_RI_1, P_poll__networl_1_2_RP_0, P_poll__networl_0_0_RI_2, P_masterList_2_2_2, P_poll__networl_2_1_RP_1, P_poll__networl_0_2_AnsP_0, P_dead_2, P_poll__networl_0_2_AskP_0
May 31, 2016 5:25:29 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 462 expressions due to constant valuations.
May 31, 2016 5:25:29 PM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 14 false transitions.
May 31, 2016 5:25:29 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 7 fixed domain variables (out of 177 variables) in GAL type NeoElection_PT_2_flat
May 31, 2016 5:25:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 1395 ms
May 31, 2016 5:25:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 32 ms
May 31, 2016 5:25:29 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms

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="S_NeoElection-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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/S_NeoElection-PT-2.tgz
mv S_NeoElection-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_NeoElection-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444112401049"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;