secret06-output 8.45 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305
Santiagos-MacBook-Pro:prototype-20121204 sescobar$ examples/secret06-command 
Wed Dec  5 02:36:45 CET 2012
		     \||||||||||||||||||/
		   --- Welcome to Maude ---
		     /||||||||||||||||||\
	    Maude alpha96b built: Nov  9 2012 18:20:01
	    Copyright 1997-2011 SRI International
		   Wed Dec  5 02:36:45 2012
Maude> 
	    Maude-NPA Version:  Dec 4 2012 with direct composition
	    Copyright (c) 2012, University of Illinois
	    All rights reserved.

 Commands:
 red unification? .           for getting the unification algorithm
 red genGrammars .            for generating grammars
 red run(X,Y).                for Y backwards analysis steps for attack pattern X
 red summary(X,Y).            for summary of analysis steps
 red initials(X,Y).           for showing only initial steps
==========================================
reduce in MAUDE-NPA : genGrammars .
rewrites: 7359423 in 10548ms cpu (10630ms real) (697707 rewrites/second)
result GrammarList: (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl #0:Msg notInI, #0:Msg notLeq (#1:Elm ; #2:Elm) => (#0:Msg ; #3:Msg) inL .)
| (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl #0:Msg notInI, (#0:Msg notLeq n(a, #1:Fresh)), #0:Msg notLeq (#2:Elm ; #3:Elm) => (#0:Msg ; #4:Elm) inL . ; 
grl #0:Msg notInI, (#0:Msg notLeq n(a, #1:Fresh)), #0:Msg notLeq (#2:Elm ; #3:Elm) => (#4:Msg ; #0:Msg) inL .)
| (errorNoHeuristicApplied {
grl empty => (#1:Msg ; #2:Msg) inL .,none,
grl empty => (#1:Msg,#2:Msg) inL .,none,
grl empty => (#1:Msg,#2:Msg) inL .} usingGrammar 
grl empty => (#1:Msg ; #2:Msg) inL .)
| (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl (n(#0:Name, #1:Fresh) notLeq n(s, #2:Fresh)), n(#0:Name, #1:Fresh) notLeq n(a, #3:Fresh) => n(#0:Name, #1:Fresh) inL .)
| (errorNoHeuristicApplied {
grl #50:Key notInI => pk(#50:Key, #60:Msg) inL .,none,
grl #50:Key notInI => #60:Msg inL .,none,
grl #50:Key notInI => #60:Msg inL .} usingGrammar 
grl #50:Key notInI => pk(#50:Key, #60:Msg) inL .)
| (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl #0:Msg notInI => pk(#1:Key, #0:Msg) inL .)
| (errorNoHeuristicApplied {
grl empty => pk(#1:Key, #2:Msg) inL .,none,
grl empty => #2:Msg inL .,none,
grl empty => #2:Msg inL .} usingGrammar 
grl empty => pk(#1:Key, #2:Msg) inL .)
| (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl #0:Key notInI => sk(#0:Key, #1:Msg) inL .)
| (
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl #0:Msg notInI, (#0:Msg notLeq (#1:Nonce ; s)), #0:Msg notLeq ((b ; n(a, #2:Fresh)) ; s) => sk(#3:Key, #0:Msg) inL .)
| 
grl #0:Msg inL => pk(i, #0:Msg) inL . ; 
grl #0:Msg inL => sk(#1:Key, #0:Msg) inL . ; 
grl #0:Msg inL => (#0:Msg ; #1:Msg) inL . ; 
grl #0:Msg inL => (#1:Msg ; #0:Msg) inL . ; 
grl (sk(#0:Key, #1:Msg) notLeq sk(a, #2:Nonce ; s)), (sk(#0:Key, #1:Msg) notLeq sk(a, (b ; n(a, #3:Fresh)) ; s)), sk(#0:Key, #1:Msg) notLeq sk(i, #4:Msg) => sk(#0:Key, #1:Msg) inL .
==========================================
reduce in MAUDE-NPA : run(0) .
rewrites: 2361 in 19ms cpu (29ms real) (119853 rewrites/second)
result IdSystem: < 1 > 
:: nil ::
[ nil, 
   -(sk(a, X:Msg ; s)), 
   -(sk(a, (b ; N:Nonce) ; s)) | nil] 
|| empty
|| 
nil
|| 
nil
|| 
nil
==========================================
reduce in MAUDE-NPA : summary(1) .
rewrites: 1271524 in 2541ms cpu (2562ms real) (500388 rewrites/second)
result Summary: States>> 2 Solutions>> 0
==========================================
reduce in MAUDE-NPA : summary(2) .
rewrites: 536004 in 1372ms cpu (1382ms real) (390570 rewrites/second)
result Summary: States>> 3 Solutions>> 1
==========================================
reduce in MAUDE-NPA : summary(3) .
rewrites: 243212 in 553ms cpu (566ms real) (439029 rewrites/second)
result Summary: States>> 2 Solutions>> 2
==========================================
reduce in MAUDE-NPA : run(1) .
rewrites: 18 in 0ms cpu (0ms real) (~ rewrites/second)
result IdSystemSet: (< 1 . 9 > (
:: nil ::
[ nil | 
   -(sk(a, #2:Msg ; s)), 
   -(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil, 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)) | 
   +(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil] )
|| 
sk(a, (b ; n(a, #0:Fresh)) ; s) !inI,
sk(a, #2:Msg ; s) inI
|| 
+(sk(a, (b ; n(a, #0:Fresh)) ; s)), 
-(sk(a, #2:Msg ; s)), 
-(sk(a, (b ; n(a, #0:Fresh)) ; s))
|| 
nil
|| 
nil)
< 1 . 10 > (
:: nil ::
[ nil | 
   -(sk(a, #1:Nonce ; s)), 
   -(sk(a, (b ; #2:Nonce) ; s)), nil]  & 
:: #0:Fresh ::
[ nil | 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)), nil] )
|| 
#1:Nonce !inI,
sk(a, #1:Nonce ; s) !inI,
sk(a, (b ; #2:Nonce) ; s) inI,
inst(#1:Nonce)
|| 
generatedByIntruder(#1:Nonce), 
-(#1:Nonce), 
+(sk(a, #1:Nonce ; s)), 
-(sk(a, #1:Nonce ; s)), 
-(sk(a, (b ; #2:Nonce) ; s))
|| 
nil
|| 
nil
==========================================
reduce in MAUDE-NPA : run(2) .
rewrites: 18 in 0ms cpu (0ms real) (~ rewrites/second)
result IdSystemSet: (< 1 . 9 . 1 > (
:: nil ::
[ nil | 
   -(sk(a, #2:Msg ; s)), 
   -(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil | 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)), 
   +(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil] )
|| 
#1:Nonce !inI,
sk(a, (b ; n(a, #0:Fresh)) ; s) !inI,
sk(a, #2:Msg ; s) inI
|| 
generatedByIntruder(#1:Nonce), 
-(#1:Nonce), 
+(sk(a, #1:Nonce ; s)), 
+(sk(a, (b ; n(a, #0:Fresh)) ; s)), 
-(sk(a, #2:Msg ; s)), 
-(sk(a, (b ; n(a, #0:Fresh)) ; s))
|| 
nil
|| 
nil)
(< 1 . 9 . 2 > (
:: nil ::
[ nil | 
   -(sk(a, #1:Nonce ; s)), 
   -(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil | 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)), 
   +(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil] )
|| 
#1:Nonce !inI,
sk(a, #1:Nonce ; s) !inI,
sk(a, (b ; n(a, #0:Fresh)) ; s) !inI,
inst(#1:Nonce)
|| 
generatedByIntruder(#1:Nonce), 
-(#1:Nonce), 
+(sk(a, #1:Nonce ; s)), 
+(sk(a, (b ; n(a, #0:Fresh)) ; s)), 
-(sk(a, #1:Nonce ; s)), 
-(sk(a, (b ; n(a, #0:Fresh)) ; s))
|| 
nil
|| 
nil)
< 1 . 9 . 7 > (
:: nil ::
[ nil | 
   -(sk(a, #3:Nonce ; s)), 
   -(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil, 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)) | 
   +(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #2:Fresh ::
[ nil | 
   -(#3:Nonce), 
   +(sk(a, #3:Nonce ; s)), nil] )
|| 
#3:Nonce !inI,
sk(a, #3:Nonce ; s) !inI,
sk(a, (b ; n(a, #0:Fresh)) ; s) !inI,
inst(#3:Nonce)
|| 
generatedByIntruder(#3:Nonce), 
-(#3:Nonce), 
+(sk(a, #3:Nonce ; s)), 
+(sk(a, (b ; n(a, #0:Fresh)) ; s)), 
-(sk(a, #3:Nonce ; s)), 
-(sk(a, (b ; n(a, #0:Fresh)) ; s))
|| 
nil
|| 
nil
==========================================
reduce in MAUDE-NPA : run(3) .
rewrites: 18 in 0ms cpu (0ms real) (~ rewrites/second)
result IdSystemSet: (< 1 . 9 . 2 > (
:: nil ::
[ nil | 
   -(sk(a, #1:Nonce ; s)), 
   -(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil | 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)), 
   +(sk(a, (b ; n(a, #0:Fresh)) ; s)), nil] )
|| 
#1:Nonce !inI,
sk(a, #1:Nonce ; s) !inI,
sk(a, (b ; n(a, #0:Fresh)) ; s) !inI,
inst(#1:Nonce)
|| 
generatedByIntruder(#1:Nonce), 
-(#1:Nonce), 
+(sk(a, #1:Nonce ; s)), 
+(sk(a, (b ; n(a, #0:Fresh)) ; s)), 
-(sk(a, #1:Nonce ; s)), 
-(sk(a, (b ; n(a, #0:Fresh)) ; s))
|| 
nil
|| 
nil)
< 1 . 9 . 1 . 5 > (
:: nil ::
[ nil | 
   -(sk(a, #1:Nonce ; s)), 
   -(sk(a, (b ; n(a, #2:Fresh)) ; s)), nil]  & 
:: #0:Fresh ::
[ nil | 
   -(#1:Nonce), 
   +(sk(a, #1:Nonce ; s)), nil]  & 
:: #2:Fresh ::
[ nil | 
   -(#3:Nonce), 
   +(sk(a, #3:Nonce ; s)), 
   +(sk(a, (b ; n(a, #2:Fresh)) ; s)), nil] )
|| 
#3:Nonce !inI,
#1:Nonce !inI,
sk(a, #1:Nonce ; s) !inI,
sk(a, (b ; n(a, #2:Fresh)) ; s) !inI,
inst(#3:Nonce)
|| 
generatedByIntruder(#1:Nonce), 
-(#1:Nonce), 
+(sk(a, #1:Nonce ; s)), 
generatedByIntruder(#3:Nonce), 
-(#3:Nonce), 
+(sk(a, #3:Nonce ; s)), 
+(sk(a, (b ; n(a, #2:Fresh)) ; s)), 
-(sk(a, #1:Nonce ; s)), 
-(sk(a, (b ; n(a, #2:Fresh)) ; s))
|| 
nil
|| 
nil
Maude> Bye.
Wed Dec  5 02:37:01 CET 2012
Santiagos-MacBook-Pro:prototype-20121204 sescobar$