Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer 2019-03-28 22.15 pair #432271600
details
property
value
status
complete
benchmark
Fibonacci.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n118.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.55105 seconds
cpu usage
10.7052
user time
10.253
system time
0.45217
max virtual memory
1.9352136E7
max residence set size
858956.0
stage attributes
key
value
starexec-result
NO
output
10.55/3.50 NO 10.55/3.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 10.55/3.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.55/3.51 10.55/3.51 10.55/3.51 Termination of the given C Problem could be disproven: 10.55/3.51 10.55/3.51 (0) C Problem 10.55/3.51 (1) CToIRSProof [EQUIVALENT, 0 ms] 10.55/3.51 (2) IntTRS 10.55/3.51 (3) IRS2T2 [EQUIVALENT, 0 ms] 10.55/3.51 (4) T2IntSys 10.55/3.51 (5) T2 [COMPLETE, 1684 ms] 10.55/3.51 (6) NO 10.55/3.51 10.55/3.51 10.55/3.51 ---------------------------------------- 10.55/3.51 10.55/3.51 (0) 10.55/3.51 Obligation: 10.55/3.51 c file /export/starexec/sandbox/benchmark/theBenchmark.c 10.55/3.51 ---------------------------------------- 10.55/3.51 10.55/3.51 (1) CToIRSProof (EQUIVALENT) 10.55/3.51 Parsed C Integer Program as IRS. 10.55/3.51 ---------------------------------------- 10.55/3.51 10.55/3.51 (2) 10.55/3.51 Obligation: 10.55/3.51 Rules: 10.55/3.51 f1(n, i, j, t) -> f2(x_1, i, j, t) :|: TRUE 10.55/3.51 f2(x, x1, x2, x3) -> f3(x, 0, x2, x3) :|: TRUE 10.55/3.51 f3(x4, x5, x6, x7) -> f4(x4, x5, 1, x7) :|: TRUE 10.55/3.51 f4(x8, x9, x10, x11) -> f5(x8, x9, x10, 0) :|: TRUE 10.55/3.51 f6(x12, x13, x14, x15) -> f7(x12, x13, x14, arith) :|: TRUE && arith = x14 + x13 10.55/3.51 f7(x16, x17, x18, x19) -> f8(x16, x18, x18, x19) :|: TRUE 10.55/3.51 f8(x20, x21, x22, x23) -> f9(x20, x21, x23, x23) :|: TRUE 10.55/3.51 f5(x24, x25, x26, x27) -> f6(x24, x25, x26, x27) :|: x26 < x24 10.55/3.51 f5(x36, x37, x38, x39) -> f6(x36, x37, x38, x39) :|: x38 > x36 10.55/3.51 f9(x28, x29, x30, x31) -> f5(x28, x29, x30, x31) :|: TRUE 10.55/3.51 f5(x32, x33, x34, x35) -> f10(x32, x33, x34, x35) :|: x34 = x32 10.55/3.51 Start term: f1(n, i, j, t) 10.55/3.51 10.55/3.51 ---------------------------------------- 10.55/3.51 10.55/3.51 (3) IRS2T2 (EQUIVALENT) 10.55/3.51 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 10.55/3.51 10.55/3.51 (f1_4,1) 10.55/3.51 (f2_4,2) 10.55/3.51 (f3_4,3) 10.55/3.51 (f4_4,4) 10.55/3.51 (f5_4,5) 10.55/3.51 (f6_4,6) 10.55/3.51 (f7_4,7) 10.55/3.51 (f8_4,8) 10.55/3.51 (f9_4,9) 10.55/3.51 (f10_4,10) 10.55/3.51 10.55/3.51 ---------------------------------------- 10.55/3.51 10.55/3.51 (4) 10.55/3.51 Obligation: 10.55/3.51 START: 1; 10.55/3.51 10.55/3.51 FROM: 1; 10.55/3.51 oldX0 := x0; 10.55/3.51 oldX1 := x1; 10.55/3.51 oldX2 := x2; 10.55/3.51 oldX3 := x3; 10.55/3.51 oldX4 := nondet(); 10.55/3.51 assume(0 = 0); 10.55/3.51 x0 := oldX4; 10.55/3.51 x1 := oldX1; 10.55/3.51 x2 := oldX2; 10.55/3.51 x3 := oldX3; 10.55/3.51 TO: 2; 10.55/3.51 10.55/3.51 FROM: 2; 10.55/3.51 oldX0 := x0; 10.55/3.51 oldX1 := x1; 10.55/3.51 oldX2 := x2; 10.55/3.51 oldX3 := x3; 10.55/3.51 assume(0 = 0); 10.55/3.51 x0 := oldX0; 10.55/3.51 x1 := 0; 10.55/3.51 x2 := oldX2; 10.55/3.51 x3 := oldX3; 10.55/3.51 TO: 3; 10.55/3.51 10.55/3.51 FROM: 3; 10.55/3.51 oldX0 := x0; 10.55/3.51 oldX1 := x1; 10.55/3.51 oldX2 := x2; 10.55/3.51 oldX3 := x3; 10.55/3.51 assume(0 = 0); 10.55/3.51 x0 := oldX0; 10.55/3.51 x1 := oldX1; 10.55/3.51 x2 := 1; 10.55/3.51 x3 := oldX3;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer 2019-03-28 22.15