details

property	value
status	complete
benchmark	svcomp-addition01-true-unreach-call-true-termination-modified-c.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	AProVE_numeric

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.09534192085 seconds
cpu usage	4.965236153
max memory	3.29719808E8

stage attributes

key	value
output-size	60248
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern main(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 36 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: main(M, N) :- ','(>(M, 0), ','(>(N, 0), addition(M, N, Ret))). addition(M, N, Ret) :- ','(=:=(N, 0), ','(!, is(Ret, M))). addition(M, N, Ret) :- ','(>(N, 0), ','(!, ','(is(M1, +(M, 1)), ','(is(N1, -(N, 1)), addition(M1, N1, Ret))))). addition(M, N, Ret) :- ','(<(N, 0), ','(!, ','(is(M1, -(M, 1)), ','(is(N1, +(N, 1)), addition(M1, N1, Ret))))). Query: main(g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(main M N)", "(',' (> M (0)) (',' (> N (0)) (addition M N Ret)))" ], [ "(addition M N Ret)", "(',' (=:= N (0)) (',' (!) (is Ret M)))" ], [ "(addition M N Ret)", "(',' (> N (0)) (',' (!) (',' (is M1 (+ M (1))) (',' (is N1 (- N (1))) (addition M1 N1 Ret)))))" ], [ "(addition M N Ret)", "(',' (< N (0)) (',' (!) (',' (is M1 (- M (1))) (',' (is N1 (+ N (1))) (addition M1 N1 Ret)))))" ] ] }, "graph": { "nodes": { "11": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (> T7 (0)) (',' (> T8 (0)) (addition T7 T8 X8)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T7", "T8" ], "free": ["X8"], "exprvars": [] } }, "12": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Progr 19030