You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

95 lines
2.9 KiB

  1. PRISM
  2. =====
  3. Version: 4.3
  4. Date: Sun Jun 12 16:34:37 CEST 2016
  5. Hostname: Tims-iMac.fritz.box
  6. Memory limits: cudd=1g, java(heap)=2.7g
  7. Command line: prism zeroconf/zeroconf4.nm zeroconf/zeroconf4_numerical.pctl -epsilon 0.000001 -paretoepsilon 0.0001 -sparse -javamaxmem 3g
  8. Parsing model file "zeroconf/zeroconf4.nm"...
  9. Parsing properties file "zeroconf/zeroconf4_numerical.pctl"...
  10. 1 property:
  11. (1) multi(Pmax=? [ F l=4&ip=1 ], P>=0.993141 [ G (error=0) ])
  12. Type: MDP
  13. Modules: host0 env_error4
  14. Variables: x y coll probes mess defend ip l env k c1 c2 c3 c4 error
  15. ---------------------------------------------------------------------
  16. Model checking: multi(Pmax=? [ F l=4&ip=1 ], P>=0.993141 [ G (error=0) ])
  17. Building model...
  18. Computing reachable states...
  19. Reachability (BFS): 116 iterations in 0.07 seconds (average 0.000603, setup 0.00)
  20. Time for model construction: 0.148 seconds.
  21. Type: MDP
  22. States: 5449 (1 initial)
  23. Transitions: 17152
  24. Choices: 16487
  25. Transition matrix: 2515 nodes (4 terminal), 17152 minterms, vars: 36r/36c/7nd
  26. Building deterministic Rabin automaton (for F "L0")...
  27. Taking deterministic Rabin automaton from library...
  28. DRA has 2 states, , 1 Rabin pairs.Time for Rabin translation: 0.015 seconds.
  29. Constructing MDP-DRA product...
  30. Reachability (BFS): 116 iterations in 0.06 seconds (average 0.000500, setup 0.00)
  31. States: 5449 (1 initial)
  32. Transitions: 17152
  33. Choices: 16487
  34. Transition matrix: 2604 nodes (4 terminal), 17152 minterms, vars: 37r/37c/7nd
  35. Building deterministic Rabin automaton (for G "L0")...
  36. Taking deterministic Rabin automaton from library...
  37. DRA has 2 states, , 1 Rabin pairs.Time for Rabin translation: 0.001 seconds.
  38. Constructing MDP-DRA product...
  39. Reachability (BFS): 116 iterations in 0.07 seconds (average 0.000647, setup 0.00)
  40. States: 5449 (1 initial)
  41. Transitions: 17152
  42. Choices: 16487
  43. Transition matrix: 3754 nodes (4 terminal), 17152 minterms, vars: 38r/38c/7nd
  44. States: 5449 (1 initial)
  45. Transitions: 17152
  46. Choices: 16487
  47. Transition matrix: 3754 nodes (4 terminal), 17152 minterms, vars: 38r/38c/7nd
  48. Finding accepting end components for F l=4&ip=1...
  49. Time for end component identification: 0.031 seconds.
  50. Finding accepting end components for G (error=0)...
  51. Time for end component identification: 0.051 seconds.
  52. Prob0A: 82 iterations in 0.03 seconds (average 0.000354, setup 0.00)
  53. yes = 4813, no = 172, maybe = 464
  54. Computing remaining probabilities...
  55. Engine: Sparse
  56. Iterative method: 85 iterations in 0.03 seconds (average 0.000306, setup 0.00)
  57. Iterative method: 85 iterations in 0.03 seconds (average 0.000318, setup 0.00)
  58. The value iteration(s) took 0.096 seconds altogether.
  59. Number of weight vectors used: 2
  60. Multi-objective value iterations took 0.096 s.
  61. Value in the initial state: 3.075787401574803E-4
  62. Time for model checking: 3.519 seconds.
  63. Result: 3.075787401574803E-4 (value in the initial state)