Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is CSRepetitions-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r225-ebro-152732379600126
=====================================================================

--------------------
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-PT-02-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527624687179

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph446745687661990727.txt, -o, /tmp/graph446745687661990727.bin, -w, /tmp/graph446745687661990727.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph446745687661990727.bin, -l, -1, -v, -w, /tmp/graph446745687661990727.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(G(F(F("(((((((((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))||((u3.Client_Sending_4>=1)&&(u0.Server_Anwering_4_2>=1)))||((u4.Server_Anwering_1_1>=1)&&(u1.Client_Sending_1>=1)))||((u4.Server_Anwering_3_1>=1)&&(u2.Client_Sending_3>=1)))||((u4.Server_Anwering_2_1>=1)&&(u6.Client_Sending_2>=1)))||((u4.Server_Anwering_4_1>=1)&&(u3.Client_Sending_4>=1)))||((u0.Server_Anwering_1_2>=1)&&(u1.Client_Sending_1>=1)))||((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1)))"))))))
Formula 0 simplified : !XGF"(((((((((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))||((u3.Client_Sending_4>=1)&&(u0.Server_Anwering_4_2>=1)))||((u4.Server_Anwering_1_1>=1)&&(u1.Client_Sending_1>=1)))||((u4.Server_Anwering_3_1>=1)&&(u2.Client_Sending_3>=1)))||((u4.Server_Anwering_2_1>=1)&&(u6.Client_Sending_2>=1)))||((u4.Server_Anwering_4_1>=1)&&(u3.Client_Sending_4>=1)))||((u0.Server_Anwering_1_2>=1)&&(u1.Client_Sending_1>=1)))||((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1)))"
built 14 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Send_Answer_3_2, Send_Answer_4_2, Send_Answer_1_1, Send_Answer_3_1, Send_Answer_2_1, Send_Answer_4_1, Send_Answer_1_2, Send_Answer_2_2, u1.Prepare_Request_1, u2.Prepare_Request_3, u3.Prepare_Request_4, u5.Lose_Request_4, u5.Lose_Request_2, u5.Lose_Request_3, u5.Lose_Request_1, u6.Prepare_Request_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :u2:Client_Waiting_3 + u2:Client_Sending_3 = 1
invariant :u1:Client_Sending_1 + u1:Client_Waiting_1 = 1
invariant :u4:Server_Anwering_4_1 + u4:Server_Anwering_3_1 + u4:Server_Anwering_2_1 + u4:Server_Anwering_1_1 + u4:Server_Waiting_1 = 1
invariant :u3:Client_Waiting_4 + u3:Client_Sending_4 = 1
invariant :u0:Server_Anwering_3_2 + u0:Server_Anwering_1_2 + u0:Server_Waiting_2 + u0:Server_Anwering_4_2 + u0:Server_Anwering_2_2 = 1
invariant :u6:Client_Sending_2 + u6:Client_Waiting_2 = 1
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.242142,22580,1,0,10573,1692,396,19565,182,10360,22806
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((u6.Client_Waiting_2>=1)||(u2.Client_Waiting_3>=1))||(u1.Client_Waiting_1>=1))||(u3.Client_Waiting_4>=1))"))
Formula 1 simplified : !"((((u6.Client_Waiting_2>=1)||(u2.Client_Waiting_3>=1))||(u1.Client_Waiting_1>=1))||(u3.Client_Waiting_4>=1))"
Computing Next relation with stutter on 1 deadlock states
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.243166,22844,1,0,10573,1692,407,19565,182,10360,22821
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G((X("(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"))U(F("((((u6.Client_Waiting_2>=1)||(u2.Client_Waiting_3>=1))||(u1.Client_Waiting_1>=1))||(u3.Client_Waiting_4>=1))"))))))
Formula 2 simplified : !G(X"(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))" U F"((((u6.Client_Waiting_2>=1)||(u2.Client_Waiting_3>=1))||(u1.Client_Waiting_1>=1))||(u3.Client_Waiting_4>=1))")
Computing Next relation with stutter on 1 deadlock states
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.252194,23104,1,0,11053,1871,422,20422,182,11487,23628
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"))
Formula 3 simplified : !"(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"
Computing Next relation with stutter on 1 deadlock states
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.254564,23268,1,0,11053,1871,463,20422,187,11487,23637
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"))
Formula 4 simplified : !"(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"
Computing Next relation with stutter on 1 deadlock states
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.256196,23268,1,0,11053,1871,463,20422,187,11487,23637
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((((((((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))||((u3.Client_Sending_4>=1)&&(u0.Server_Anwering_4_2>=1)))||((u4.Server_Anwering_1_1>=1)&&(u1.Client_Sending_1>=1)))||((u4.Server_Anwering_3_1>=1)&&(u2.Client_Sending_3>=1)))||((u4.Server_Anwering_2_1>=1)&&(u6.Client_Sending_2>=1)))||((u4.Server_Anwering_4_1>=1)&&(u3.Client_Sending_4>=1)))||((u0.Server_Anwering_1_2>=1)&&(u1.Client_Sending_1>=1)))||((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1)))"))
Formula 5 simplified : !"(((((((((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))||((u3.Client_Sending_4>=1)&&(u0.Server_Anwering_4_2>=1)))||((u4.Server_Anwering_1_1>=1)&&(u1.Client_Sending_1>=1)))||((u4.Server_Anwering_3_1>=1)&&(u2.Client_Sending_3>=1)))||((u4.Server_Anwering_2_1>=1)&&(u6.Client_Sending_2>=1)))||((u4.Server_Anwering_4_1>=1)&&(u3.Client_Sending_4>=1)))||((u0.Server_Anwering_1_2>=1)&&(u1.Client_Sending_1>=1)))||((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1)))"
Computing Next relation with stutter on 1 deadlock states
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.257591,23268,1,0,11053,1871,463,20422,187,11487,23658
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))")))
Formula 6 simplified : !X"(((((((((u5.RequestBuffer_4>=1)&&(u0.Server_Waiting_2>=1))||((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1)))||((u5.RequestBuffer_1>=1)&&(u4.Server_Waiting_1>=1)))||((u5.RequestBuffer_2>=1)&&(u0.Server_Waiting_2>=1)))||((u0.Server_Waiting_2>=1)&&(u5.RequestBuffer_1>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_4>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_3>=1)))||((u4.Server_Waiting_1>=1)&&(u5.RequestBuffer_2>=1)))"
Computing Next relation with stutter on 1 deadlock states
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.327603,24588,1,0,13625,1932,463,26840,187,12405,29359
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((((u5.RequestBuffer_4>=1)||(u5.RequestBuffer_2>=1))||(u5.RequestBuffer_3>=1))||(u5.RequestBuffer_1>=1))"))))
Formula 7 simplified : !XG"((((u5.RequestBuffer_4>=1)||(u5.RequestBuffer_2>=1))||(u5.RequestBuffer_3>=1))||(u5.RequestBuffer_1>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.329532,25096,1,0,13625,1932,480,26840,194,12405,29370
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1))")))
Formula 8 simplified : !X"((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1))"
Computing Next relation with stutter on 1 deadlock states
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,0.329954,25096,1,0,13625,1932,482,26840,194,12405,29379
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((F(F("(u2.Client_Waiting_3>=1)")))U(("(u5.RequestBuffer_4>=1)")U("(u1.Client_Waiting_1>=1)")))))
Formula 9 simplified : !G(F"(u2.Client_Waiting_3>=1)" U ("(u5.RequestBuffer_4>=1)" U "(u1.Client_Waiting_1>=1)"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.351136,25736,1,0,14419,2172,520,28865,194,14375,31164
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(F("((u5.RequestBufferSlots>=1)&&(u6.Client_Sending_2>=1))"))))
Formula 10 simplified : !F"((u5.RequestBufferSlots>=1)&&(u6.Client_Sending_2>=1))"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.372453,26264,1,0,15710,2189,537,31344,194,14937,33637
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(X(G("((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))")))))
Formula 11 simplified : !FXG"((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15 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.525535,31804,1,0,25984,2775,562,49695,194,19889,47940
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(u5.RequestBuffer_3>=1)"))
Formula 12 simplified : !"(u5.RequestBuffer_3>=1)"
Computing Next relation with stutter on 1 deadlock states
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.526049,31804,1,0,25984,2775,565,49695,194,19889,47944
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G((F("((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1))"))U(X("((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1))"))))))
Formula 13 simplified : !G(F"((u5.RequestBuffer_3>=1)&&(u0.Server_Waiting_2>=1))" U X"((u6.Client_Sending_2>=1)&&(u0.Server_Anwering_2_2>=1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.552288,32240,1,0,26532,2906,597,51073,194,20863,49057
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(X(G("(u6.Client_Waiting_2>=1)"))))))
Formula 14 simplified : !FXG"(u6.Client_Waiting_2>=1)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 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.591354,32768,1,0,27498,3092,615,53333,194,22338,50978
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(F((X("(u5.RequestBuffer_4>=1)"))U(F("((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))"))))))
Formula 15 simplified : !F(X"(u5.RequestBuffer_4>=1)" U F"((u2.Client_Sending_3>=1)&&(u0.Server_Anwering_3_2>=1))")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.65913,34880,1,0,30509,3315,642,60641,194,24820,56467
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527624692046

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 29, 2018 8:11:30 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 29, 2018 8:11:30 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 8:11:30 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
May 29, 2018 8:11:30 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 23 places.
May 29, 2018 8:11:30 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 transitions.
May 29, 2018 8:11:30 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
May 29, 2018 8:11:30 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 41 ms
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
Begin: Tue May 29 20:11:30 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Tue May 29 20:11:30 2018
network size: 23 nodes, 92 links, 48 weight
quality increased from -0.0577257 to 0.407552
end computation: Tue May 29 20:11:30 2018
level 1:
start computation: Tue May 29 20:11:30 2018
network size: 7 nodes, 35 links, 48 weight
quality increased from 0.407552 to 0.407552
end computation: Tue May 29 20:11:30 2018
End: Tue May 29 20:11:30 2018
Total duration: 0 sec
0.407552
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 29, 2018 8:11:30 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 8 redundant transitions.
May 29, 2018 8:11:30 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
May 29, 2018 8:11:30 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
May 29, 2018 8:11:31 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 28 transitions.
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 15 ms
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 102 ms
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 8:11:31 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 1) 1) (>= (select s0 5) 1)) (= (store (store (store (store s0 2 (+ (select s0 2) 1)) 1 (- (select s0 1) 1)) 6 (+ (select s0 6) 1)) 5 (- (select s0 5) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 1) 1) (>= (select s0 5) 1)) (= (store (store (store (store s0 2 (+ (select s0 2) 1)) 1 (- (select s0 1) 1)) 6 (+ (select s0 6) 1)) 5 (- (select s0 5) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 29, 2018 8:11:31 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 787ms conformant to PINS in folder :/home/mcc/execution

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="CSRepetitions-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is 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 r225-ebro-152732379600126"
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 ;