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 560K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 11K 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.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K 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.8K 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 398K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DLCround-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264000180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527876700802

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 : !((X(("((u6.p46>=1)&&(u88.p184>=1))")U(G("((u12.p103>=1)&&(u130.p226>=1))")))))
Formula 0 simplified : !X("((u6.p46>=1)&&(u88.p184>=1))" U G"((u12.p103>=1)&&(u130.p226>=1))")
built 241 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 170
// Phase 1: matrix 170 rows 229 cols
invariant :u59:p155 + u133:p0 = 1
invariant :u111:p207 + u133:p0 = 1
invariant :u35:p131 + u133:p0 = 1
invariant :u24:p120 + u133:p0 = 1
invariant :u44:p140 + u133:p0 = 1
invariant :u105:p201 + u133:p0 = 1
invariant :u108:p204 + u133:p0 = 1
invariant :u58:p154 + u133:p0 = 1
invariant :u96:p192 + u133:p0 = 1
invariant :u55:p151 + u133:p0 = 1
invariant :u41:p137 + u133:p0 = 1
invariant :u124:p220 + u133:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u133:p0 = 1
invariant :u17:p113 + u133:p0 = 1
invariant :u109:p205 + u133:p0 = 1
invariant :u74:p170 + u133:p0 = 1
invariant :u38:p134 + u133:p0 = 1
invariant :u128:p224 + u133:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u133:p0 = 1
invariant :u125:p221 + u133:p0 = 1
invariant :u14:p110 + u133:p0 = 1
invariant :u36:p132 + u133:p0 = 1
invariant :u104:p200 + u133:p0 = 1
invariant :u30:p126 + u133:p0 = 1
invariant :u107:p203 + u133:p0 = 1
invariant :u48:p144 + u133:p0 = 1
invariant :u70:p166 + u133:p0 = 1
invariant :u100:p196 + u133:p0 = 1
invariant :u113:p209 + u133:p0 = 1
invariant :u103:p199 + u133:p0 = 1
invariant :u23:p119 + u133:p0 = 1
invariant :u62:p158 + u133:p0 = 1
invariant :u27:p123 + u133:p0 = 1
invariant :u56:p152 + u133:p0 = 1
invariant :u53:p149 + u133:p0 = 1
invariant :u122:p218 + u133:p0 = 1
invariant :u29:p125 + u133:p0 = 1
invariant :u15:p111 + u133:p0 = 1
invariant :u28:p124 + u133:p0 = 1
invariant :u92:p188 + u133:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u133:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u133:p0 = 1
invariant :u34:p130 + u133:p0 = 1
invariant :u43:p139 + u133:p0 = 1
invariant :u110:p206 + u133:p0 = 1
invariant :u81:p177 + u133:p0 = 1
invariant :u52:p148 + u133:p0 = 1
invariant :u66:p162 + u133:p0 = 1
invariant :u33:p129 + u133:p0 = 1
invariant :u77:p173 + u133:p0 = 1
invariant :u79:p175 + u133:p0 = 1
invariant :u126:p222 + u133:p0 = 1
invariant :u99:p195 + u133:p0 = 1
invariant :u80:p176 + u133:p0 = 1
invariant :u116:p212 + u133:p0 = 1
invariant :u31:p127 + u133:p0 = 1
invariant :u117:p213 + u133:p0 = 1
invariant :u86:p182 + u133:p0 = 1
invariant :u63:p159 + u133:p0 = 1
invariant :u112:p208 + u133:p0 = 1
invariant :u75:p171 + u133:p0 = 1
invariant :u132:p228 + u133:p0 = 1
invariant :u73:p169 + u133:p0 = 1
invariant :u98:p194 + u133:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u133:p0 = 1
invariant :u88:p184 + u133:p0 = 1
invariant :u67:p163 + u133:p0 = 1
invariant :u26:p122 + u133:p0 = 1
invariant :u121:p217 + u133:p0 = 1
invariant :u39:p135 + u133:p0 = 1
invariant :u45:p141 + u133:p0 = 1
invariant :u76:p172 + u133:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u133:p0 = 1
invariant :u83:p179 + u133:p0 = 1
invariant :u42:p138 + u133:p0 = 1
invariant :u65:p161 + u133:p0 = 1
invariant :u32:p128 + u133:p0 = 1
invariant :u101:p197 + u133:p0 = 1
invariant :u18:p114 + u133:p0 = 1
invariant :u118:p214 + u133:p0 = 1
invariant :u115:p211 + u133:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u133:p0 = 1
invariant :u40:p136 + u133:p0 = 1
invariant :u130:p226 + u133:p0 = 1
invariant :u50:p146 + u133:p0 = 1
invariant :u19:p115 + u133:p0 = 1
invariant :u51:p147 + u133:p0 = 1
invariant :u95:p191 + u133:p0 = 1
invariant :u68:p164 + u133:p0 = 1
invariant :u90:p186 + u133:p0 = 1
invariant :u61:p157 + u133:p0 = 1
invariant :u46:p142 + u133:p0 = 1
invariant :u119:p215 + u133:p0 = 1
invariant :u82:p178 + u133:p0 = 1
invariant :u89:p185 + u133:p0 = 1
invariant :u106:p202 + u133:p0 = 1
invariant :u127:p223 + u133:p0 = 1
invariant :u97:p193 + u133:p0 = 1
invariant :u49:p145 + u133:p0 = 1
invariant :u21:p117 + u133:p0 = 1
invariant :u78:p174 + u133:p0 = 1
invariant :u91:p187 + u133:p0 = 1
invariant :u60:p156 + u133:p0 = 1
invariant :u102:p198 + u133:p0 = 1
invariant :u85:p181 + u133:p0 = 1
invariant :u57:p153 + u133:p0 = 1
invariant :u71:p167 + u133:p0 = 1
invariant :u114:p210 + u133:p0 = 1
invariant :u64:p160 + u133:p0 = 1
invariant :u94:p190 + u133:p0 = 1
invariant :u120:p216 + u133:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u133:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u133:p0 = 1
invariant :u22:p118 + u133:p0 = 1
invariant :u72:p168 + u133:p0 = 1
invariant :u37:p133 + u133:p0 = 1
invariant :u87:p183 + u133:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u133:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u133:p0 = 1
invariant :u131:p227 + u133:p0 = 1
invariant :u69:p165 + u133:p0 = 1
invariant :u54:p150 + u133:p0 = 1
invariant :u47:p143 + u133:p0 = 1
invariant :u25:p121 + u133:p0 = 1
invariant :u13:p109 + u133:p0 = 1
invariant :u20:p116 + u133:p0 = 1
invariant :u84:p180 + u133:p0 = 1
invariant :u129:p225 + u133:p0 = 1
invariant :u12:p99 + u12:p100 + u12:p101 + u12:p102 + u12:p103 + u12:p104 + u12:p105 + u12:p106 + u12:p107 + u12:p108 + u133:p0 = 1
invariant :u16:p112 + u133:p0 = 1
invariant :u93:p189 + u133:p0 = 1
invariant :u123:p219 + u133:p0 = 1
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
146 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.53833,33864,1,0,7284,694,6008,6409,409,796,30921
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(("((u104.p200>=1)&&(u12.p107>=1))")U("((u6.p47>=1)&&(u99.p195>=1))")))U("((u4.p23>=1)&&(u27.p123>=1))")))
Formula 1 simplified : !(G("((u104.p200>=1)&&(u12.p107>=1))" U "((u6.p47>=1)&&(u99.p195>=1))") U "((u4.p23>=1)&&(u27.p123>=1))")
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,1.54413,34884,1,0,7285,694,6043,6409,409,796,31194
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(G(G("((u9.p71>=1)&&(u48.p144>=1))"))))U("(u6.p48>=1)")))
Formula 2 simplified : !(G"((u9.p71>=1)&&(u48.p144>=1))" U "(u6.p48>=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.54695,35116,1,0,7285,694,6061,6409,410,796,31365
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(X(G(F("((u8.p62>=1)&&(u103.p199>=1))")))))))
Formula 3 simplified : !FGXGF"((u8.p62>=1)&&(u103.p199>=1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.67559,38984,1,0,9389,694,6290,10167,410,1062,34516
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X("((u1.p1>=1)&&(u53.p149>=1))")))
Formula 4 simplified : !X"((u1.p1>=1)&&(u53.p149>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.67671,39248,1,0,9389,694,6294,10167,410,1062,34653
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((u10.p87>=1)&&(u118.p214>=1))")))
Formula 5 simplified : !G"((u10.p87>=1)&&(u118.p214>=1))"
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,1.6852,39512,1,0,9389,694,6314,10167,410,1062,34687
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("((u89.p185>=1)&&(u6.p45>=1))")))
Formula 6 simplified : !X"((u89.p185>=1)&&(u6.p45>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.68595,39512,1,0,9389,694,6320,10167,410,1062,34786
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((u81.p177>=1)&&(u5.p35>=1))"))
Formula 7 simplified : !"((u81.p177>=1)&&(u5.p35>=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.68661,39512,1,0,9389,694,6325,10167,410,1062,34843
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(G(("((u12.p104>=1)&&(u74.p170>=1))")U("((u11.p89>=1)&&(u124.p220>=1))"))))))
Formula 8 simplified : !GFG("((u12.p104>=1)&&(u74.p170>=1))" U "((u11.p89>=1)&&(u124.p220>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.82345,43352,1,0,12342,694,6564,13841,410,1629,38925
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(G(X(G("((u12.p107>=1)&&(u111.p207>=1))")))))))
Formula 9 simplified : !XGXG"((u12.p107>=1)&&(u111.p207>=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,1.93208,46776,1,0,17501,703,6670,20193,410,2690,45576
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("((u7.p49>=1)&&(u36.p132>=1))")))
Formula 10 simplified : !F"((u7.p49>=1)&&(u36.p132>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.13655,51792,1,0,21374,768,6938,26338,410,3322,52536
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(F("((u11.p93>=1)&&(u122.p218>=1))")))U(X(G(X("((u6.p42>=1)&&(u26.p122>=1))"))))))
Formula 11 simplified : !(F"((u11.p93>=1)&&(u122.p218>=1))" U XGX"((u6.p42>=1)&&(u26.p122>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.26962,56260,1,0,25503,817,7071,32296,410,3970,58282
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F(F("((u4.p28>=1)&&(u19.p115>=1))")))))
Formula 12 simplified : !XF"((u4.p28>=1)&&(u19.p115>=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,2.28175,57052,1,0,25503,817,7091,32296,410,3970,58419
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((u96.p192>=1)&&(u11.p97>=1))"))
Formula 13 simplified : !"((u96.p192>=1)&&(u11.p97>=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,2.28297,57316,1,0,25503,817,7093,32296,410,3970,58458
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("((u39.p135>=1)&&(u8.p67>=1))")U((G("((u102.p198>=1)&&(u10.p87>=1))"))U(F("((u35.p131>=1)&&(u7.p57>=1))")))))
Formula 14 simplified : !("((u39.p135>=1)&&(u8.p67>=1))" U (G"((u102.p198>=1)&&(u10.p87>=1))" U F"((u35.p131>=1)&&(u7.p57>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,2.50878,60996,1,0,28094,818,7331,36845,410,4002,63454
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-07a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(F(("((u2.p14>=1)&&(u48.p144>=1))")U("((u6.p47>=1)&&(u23.p119>=1))")))))
Formula 15 simplified : !GF("((u2.p14>=1)&&(u48.p144>=1))" U "((u6.p47>=1)&&(u23.p119>=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,2.73896,65748,1,0,30316,824,7617,41175,410,4099,67669
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-07a-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 1527876709432

--------------------
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
Jun 01, 2018 6:11:43 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/, -louvain, -smt]
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 233 ms
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 229 places.
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1597 transitions.
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2018 6:11:43 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 52 ms
Jun 01, 2018 6:11:43 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 01, 2018 6:11:44 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 376 ms
Jun 01, 2018 6:11:44 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 172 ms
Jun 01, 2018 6:11:44 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2018 6:11:44 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 138 ms
Jun 01, 2018 6:11:44 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 01, 2018 6:11:45 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2560 redundant transitions.
Jun 01, 2018 6:11:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 26 ms
Jun 01, 2018 6:11:45 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Jun 01, 2018 6:11:45 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 160 identical transitions.
Jun 01, 2018 6:11:45 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 1437 transitions.
Jun 01, 2018 6:11:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 132 place invariants in 67 ms
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 229 variables to be positive in 825 ms
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 1437 transitions.
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/1437 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 116 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 1437 transitions.
Jun 01, 2018 6:11:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 75 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2018 6:11:48 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 44) 1) (>= (select s0 123) 1)) (= (store (store s0 44 (- (select s0 44) 1)) 43 (+ (select s0 43) 1)) s1))) 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.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 6:11:48 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2970ms 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-07a"
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/DLCround-PT-07a.tgz
mv DLCround-PT-07a 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-07a, 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 r213-smll-152732264000180"
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 ;