About the Execution of ITS-Tools for S_SharedMemory-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
311.910 | 4649.00 | 10058.00 | 284.90 | FTTFFTTFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is S_SharedMemory-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444111800752
=====================================================================
--------------------
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 SharedMemory-COL-000005-LTLCardinality-0
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-1
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-10
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-11
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-12
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-13
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-14
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-15
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-2
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-3
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-4
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-5
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-6
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-7
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-8
FORMULA_NAME SharedMemory-COL-000005-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464623839656
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/LTLCardinality.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((G(X("3<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)")))U(G("2<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)"))))
Formula 0 simplified : !(GX"3<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)" U G"2<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.175638,29388,1,0,14,18849,36,2,1256,12914,51
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("1<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)")))
Formula 1 simplified : !F"1<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.176351,29480,1,0,14,18849,45,2,1262,12914,55
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)")))
Formula 2 simplified : !G"((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)"
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.228457,30236,1,0,19,22023,51,8,1398,18324,88
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X("2<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)")))
Formula 3 simplified : !X"2<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"
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.231703,30516,1,0,20,22123,54,8,1419,18448,95
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F("2<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)")))
Formula 4 simplified : !F"2<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.270022,31784,1,0,29,26224,63,12,1434,25065,129
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(F(G(X("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"))))))
Formula 5 simplified : !GFGX"((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"
2 unique states visited
1 strongly connected components in search stack
3 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.289508,32136,1,0,29,26248,68,12,1702,25131,139
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(G(("2<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)")U("Ext_Bus<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)")))))
Formula 6 simplified : !FG("2<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)" U "Ext_Bus<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)")
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.299667,32576,1,0,33,26489,82,12,1767,25858,161
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((G(F("(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)<=Ext_Bus")))U(("1<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)")U("3<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)"))))
Formula 7 simplified : !(GF"(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)<=Ext_Bus" U ("1<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)" U "3<=((((OwnMemAcc_1+OwnMemAcc_4)+OwnMemAcc_5)+OwnMemAcc_2)+OwnMemAcc_3)"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.33455,33988,1,0,38,27454,95,16,1868,27482,198
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("1<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"))
Formula 8 simplified : !"1<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"
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.33617,34016,1,0,38,27454,98,16,1888,27482,200
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(F(G("1<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)")))))
Formula 9 simplified : !FG"1<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.441576,37120,1,0,50,33368,108,25,1916,40270,260
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)"))
Formula 10 simplified : !"((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)"
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.44304,37120,1,0,50,33368,111,25,1927,40270,262
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)"))
Formula 11 simplified : !"((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=((((Queue_1+Queue_2)+Queue_5)+Queue_3)+Queue_4)"
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.444024,37256,1,0,50,33368,114,25,1938,40270,264
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(X(G(G("2<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)"))))))
Formula 12 simplified : !FXG"2<=((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)"
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.484212,37396,1,0,62,35282,127,35,1972,46423,317
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("1<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)"))
Formula 13 simplified : !"1<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)"
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.484914,37396,1,0,62,35282,130,35,1978,46423,319
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(G(("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=Ext_Bus")U("3<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)")))))
Formula 14 simplified : !G("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=Ext_Bus" U "3<=((((Memory_2+Memory_1)+Memory_4)+Memory_3)+Memory_5)")
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 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.503529,38040,1,0,62,35388,146,35,2070,46591,339
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(G(F("((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)")))))
Formula 15 simplified : !GF"((((Active_1+Active_3)+Active_2)+Active_4)+Active_5)<=(((((((((((((((((((Ext_Mem_Acc_2_1+Ext_Mem_Acc_3_1)+Ext_Mem_Acc_4_1)+Ext_Mem_Acc_5_1)+Ext_Mem_Acc_1_2)+Ext_Mem_Acc_3_2)+Ext_Mem_Acc_4_2)+Ext_Mem_Acc_5_2)+Ext_Mem_Acc_1_3)+Ext_Mem_Acc_2_3)+Ext_Mem_Acc_4_3)+Ext_Mem_Acc_5_3)+Ext_Mem_Acc_1_4)+Ext_Mem_Acc_3_4)+Ext_Mem_Acc_2_4)+Ext_Mem_Acc_1_5)+Ext_Mem_Acc_5_4)+Ext_Mem_Acc_3_5)+Ext_Mem_Acc_2_5)+Ext_Mem_Acc_4_5)"
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.505442,38064,1,0,62,35388,150,35,2070,46591,342
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA SharedMemory-COL-000005-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1464623844305
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its
+ 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 LTLCardinality -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 30, 2016 3:57:22 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 30, 2016 3:57:23 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 44 ms
May 30, 2016 3:57:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 places.
May 30, 2016 3:57:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 55 transitions.
May 30, 2016 3:57:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 82 ms
May 30, 2016 3:57:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 13 ms
May 30, 2016 3:57:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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_SharedMemory-PT-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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_SharedMemory-PT-000005.tgz
mv S_SharedMemory-PT-000005 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_SharedMemory-PT-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181kn-smll-146444111800752"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;