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
|
/* CheckEmpty.cpp -- checking whether the input polytope is empty
Copyright 2004 Ruriko Yoshida.
Copyright 2006 Matthias Koeppe.
This file is part of LattE.
LattE is free software; you can redistribute it and/or modify it
under the terms of the version 2 of the GNU General Public License
as published by the Free Software Foundation.
LattE is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with LattE; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include <string.h>
#include <stdio.h>
#include "config.h"
#include "barvinok/dec.h"
#include "barvinok/barvinok.h"
#include "barvinok/Triangulation.h"
#include "vertices/cdd.h"
#include "genFunction/maple.h"
#include "genFunction/piped.h"
#include "cone.h"
#include "dual.h"
#include "RudyResNTL.h"
#include "Grobner.h"
#include "preprocess.h"
#include "print.h"
#include "ramon.h"
#include "rational.h"
#include "timing.h"
#include "ReadingFile.h"
#include "binarySearchIP.h"
#include "latte_system.h"
#include "latte_relocatable.h"
#include "LattException.h"
void CheckEmpty(const char * Filename){
int numOfConsts, numOfDims, numOfEqu = 0, flag = 0;
string tmpString;
char equ[127], nonneg[127];
equ[0] = 'n';
nonneg[0] = 'n';
int numOfNonneg = 0, hold = 0;
vec_ZZ Index, Index2;
cerr << "Checking whether the input polytope is empty or not...";
cerr.flush();
ifstream IN(Filename);
if(!IN){
cerr << "Input file is missing!! Please check input file." << endl;
THROW_LATTE(LattException::ue_FileNameMissing,0);
}
while(IN >> tmpString){
if(tmpString == "linearity"){
strcpy(equ, "yes");
IN >> numOfEqu;
Index.SetLength(numOfEqu);
for(int i = 0; i < numOfEqu; i++) IN >> Index[i];
flag = 1;
}
else if((tmpString == "NONNEGATIVE") || (tmpString == "nonnegative")){
strcpy(nonneg, "yes");
flag = 2;
IN >> numOfNonneg;
Index2.SetLength(numOfNonneg);
for(int i = 0; i < numOfNonneg; i++) IN >> Index2[i];
}
}
ifstream in(Filename);
// cerr << "here" << endl;
in >> numOfConsts >> numOfDims;
// cerr << numOfConsts << " " << numOfDims << endl;
int equs[numOfConsts];
//ZZ cost[numOfDims - 1];
mat_ZZ entries;
entries.SetDims(numOfConsts, numOfDims);
// cerr << "here2" << endl;
if(flag == 2) hold = numOfDims - 1;
for(int i = 0; i < numOfEqu; i++) conv(equs[i], Index[i]);
// cerr << "ther" << endl;
for(int i = 0; i < numOfConsts; i++)
for(int j = 0; j < numOfDims; j++)
{ in >> entries[i][j]; }
// cerr << "here3" << endl;
// printListVector(CheckRedIneq(entries), numOfDims);
if((equ[0] == 'y') && (flag == 0)){ in >> numOfEqu;
for(int i = 0; i < numOfEqu; i++) in >> equs[i];}
// for(int i = 0; i < numOfEqu; i++) cerr << equs[i] << endl;
/* if(max[0] == 'y')
for(int i = 0; i < numOfDims - 1; i++) in >> cost[i]; */
mat_ZZ NONNEG;
NONNEG.SetDims(numOfDims, numOfDims);
int tmpInt;
for(int i = 0; i < numOfNonneg; i++){
conv(tmpInt, Index2[i]); //cerr << Index2[i] << " ";
NONNEG[tmpInt-1][tmpInt-1] = 1;
}
ofstream out("Check_emp.lp");
if(!out){
cerr << "Cannot write Check_red file..." << endl;
exit(1);
}
out << "H-representation" << endl;
out << "begin" << endl;
out << numOfConsts + hold + numOfEqu << " " << numOfDims << " rational" << endl;
for(int i = 0; i < numOfConsts; i++){
for(int j = 0; j < numOfDims; j++){
out << entries[i][j] << " ";}// cerr << entries[i][j] << " ";}
out << endl;
}//cerr << "here" << endl;
if(equ[0] == 'y'){
for(int i = 0; i < numOfEqu; i++){out << -entries[equs[i]-1][0] << " ";
for(int j = 1; j < numOfDims; j++){
out << -entries[equs[i]-1][j] << " "; }//cerr << entries[i][j] << " ";}
out << endl;
}
}
if(nonneg[0] == 'y'){
for(int i = 0; i < numOfDims - 1; i++){ out << 0 << " ";
for(int j = 0; j < numOfDims - 1; j++) out << NONNEG[i][j] << " ";
out << endl;
}
}
out << "end" << endl;
/* if(equ[0] == 'y'){
out << "linearity " << numOfEqu << " ";
for(int i = 0; i < numOfEqu; i++) out << equs[i] << " ";
out << endl;
}*/
out<< "maximize" << endl; out << 0 << " " ;
for(int j = 1; j < numOfDims; j++){
out << entries[0][j] << " "; }
out << endl;
/* CDD+ has a zero exit status even if an error occurs. So make
sure the output file is not there before, then check for the
existence of the output file.
*/
system_with_error_check("rm -f Check_emp.lps");
system_with_error_check(shell_quote(relocated_pathname(CDD_PATH)) + " Check_emp.lp > Check_emp.out");
int FLAG = 0;
ifstream IN3("Check_emp.lps");
if(!IN3){
cerr << relocated_pathname(CDD_PATH) << " failed to create the file `Check_emp.lps'. See `Check_emp.out'." << endl;
exit(1);
}
while(IN3 >> tmpString){
// cerr << tmpString << endl;
if((tmpString == "primal_solution") || ( tmpString == "primal_direction")){
FLAG = 1;
}
}
// system_with_error_check("rm Check_emp.*");
if(FLAG == 0) {
cerr << "Empty polytope or unbounded polytope!"<< endl;
ofstream NOL("numOfLatticePoints");
NOL << 0 << endl;
THROW_LATTE(LattException::pe_Unbounded,0);
}
cerr << "done." << endl;
}
|
