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 276K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.8K 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.2K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 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 18K 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 107K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585900116
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527503097865

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 : !((("((u66.p255>=1)&&(u72.p304>=1))")U(G("(u53.p200>=1)"))))
Formula 0 simplified : !("((u66.p255>=1)&&(u72.p304>=1))" U G"(u53.p200>=1)")
built 125 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t344, t345, t346, t347, t372, t373, t374, t375, t400, t401, t402, t403, t428, t429, t430, t431, u27.t177, u27.t178, u27.t179, u27.t180, u42.t119, u42.t120, u42.t121, u42.t122, u57.t61, u57.t62, u57.t63, u57.t64, u72.t3, u72.t4, u72.t5, u72.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :176/233/24/433
Computing Next relation with stutter on 130321 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 257 rows 305 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
51 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.574001,34528,1,0,44194,1948,3485,37228,380,7497,97420
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(("(u13.p26>=1)")U(F(G("((u51.p181>=1)&&(u56.p230>=1))"))))))
Formula 1 simplified : !X("(u13.p26>=1)" U FG"((u51.p181>=1)&&(u56.p230>=1))")
Computing Next relation with stutter on 130321 deadlock states
invariant :u37:p119 + u37:p120 + u37:p121 + u37:p122 + u37:p123 + u37:p124 + u37:p125 + u37:p126 + u73:p0 = 1
invariant :u48:p175 + u48:p176 + u73:p0 = 1
invariant :u11:p21 + u11:p22 + u73:p0 = 1
invariant :u56:p229 + u56:p230 + u73:p0 = 1
invariant :u53:p197 + u53:p198 + u53:p199 + u53:p200 + u53:p201 + u53:p202 + u53:p203 + u53:p204 + u73:p0 = 1
invariant :u34:p107 + u34:p108 + u73:p0 = 1
invariant :u12:p23 + u12:p24 + u73:p0 = 1
invariant :u38:p127 + u38:p128 + u38:p129 + u38:p130 + u38:p131 + u38:p132 + u38:p133 + u38:p134 + u73:p0 = 1
invariant :u60:p239 + u60:p240 + u73:p0 = 1
invariant :u20:p39 + u20:p40 + u73:p0 = 1
invariant :u13:p25 + u13:p26 + u73:p0 = 1
invariant :u40:p143 + u40:p144 + u40:p145 + u40:p146 + u40:p147 + u40:p148 + u40:p149 + u40:p150 + u40:p151 + u40:p152 + u40:p153 + u40:p154 + u40:p155 + u40:p156 + u40:p157 + u40:p158 + u73:p0 = 1
invariant :u19:p37 + u19:p38 + u73:p0 = 1
invariant :u66:p251 + u66:p252 + u66:p253 + u66:p254 + u66:p255 + u66:p256 + u66:p257 + -1'u67:p266 + -1'u68:p274 + -1'u69:p282 + -1'u70:p298 + -1'u71:p300 + -4'u73:p0 = -4
invariant :u15:p29 + u15:p30 + u73:p0 = 1
invariant :u17:p33 + u17:p34 + u73:p0 = 1
invariant :u16:p31 + u16:p32 + u73:p0 = 1
invariant :u32:p103 + u32:p104 + u73:p0 = 1
invariant :u30:p99 + u30:p100 + u73:p0 = 1
invariant :u58:p235 + u58:p236 + u73:p0 = 1
invariant :u28:p95 + u28:p96 + u73:p0 = 1
invariant :u44:p167 + u44:p168 + u73:p0 = 1
invariant :u6:p11 + u6:p12 + u73:p0 = 1
invariant :u1:p1 + u1:p2 + u73:p0 = 1
invariant :u21:p41 + u21:p42 + u21:p43 + u21:p44 + u21:p45 + u21:p46 + u21:p47 + -1'u22:p56 + -1'u23:p64 + -1'u24:p72 + -1'u25:p88 + -1'u26:p90 + -4'u73:p0 = -4
invariant :u41:p159 + u41:p160 + u73:p0 = 1
invariant :u54:p205 + u54:p206 + u54:p207 + u54:p208 + u54:p209 + u54:p210 + u54:p211 + u54:p212 + u73:p0 = 1
invariant :u61:p241 + u61:p242 + u73:p0 = 1
invariant :u35:p109 + u35:p110 + u73:p0 = 1
invariant :u21:p48 + u22:p56 + u23:p64 + u24:p72 + u25:p88 + u26:p90 + 5'u73:p0 = 5
invariant :u52:p189 + u52:p190 + u52:p191 + u52:p192 + u52:p193 + u52:p194 + u52:p195 + u52:p196 + u73:p0 = 1
invariant :u22:p49 + u22:p50 + u22:p51 + u22:p52 + u22:p53 + u22:p54 + u22:p55 + u22:p56 + u73:p0 = 1
invariant :u50:p179 + u50:p180 + u73:p0 = 1
invariant :u51:p188 + u52:p196 + u53:p204 + u54:p212 + u55:p228 + u56:p230 + 5'u73:p0 = 5
invariant :u31:p101 + u31:p102 + u73:p0 = 1
invariant :u55:p213 + u55:p214 + u55:p215 + u55:p216 + u55:p217 + u55:p218 + u55:p219 + u55:p220 + u55:p221 + u55:p222 + u55:p223 + u55:p224 + u55:p225 + u55:p226 + u55:p227 + u55:p228 + u73:p0 = 1
invariant :u3:p5 + u3:p6 + u73:p0 = 1
invariant :u49:p177 + u49:p178 + u73:p0 = 1
invariant :u57:p231 + u57:p232 + u57:p233 + u57:p234 + u73:p0 = 1
invariant :u42:p161 + u42:p162 + u42:p163 + u42:p164 + u73:p0 = 1
invariant :u10:p19 + u10:p20 + u73:p0 = 1
invariant :u4:p7 + u4:p8 + u73:p0 = 1
invariant :u47:p173 + u47:p174 + u73:p0 = 1
invariant :u69:p275 + u69:p276 + u69:p277 + u69:p278 + u69:p279 + u69:p280 + u69:p281 + u69:p282 + u73:p0 = 1
invariant :u27:p91 + u27:p92 + u27:p93 + u27:p94 + u73:p0 = 1
invariant :u63:p245 + u63:p246 + u73:p0 = 1
invariant :u14:p27 + u14:p28 + u73:p0 = 1
invariant :u18:p35 + u18:p36 + u73:p0 = 1
invariant :u46:p171 + u46:p172 + u73:p0 = 1
invariant :u5:p9 + u5:p10 + u73:p0 = 1
invariant :u67:p259 + u67:p260 + u67:p261 + u67:p262 + u67:p263 + u67:p264 + u67:p265 + u67:p266 + u73:p0 = 1
invariant :u45:p169 + u45:p170 + u73:p0 = 1
invariant :u25:p73 + u25:p74 + u25:p75 + u25:p76 + u25:p77 + u25:p78 + u25:p79 + u25:p80 + u25:p81 + u25:p82 + u25:p83 + u25:p84 + u25:p85 + u25:p86 + u25:p87 + u25:p88 + u73:p0 = 1
invariant :u43:p165 + u43:p166 + u73:p0 = 1
invariant :u68:p267 + u68:p268 + u68:p269 + u68:p270 + u68:p271 + u68:p272 + u68:p273 + u68:p274 + u73:p0 = 1
invariant :u71:p299 + u71:p300 + u73:p0 = 1
invariant :u66:p258 + u67:p266 + u68:p274 + u69:p282 + u70:p298 + u71:p300 + 5'u73:p0 = 5
invariant :u64:p247 + u64:p248 + u73:p0 = 1
invariant :u24:p65 + u24:p66 + u24:p67 + u24:p68 + u24:p69 + u24:p70 + u24:p71 + u24:p72 + u73:p0 = 1
invariant :u7:p13 + u7:p14 + u73:p0 = 1
invariant :u23:p57 + u23:p58 + u23:p59 + u23:p60 + u23:p61 + u23:p62 + u23:p63 + u23:p64 + u73:p0 = 1
invariant :u72:p301 + u72:p302 + u72:p303 + u72:p304 + u73:p0 = 1
invariant :u51:p181 + u51:p182 + u51:p183 + u51:p184 + u51:p185 + u51:p186 + u51:p187 + -1'u52:p196 + -1'u53:p204 + -1'u54:p212 + -1'u55:p228 + -1'u56:p230 + -4'u73:p0 = -4
invariant :u2:p3 + u2:p4 + u73:p0 = 1
invariant :u33:p105 + u33:p106 + u73:p0 = 1
invariant :u8:p15 + u8:p16 + u73:p0 = 1
invariant :u36:p111 + u36:p112 + u36:p113 + u36:p114 + u36:p115 + u36:p116 + u36:p117 + -1'u37:p126 + -1'u38:p134 + -1'u39:p142 + -1'u40:p158 + -1'u41:p160 + -4'u73:p0 = -4
invariant :u59:p237 + u59:p238 + u73:p0 = 1
invariant :u26:p89 + u26:p90 + u73:p0 = 1
invariant :u39:p135 + u39:p136 + u39:p137 + u39:p138 + u39:p139 + u39:p140 + u39:p141 + u39:p142 + u73:p0 = 1
invariant :u65:p249 + u65:p250 + u73:p0 = 1
invariant :u9:p17 + u9:p18 + u73:p0 = 1
invariant :u70:p283 + u70:p284 + u70:p285 + u70:p286 + u70:p287 + u70:p288 + u70:p289 + u70:p290 + u70:p291 + u70:p292 + u70:p293 + u70:p294 + u70:p295 + u70:p296 + u70:p297 + u70:p298 + u73:p0 = 1
invariant :u62:p243 + u62:p244 + u73:p0 = 1
invariant :u29:p97 + u29:p98 + u73:p0 = 1
invariant :u36:p118 + u37:p126 + u38:p134 + u39:p142 + u40:p158 + u41:p160 + 5'u73:p0 = 5
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
292 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.4884,144284,1,0,321040,4244,3515,342528,380,20971,515595
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("(u45.p170>=1)"))
Formula 2 simplified : !"(u45.p170>=1)"
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.48897,144548,1,0,321040,4244,3518,342528,381,20971,515624
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(u24.p68>=1)"))
Formula 3 simplified : !"(u24.p68>=1)"
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.48944,144548,1,0,321040,4244,3521,342528,381,20971,515684
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(("((u21.p45>=1)&&(u27.p94>=1))")U("(u53.p200>=1)")))))
Formula 4 simplified : !GX("((u21.p45>=1)&&(u27.p94>=1))" U "(u53.p200>=1)")
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
8 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.57002,147624,1,0,328400,4448,3707,351534,381,22078,528332
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(u59.p238>=1)"))
Formula 5 simplified : !"(u59.p238>=1)"
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.57079,147624,1,0,328400,4448,3709,351534,381,22078,528346
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(("(u69.p278>=1)")U("((u16.p32>=1)&&(u25.p78>=1))"))))
Formula 6 simplified : !F("(u69.p278>=1)" U "((u16.p32>=1)&&(u25.p78>=1))")
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
31 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.87982,157128,1,0,346118,6252,3885,387912,381,35668,560345
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(F("((u52.p194>=1)&&(u57.p233>=1))")))))
Formula 7 simplified : !XXF"((u52.p194>=1)&&(u57.p233>=1))"
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,3.94356,158968,1,0,350777,6481,3950,392770,381,37298,570724
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("((u5.p10>=1)&&(u40.p145>=1))"))
Formula 8 simplified : !"((u5.p10>=1)&&(u40.p145>=1))"
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.9444,159232,1,0,350777,6481,3955,392770,381,37298,570776
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(F("((u59.p237>=1)&&(u66.p257>=1))")))))
Formula 9 simplified : !XGF"((u59.p237>=1)&&(u66.p257>=1))"
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.95574,159472,1,0,350940,6483,4007,393031,381,37355,571399
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((F("((u28.p96>=1)&&(u36.p113>=1))"))U(X("((u10.p20>=1)&&(u70.p284>=1))")))))
Formula 10 simplified : !F(F"((u28.p96>=1)&&(u36.p113>=1))" U X"((u10.p20>=1)&&(u70.p284>=1))")
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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,4.13941,166072,1,0,365366,8842,4142,411764,381,50307,596118
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("(u53.p200>=1)"))U(F(G("((u66.p255>=1)&&(u72.p304>=1))")))))
Formula 11 simplified : !(F"(u53.p200>=1)" U FG"((u66.p255>=1)&&(u72.p304>=1))")
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
132 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.4635,198600,1,0,438402,8888,4166,498886,381,50547,738548
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(u30.p100>=1)")))
Formula 12 simplified : !G"(u30.p100>=1)"
Computing Next relation with stutter on 130321 deadlock states
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,5.4672,198864,1,0,438402,8888,4181,498886,381,50547,738648
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(F(("(u27.p94>=1)")U("((u48.p175>=1)&&(u53.p203>=1))"))))))
Formula 13 simplified : !GF("(u27.p94>=1)" U "((u48.p175>=1)&&(u53.p203>=1))")
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.4862,199128,1,0,438991,8889,4247,499754,381,50631,740118
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((G("(u52.p192>=1)"))U(X(F(G("(u46.p172>=1)"))))))
Formula 14 simplified : !(G"(u52.p192>=1)" U XFG"(u46.p172>=1)")
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
48 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.95624,215844,1,0,485029,9212,4317,546692,381,53574,825199
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((((F("((u35.p110>=1)&&(u40.p150>=1))"))U(F("(u19.p38>=1)")))U("(u53.p201>=1)")))
Formula 15 simplified : !((F"((u35.p110>=1)&&(u40.p150>=1))" U F"(u19.p38>=1)") U "(u53.p201>=1)")
Computing Next relation with stutter on 130321 deadlock states
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,6.06929,218424,1,0,489750,9229,4494,553574,382,53711,834795
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527503130858

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 10:25:00 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 28, 2018 10:25:00 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 10:25:00 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 103 ms
May 28, 2018 10:25:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 305 places.
May 28, 2018 10:25:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 433 transitions.
May 28, 2018 10:25:01 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 28, 2018 10:25:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 23 ms
May 28, 2018 10:25:01 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 195 ms
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 55 ms
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 10:25:01 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 72 redundant transitions.
May 28, 2018 10:25:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
May 28, 2018 10:25:01 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 28, 2018 10:25:02 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 176 identical transitions.
May 28, 2018 10:25:02 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 257 transitions.
May 28, 2018 10:25:02 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 76 place invariants in 111 ms
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 305 variables to be positive in 4303 ms
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 257 transitions.
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/257 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 257 transitions.
May 28, 2018 10:25:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:25:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 257 transitions.
May 28, 2018 10:25:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/257) took 169 ms. Total solver calls (SAT/UNSAT): 256(0/256)
May 28, 2018 10:25:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(19/257) took 3187 ms. Total solver calls (SAT/UNSAT): 546(124/422)
May 28, 2018 10:25:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(57/257) took 6212 ms. Total solver calls (SAT/UNSAT): 1071(204/867)
May 28, 2018 10:25:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(80/257) took 9263 ms. Total solver calls (SAT/UNSAT): 1262(274/988)
May 28, 2018 10:25:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(115/257) took 12267 ms. Total solver calls (SAT/UNSAT): 1517(369/1148)
May 28, 2018 10:25:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(151/257) took 15276 ms. Total solver calls (SAT/UNSAT): 1811(493/1318)
May 28, 2018 10:25:29 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(233/257) took 18334 ms. Total solver calls (SAT/UNSAT): 1946(538/1408)
May 28, 2018 10:25:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 18835 ms. Total solver calls (SAT/UNSAT): 1956(540/1416)
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)
May 28, 2018 10:25:30 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 28419ms 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="Parking-PT-416"
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/Parking-PT-416.tgz
mv Parking-PT-416 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 Parking-PT-416, 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 r261-csrt-152732585900116"
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 ;