details

property	value
status	complete
benchmark	svcomp-java-nested-c.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n037.star.cs.uiowa.edu
space	AProVE_numeric

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.03080797195 seconds
cpu usage	4.969554929
max memory	4.08203264E8

stage attributes

key	value
output-size	18433
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() w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 54 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: main :- main(0, 0). main(I, C) :- ','(<(I, 10), loop(I, 3, C)). main(I, C) :- >=(I, 10). loop(I, J, C) :- ','(<(J, 12), ','(is(J1, -(J, 1)), ','(is(C1, +(C, 1)), ','(is(J2, +(J1, 2)), loop(I, J2, C1))))). loop(I, J, C) :- ','(>=(J, 12), ','(is(I1, +(I, 1)), main(I1, C))). Query: main() ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 5, "program": { "directives": [], "clauses": [ [ "(main)", "(main (0) (0))" ], [ "(main I C)", "(',' (< I (10)) (loop I (3) C))" ], [ "(main I C)", "(>= I (10))" ], [ "(loop I J C)", "(',' (< J (12)) (',' (is J1 (- J (1))) (',' (is C1 (+ C (1))) (',' (is J2 (+ J1 (2))) (loop I J2 C1)))))" ], [ "(loop I J C)", "(',' (>= J (12)) (',' (is I1 (+ I (1))) (main I1 C)))" ] ] }, "graph": { "nodes": { "11": { "goal": [{ "clause": 2, "scope": 2, "term": "(main (0) (0))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "2583": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (< (3) (12)) (',' (is X38 (- (3) (1))) (',' (is X39 (+ (0) (1))) (',' (is X40 (+ X38 (2))) (loop (0) X40 X39)))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { popout

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

job log

popout

actions

all output return to Logic Progr 19030