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_CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169kn-ebro-146433128400438
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464373247697


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/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((((("Client0.clientSending_0>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1"))||(("Client1.clientSending_1>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client2.clientSending_2>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client3.clientSending_3>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1"))))
Formula 0 simplified : !(("Client0.clientSending_0>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client1.clientSending_1>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client2.clientSending_2>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client3.clientSending_3>=1" & "requestBufferSlots.requestBufferSlots[0]>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
30 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.354573,29556,1,0,14147,132,349,20107,77,798,26382
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(F((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))))))
Formula 1 simplified : !XGF(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.492949,35900,1,0,25098,132,405,29192,78,842,47771
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1")))
Formula 2 simplified : !("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1")
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.494405,36148,1,0,25098,132,426,29192,78,842,47778
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))))
Formula 3 simplified : !G(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
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.498206,36384,1,0,25098,132,463,29192,78,842,47915
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(X(F((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1"))))))))
Formula 4 simplified : !GXF(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
3 unique states visited
3 strongly connected components in search stack
4 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.505653,36584,1,0,25179,132,463,29397,78,846,48131
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(F(G(((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1")))))U(G(F(((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1"))))))
Formula 5 simplified : !(GFG("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1") U GF("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1"))
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.567612,37784,1,0,29059,132,472,32108,78,855,55193
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1"))U((((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1"))U((((((((("Computation0.serverAnwering_0>=1")&&("Client0.clientSending_0>=1"))||(("Computation2.serverAnwering_2>=1")&&("Client1.clientSending_1>=1")))||(("Computation4.serverAnwering_4>=1")&&("Client2.clientSending_2>=1")))||(("Computation6.serverAnwering_6>=1")&&("Client3.clientSending_3>=1")))||(("Computation1.serverAnwering_1>=1")&&("Client0.clientSending_0>=1")))||(("Computation3.serverAnwering_3>=1")&&("Client1.clientSending_1>=1")))||(("Computation5.serverAnwering_5>=1")&&("Client2.clientSending_2>=1")))||(("Computation7.serverAnwering_7>=1")&&("Client3.clientSending_3>=1")))))))
Formula 6 simplified : !G(("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1") U (("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1") U (("Client0.clientSending_0>=1" & "Computation0.serverAnwering_0>=1") | ("Client1.clientSending_1>=1" & "Computation2.serverAnwering_2>=1") | ("Client2.clientSending_2>=1" & "Computation4.serverAnwering_4>=1") | ("Client3.clientSending_3>=1" & "Computation6.serverAnwering_6>=1") | ("Client0.clientSending_0>=1" & "Computation1.serverAnwering_1>=1") | ("Client1.clientSending_1>=1" & "Computation3.serverAnwering_3>=1") | ("Client2.clientSending_2>=1" & "Computation5.serverAnwering_5>=1") | ("Client3.clientSending_3>=1" & "Computation7.serverAnwering_7>=1"))))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
85 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,11.4142,59768,1,0,84904,132,943,82082,78,1145,153266
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F(F(G(((("Client0.requestBuffer_0>=1")||("Client1.requestBuffer_1>=1"))||("Client2.requestBuffer_2>=1"))||("Client3.requestBuffer_3>=1")))))U(X((((("Client0.clientSending_0>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1"))||(("Client1.clientSending_1>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client2.clientSending_2>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client3.clientSending_3>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1"))))))
Formula 7 simplified : !(FG("Client0.requestBuffer_0>=1" | "Client1.requestBuffer_1>=1" | "Client2.requestBuffer_2>=1" | "Client3.requestBuffer_3>=1") U X(("Client0.clientSending_0>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client1.clientSending_1>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client2.clientSending_2>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client3.clientSending_3>=1" & "requestBufferSlots.requestBufferSlots[0]>=1")))
3 unique states visited
0 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,11.4495,60028,1,0,84904,132,943,82082,78,1145,153313
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1"))))))
Formula 8 simplified : !GX(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
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,11.4585,60048,1,0,85195,132,943,82308,78,1145,154131
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))))
Formula 9 simplified : !G(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
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,11.4621,60048,1,0,85195,132,943,82308,78,1145,154131
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))U((((((((("Computation0.serverAnwering_0>=1")&&("Client0.clientSending_0>=1"))||(("Computation2.serverAnwering_2>=1")&&("Client1.clientSending_1>=1")))||(("Computation4.serverAnwering_4>=1")&&("Client2.clientSending_2>=1")))||(("Computation6.serverAnwering_6>=1")&&("Client3.clientSending_3>=1")))||(("Computation1.serverAnwering_1>=1")&&("Client0.clientSending_0>=1")))||(("Computation3.serverAnwering_3>=1")&&("Client1.clientSending_1>=1")))||(("Computation5.serverAnwering_5>=1")&&("Client2.clientSending_2>=1")))||(("Computation7.serverAnwering_7>=1")&&("Client3.clientSending_3>=1"))))U(F(X((((((((("Computation0.serverAnwering_0>=1")&&("Client0.clientSending_0>=1"))||(("Computation2.serverAnwering_2>=1")&&("Client1.clientSending_1>=1")))||(("Computation4.serverAnwering_4>=1")&&("Client2.clientSending_2>=1")))||(("Computation6.serverAnwering_6>=1")&&("Client3.clientSending_3>=1")))||(("Computation1.serverAnwering_1>=1")&&("Client0.clientSending_0>=1")))||(("Computation3.serverAnwering_3>=1")&&("Client1.clientSending_1>=1")))||(("Computation5.serverAnwering_5>=1")&&("Client2.clientSending_2>=1")))||(("Computation7.serverAnwering_7>=1")&&("Client3.clientSending_3>=1"))))))))
Formula 10 simplified : !G(((("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1")) U (("Client0.clientSending_0>=1" & "Computation0.serverAnwering_0>=1") | ("Client1.clientSending_1>=1" & "Computation2.serverAnwering_2>=1") | ("Client2.clientSending_2>=1" & "Computation4.serverAnwering_4>=1") | ("Client3.clientSending_3>=1" & "Computation6.serverAnwering_6>=1") | ("Client0.clientSending_0>=1" & "Computation1.serverAnwering_1>=1") | ("Client1.clientSending_1>=1" & "Computation3.serverAnwering_3>=1") | ("Client2.clientSending_2>=1" & "Computation5.serverAnwering_5>=1") | ("Client3.clientSending_3>=1" & "Computation7.serverAnwering_7>=1"))) U FX(("Client0.clientSending_0>=1" & "Computation0.serverAnwering_0>=1") | ("Client1.clientSending_1>=1" & "Computation2.serverAnwering_2>=1") | ("Client2.clientSending_2>=1" & "Computation4.serverAnwering_4>=1") | ("Client3.clientSending_3>=1" & "Computation6.serverAnwering_6>=1") | ("Client0.clientSending_0>=1" & "Computation1.serverAnwering_1>=1") | ("Client1.clientSending_1>=1" & "Computation3.serverAnwering_3>=1") | ("Client2.clientSending_2>=1" & "Computation5.serverAnwering_5>=1") | ("Client3.clientSending_3>=1" & "Computation7.serverAnwering_7>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
31 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,25.3845,73300,1,0,107771,132,949,95236,78,1152,191951
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(X(X(((("Client0.requestBuffer_0>=1")||("Client1.requestBuffer_1>=1"))||("Client2.requestBuffer_2>=1"))||("Client3.requestBuffer_3>=1")))))))
Formula 11 simplified : !FXXX("Client0.requestBuffer_0>=1" | "Client1.requestBuffer_1>=1" | "Client2.requestBuffer_2>=1" | "Client3.requestBuffer_3>=1")
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 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,25.4055,73300,1,0,109986,132,967,96366,78,1152,196188
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(X(((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))U((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))))))
Formula 12 simplified : !GX(("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1"))
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,25.4105,73300,1,0,109986,132,967,96366,78,1152,196188
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((((("Client0.clientSending_0>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1"))||(("Client1.clientSending_1>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client2.clientSending_2>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))||(("Client3.clientSending_3>=1")&&("requestBufferSlots.requestBufferSlots[0]>=1")))U((((((((("Client0.requestBuffer_0>=1")&&("Server0.serverWaiting_0>=1"))||(("Client1.requestBuffer_1>=1")&&("Server0.serverWaiting_0>=1")))||(("Client2.requestBuffer_2>=1")&&("Server0.serverWaiting_0>=1")))||(("Client3.requestBuffer_3>=1")&&("Server0.serverWaiting_0>=1")))||(("Client0.requestBuffer_0>=1")&&("Server1.serverWaiting_1>=1")))||(("Client1.requestBuffer_1>=1")&&("Server1.serverWaiting_1>=1")))||(("Client2.requestBuffer_2>=1")&&("Server1.serverWaiting_1>=1")))||(("Client3.requestBuffer_3>=1")&&("Server1.serverWaiting_1>=1")))))
Formula 13 simplified : !((("Client0.clientSending_0>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client1.clientSending_1>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client2.clientSending_2>=1" & "requestBufferSlots.requestBufferSlots[0]>=1") | ("Client3.clientSending_3>=1" & "requestBufferSlots.requestBufferSlots[0]>=1")) U (("Client0.requestBuffer_0>=1" & "Server0.serverWaiting_0>=1") | ("Client1.requestBuffer_1>=1" & "Server0.serverWaiting_0>=1") | ("Client2.requestBuffer_2>=1" & "Server0.serverWaiting_0>=1") | ("Client3.requestBuffer_3>=1" & "Server0.serverWaiting_0>=1") | ("Client0.requestBuffer_0>=1" & "Server1.serverWaiting_1>=1") | ("Client1.requestBuffer_1>=1" & "Server1.serverWaiting_1>=1") | ("Client2.requestBuffer_2>=1" & "Server1.serverWaiting_1>=1") | ("Client3.requestBuffer_3>=1" & "Server1.serverWaiting_1>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,25.4331,73300,1,0,109986,132,1008,96366,78,1152,196214
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(X(G(G(((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1"))))))))
Formula 14 simplified : !FXG("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
41 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,25.8523,77684,1,0,131697,132,1029,123198,78,1247,235121
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(X(X((((((((("Computation0.serverAnwering_0>=1")&&("Client0.clientSending_0>=1"))||(("Computation2.serverAnwering_2>=1")&&("Client1.clientSending_1>=1")))||(("Computation4.serverAnwering_4>=1")&&("Client2.clientSending_2>=1")))||(("Computation6.serverAnwering_6>=1")&&("Client3.clientSending_3>=1")))||(("Computation1.serverAnwering_1>=1")&&("Client0.clientSending_0>=1")))||(("Computation3.serverAnwering_3>=1")&&("Client1.clientSending_1>=1")))||(("Computation5.serverAnwering_5>=1")&&("Client2.clientSending_2>=1")))||(("Computation7.serverAnwering_7>=1")&&("Client3.clientSending_3>=1"))))))U(((("Client0.clientWaiting_0>=1")||("Client1.clientWaiting_1>=1"))||("Client2.clientWaiting_2>=1"))||("Client3.clientWaiting_3>=1"))))
Formula 15 simplified : !(XXX(("Client0.clientSending_0>=1" & "Computation0.serverAnwering_0>=1") | ("Client1.clientSending_1>=1" & "Computation2.serverAnwering_2>=1") | ("Client2.clientSending_2>=1" & "Computation4.serverAnwering_4>=1") | ("Client3.clientSending_3>=1" & "Computation6.serverAnwering_6>=1") | ("Client0.clientSending_0>=1" & "Computation1.serverAnwering_1>=1") | ("Client1.clientSending_1>=1" & "Computation3.serverAnwering_3>=1") | ("Client2.clientSending_2>=1" & "Computation5.serverAnwering_5>=1") | ("Client3.clientSending_3>=1" & "Computation7.serverAnwering_7>=1")) U ("Client0.clientWaiting_0>=1" | "Client1.clientWaiting_1>=1" | "Client2.clientWaiting_2>=1" | "Client3.clientWaiting_3>=1"))
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,29.2137,118336,1,0,131697,132,1029,123198,78,1247,235121
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1464373286857

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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 27, 2016 6:20:53 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 27, 2016 6:20:53 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 3073 ms
May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: read order :VarOrder [vars=[requestBufferSlots[0], clientSending[0], clientSending[1], clientSending[2], clientSending[3], requestBuffer[0], requestBuffer[1], requestBuffer[2], requestBuffer[3], serverWaiting[0], serverWaiting[1], clientWaiting[0], clientWaiting[1], clientWaiting[2], clientWaiting[3], serverAnwering[0], serverAnwering[1], serverAnwering[2], serverAnwering[3], serverAnwering[4], serverAnwering[5], serverAnwering[6], serverAnwering[7]]]
May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains : CompositeGalOrder [children=[VarOrder [vars=[serverWaiting[0]]], VarOrder [vars=[serverWaiting[1]]], VarOrder [vars=[serverAnwering[0]]], VarOrder [vars=[serverAnwering[1]]], VarOrder [vars=[serverAnwering[2]]], VarOrder [vars=[serverAnwering[3]]], VarOrder [vars=[serverAnwering[4]]], VarOrder [vars=[serverAnwering[5]]], VarOrder [vars=[serverAnwering[6]]], VarOrder [vars=[serverAnwering[7]]], VarOrder [vars=[requestBufferSlots[0]]], VarOrder [vars=[clientSending[0], requestBuffer[0], clientWaiting[0]]], VarOrder [vars=[clientSending[1], requestBuffer[1], clientWaiting[1]]], VarOrder [vars=[clientSending[2], requestBuffer[2], clientWaiting[2]]], VarOrder [vars=[clientSending[3], requestBuffer[3], clientWaiting[3]]]]]
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
May 27, 2016 6:20:56 PM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[serverWaiting[0], ],[serverWaiting[1], ],[serverAnwering[0], ],[serverAnwering[1], ],[serverAnwering[2], ],[serverAnwering[3], ],[serverAnwering[4], ],[serverAnwering[5], ],[serverAnwering[6], ],[serverAnwering[7], ],[requestBufferSlots[0], ],[clientSending[0], requestBuffer[0], clientWaiting[0], ],[clientSending[1], requestBuffer[1], clientWaiting[1], ],[clientSending[2], requestBuffer[2], clientWaiting[2], ],[clientSending[3], requestBuffer[3], clientWaiting[3], ],

May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array clientSending to variables to allow decomposition.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array requestBuffer to variables to allow decomposition.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array serverWaiting to variables to allow decomposition.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array clientWaiting to variables to allow decomposition.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array serverAnwering to variables to allow decomposition.
May 27, 2016 6:20:56 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 12 redundant transitions.
May 27, 2016 6:20:56 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 15 ms
May 27, 2016 6:20:56 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 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_CSRepetitions-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/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_CSRepetitions-COL-02.tgz
mv S_CSRepetitions-COL-02 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_CSRepetitions-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169kn-ebro-146433128400438"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;