btor 0.1.0

Rust wrapper for btor
Documentation 
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

/**
 *  Btor2Tools: A tool package for the BTOR format.
 *
 *  Copyright (c) 2018 Armin Biere.
 *  Copyright (c) 2018 Aina Niemetz.
 *  Copyright (c) 2019 Mathias Preiner.
 *  Copyright (c) 2020 Nina Engelhardt.
 *
 *  All rights reserved.
 *
 *  This file is part of the Btor2Tools package.
 *  See LICENSE.txt for more information on using this software.
 */

#include "btorsimhelpers.h"

void
die (const char *m, ...)
{
  fflush (stdout);
  fputs ("*** 'btorsim' error: ", stderr);
  va_list ap;
  va_start (ap, m);
  vfprintf (stderr, m, ap);
  va_end (ap);
  fprintf (stderr, "\n");
  exit (1);
}

void
msg (int32_t level, const char *m, ...)
{
  if (level > verbosity) return;
  assert (m);
  printf ("[btorsim] ");
  va_list ap;
  va_start (ap, m);
  vprintf (m, ap);
  va_end (ap);
  printf ("\n");
}

// this would ideally be in btorsimbv.c but that's C and doesn't know what
// std::string is
std::string
btorsim_bv_to_string (const BtorSimBitVector *bv)
{
  std::string sval ("");
  for (int j = bv->width - 1; j >= 0; j--)
    sval += std::to_string (btorsim_bv_get_bit (bv, j));
  return sval;
}

std::string
btorsim_bv_to_hex_string (const BtorSimBitVector *bv)
{
  char *bv_char = btorsim_bv_to_hex_char (bv);
  std::string res (bv_char);
  BTOR2_DELETE (bv_char);
  return res;
}

Btor2Sort *
get_sort (Btor2Line *l, Btor2Parser *model)
{
  Btor2Sort *sort;
  switch (l->tag)
  {
    case BTOR2_TAG_output:
    case BTOR2_TAG_bad:
    case BTOR2_TAG_constraint:
    case BTOR2_TAG_fair:
      // case BTOR2_TAG_justice:
      {
        Btor2Line *ls = btor2parser_get_line_by_id (model, l->args[0]);
        sort          = &(ls->sort);
      }
      break;
    default: sort = &(l->sort); break;
  }
  assert (sort);
  assert (sort->id);
  return sort;
}