mirrors/sby
3
0
Fork 0
mirror of https://github.com/YosysHQ/sby.git synced 2025-04-12 00:23:35 +00:00
Code Activity

Replace the 'primes' test in junit_timeout_error.sby with a new test that solves a**3 + b**3 == c**3.

Browse source 
The old test tried to find two primes that are 7 apart. It is supposed to time
out after 1 second but on newer hardware the test completes too quickly. This
commit replaces it with a new test that tries to find a non-trivial solution to
the diophantine equation a**3 + b**3 == c**3, which is a lot more difficult.
This commit is contained in:
Emily Schmidt 2024-04-02 11:28:54 +01:00
parent e30a0fe611
commit 725038d315
1 changed files with 14 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

29
tests/junit/junit_timeout_error.sby
View file

@ -17,26 +17,25 @@ solver: smtbmc foo
[script] [script]
read -noverific read -noverific
syntax: read -define SYNTAX_ERROR syntax: read -define SYNTAX_ERROR
read -sv primes.sv read -sv diophantine.sv
prep -top primes prep -top diophantine
[file primes.sv] [file diophantine.sv]
module primes; module diophantine;
parameter [8:0] offset = 7; (* anyconst *) reg [15:0] a, b, c;
(* anyconst *) reg [8:0] prime1;
wire [9:0] prime2 = prime1 + offset;
(* allconst *) reg [4:0] factor;
`ifdef SYNTAX_ERROR `ifdef SYNTAX_ERROR
foo foo
`endif `endif
wire [48:0] x = a*a*a + b*b*b;
wire [48:0] y = c*c*c;
always @* begin always @* begin
if (1 < factor && factor < prime1) assume (a > 0);
assume ((prime1 % factor) != 0); assume (b > 0);
if (1 < factor && factor < prime2) assume (c > 0);
assume ((prime2 % factor) != 0); assume (x == y);
assume (1 < prime1);
cover (1); cover (1);
end end
endmodule endmodule