fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r040-blw7-149440486400230
Last Updated
June 27, 2017

About the Execution of ITS-Tools for NeoElection-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
418.370 6142.00 13894.00 126.30 TFTFFTFFTFFFFFTT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is NeoElection-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486400230
=====================================================================


--------------------
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 1496278601572


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X("(((((P_sendAnnPs__broadcasting[0]+P_sendAnnPs__broadcasting[1])+P_sendAnnPs__broadcasting[2])+P_sendAnnPs__broadcasting[3])+P_sendAnnPs__broadcasting[4])+P_sendAnnPs__broadcasting[5])<=0")))
Formula 0 simplified : !X"(((((P_sendAnnPs__broadcasting[0]+P_sendAnnPs__broadcasting[1])+P_sendAnnPs__broadcasting[2])+P_sendAnnPs__broadcasting[3])+P_sendAnnPs__broadcasting[4])+P_sendAnnPs__broadcasting[5])<=0"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 343 rows 411 cols
invariant : 1'P_poll__networl[86]= 0
invariant : 1'P_network[35]= 0
invariant : 1'P_network[109]= 0
invariant : 1'P_network[139]= 0
invariant : 1'P_poll__networl[122]= 0
invariant : 1'P_poll__networl[28]= 0
invariant : 1'P_poll__networl[60]= 0
invariant : 1'P_poll__networl[48]= 0
invariant : 1'P_poll__networl[80]= 0
invariant : 1'P_poll__networl[92]= 0
invariant : 1'P_poll__networl[16]= 0
invariant : 1'P_network[43]= 0
invariant : 1'P_network[161]= 0
invariant : 1'P_network[20]= 0
invariant : 1'P_negotiation[1] + 1'P_negotiation[2]= 0
invariant : 1'P_network[119]= 0
invariant : 1'P_poll__networl[98]= 0
invariant : 1'P_network[118]= 0
invariant : 1'P_poll__networl[124]= 0
invariant : 1'P_poll__networl[21]= 0
invariant : 1'P_poll__networl[88]= 0
invariant : 1'P_poll__waitingMessage[1] + 1'P_stage[4] + 1'P_stage[5]= 0
invariant : 1'P_network[133]= 0
invariant : 1'P_poll__networl[62]= 0
invariant : 1'P_poll__networl[147]= 0
invariant : 1'P_negotiation[21] + 1'P_negotiation[22] + 1'P_negotiation[23]= 1
invariant : 1'P_poll__networl[81]= 0
invariant : 1'P_network[104]= 0
invariant : 1'P_poll__networl[155]= 0
invariant : 1'P_poll__networl[161]= 0
invariant : 1'P_electionInit[0] + 1'P_startNeg__broadcasting[0]= 0
invariant : 1'P_network[125]= 0
invariant : 1'P_network[71]= 0
invariant : 1'P_poll__networl[146]= 0
invariant : 1'P_poll__networl[103]= 0
invariant : 1'P_poll__networl[73]= 0
invariant : 1'P_poll__networl[160]= 0
invariant : 1'P_poll__networl[119]= 0
invariant : 1'P_network[25]= 0
invariant : 1'P_electedPrimary[0] + 1'P_electedSecondary[0] + 1'P_poll__handlingMessage[0] + 1'P_poll__pollEnd[0] + 1'P_poll__waitingMessage[0] + 1'P_polling[0] + 1'P_sendAnnPs__broadcasting[0] + 1'P_sendAnnPs__broadcasting[1] + 1'P_startNeg__broadcasting[1]= 0
invariant : 1'P_network[115]= 0
invariant : 1'P_poll__networl[100]= 0
invariant : 1'P_poll__waitingMessage[2] + 1'P_stage[7] + 1'P_stage[8]= 0
invariant : 1'P_poll__networl[90]= 0
invariant : -1'P_electedPrimary[0] + -1'P_sendAnnPs__broadcasting[0] + 1'P_stage[1]= 0
invariant : 1'P_poll__networl[12]= 0
invariant : 1'P_poll__networl[32]= 0
invariant : 1'P_network[137]= 0
invariant : 1'P_poll__networl[121]= 0
invariant : 1'P_network[82]= 0
invariant : 1'P_poll__networl[139]= 0
invariant : 1'P_poll__networl[96]= 0
invariant : 1'P_network[121]= 0
invariant : 1'P_network[98]= 0
invariant : 1'P_network[65]= 0
invariant : 1'P_poll__networl[66]= 0
invariant : 1'P_poll__networl[72]= 0
invariant : 1'P_network[29]= 0
invariant : 1'P_poll__networl[110]= 0
invariant : 1'P_negotiation[13] + 1'P_negotiation[14]= 1
invariant : 1'P_poll__networl[135]= 0
invariant : 1'P_poll__networl[137]= 0
invariant : 1'P_poll__networl[138]= 0
invariant : 1'P_negotiation[0]= 0
invariant : 1'P_network[152]= 0
invariant : 1'P_poll__networl[89]= 0
invariant : 1'P_poll__networl[117]= 0
invariant : 1'P_poll__networl[69]= 0
invariant : 1'P_poll__networl[114]= 0
invariant : 1'P_poll__networl[156]= 0
invariant : 1'P_network[100]= 0
invariant : 1'P_network[2]= 0
invariant : 1'P_network[97]= 0
invariant : 1'P_poll__networl[97]= 0
invariant : 1'P_poll__networl[87]= 0
invariant : 1'P_poll__networl[84]= 0
invariant : 1'P_network[56]= 0
invariant : 1'P_poll__networl[129]= 0
invariant : 1'P_poll__networl[14]= 0
invariant : 1'P_network[73]= 0
invariant : 1'P_network[32]= 0
invariant : 1'P_poll__networl[101]= 0
invariant : 1'P_poll__networl[85]= 0
invariant : 1'P_network[158]= 0
invariant : 1'P_negotiation[6]= 0
invariant : 1'P_poll__networl[145]= 0
invariant : 1'P_poll__networl[9]= 0
invariant : 1'P_poll__networl[105]= 0
invariant : 1'P_network[128]= 0
invariant : 1'P_network[160]= 0
invariant : 1'P_electedPrimary[0] + 1'P_poll__waitingMessage[0] + 1'P_sendAnnPs__broadcasting[0] + 1'P_stage[2]= 0
invariant : 1'P_poll__networl[106]= 0
invariant : 1'P_network[70]= 0
invariant : 1'P_network[157]= 0
invariant : 1'P_poll__networl[39]= 0
invariant : 1'P_poll__networl[140]= 0
invariant : 1'P_poll__networl[33]= 0
invariant : 1'P_network[53]= 0
invariant : 1'P_poll__networl[3]= 0
invariant : 1'P_poll__networl[120]= 0
invariant : 1'P_network[151]= 0
invariant : 1'P_network[74]= 0
invariant : 1'P_network[155]= 0
invariant : 1'P_network[134]= 0
invariant : -1'P_poll__waitingMessage[1] + 1'P_stage[3]= 1
invariant : 1'P_network[79]= 0
invariant : 1'P_poll__networl[102]= 0
invariant : 1'P_poll__networl[134]= 0
invariant : 1'P_network[62]= 0
invariant : 1'P_network[67]= 0
invariant : 1'P_negotiation[3]= 0
invariant : 1'P_negotiation[9]= 0
invariant : 1'P_network[85]= 0
invariant : 1'P_network[92]= 0
invariant : 1'P_network[103]= 0
invariant : 1'P_poll__networl[116]= 0
invariant : 1'P_network[88]= 0
invariant : 1'P_poll__networl[63]= 0
invariant : 1'P_network[38]= 0
invariant : 1'P_poll__networl[45]= 0
invariant : 1'P_poll__networl[65]= 0
invariant : 1'P_poll__networl[26]= 0
invariant : 1'P_poll__networl[142]= 0
invariant : 1'P_network[14]= 0
invariant : 1'P_poll__networl[6]= 0
invariant : 1'P_poll__networl[151]= 0
invariant : 1'P_network[136]= 0
invariant : 1'P_masterState[0] + 1'P_masterState[1] + 1'P_masterState[2] + 1'P_masterState[3] + 1'P_masterState[4] + 1'P_masterState[5]= 0
invariant : 1'P_poll__networl[74]= 0
invariant : 1'P_network[28]= 0
invariant : 1'P_network[31]= 0
invariant : 1'P_network[49]= 0
invariant : 1'P_poll__networl[144]= 0
invariant : 1'P_poll__networl[67]= 0
invariant : 1'P_negotiation[18]= 0
invariant : 1'P_network[61]= 0
invariant : 1'P_network[1]= 0
invariant : 1'P_negotiation[10] + 1'P_negotiation[11]= 0
invariant : 1'P_poll__networl[125]= 0
invariant : 1'P_poll__networl[61]= 0
invariant : 1'P_poll__networl[68]= 0
invariant : 1'P_negotiation[15] + 1'P_negotiation[16] + 1'P_negotiation[17]= 1
invariant : 1'P_poll__networl[71]= 0
invariant : 1'P_poll__networl[118]= 0
invariant : 1'P_poll__networl[83]= 0
invariant : 1'P_poll__networl[115]= 0
invariant : 1'P_network[86]= 0
invariant : 1'P_network[91]= 0
invariant : 1'P_poll__networl[17]= 0
invariant : 1'P_poll__networl[2]= 0
invariant : 1'P_poll__networl[50]= 0
invariant : 1'P_poll__networl[150]= 0
invariant : 1'P_poll__networl[152]= 0
invariant : 1'P_poll__networl[107]= 0
invariant : 1'P_negotiation[12]= 0
invariant : 1'P_network[110]= 0
invariant : 1'P_network[16]= 0
invariant : 1'P_poll__networl[126]= 0
invariant : 1'P_poll__networl[8]= 0
invariant : 1'P_network[26]= 0
invariant : 1'P_network[116]= 0
invariant : 1'P_poll__networl[128]= 0
invariant : 1'P_network[7]= 0
invariant : 1'P_poll__networl[57]= 0
invariant : 1'P_network[44]= 0
invariant : 1'P_network[47]= 0
invariant : 1'P_network[89]= 0
invariant : 1'P_poll__networl[49]= 0
invariant : 1'P_network[13]= 0
invariant : 1'P_poll__networl[42]= 0
invariant : 1'P_poll__networl[43]= 0
invariant : 1'P_masterState[6] + 1'P_masterState[7] + 1'P_masterState[8] + 1'P_masterState[9] + 1'P_masterState[10] + 1'P_masterState[11]= 1
invariant : 1'P_poll__networl[37]= 0
invariant : 1'P_poll__networl[136]= 0
invariant : 1'P_network[101]= 0
invariant : -1'P_poll__waitingMessage[2] + 1'P_stage[6]= 1
invariant : 1'P_poll__networl[1]= 0
invariant : 1'P_poll__networl[123]= 0
invariant : 1'P_network[68]= 0
invariant : 1'P_poll__networl[44]= 0
invariant : 1'P_network[80]= 0
invariant : 1'P_poll__networl[64]= 0
invariant : 1'P_network[11]= 0
invariant : 1'P_poll__networl[38]= 0
invariant : 1'P_electedPrimary[1] + 1'P_electedSecondary[1] + 1'P_negotiation[15] + 1'P_poll__handlingMessage[1] + 1'P_poll__pollEnd[1] + 1'P_poll__waitingMessage[1] + 1'P_polling[1] + 1'P_sendAnnPs__broadcasting[2] + 1'P_sendAnnPs__broadcasting[3] + 1'P_startNeg__broadcasting[3]= 1
invariant : 1'P_poll__networl[0]= 0
invariant : 1'P_poll__networl[18]= 0
invariant : 1'P_poll__networl[108]= 0
invariant : 1'P_network[145]= 0
invariant : 1'P_poll__networl[153]= 0
invariant : 1'P_poll__networl[7]= 0
invariant : 1'P_network[52]= 0
invariant : 1'P_poll__networl[35]= 0
invariant : 1'P_poll__networl[24]= 0
invariant : 1'P_network[19]= 0
invariant : 1'P_network[50]= 0
invariant : 1'P_negotiation[4] + 1'P_negotiation[5]= 0
invariant : 1'P_poll__networl[157]= 0
invariant : 1'P_poll__networl[29]= 0
invariant : 1'P_poll__networl[46]= 0
invariant : 1'P_network[140]= 0
invariant : 1'P_poll__networl[111]= 0
invariant : 1'P_poll__networl[93]= 0
invariant : 1'P_negotiation[7] + 1'P_negotiation[8]= 0
invariant : 1'P_poll__networl[36]= 0
invariant : 1'P_poll__networl[20]= 0
invariant : 1'P_poll__networl[47]= 0
invariant : 1'P_poll__networl[91]= 0
invariant : 1'P_network[10]= 0
invariant : 1'P_poll__networl[54]= 0
invariant : 1'P_poll__networl[10]= 0
invariant : 1'P_network[46]= 0
invariant : 1'P_poll__networl[27]= 0
invariant : 1'P_poll__networl[75]= 0
invariant : 1'P_negotiation[24]= 0
invariant : 1'P_network[64]= 0
invariant : 1'P_poll__networl[19]= 0
invariant : 1'P_negotiation[19] + 1'P_negotiation[20]= 0
invariant : 1'P_electedPrimary[2] + 1'P_electedSecondary[2] + 1'P_negotiation[21] + 1'P_poll__handlingMessage[2] + 1'P_poll__pollEnd[2] + 1'P_poll__waitingMessage[2] + 1'P_polling[2] + 1'P_sendAnnPs__broadcasting[4] + 1'P_sendAnnPs__broadcasting[5] + 1'P_startNeg__broadcasting[5]= 1
invariant : 1'P_network[154]= 0
invariant : 1'P_network[127]= 0
invariant : -1'P_poll__waitingMessage[0] + 1'P_stage[0]= 0
invariant : 1'P_poll__networl[55]= 0
invariant : 1'P_network[124]= 0
invariant : 1'P_network[8]= 0
invariant : 1'P_poll__networl[158]= 0
invariant : 1'P_poll__networl[104]= 0
invariant : 1'P_network[106]= 0
invariant : 1'P_network[107]= 0
invariant : 1'P_poll__networl[34]= 0
invariant : 1'P_poll__networl[99]= 0
invariant : 1'P_electionInit[2] + -1'P_negotiation[21] + 1'P_startNeg__broadcasting[4]= 0
invariant : 1'P_poll__networl[30]= 0
invariant : 1'P_electionInit[1] + -1'P_negotiation[15] + 1'P_startNeg__broadcasting[2]= 0
invariant : 1'P_poll__networl[82]= 0
invariant : 1'P_network[34]= 0
invariant : 1'P_network[37]= 0
invariant : 1'P_poll__networl[31]= 0
invariant : 1'P_poll__networl[70]= 0
invariant : 1'P_poll__networl[159]= 0
invariant : 1'P_poll__networl[51]= 0
invariant : 1'P_poll__networl[11]= 0
invariant : 1'P_poll__networl[154]= 0
invariant : 1'P_masterState[12] + 1'P_masterState[13] + 1'P_masterState[14] + 1'P_masterState[15] + 1'P_masterState[16] + 1'P_masterState[17]= 1
invariant : 1'P_network[142]= 0
invariant : 1'P_negotiation[25] + 1'P_negotiation[26]= 1
invariant : 1'P_poll__networl[132]= 0
invariant : 1'P_poll__networl[109]= 0
invariant : 1'P_poll__networl[127]= 0
invariant : 1'P_poll__networl[56]= 0
invariant : 1'P_network[17]= 0
invariant : 1'P_poll__networl[141]= 0
invariant : 1'P_poll__networl[25]= 0
invariant : 1'P_poll__networl[78]= 0
invariant : 1'P_network[146]= 0
invariant : 1'P_network[143]= 0
invariant : 1'P_poll__networl[15]= 0
invariant : 1'P_network[83]= 0
invariant : 1'P_poll__networl[13]= 0
invariant : 1'P_poll__networl[133]= 0
invariant : 1'P_network[55]= 0
invariant : 1'P_poll__networl[53]= 0
invariant : 1'P_poll__networl[79]= 0
invariant : 1'P_network[122]= 0
invariant : 1'P_poll__networl[52]= 0
invariant : 1'P_poll__networl[143]= 0
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
75 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.827557,41444,1,0,53,34646,295,24,4883,24108,286
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(F(F(false))))))
Formula 1 simplified : 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
25 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.0725,49324,1,0,84,61241,301,88,5048,58920,395
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((("((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=2")U("((P_poll__waitingMessage[0]+P_poll__waitingMessage[1])+P_poll__waitingMessage[2])>=0"))U("((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])<=((P_electedPrimary[0]+P_electedPrimary[1])+P_electedPrimary[2])")))
Formula 2 simplified : !(("((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=2" U "((P_poll__waitingMessage[0]+P_poll__waitingMessage[1])+P_poll__waitingMessage[2])>=0") U "((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])<=((P_electedPrimary[0]+P_electedPrimary[1])+P_electedPrimary[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,1.07583,50160,1,0,84,61242,323,88,5078,58921,401
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F("((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=3"))U(G("((P_electionInit[0]+P_electionInit[1])+P_electionInit[2])<=0")))))
Formula 3 simplified : !G(F"((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=3" U G"((P_electionInit[0]+P_electionInit[1])+P_electionInit[2])<=0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
28 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.35879,61048,1,0,144,96786,341,151,5094,127006,637
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 USE_NUPN
Checking formula 4 : !((F("(((((((((((((((((P_poll__networl[4]+P_poll__networl[5])+P_poll__networl[22])+P_poll__networl[23])+P_poll__networl[40])+P_poll__networl[41])+P_poll__networl[58])+P_poll__networl[59])+P_poll__networl[76])+P_poll__networl[77])+P_poll__networl[94])+P_poll__networl[95])+P_poll__networl[112])+P_poll__networl[113])+P_poll__networl[130])+P_poll__networl[131])+P_poll__networl[148])+P_poll__networl[149])>=3")))
Formula 4 simplified : !F"(((((((((((((((((P_poll__networl[4]+P_poll__networl[5])+P_poll__networl[22])+P_poll__networl[23])+P_poll__networl[40])+P_poll__networl[41])+P_poll__networl[58])+P_poll__networl[59])+P_poll__networl[76])+P_poll__networl[77])+P_poll__networl[94])+P_poll__networl[95])+P_poll__networl[112])+P_poll__networl[113])+P_poll__networl[130])+P_poll__networl[131])+P_poll__networl[148])+P_poll__networl[149])>=3"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
22 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.58332,66232,1,0,174,105597,350,215,5114,171405,866
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 USE_NUPN
Checking formula 5 : !((G((X("((P_electedSecondary[0]+P_electedSecondary[1])+P_electedSecondary[2])>=0"))U(F("((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])<=0")))))
Formula 5 simplified : !G(X"((P_electedSecondary[0]+P_electedSecondary[1])+P_electedSecondary[2])>=0" U F"((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])<=0")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
12 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.69351,70284,1,0,226,128579,359,269,5121,202368,1012
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 USE_NUPN
Checking formula 6 : !((false))
Formula 6 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,1.69385,70284,1,0,226,128579,359,269,5121,202368,1012
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 USE_NUPN
Checking formula 7 : !(("(((((((((((((((((((P_negotiation[1]+P_negotiation[2])+P_negotiation[4])+P_negotiation[5])+P_negotiation[7])+P_negotiation[8])+P_negotiation[10])+P_negotiation[11])+P_negotiation[13])+P_negotiation[14])+P_negotiation[15])+P_negotiation[16])+P_negotiation[17])+P_negotiation[19])+P_negotiation[20])+P_negotiation[21])+P_negotiation[22])+P_negotiation[23])+P_negotiation[25])+P_negotiation[26])<=((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])"))
Formula 7 simplified : !"(((((((((((((((((((P_negotiation[1]+P_negotiation[2])+P_negotiation[4])+P_negotiation[5])+P_negotiation[7])+P_negotiation[8])+P_negotiation[10])+P_negotiation[11])+P_negotiation[13])+P_negotiation[14])+P_negotiation[15])+P_negotiation[16])+P_negotiation[17])+P_negotiation[19])+P_negotiation[20])+P_negotiation[21])+P_negotiation[22])+P_negotiation[23])+P_negotiation[25])+P_negotiation[26])<=((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[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.6964,70348,1,0,226,128579,362,269,5145,202368,1015
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 USE_NUPN
Checking formula 8 : !((F(F(G(G("(((((P_sendAnnPs__broadcasting[0]+P_sendAnnPs__broadcasting[1])+P_sendAnnPs__broadcasting[2])+P_sendAnnPs__broadcasting[3])+P_sendAnnPs__broadcasting[4])+P_sendAnnPs__broadcasting[5])<=0"))))))
Formula 8 simplified : !FG"(((((P_sendAnnPs__broadcasting[0]+P_sendAnnPs__broadcasting[1])+P_sendAnnPs__broadcasting[2])+P_sendAnnPs__broadcasting[3])+P_sendAnnPs__broadcasting[4])+P_sendAnnPs__broadcasting[5])<=0"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.75516,72060,1,0,226,128579,372,269,5151,202369,1248
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X("((P_polling[0]+P_polling[1])+P_polling[2])>=3")))U(G(G("((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=0")))))
Formula 9 simplified : !(GX"((P_polling[0]+P_polling[1])+P_polling[2])>=3" U G"((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=0")
96 unique states visited
0 strongly connected components in search stack
98 transitions explored
33 items max in DFS search stack
25 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,2.00979,76080,1,0,226,128606,394,298,5183,232360,1760
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(G("(((((((((((((((((P_poll__networl[4]+P_poll__networl[5])+P_poll__networl[22])+P_poll__networl[23])+P_poll__networl[40])+P_poll__networl[41])+P_poll__networl[58])+P_poll__networl[59])+P_poll__networl[76])+P_poll__networl[77])+P_poll__networl[94])+P_poll__networl[95])+P_poll__networl[112])+P_poll__networl[113])+P_poll__networl[130])+P_poll__networl[131])+P_poll__networl[148])+P_poll__networl[149])>=2")))U("((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])>=0")))
Formula 10 simplified : !(FG"(((((((((((((((((P_poll__networl[4]+P_poll__networl[5])+P_poll__networl[22])+P_poll__networl[23])+P_poll__networl[40])+P_poll__networl[41])+P_poll__networl[58])+P_poll__networl[59])+P_poll__networl[76])+P_poll__networl[77])+P_poll__networl[94])+P_poll__networl[95])+P_poll__networl[112])+P_poll__networl[113])+P_poll__networl[130])+P_poll__networl[131])+P_poll__networl[148])+P_poll__networl[149])>=2" U "((P_poll__handlingMessage[0]+P_poll__handlingMessage[1])+P_poll__handlingMessage[2])>=0")
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,2.01113,76140,1,0,226,128606,397,298,5187,232360,1762
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(G(F(false))))))
Formula 11 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,2.0113,76296,1,0,226,128606,397,298,5187,232360,1762
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 USE_NUPN
Checking formula 12 : !(((("(((((((((((((((((((P_negotiation[1]+P_negotiation[2])+P_negotiation[4])+P_negotiation[5])+P_negotiation[7])+P_negotiation[8])+P_negotiation[10])+P_negotiation[11])+P_negotiation[13])+P_negotiation[14])+P_negotiation[15])+P_negotiation[16])+P_negotiation[17])+P_negotiation[19])+P_negotiation[20])+P_negotiation[21])+P_negotiation[22])+P_negotiation[23])+P_negotiation[25])+P_negotiation[26])>=1")U("((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=3"))U(F(G("(((((P_startNeg__broadcasting[0]+P_startNeg__broadcasting[1])+P_startNeg__broadcasting[2])+P_startNeg__broadcasting[3])+P_startNeg__broadcasting[4])+P_startNeg__broadcasting[5])>=3")))))
Formula 12 simplified : !(("(((((((((((((((((((P_negotiation[1]+P_negotiation[2])+P_negotiation[4])+P_negotiation[5])+P_negotiation[7])+P_negotiation[8])+P_negotiation[10])+P_negotiation[11])+P_negotiation[13])+P_negotiation[14])+P_negotiation[15])+P_negotiation[16])+P_negotiation[17])+P_negotiation[19])+P_negotiation[20])+P_negotiation[21])+P_negotiation[22])+P_negotiation[23])+P_negotiation[25])+P_negotiation[26])>=1" U "((P_poll__pollEnd[0]+P_poll__pollEnd[1])+P_poll__pollEnd[2])>=3") U FG"(((((P_startNeg__broadcasting[0]+P_startNeg__broadcasting[1])+P_startNeg__broadcasting[2])+P_startNeg__broadcasting[3])+P_startNeg__broadcasting[4])+P_startNeg__broadcasting[5])>=3")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.06966,78912,1,0,226,128606,410,298,5216,232366,2062
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 USE_NUPN
Checking formula 13 : !(("((P_electedSecondary[0]+P_electedSecondary[1])+P_electedSecondary[2])<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network[0]+P_network[3])+P_network[4])+P_network[5])+P_network[6])+P_network[9])+P_network[12])+P_network[15])+P_network[18])+P_network[21])+P_network[22])+P_network[23])+P_network[24])+P_network[27])+P_network[30])+P_network[33])+P_network[36])+P_network[39])+P_network[40])+P_network[41])+P_network[42])+P_network[45])+P_network[48])+P_network[51])+P_network[54])+P_network[57])+P_network[58])+P_network[59])+P_network[60])+P_network[63])+P_network[66])+P_network[69])+P_network[72])+P_network[75])+P_network[76])+P_network[77])+P_network[78])+P_network[81])+P_network[84])+P_network[87])+P_network[90])+P_network[93])+P_network[94])+P_network[95])+P_network[96])+P_network[99])+P_network[102])+P_network[105])+P_network[108])+P_network[111])+P_network[112])+P_network[113])+P_network[114])+P_network[117])+P_network[120])+P_network[123])+P_network[126])+P_network[129])+P_network[130])+P_network[131])+P_network[132])+P_network[135])+P_network[138])+P_network[141])+P_network[144])+P_network[147])+P_network[148])+P_network[149])+P_network[150])+P_network[153])+P_network[156])+P_network[159])"))
Formula 13 simplified : !"((P_electedSecondary[0]+P_electedSecondary[1])+P_electedSecondary[2])<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((P_network[0]+P_network[3])+P_network[4])+P_network[5])+P_network[6])+P_network[9])+P_network[12])+P_network[15])+P_network[18])+P_network[21])+P_network[22])+P_network[23])+P_network[24])+P_network[27])+P_network[30])+P_network[33])+P_network[36])+P_network[39])+P_network[40])+P_network[41])+P_network[42])+P_network[45])+P_network[48])+P_network[51])+P_network[54])+P_network[57])+P_network[58])+P_network[59])+P_network[60])+P_network[63])+P_network[66])+P_network[69])+P_network[72])+P_network[75])+P_network[76])+P_network[77])+P_network[78])+P_network[81])+P_network[84])+P_network[87])+P_network[90])+P_network[93])+P_network[94])+P_network[95])+P_network[96])+P_network[99])+P_network[102])+P_network[105])+P_network[108])+P_network[111])+P_network[112])+P_network[113])+P_network[114])+P_network[117])+P_network[120])+P_network[123])+P_network[126])+P_network[129])+P_network[130])+P_network[131])+P_network[132])+P_network[135])+P_network[138])+P_network[141])+P_network[144])+P_network[147])+P_network[148])+P_network[149])+P_network[150])+P_network[153])+P_network[156])+P_network[159])"
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,2.0748,78912,1,0,226,128606,413,298,5293,232366,2064
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X(G(X("((P_electedPrimary[0]+P_electedPrimary[1])+P_electedPrimary[2])>=2"))))))
Formula 14 simplified : !GXGX"((P_electedPrimary[0]+P_electedPrimary[1])+P_electedPrimary[2])>=2"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.08393,79252,1,0,227,128843,419,299,5300,233527,2077
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(F(false)))))
Formula 15 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,2.08415,79252,1,0,227,128843,419,299,5300,233527,2077
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 USE_NUPN
Exit code :0

