fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r237-blw3-152732477600012
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for DatabaseWithMutex-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15755.940 2624.00 4559.00 91.30 FFFFTTTTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DatabaseWithMutex-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-blw3-152732477600012
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527983002852

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/graph7147722814953863842.txt, -o, /tmp/graph7147722814953863842.bin, -w, /tmp/graph7147722814953863842.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/graph7147722814953863842.bin, -l, -1, -v, -w, /tmp/graph7147722814953863842.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 : !(("((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))"))
Formula 0 simplified : !"((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))"
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.04734,16684,1,0,729,77,478,757,75,152,2285
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G("((((i3.u5.Modify_1_1>=1)||(i6.u13.Modify_1_2>=1))||(i0.u0.Modify_2_2>=1))||(i1.u2.Modify_2_1>=1))"))))
Formula 1 simplified : !XG"((((i3.u5.Modify_1_1>=1)||(i6.u13.Modify_1_2>=1))||(i0.u0.Modify_2_2>=1))||(i1.u2.Modify_2_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,0.049738,17108,1,0,764,77,505,770,75,152,2496
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X(X(X(X("(((((i2.u10.all_passive_1>=1)&&(u6.RecBuff_1_2>=1))||((i5.u9.all_passive_2>=1)&&(i6.u12.RecBuff_2_2>=1)))||((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1)))||((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_1>=1)))")))))))
Formula 2 simplified : !XXXXX"(((((i2.u10.all_passive_1>=1)&&(u6.RecBuff_1_2>=1))||((i5.u9.all_passive_2>=1)&&(i6.u12.RecBuff_2_2>=1)))||((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1)))||((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_1>=1)))"
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 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.053479,17480,1,0,1032,78,531,940,75,154,3795
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("((((i5.u9.updating_2_1>=1)||(i2.u10.updating_1_1>=1))||(i2.u10.updating_1_2>=1))||(i5.u9.updating_2_2>=1))")))
Formula 3 simplified : !X"((((i5.u9.updating_2_1>=1)||(i2.u10.updating_1_1>=1))||(i2.u10.updating_1_2>=1))||(i5.u9.updating_2_2>=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,0.054129,17480,1,0,1032,78,548,940,76,154,3811
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(("((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))")U(X("((((i5.u9.updating_2_1>=1)||(i2.u10.updating_1_1>=1))||(i2.u10.updating_1_2>=1))||(i5.u9.updating_2_2>=1))")))))
Formula 4 simplified : !F("((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))" U X"((((i5.u9.updating_2_1>=1)||(i2.u10.updating_1_1>=1))||(i2.u10.updating_1_2>=1))||(i5.u9.updating_2_2>=1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.056586,17480,1,0,1408,78,569,1195,76,154,4909
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X(X(F("((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))")))))))
Formula 5 simplified : !FGXXF"((((i1.u7.Message_1_1>=1)||(i3.u8.Message_2_1>=1))||(i6.u12.Message_2_2>=1))||(u6.Message_1_2>=1))"
3 unique states visited
0 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.063286,18056,1,0,2147,78,590,1750,76,154,6807
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(("(((((i6.u13.Active_1_2>=1)&&(i5.u14.Acknowledge_2_2>=1))||((i0.u0.Active_2_2>=1)&&(i2.u3.Acknowledge_1_2>=1)))||((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1)))||((i1.u2.Active_2_1>=1)&&(i2.u15.Acknowledge_1_1>=1)))")U("(((((i6.u13.Active_1_2>=1)&&(i5.u14.Acknowledge_2_2>=1))||((i0.u0.Active_2_2>=1)&&(i2.u3.Acknowledge_1_2>=1)))||((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1)))||((i1.u2.Active_2_1>=1)&&(i2.u15.Acknowledge_1_1>=1)))")))U("(((((i2.u10.all_passive_1>=1)&&(u6.RecBuff_1_2>=1))||((i5.u9.all_passive_2>=1)&&(i6.u12.RecBuff_2_2>=1)))||((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1)))||((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_1>=1)))")))
Formula 6 simplified : !(F"(((((i6.u13.Active_1_2>=1)&&(i5.u14.Acknowledge_2_2>=1))||((i0.u0.Active_2_2>=1)&&(i2.u3.Acknowledge_1_2>=1)))||((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1)))||((i1.u2.Active_2_1>=1)&&(i2.u15.Acknowledge_1_1>=1)))" U "(((((i2.u10.all_passive_1>=1)&&(u6.RecBuff_1_2>=1))||((i5.u9.all_passive_2>=1)&&(i6.u12.RecBuff_2_2>=1)))||((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1)))||((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_1>=1)))")
15 unique states visited
0 strongly connected components in search stack
14 transitions explored
8 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.083112,19076,1,0,4654,78,645,4087,76,154,14446
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((G(X("((((i3.u1.all_active_1>=1)||(i0.u4.all_active_2>=1))||(i0.u4.all_active_2>=1))||(i3.u1.all_active_1>=1))")))U("((((i3.u1.all_active_1>=1)||(i0.u4.all_active_2>=1))||(i0.u4.all_active_2>=1))||(i3.u1.all_active_1>=1))"))))
Formula 7 simplified : !F(GX"((((i3.u1.all_active_1>=1)||(i0.u4.all_active_2>=1))||(i0.u4.all_active_2>=1))||(i3.u1.all_active_1>=1))" U "((((i3.u1.all_active_1>=1)||(i0.u4.all_active_2>=1))||(i0.u4.all_active_2>=1))||(i3.u1.all_active_1>=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.083919,19340,1,0,4654,78,666,4087,76,154,14463
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(G(F("(i3.u1.all_active_1>=1)"))))))
Formula 8 simplified : !FGF"(i3.u1.all_active_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.084949,19340,1,0,4701,78,691,4138,77,154,14607
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((X(F("((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1))")))U(F("(i1.u2.Modify_2_1>=1)")))))
Formula 9 simplified : !G(XF"((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1))" U F"(i1.u2.Modify_2_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.086446,19520,1,0,4796,78,715,4238,77,154,14859
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(("(i1.u7.Message_1_1>=1)")U("(i6.u13.Modify_1_2>=1)")))U(G(F(F("(i1.u2.Modify_2_1>=1)"))))))
Formula 10 simplified : !(F("(i1.u7.Message_1_1>=1)" U "(i6.u13.Modify_1_2>=1)") U GF"(i1.u2.Modify_2_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.087201,19668,1,0,4796,78,715,4238,77,154,14859
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((F(G("(i5.u11.MesBuffReply_2_1>=1)")))U(G(X("(i5.u14.MesBuffReply_2_2>=1)"))))))
Formula 11 simplified : !F(FG"(i5.u11.MesBuffReply_2_1>=1)" U GX"(i5.u14.MesBuffReply_2_2>=1)")
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.088274,19956,1,0,4821,78,733,4271,77,154,14945
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G((G("((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1))"))U("(i5.u9.updating_2_2>=1)")))))
Formula 12 simplified : !XG(G"((i3.u5.Active_1_1>=1)&&(i5.u11.Acknowledge_2_1>=1))" U "(i5.u9.updating_2_2>=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,0.09027,20416,1,0,4821,78,764,4271,78,154,14977
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_1>=1))"))
Formula 13 simplified : !"((i5.u9.all_passive_2>=1)&&(i3.u8.RecBuff_2_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.090622,20416,1,0,4821,78,766,4271,78,154,14981
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((G("(i2.u3.MesBuffReply_1_2>=1)"))U(X("(i5.u11.MesBuffReply_2_1>=1)")))U(F(G("((i0.u4.WaitMutex_2_1>=1)&&(i1.u2.Mutex_1>=1))")))))
Formula 14 simplified : !((G"(i2.u3.MesBuffReply_1_2>=1)" U X"(i5.u11.MesBuffReply_2_1>=1)") U FG"((i0.u4.WaitMutex_2_1>=1)&&(i1.u2.Mutex_1>=1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
// Phase 1: matrix 32 rows 38 cols
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.09581,21008,1,0,5617,78,795,4840,78,159,16834
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G(X("((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1))")))U("(i2.u10.updating_1_2>=1)")))
Formula 15 simplified : !(GX"((i2.u10.all_passive_1>=1)&&(i1.u7.RecBuff_1_1>=1))" U "(i2.u10.updating_1_2>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.098053,21184,1,0,5742,78,835,4992,78,159,17260
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
invariant :i0:u0:Mutex_2 + -1'i0:u4:WaitMutex_2_2 + -1'i0:u4:all_active_2 + -1'i0:u4:WaitMutex_2_1 + i1:u2:Mutex_1 + i3:u5:Modify_1_1 + i3:u8:RecBuff_2_1 + i3:u8:Message_2_1 + i5:u9:updating_2_1 + i5:u11:MesBuffReply_2_1 + i5:u11:Acknowledge_2_1 + i6:u13:Active_1_2 + i6:u13:Modify_1_2 = 1
invariant :u6:Message_1_2 + u6:RecBuff_1_2 + -1'i0:u0:Active_2_2 + i2:u3:MesBuffReply_1_2 + i2:u3:Acknowledge_1_2 + i2:u10:updating_1_2 = 0
invariant :i5:u9:all_passive_2 + i5:u9:updating_2_1 + -1'i5:u14:Acknowledge_2_2 + -1'i5:u14:MesBuffReply_2_2 + -1'i6:u12:Message_2_2 + -1'i6:u12:RecBuff_2_2 + i6:u13:Active_1_2 = 1
invariant :i5:u9:updating_2_2 + i5:u14:Acknowledge_2_2 + i5:u14:MesBuffReply_2_2 + i6:u12:Message_2_2 + i6:u12:RecBuff_2_2 + -1'i6:u13:Active_1_2 = 0
invariant :i3:u1:WaitMutex_1_1 + i3:u1:all_active_1 + i3:u1:WaitMutex_1_2 + i3:u5:Modify_1_1 + i3:u8:RecBuff_2_1 + i3:u8:Message_2_1 + i5:u9:updating_2_1 + i5:u11:MesBuffReply_2_1 + i5:u11:Acknowledge_2_1 + i6:u13:Active_1_2 + i6:u13:Modify_1_2 = 1
invariant :i2:u10:updating_1_1 + i2:u10:updating_1_2 + i2:u10:all_passive_1 = 1
invariant :i1:u2:Modify_2_1 + i1:u2:Mutex_1 + i1:u7:RecBuff_1_1 + i1:u7:Message_1_1 + -1'i2:u10:updating_1_2 + -1'i2:u10:all_passive_1 + i2:u15:Acknowledge_1_1 + i2:u15:MesBuffReply_1_1 + i3:u5:Modify_1_1 + i3:u8:RecBuff_2_1 + i3:u8:Message_2_1 + i5:u9:updating_2_1 + i5:u11:MesBuffReply_2_1 + i5:u11:Acknowledge_2_1 = 0
invariant :i3:u5:Active_1_1 + -1'i3:u8:RecBuff_2_1 + -1'i3:u8:Message_2_1 + -1'i5:u9:updating_2_1 + -1'i5:u11:MesBuffReply_2_1 + -1'i5:u11:Acknowledge_2_1 = 0
invariant :i0:u0:Modify_2_2 + i0:u0:Active_2_2 + i0:u4:WaitMutex_2_2 + i0:u4:all_active_2 + i0:u4:WaitMutex_2_1 + -1'i1:u2:Mutex_1 + -1'i3:u5:Modify_1_1 + -1'i3:u8:RecBuff_2_1 + -1'i3:u8:Message_2_1 + -1'i5:u9:updating_2_1 + -1'i5:u11:MesBuffReply_2_1 + -1'i5:u11:Acknowledge_2_1 = 0
invariant :i1:u2:Active_2_1 + -1'i1:u7:RecBuff_1_1 + -1'i1:u7:Message_1_1 + i2:u10:updating_1_2 + i2:u10:all_passive_1 + -1'i2:u15:Acknowledge_1_1 + -1'i2:u15:MesBuffReply_1_1 = 1
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 1527983005476

--------------------
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
Jun 02, 2018 11:43:24 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]
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 34 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 38 places.
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 transitions.
Jun 02, 2018 11:43:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Begin: Sat Jun 2 23:43:24 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 23:43:24 2018
network size: 38 nodes, 112 links, 64 weight
quality increased from -0.0280762 to 0.540039
end computation: Sat Jun 2 23:43:24 2018
level 1:
start computation: Sat Jun 2 23:43:24 2018
network size: 16 nodes, 68 links, 64 weight
quality increased from 0.540039 to 0.604004
end computation: Sat Jun 2 23:43:24 2018
level 2:
start computation: Sat Jun 2 23:43:24 2018
network size: 7 nodes, 31 links, 64 weight
quality increased from 0.604004 to 0.604004
end computation: Sat Jun 2 23:43:24 2018
End: Sat Jun 2 23:43:24 2018
Total duration: 0 sec
0.604004
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2 redundant transitions.
Jun 02, 2018 11:43:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 02, 2018 11:43:24 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 32 transitions.
Jun 02, 2018 11:43:25 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 16 ms
Skipping mayMatrices nes/nds SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: SMT solver raised an error :(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.computeAndDeclareInvariants(KInductionSolver.java:293)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:71)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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)
Jun 02, 2018 11:43:25 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 149ms 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="DatabaseWithMutex-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/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-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 DatabaseWithMutex-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 r237-blw3-152732477600012"
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 ;