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 484K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.2K 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 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 321K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is FlexibleBarrier-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-blw7-152732549700062
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527963726913

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 : !(("(((u4.p48>=1)&&(u6.p71>=1))&&(u21.p241>=1))"))
Formula 0 simplified : !"(((u4.p48>=1)&&(u6.p71>=1))&&(u21.p241>=1))"
built 231 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
23 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.275152,22540,1,0,10772,1212,3162,10061,303,4920,13230
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("((u7.p74>=1)&&(u22.p242>=1))")))
Formula 1 simplified : !F"((u7.p74>=1)&&(u22.p242>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.377482,28768,1,0,27525,1287,3391,26326,303,7306,36335
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(F("(((u7.p84>=1)&&(u8.p95>=1))&&(u21.p241>=1))")))))
Formula 2 simplified : !XF"(((u7.p84>=1)&&(u8.p95>=1))&&(u21.p241>=1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 682
// Phase 1: matrix 682 rows 243 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
14 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.51395,37216,1,0,48788,1540,3462,49304,303,10629,63995
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(G(X("(((u4.p48>=1)&&(u5.p59>=1))&&(u21.p241>=1))"))))))
Formula 3 simplified : !GXGX"(((u4.p48>=1)&&(u5.p59>=1))&&(u21.p241>=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 + u23: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 + u23: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 + u23:p0 = 1
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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23: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 + u23:p0 = 1
invariant :u22:p242 + u23: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 + u23:p0 = 1
invariant :u21:p241 + u23: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 + u23: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 + u23: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 + u23: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 + u23:p0 = 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 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.611346,41404,1,0,58497,1556,3546,61602,303,11075,75732
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(("(((u3.p36>=1)&&(u19.p227>=1))&&(u21.p241>=1))")U(X("((u22.p242>=1)&&(u16.p189>=1))"))))))
Formula 4 simplified : !XF("(((u3.p36>=1)&&(u19.p227>=1))&&(u21.p241>=1))" U X"((u22.p242>=1)&&(u16.p189>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.643751,44308,1,0,66606,1559,3624,67778,303,11099,87516
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(G(G("(((u3.p35>=1)&&(u12.p144>=1))&&(u21.p241>=1))"))))U(F(("(((u2.p24>=1)&&(u8.p95>=1))&&(u21.p241>=1))")U("(((u12.p144>=1)&&(u19.p227>=1))&&(u21.p241>=1))")))))
Formula 5 simplified : !(G"(((u3.p35>=1)&&(u12.p144>=1))&&(u21.p241>=1))" U F("(((u2.p24>=1)&&(u8.p95>=1))&&(u21.p241>=1))" U "(((u12.p144>=1)&&(u19.p227>=1))&&(u21.p241>=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,0.801128,54532,1,0,92206,1576,3682,98212,303,11617,121081
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((u17.p199>=1)&&(u22.p242>=1))")U(("(((u2.p24>=1)&&(u18.p215>=1))&&(u21.p241>=1))")U(G("(u8.p94>=1)")))))
Formula 6 simplified : !("((u17.p199>=1)&&(u22.p242>=1))" U ("(((u2.p24>=1)&&(u18.p215>=1))&&(u21.p241>=1))" U G"(u8.p94>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.806239,55600,1,0,92206,1576,3762,98212,304,11617,121149
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(F("(((u1.p12>=1)&&(u15.p179>=1))&&(u21.p241>=1))"))))
Formula 7 simplified : !F"(((u1.p12>=1)&&(u15.p179>=1))&&(u21.p241>=1))"
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,1.05032,68800,1,0,125212,1581,3850,143077,304,11963,160802
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("((u5.p52>=1)&&(u22.p242>=1))"))U(G("(((u1.p12>=1)&&(u18.p215>=1))&&(u21.p241>=1))"))))
Formula 8 simplified : !(F"((u5.p52>=1)&&(u22.p242>=1))" U G"(((u1.p12>=1)&&(u18.p215>=1))&&(u21.p241>=1))")
2 unique states visited
2 strongly connected components in search stack
2 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.05947,69432,1,0,125719,1581,3905,143799,304,11993,161665
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(G(F(G("(u18.p205>=1)")))))))
Formula 9 simplified : !FXGFG"(u18.p205>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
50 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.56302,95536,1,0,193243,1923,3934,189739,305,15227,214040
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(F(G("(((u4.p48>=1)&&(u9.p107>=1))&&(u21.p241>=1))"))))))
Formula 10 simplified : !XXFG"(((u4.p48>=1)&&(u9.p107>=1))&&(u21.p241>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 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.65328,100812,1,0,205870,1961,4024,206548,305,15923,230177
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("(((u1.p11>=1)&&(u18.p216>=1))&&(u21.p241>=1))")U("(u20.p236>=1)")))
Formula 11 simplified : !("(((u1.p11>=1)&&(u18.p216>=1))&&(u21.p241>=1))" U "(u20.p236>=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,1.65432,101060,1,0,205870,1961,4049,206548,306,15923,230214
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F("((u18.p208>=1)&&(u22.p242>=1))"))))
Formula 12 simplified : !XF"((u18.p208>=1)&&(u22.p242>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.8142,102644,1,0,209994,1970,4090,211332,306,16197,236389
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((X("(((u2.p24>=1)&&(u8.p95>=1))&&(u21.p241>=1))"))U("(((u8.p96>=1)&&(u15.p179>=1))&&(u21.p241>=1))"))))
Formula 13 simplified : !X(X"(((u2.p24>=1)&&(u8.p95>=1))&&(u21.p241>=1))" U "(((u8.p96>=1)&&(u15.p179>=1))&&(u21.p241>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
14 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.94337,112148,1,0,233655,1972,4191,240929,306,16259,266029
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X("(((u8.p96>=1)&&(u20.p239>=1))&&(u21.p241>=1))"))))
Formula 14 simplified : !FX"(((u8.p96>=1)&&(u20.p239>=1))&&(u21.p241>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,2.05638,120068,1,0,251736,1980,4257,267006,306,16406,289305
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(G("(((u3.p36>=1)&&(u15.p179>=1))&&(u21.p241>=1))"))))
Formula 15 simplified : !FG"(((u3.p36>=1)&&(u15.p179>=1))&&(u21.p241>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
123 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.27966,173120,1,0,368243,2038,4293,393508,306,17393,374571
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-20a-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 1527963733928

--------------------
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 6:22:08 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 6:22:08 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 113 ms
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 243 places.
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1064 transitions.
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 6:22:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 34 ms
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 6:22:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 6:22:09 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 280 ms
Jun 02, 2018 6:22:09 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 6:22:09 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2265 redundant transitions.
Jun 02, 2018 6:22:09 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
Jun 02, 2018 6:22:09 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2018 6:22:09 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 362 identical transitions.
Jun 02, 2018 6:22:09 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 702 transitions.
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 22 place invariants in 106 ms
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 243 variables to be positive in 566 ms
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 702 transitions.
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/702 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 702 transitions.
Jun 02, 2018 6:22:10 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 6:22:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 702 transitions.
Jun 02, 2018 6:22:13 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 51) 1) (>= (select s0 241) 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 6:22:13 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4153ms 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-20a"
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-20a.tgz
mv FlexibleBarrier-PT-20a 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-20a, 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-152732549700062"
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 ;