About the Execution of ITS-Tools.L for DLCround-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15749.660 | 68076.00 | 81783.00 | 601.30 | FFFTTTFFTTFTTFTT | 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 424K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 259K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DLCround-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264000171
=====================================================================
--------------------
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 DLCround-PT-05a-LTLCardinality-00
FORMULA_NAME DLCround-PT-05a-LTLCardinality-01
FORMULA_NAME DLCround-PT-05a-LTLCardinality-02
FORMULA_NAME DLCround-PT-05a-LTLCardinality-03
FORMULA_NAME DLCround-PT-05a-LTLCardinality-04
FORMULA_NAME DLCround-PT-05a-LTLCardinality-05
FORMULA_NAME DLCround-PT-05a-LTLCardinality-06
FORMULA_NAME DLCround-PT-05a-LTLCardinality-07
FORMULA_NAME DLCround-PT-05a-LTLCardinality-08
FORMULA_NAME DLCround-PT-05a-LTLCardinality-09
FORMULA_NAME DLCround-PT-05a-LTLCardinality-10
FORMULA_NAME DLCround-PT-05a-LTLCardinality-11
FORMULA_NAME DLCround-PT-05a-LTLCardinality-12
FORMULA_NAME DLCround-PT-05a-LTLCardinality-13
FORMULA_NAME DLCround-PT-05a-LTLCardinality-14
FORMULA_NAME DLCround-PT-05a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527872257991
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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(u79.p157>=1)"))
Formula 0 simplified : !"(u79.p157>=1)"
built 157 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
52 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.58061,23912,1,0,3118,532,3929,2560,382,751,12884
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((("(u7.p50>=1)")U("(u41.p119>=1)"))U(F(G("(u26.p104>=2)")))))
Formula 1 simplified : !(("(u7.p50>=1)" U "(u41.p119>=1)") U FG"(u26.p104>=2)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 138
// Phase 1: matrix 138 rows 167 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
24 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.8237,37656,1,0,37882,680,3954,45517,384,3194,56607
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("(u59.p137>=1)"))U(G("(u7.p54>=3)"))))
Formula 2 simplified : !(G"(u59.p137>=1)" U G"(u7.p54>=3)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.830482,38768,1,0,37882,680,3987,45517,386,3194,56788
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("((u7.p51==0)||(u41.p119==1))"))U("((u4.p27==0)||(u2.p12==1))")))
Formula 3 simplified : !(X"((u7.p51==0)||(u41.p119==1))" U "((u4.p27==0)||(u2.p12==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.831912,38768,1,0,37882,680,3994,45517,388,3194,56881
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("((u34.p112==0)||(u57.p135==1))")U("((u85.p163==0)||(u59.p137==1))")))
Formula 4 simplified : !("((u34.p112==0)||(u57.p135==1))" U "((u85.p163==0)||(u59.p137==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.833369,38768,1,0,37882,680,4011,45517,390,3194,56927
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((F("(u7.p57>=1)"))U(X("((u21.p99==0)||(u47.p125==1))")))))
Formula 5 simplified : !G(F"(u7.p57>=1)" U X"((u21.p99==0)||(u47.p125==1))")
4 unique states visited
0 strongly connected components in search stack
6 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.840894,39004,1,0,38640,690,4022,46442,391,3282,58670
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X(G("((u5.p34==0)||(u7.p50==1))"))))))
Formula 6 simplified : !GXXG"((u5.p34==0)||(u7.p50==1))"
invariant :u18:p96 + u89:p0 = 1
invariant :u12:p90 + u89:p0 = 1
invariant :u47:p125 + u89:p0 = 1
invariant :u34:p112 + u89:p0 = 1
invariant :u41:p119 + u89:p0 = 1
invariant :u78:p156 + u89:p0 = 1
invariant :u16:p94 + u89:p0 = 1
invariant :u58:p136 + u89:p0 = 1
invariant :u85:p163 + u89:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u89:p0 = 1
invariant :u27:p105 + u89:p0 = 1
invariant :u48:p126 + u89:p0 = 1
invariant :u70:p148 + u89:p0 = 1
invariant :u20:p98 + u89:p0 = 1
invariant :u50:p128 + u89:p0 = 1
invariant :u76:p154 + u89:p0 = 1
invariant :u65:p143 + u89:p0 = 1
invariant :u80:p158 + u89:p0 = 1
invariant :u30:p108 + u89:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u89:p0 = 1
invariant :u86:p164 + u89:p0 = 1
invariant :u51:p129 + u89:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u89:p0 = 1
invariant :u81:p159 + u89:p0 = 1
invariant :u84:p162 + u89:p0 = 1
invariant :u39:p117 + u89:p0 = 1
invariant :u13:p91 + u89:p0 = 1
invariant :u24:p102 + u89:p0 = 1
invariant :u46:p124 + u89:p0 = 1
invariant :u60:p138 + u89:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u89:p0 = 1
invariant :u63:p141 + u89:p0 = 1
invariant :u69:p147 + u89:p0 = 1
invariant :u26:p104 + u89:p0 = 1
invariant :u75:p153 + u89:p0 = 1
invariant :u56:p134 + u89:p0 = 1
invariant :u45:p123 + u89:p0 = 1
invariant :u38:p116 + u89:p0 = 1
invariant :u83:p161 + u89:p0 = 1
invariant :u59:p137 + u89:p0 = 1
invariant :u53:p131 + u89:p0 = 1
invariant :u62:p140 + u89:p0 = 1
invariant :u67:p145 + u89:p0 = 1
invariant :u42:p120 + u89:p0 = 1
invariant :u29:p107 + u89:p0 = 1
invariant :u31:p109 + u89:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u89:p0 = 1
invariant :u68:p146 + u89:p0 = 1
invariant :u88:p166 + u89:p0 = 1
invariant :u54:p132 + u89:p0 = 1
invariant :u23:p101 + u89:p0 = 1
invariant :u77:p155 + u89:p0 = 1
invariant :u44:p122 + u89:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u89:p0 = 1
invariant :u17:p95 + u89:p0 = 1
invariant :u32:p110 + u89:p0 = 1
invariant :u61:p139 + u89:p0 = 1
invariant :u21:p99 + u89:p0 = 1
invariant :u57:p135 + u89:p0 = 1
invariant :u64:p142 + u89:p0 = 1
invariant :u14:p92 + u89:p0 = 1
invariant :u11:p89 + u89:p0 = 1
invariant :u71:p149 + u89:p0 = 1
invariant :u52:p130 + u89:p0 = 1
invariant :u19:p97 + u89:p0 = 1
invariant :u74:p152 + u89:p0 = 1
invariant :u15:p93 + u89:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u89:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u89:p0 = 1
invariant :u37:p115 + u89:p0 = 1
invariant :u43:p121 + u89:p0 = 1
invariant :u66:p144 + u89:p0 = 1
invariant :u28:p106 + u89:p0 = 1
invariant :u87:p165 + u89:p0 = 1
invariant :u25:p103 + u89:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u89:p0 = 1
invariant :u22:p100 + u89:p0 = 1
invariant :u33:p111 + u89:p0 = 1
invariant :u35:p113 + u89:p0 = 1
invariant :u40:p118 + u89:p0 = 1
invariant :u55:p133 + u89:p0 = 1
invariant :u82:p160 + u89:p0 = 1
invariant :u49:p127 + u89:p0 = 1
invariant :u36:p114 + u89:p0 = 1
invariant :u79:p157 + u89:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u89:p0 = 1
invariant :u73:p151 + u89:p0 = 1
invariant :u72:p150 + u89:p0 = 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.955253,41856,1,0,43630,733,4242,52888,393,3852,67534
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(G(F(F("(u6.p40>=1)"))))))
Formula 7 simplified : !GF"(u6.p40>=1)"
4 unique states visited
4 strongly connected components in search stack
5 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,1.02664,43964,1,0,44569,733,4407,54654,394,3859,69412
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(("((u7.p57==0)||(u71.p149==1))")U("((u9.p69==0)||(u5.p37==1))")))))
Formula 8 simplified : !FX("((u7.p57==0)||(u71.p149==1))" U "((u9.p69==0)||(u5.p37==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,1.03575,44228,1,0,44569,733,4433,54654,395,3859,69491
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((u49.p127==0)||(u9.p70==1))"))
Formula 9 simplified : !"((u49.p127==0)||(u9.p70==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,1.03714,44492,1,0,44569,733,4438,54654,395,3859,69540
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(X(F("(u8.p62>=3)"))))))
Formula 10 simplified : !FGXF"(u8.p62>=3)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.09336,45272,1,0,44682,733,4560,54776,397,3859,69870
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(F("((u48.p126==0)||(u4.p22==1))")))U("((u57.p135==0)||(u3.p15==1))")))
Formula 11 simplified : !(GF"((u48.p126==0)||(u4.p22==1))" U "((u57.p135==0)||(u3.p15==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,1.09707,45764,1,0,44682,733,4572,54776,397,3859,69994
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((u3.p16==0)||(u59.p137==1))")))
Formula 12 simplified : !F"((u3.p16==0)||(u59.p137==1))"
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,1.10614,45764,1,0,44682,733,4592,54776,397,3859,70086
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X("(u5.p35>=1)"))))
Formula 13 simplified : !FX"(u5.p35>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 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,1.28297,47348,1,0,46791,737,4723,58035,398,3917,74029
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((F("(u2.p14>=1)"))U(F("(u68.p146>=1)")))))
Formula 14 simplified : !F(F"(u2.p14>=1)" U F"(u68.p146>=1)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.30988,48140,1,0,46791,737,4776,58037,398,3917,74144
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F((G("(u37.p115>=2)"))U("((u3.p15==0)||(u26.p104==1))"))))
Formula 15 simplified : !F(G"(u37.p115>=2)" U "((u3.p15==0)||(u26.p104==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,1.31756,48404,1,0,46791,737,4797,58037,398,3917,74237
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DLCround-PT-05a-LTLCardinality-15 TRUE 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 1527872326067
--------------------
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 LTLCardinality -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 LTLCardinality -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 01, 2018 4:57:40 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 01, 2018 4:57:40 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 4:57:40 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 224 ms
Jun 01, 2018 4:57:40 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 167 places.
Jun 01, 2018 4:57:41 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1055 transitions.
Jun 01, 2018 4:57:41 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2018 4:57:41 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 58 ms
Jun 01, 2018 4:57:41 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 4:57:41 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 460 ms
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 198 ms
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 151 ms
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 1614 redundant transitions.
Jun 01, 2018 4:57:42 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
Jun 01, 2018 4:57:42 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 112 identical transitions.
Jun 01, 2018 4:57:42 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 943 transitions.
Jun 01, 2018 4:57:43 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 88 place invariants in 68 ms
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 167 variables to be positive in 598 ms
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 943 transitions.
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/943 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 90 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 943 transitions.
Jun 01, 2018 4:57:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 4:57:45 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 943 transitions.
Jun 01, 2018 4:57:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(5/943) took 1301 ms. Total solver calls (SAT/UNSAT): 1557(61/1496)
Jun 01, 2018 4:57:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(30/943) took 4345 ms. Total solver calls (SAT/UNSAT): 4392(549/3843)
Jun 01, 2018 4:57:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(56/943) took 7413 ms. Total solver calls (SAT/UNSAT): 7356(1078/6278)
Jun 01, 2018 4:57:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(87/943) took 10417 ms. Total solver calls (SAT/UNSAT): 10812(1691/9121)
Jun 01, 2018 4:57:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(115/943) took 13438 ms. Total solver calls (SAT/UNSAT): 13841(2209/11632)
Jun 01, 2018 4:58:02 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(143/943) took 16446 ms. Total solver calls (SAT/UNSAT): 16845(2740/14105)
Jun 01, 2018 4:58:05 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(172/943) took 19504 ms. Total solver calls (SAT/UNSAT): 19874(3255/16619)
Jun 01, 2018 4:58:08 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(208/943) took 22511 ms. Total solver calls (SAT/UNSAT): 22757(3774/18983)
Jun 01, 2018 4:58:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(249/943) took 25523 ms. Total solver calls (SAT/UNSAT): 25689(4338/21351)
Jun 01, 2018 4:58:14 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(292/943) took 28584 ms. Total solver calls (SAT/UNSAT): 28637(4902/23735)
Jun 01, 2018 4:58:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(337/943) took 31648 ms. Total solver calls (SAT/UNSAT): 31643(5466/26177)
Jun 01, 2018 4:58:20 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(379/943) took 34676 ms. Total solver calls (SAT/UNSAT): 34589(5963/28626)
Jun 01, 2018 4:58:23 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(424/943) took 37742 ms. Total solver calls (SAT/UNSAT): 37478(6455/31023)
Jun 01, 2018 4:58:26 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(470/943) took 40757 ms. Total solver calls (SAT/UNSAT): 40467(6919/33548)
Jun 01, 2018 4:58:29 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(527/943) took 43786 ms. Total solver calls (SAT/UNSAT): 42804(7675/35129)
Jun 01, 2018 4:58:32 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(590/943) took 46832 ms. Total solver calls (SAT/UNSAT): 45003(8386/36617)
Jun 01, 2018 4:58:35 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(657/943) took 49847 ms. Total solver calls (SAT/UNSAT): 47184(8988/38196)
Jun 01, 2018 4:58:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(723/943) took 52873 ms. Total solver calls (SAT/UNSAT): 49509(9440/40069)
Jun 01, 2018 4:58:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(801/943) took 55889 ms. Total solver calls (SAT/UNSAT): 51711(9823/41888)
Jun 01, 2018 4:58:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 58682 ms. Total solver calls (SAT/UNSAT): 52806(9926/42880)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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 01, 2018 4:58:44 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 62108ms 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="DLCround-PT-05a"
export BK_EXAMINATION="LTLCardinality"
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/DLCround-PT-05a.tgz
mv DLCround-PT-05a 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 DLCround-PT-05a, 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 r213-smll-152732264000171"
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 ;