BK_STOP 1496278607714

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.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 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 12:56:42 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 12:56:42 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1438 ms
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * STAGE->P-stage,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,
M * M * NEGSTEP->P-negotiation,

Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 125 instantiations of transitions. Total transitions/syncs built is 366
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Instantiator normalizeCalls
INFO: Calls to non existing labels (possibly due to false guards) leads to 6 abort statements.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 4 fixed domain variables (out of 438 variables) in GAL type NeoElection_COL_2
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 261 constant array cells/variables (out of 438 variables) in type NeoElection_COL_2
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: P_crashed[0-2], P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161], P_masterList[0-17], dead[0-2], P_electionFailed[0-2], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161],
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 450 expressions due to constant valuations.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyFalseTransitions
INFO: Removed 32 false transitions.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 241 constant array cells/variables (out of 411 variables) in type NeoElection_COL_2
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161], P_negotiation[0,3,6,9,12,18,24], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161],
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 14 expressions due to constant valuations.
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 241 constant array cells/variables (out of 411 variables) in type NeoElection_COL_2
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: P_poll__networl[0-3,6-21,24-39,42-57,60-75,78-93,96-111,114-129,132-147,150-161], P_negotiation[0,3,6,9,12,18,24], P_network[1-2,7-8,10-11,13-14,16-17,19-20,25-26,28-29,31-32,34-35,37-38,43-44,46-47,49-50,52-53,55-56,61-62,64-65,67-68,70-71,73-74,79-80,82-83,85-86,88-89,91-92,97-98,100-101,103-104,106-107,109-110,115-116,118-119,121-122,124-125,127-128,133-134,136-137,139-140,142-143,145-146,151-152,154-155,157-158,160-161],
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.Simplifier removeUncalledTransitions
INFO: Removed 3 uncalled transitions from type NeoElection_COL_2
Jun 01, 2017 12:56:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 416 ms
Jun 01, 2017 12:56:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 23 ms
Jun 01, 2017 12:56:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 01, 2017 12:56:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 266 place invariants in 95 ms
Jun 01, 2017 12:56:47 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions T_poll__end_1, T_poll__end_2, T_startNeg__end_1, T_startNeg__end_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :237/15/4/256
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states

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-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-COL-2.tgz
mv NeoElection-COL-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-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 r040-blw7-149440486400230"
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 ;