fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r248-blw7-152732549700066
Last Updated
June 26, 2018

About the Execution of ITS-Tools for FlexibleBarrier-PT-22a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15754.190 11283.00 26928.00 123.90 FFFFFFFFFFFFFFFF 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 544K
-rw-r--r-- 1 mcc users 3.2K 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 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 384K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is FlexibleBarrier-PT-22a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-blw7-152732549700066
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527966872632

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.201805151631/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.201805151631/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(F((G("(((u16.p192>=1)&&(u18.p215>=1))&&(u23.p265>=1))"))U(G("(((u9.p108>=1)&&(u22.p263>=1))&&(u23.p265>=1))"))))))
Formula 0 simplified : !XF(G"(((u16.p192>=1)&&(u18.p215>=1))&&(u23.p265>=1))" U G"(((u9.p108>=1)&&(u22.p263>=1))&&(u23.p265>=1))")
built 276 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 794
// Phase 1: matrix 794 rows 267 cols
invariant :u6:p61 + u6:p62 + u6:p63 + u6:p64 + u6:p65 + u6:p66 + u6:p67 + u6:p68 + u6:p69 + u6:p70 + u6:p71 + u6:p72 + u25:p0 = 1
invariant :u3:p25 + u3:p26 + u3:p27 + u3:p28 + u3:p29 + u3:p30 + u3:p31 + u3:p32 + u3:p33 + u3:p34 + u3:p35 + u3:p36 + u25:p0 = 1
invariant :u13:p145 + u13:p146 + u13:p147 + u13:p148 + u13:p149 + u13:p150 + u13:p151 + u13:p152 + u13:p153 + u13:p154 + u13:p155 + u13:p156 + u25:p0 = 1
invariant :u4:p37 + u4:p38 + u4:p39 + u4:p40 + u4:p41 + u4:p42 + u4:p43 + u4:p44 + u4:p45 + u4:p46 + u4:p47 + u4:p48 + u25:p0 = 1
invariant :u2:p13 + u2:p14 + u2:p15 + u2:p16 + u2:p17 + u2:p18 + u2:p19 + u2:p20 + u2:p21 + u2:p22 + u2:p23 + u2:p24 + u25:p0 = 1
invariant :u9:p97 + u9:p98 + u9:p99 + u9:p100 + u9:p101 + u9:p102 + u9:p103 + u9:p104 + u9:p105 + u9:p106 + u9:p107 + u9:p108 + u25:p0 = 1
invariant :u22:p253 + u22:p254 + u22:p255 + u22:p256 + u22:p257 + u22:p258 + u22:p259 + u22:p260 + u22:p261 + u22:p262 + u22:p263 + u22:p264 + u25:p0 = 1
invariant :u19:p217 + u19:p218 + u19:p219 + u19:p220 + u19:p221 + u19:p222 + u19:p223 + u19:p224 + u19:p225 + u19:p226 + u19:p227 + u19:p228 + u25:p0 = 1
invariant :u20:p229 + u20:p230 + u20:p231 + u20:p232 + u20:p233 + u20:p234 + u20:p235 + u20:p236 + u20:p237 + u20:p238 + u20:p239 + u20:p240 + u25:p0 = 1
invariant :u18:p205 + u18:p206 + u18:p207 + u18:p208 + u18:p209 + u18:p210 + u18:p211 + u18:p212 + u18:p213 + u18:p214 + u18:p215 + u18:p216 + u25:p0 = 1
invariant :u5:p49 + u5:p50 + u5:p51 + u5:p52 + u5:p53 + u5:p54 + u5:p55 + u5:p56 + u5:p57 + u5:p58 + u5:p59 + u5:p60 + u25:p0 = 1
invariant :u15:p169 + u15:p170 + u15:p171 + u15:p172 + u15:p173 + u15:p174 + u15:p175 + u15:p176 + u15:p177 + u15:p178 + u15:p179 + u15:p180 + u25:p0 = 1
invariant :u16:p181 + u16:p182 + u16:p183 + u16:p184 + u16:p185 + u16:p186 + u16:p187 + u16:p188 + u16:p189 + u16:p190 + u16:p191 + u16:p192 + u25:p0 = 1
invariant :u23:p265 + u25:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u1:p8 + u1:p9 + u1:p10 + u1:p11 + u1:p12 + u25:p0 = 1
invariant :u14:p157 + u14:p158 + u14:p159 + u14:p160 + u14:p161 + u14:p162 + u14:p163 + u14:p164 + u14:p165 + u14:p166 + u14:p167 + u14:p168 + u25:p0 = 1
invariant :u11:p121 + u11:p122 + u11:p123 + u11:p124 + u11:p125 + u11:p126 + u11:p127 + u11:p128 + u11:p129 + u11:p130 + u11:p131 + u11:p132 + u25:p0 = 1
invariant :u21:p241 + u21:p242 + u21:p243 + u21:p244 + u21:p245 + u21:p246 + u21:p247 + u21:p248 + u21:p249 + u21:p250 + u21:p251 + u21:p252 + u25:p0 = 1
invariant :u12:p133 + u12:p134 + u12:p135 + u12:p136 + u12:p137 + u12:p138 + u12:p139 + u12:p140 + u12:p141 + u12:p142 + u12:p143 + u12:p144 + u25:p0 = 1
invariant :u10:p109 + u10:p110 + u10:p111 + u10:p112 + u10:p113 + u10:p114 + u10:p115 + u10:p116 + u10:p117 + u10:p118 + u10:p119 + u10:p120 + u25:p0 = 1
invariant :u24:p266 + u25:p0 = 1
invariant :u7:p73 + u7:p74 + u7:p75 + u7:p76 + u7:p77 + u7:p78 + u7:p79 + u7:p80 + u7:p81 + u7:p82 + u7:p83 + u7:p84 + u25:p0 = 1
invariant :u17:p193 + u17:p194 + u17:p195 + u17:p196 + u17:p197 + u17:p198 + u17:p199 + u17:p200 + u17:p201 + u17:p202 + u17:p203 + u17:p204 + u25:p0 = 1
invariant :u8:p85 + u8:p86 + u8:p87 + u8:p88 + u8:p89 + u8:p90 + u8:p91 + u8:p92 + u8:p93 + u8:p94 + u8:p95 + u8:p96 + u25:p0 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
173 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.83185,95228,1,0,182859,1340,3461,157749,293,9193,144632
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(("(((u6.p71>=1)&&(u19.p228>=1))&&(u23.p265>=1))")U(G(G("((u24.p266>=1)&&(u10.p117>=1))"))))))
Formula 1 simplified : !X("(((u6.p71>=1)&&(u19.p228>=1))&&(u23.p265>=1))" U G"((u24.p266>=1)&&(u10.p117>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10 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.93101,100476,1,0,194925,1503,3714,168645,307,10784,158688
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F((F("(((u19.p227>=1)&&(u20.p240>=1))&&(u23.p265>=1))"))U(G("(((u2.p23>=1)&&(u11.p132>=1))&&(u23.p265>=1))"))))))
Formula 2 simplified : !XF(F"(((u19.p227>=1)&&(u20.p240>=1))&&(u23.p265>=1))" U G"(((u2.p23>=1)&&(u11.p132>=1))&&(u23.p265>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
171 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,3.64389,171088,1,0,353293,1568,3750,321650,307,12709,269305
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("((u21.p247>=1)&&(u24.p266>=1))"))
Formula 3 simplified : !"((u21.p247>=1)&&(u24.p266>=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,3.6446,171352,1,0,353293,1568,3756,321650,307,12709,269314
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G((F("(((u1.p12>=1)&&(u3.p35>=1))&&(u23.p265>=1))"))U(X("(((u8.p96>=1)&&(u18.p215>=1))&&(u23.p265>=1))"))))))
Formula 4 simplified : !G(F"(((u1.p12>=1)&&(u3.p35>=1))&&(u23.p265>=1))" U X"(((u8.p96>=1)&&(u18.p215>=1))&&(u23.p265>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,3.66236,172020,1,0,353976,1570,3863,322787,307,12883,270726
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X("(((u6.p71>=1)&&(u21.p252>=1))&&(u23.p265>=1))")))))
Formula 5 simplified : !FGX"(((u6.p71>=1)&&(u21.p252>=1))&&(u23.p265>=1))"
3 unique states visited
2 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,3.68733,172524,1,0,354484,1577,3938,323682,307,12984,271424
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X("((u12.p134>=1)&&(u24.p266>=1))"))U(F(G("(((u4.p47>=1)&&(u9.p108>=1))&&(u23.p265>=1))"))))))
Formula 6 simplified : !X(X"((u12.p134>=1)&&(u24.p266>=1))" U FG"(((u4.p47>=1)&&(u9.p108>=1))&&(u23.p265>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
184 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,5.5208,238732,1,0,503791,1612,3973,465392,307,13778,376463
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F(X("(((u2.p23>=1)&&(u12.p144>=1))&&(u23.p265>=1))")))U(X(F("(((u3.p36>=1)&&(u12.p143>=1))&&(u23.p265>=1))"))))))
Formula 7 simplified : !X(FX"(((u2.p23>=1)&&(u12.p144>=1))&&(u23.p265>=1))" U XF"(((u3.p36>=1)&&(u12.p143>=1))&&(u23.p265>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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,5.67926,248760,1,0,528452,1653,4063,498053,307,14297,404365
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X(X("((u20.p233>=1)&&(u24.p266>=1))")))))
Formula 8 simplified : !XXX"((u20.p233>=1)&&(u24.p266>=1))"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,5.68347,249256,1,0,528723,1653,4069,498285,307,14297,405496
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(F(("((u5.p54>=1)&&(u23.p265>=1))")U("(u4.p44>=1)"))))))
Formula 9 simplified : !XXF("((u5.p54>=1)&&(u23.p265>=1))" U "(u4.p44>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
20 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,5.878,257964,1,0,551053,1653,4382,517647,308,14347,431937
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(((u1.p12>=1)&&(u19.p227>=1))&&(u23.p265>=1))"))
Formula 10 simplified : !"(((u1.p12>=1)&&(u19.p227>=1))&&(u23.p265>=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,5.8789,258228,1,0,551053,1653,4390,517647,308,14347,431945
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(((u16.p192>=1)&&(u20.p239>=1))&&(u23.p265>=1))"))
Formula 11 simplified : !"(((u16.p192>=1)&&(u20.p239>=1))&&(u23.p265>=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,5.87918,258228,1,0,551053,1653,4399,517647,308,14347,431951
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(((u5.p60>=1)&&(u19.p227>=1))&&(u23.p265>=1))"))
Formula 12 simplified : !"(((u5.p60>=1)&&(u19.p227>=1))&&(u23.p265>=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,5.87946,258228,1,0,551053,1653,4407,517647,308,14347,431957
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(F("((u24.p266>=1)&&(u15.p177>=1))")))U("((u7.p79>=1)&&(u24.p266>=1))")))
Formula 13 simplified : !(XF"((u24.p266>=1)&&(u15.p177>=1))" U "((u7.p79>=1)&&(u24.p266>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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,6.03449,269052,1,0,583823,1774,4784,545658,308,15412,480240
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(F(("(((u5.p59>=1)&&(u17.p204>=1))&&(u23.p265>=1))")U("(((u7.p84>=1)&&(u11.p131>=1))&&(u23.p265>=1))"))))))
Formula 14 simplified : !XXF("(((u5.p59>=1)&&(u17.p204>=1))&&(u23.p265>=1))" U "(((u7.p84>=1)&&(u11.p131>=1))&&(u23.p265>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19 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,6.22447,281724,1,0,615754,1784,4856,580053,308,15818,521784
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((("(u21.p250>=1)")U("(((u7.p84>=1)&&(u17.p203>=1))&&(u23.p265>=1))")))
Formula 15 simplified : !("(u21.p250>=1)" U "(((u7.p84>=1)&&(u17.p203>=1))&&(u23.p265>=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,6.22524,281976,1,0,615754,1784,4874,580053,309,15818,521802
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
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 1527966883915

--------------------
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/ -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/ -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 7:14:34 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/, -smt]
Jun 02, 2018 7:14:34 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 7:14:34 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 127 ms
Jun 02, 2018 7:14:34 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 267 places.
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1258 transitions.
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 7:14:35 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 45 ms
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 293 ms
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 7:14:35 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2755 redundant transitions.
Jun 02, 2018 7:14:35 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
Jun 02, 2018 7:14:35 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 7:14:36 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 442 identical transitions.
Jun 02, 2018 7:14:36 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 816 transitions.
Jun 02, 2018 7:14:36 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 24 place invariants in 94 ms
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 267 variables to be positive in 620 ms
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 816 transitions.
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/816 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 816 transitions.
Jun 02, 2018 7:14:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 7:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 816 transitions.
Jun 02, 2018 7:14:40 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/816) took 205 ms. Total solver calls (SAT/UNSAT): 815(0/815)
Jun 02, 2018 7:14:43 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 148) 1) (>= (select s0 265) 1))) with error
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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 7:14:43 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 7662ms 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="FlexibleBarrier-PT-22a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a 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 itstools"
echo " Input is FlexibleBarrier-PT-22a, 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 r248-blw7-152732549700066"
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 ;