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

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


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 : !(((((("RequestBufferSlots>=1")&&("Client_Sending_2>=1"))||(("Client_Sending_4>=1")&&("RequestBufferSlots>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_1>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_3>=1"))))
Formula 0 simplified : !(("Client_Sending_2>=1" & "RequestBufferSlots>=1") | ("Client_Sending_4>=1" & "RequestBufferSlots>=1") | ("Client_Sending_1>=1" & "RequestBufferSlots>=1") | ("Client_Sending_3>=1" & "RequestBufferSlots>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
13 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.164146,26260,1,0,85,15048,99,35,838,16165,78
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
Checking formula 1 : !((X(G(F((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))))))
Formula 1 simplified : !XGF(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_1>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 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.236966,30140,1,0,108,22762,147,59,874,25243,149
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
Checking formula 2 : !((((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1")))
Formula 2 simplified : !("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=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.238025,30140,1,0,108,22762,162,59,886,25243,151
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))))
Formula 3 simplified : !G(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_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.241444,30612,1,0,108,22762,196,59,915,25247,156
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
Checking formula 4 : !((G(G(X(F((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1"))))))))
Formula 4 simplified : !GXF(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_1>=1"))
3 unique states visited
3 strongly connected components in search stack
4 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,0.246894,30808,1,0,108,22896,196,60,915,25927,160
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
Checking formula 5 : !(((G(F(G(((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1")))))U(G(F(((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1"))))))
Formula 5 simplified : !(GFG("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=1") U GF("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.2759,31224,1,0,131,25722,202,79,915,28826,215
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
Checking formula 6 : !((G((((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1"))U((((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1"))U((((((((("Client_Sending_3>=1")&&("Server_Anwering_3_2>=1"))||(("Client_Sending_4>=1")&&("Server_Anwering_4_2>=1")))||(("Server_Anwering_1_1>=1")&&("Client_Sending_1>=1")))||(("Server_Anwering_3_1>=1")&&("Client_Sending_3>=1")))||(("Server_Anwering_2_1>=1")&&("Client_Sending_2>=1")))||(("Server_Anwering_4_1>=1")&&("Client_Sending_4>=1")))||(("Server_Anwering_1_2>=1")&&("Client_Sending_1>=1")))||(("Client_Sending_2>=1")&&("Server_Anwering_2_2>=1")))))))
Formula 6 simplified : !G(("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=1") U (("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=1") U (("Client_Sending_3>=1" & "Server_Anwering_3_2>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_2>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_1>=1") | ("Client_Sending_3>=1" & "Server_Anwering_3_1>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_1>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_1>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_2>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_2>=1"))))
3 unique states visited
3 strongly connected components in search stack
4 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,9.03312,42928,1,0,173,53034,507,122,1214,64127,331
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
Checking formula 7 : !(((F(F(G(((("RequestBuffer_4>=1")||("RequestBuffer_2>=1"))||("RequestBuffer_3>=1"))||("RequestBuffer_1>=1")))))U(X((((("RequestBufferSlots>=1")&&("Client_Sending_2>=1"))||(("Client_Sending_4>=1")&&("RequestBufferSlots>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_1>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_3>=1"))))))
Formula 7 simplified : !(FG("RequestBuffer_1>=1" | "RequestBuffer_2>=1" | "RequestBuffer_3>=1" | "RequestBuffer_4>=1") U X(("Client_Sending_2>=1" & "RequestBufferSlots>=1") | ("Client_Sending_4>=1" & "RequestBufferSlots>=1") | ("Client_Sending_1>=1" & "RequestBufferSlots>=1") | ("Client_Sending_3>=1" & "RequestBufferSlots>=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,9.07941,42928,1,0,173,53034,507,122,1214,64127,333
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(X((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1"))))))
Formula 8 simplified : !GX(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_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,9.08766,42928,1,0,174,53142,507,123,1214,64291,343
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
Checking formula 9 : !((G((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))))
Formula 9 simplified : !G(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_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,9.09129,42928,1,0,174,53142,507,123,1214,64291,343
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
Checking formula 10 : !((G((((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))U((((((((("Client_Sending_3>=1")&&("Server_Anwering_3_2>=1"))||(("Client_Sending_4>=1")&&("Server_Anwering_4_2>=1")))||(("Server_Anwering_1_1>=1")&&("Client_Sending_1>=1")))||(("Server_Anwering_3_1>=1")&&("Client_Sending_3>=1")))||(("Server_Anwering_2_1>=1")&&("Client_Sending_2>=1")))||(("Server_Anwering_4_1>=1")&&("Client_Sending_4>=1")))||(("Server_Anwering_1_2>=1")&&("Client_Sending_1>=1")))||(("Client_Sending_2>=1")&&("Server_Anwering_2_2>=1"))))U(F(X((((((((("Client_Sending_3>=1")&&("Server_Anwering_3_2>=1"))||(("Client_Sending_4>=1")&&("Server_Anwering_4_2>=1")))||(("Server_Anwering_1_1>=1")&&("Client_Sending_1>=1")))||(("Server_Anwering_3_1>=1")&&("Client_Sending_3>=1")))||(("Server_Anwering_2_1>=1")&&("Client_Sending_2>=1")))||(("Server_Anwering_4_1>=1")&&("Client_Sending_4>=1")))||(("Server_Anwering_1_2>=1")&&("Client_Sending_1>=1")))||(("Client_Sending_2>=1")&&("Server_Anwering_2_2>=1"))))))))
Formula 10 simplified : !G(((("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_1>=1")) U (("Client_Sending_3>=1" & "Server_Anwering_3_2>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_2>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_1>=1") | ("Client_Sending_3>=1" & "Server_Anwering_3_1>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_1>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_1>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_2>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_2>=1"))) U FX(("Client_Sending_3>=1" & "Server_Anwering_3_2>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_2>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_1>=1") | ("Client_Sending_3>=1" & "Server_Anwering_3_1>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_1>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_1>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_2>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,19.638,51100,1,0,195,70657,514,144,1214,77765,403
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
Checking formula 11 : !((F(X(X(X(((("RequestBuffer_4>=1")||("RequestBuffer_2>=1"))||("RequestBuffer_3>=1"))||("RequestBuffer_1>=1")))))))
Formula 11 simplified : !FXXX("RequestBuffer_1>=1" | "RequestBuffer_2>=1" | "RequestBuffer_3>=1" | "RequestBuffer_4>=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,19.6597,51100,1,0,218,72241,527,159,1221,80138,457
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(X(((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))U((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))))))
Formula 12 simplified : !GX(("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_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,19.6667,51100,1,0,218,72241,527,159,1221,80138,457
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
Checking formula 13 : !((((((("RequestBufferSlots>=1")&&("Client_Sending_2>=1"))||(("Client_Sending_4>=1")&&("RequestBufferSlots>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_1>=1")))||(("RequestBufferSlots>=1")&&("Client_Sending_3>=1")))U((((((((("RequestBuffer_4>=1")&&("Server_Waiting_2>=1"))||(("RequestBuffer_3>=1")&&("Server_Waiting_2>=1")))||(("RequestBuffer_1>=1")&&("Server_Waiting_1>=1")))||(("RequestBuffer_2>=1")&&("Server_Waiting_2>=1")))||(("Server_Waiting_2>=1")&&("RequestBuffer_1>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_4>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_3>=1")))||(("Server_Waiting_1>=1")&&("RequestBuffer_2>=1")))))
Formula 13 simplified : !((("Client_Sending_2>=1" & "RequestBufferSlots>=1") | ("Client_Sending_4>=1" & "RequestBufferSlots>=1") | ("Client_Sending_1>=1" & "RequestBufferSlots>=1") | ("Client_Sending_3>=1" & "RequestBufferSlots>=1")) U (("RequestBuffer_4>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_1>=1" & "Server_Waiting_2>=1") | ("RequestBuffer_4>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_3>=1" & "Server_Waiting_1>=1") | ("RequestBuffer_2>=1" & "Server_Waiting_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,19.6975,51100,1,0,218,72241,561,159,1255,80138,461
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
Checking formula 14 : !((F(F(X(G(G(((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1"))))))))
Formula 14 simplified : !FXG("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
29 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,19.9959,51100,1,0,261,90040,580,214,1264,115037,627
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
Checking formula 15 : !(((X(X(X((((((((("Client_Sending_3>=1")&&("Server_Anwering_3_2>=1"))||(("Client_Sending_4>=1")&&("Server_Anwering_4_2>=1")))||(("Server_Anwering_1_1>=1")&&("Client_Sending_1>=1")))||(("Server_Anwering_3_1>=1")&&("Client_Sending_3>=1")))||(("Server_Anwering_2_1>=1")&&("Client_Sending_2>=1")))||(("Server_Anwering_4_1>=1")&&("Client_Sending_4>=1")))||(("Server_Anwering_1_2>=1")&&("Client_Sending_1>=1")))||(("Client_Sending_2>=1")&&("Server_Anwering_2_2>=1"))))))U(((("Client_Waiting_2>=1")||("Client_Waiting_3>=1"))||("Client_Waiting_1>=1"))||("Client_Waiting_4>=1"))))
Formula 15 simplified : !(XXX(("Client_Sending_3>=1" & "Server_Anwering_3_2>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_2>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_1>=1") | ("Client_Sending_3>=1" & "Server_Anwering_3_1>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_1>=1") | ("Client_Sending_4>=1" & "Server_Anwering_4_1>=1") | ("Client_Sending_1>=1" & "Server_Anwering_1_2>=1") | ("Client_Sending_2>=1" & "Server_Anwering_2_2>=1")) U ("Client_Waiting_1>=1" | "Client_Waiting_2>=1" | "Client_Waiting_3>=1" | "Client_Waiting_4>=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,23.1594,87000,1,0,261,90040,580,214,1264,115037,627
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464376161712

--------------------
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 7:08:57 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 27, 2016 7:08:57 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 45 ms
May 27, 2016 7:08:57 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 23 places.
May 27, 2016 7:08:57 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 transitions.
May 27, 2016 7:08:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
May 27, 2016 7:08:57 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 18 ms
May 27, 2016 7:08:57 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 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-PT-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-PT-02.tgz
mv S_CSRepetitions-PT-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-PT-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-146433128500492"
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 ;