Logic Progr 19030 pair #381920089

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.56052517891 seconds
cpu usage	6.908351309
max memory	6.98175488E8

stage attributes

key	value
output-size	110031
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)

w.r.t. the given Prolog program could successfully be proven:

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 45 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 48 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 27 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) TempFilterProof [SOUND, 38 ms]
(14) IntTRS
(15) RankingReductionPairProof [EQUIVALENT, 20 ms]
(16) YES


----------------------------------------

(0)
Obligation:
Clauses:

main(X) :- ','(>=(X, 1), fibonacci(X, X1)).
fibonacci(N, Ret) :- ','(<(N, 1), ','(!, is(Ret, 0))).
fibonacci(N, Ret) :- ','(=:=(N, 1), ','(!, is(Ret, 1))).
fibonacci(N, Ret) :- ','(!, ','(is(N1, -(N, 1)), ','(fibonacci(N1, Ret1), ','(is(N2, -(N, 2)), ','(fibonacci(N2, Ret2), is(Ret, +(Ret1, Ret2))))))).


Query: main(g)
----------------------------------------

(1) PrologToIRSwTTransformerProof (SOUND)
Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert

{
    "root": 5,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(main X)",
                "(',' (>= X (1)) (fibonacci X X1))"
            ],
            [
                "(fibonacci N Ret)",
                "(',' (< N (1)) (',' (!) (is Ret (0))))"
            ],
            [
                "(fibonacci N Ret)",
                "(',' (=:= N (1)) (',' (!) (is Ret (1))))"
            ],
            [
                "(fibonacci N Ret)",
                "(',' (!) (',' (is N1 (- N (1))) (',' (fibonacci N1 Ret1) (',' (is N2 (- N (2))) (',' (fibonacci N2 Ret2) (is Ret (+ Ret1 Ret2)))))))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "2290": {
                "goal": [
                    {
                        "clause": -1,
                        "scope": -1,
                        "term": "(',' (!_2) (is X27 (1)))"
                    },
                    {
                        "clause": 3,
                        "scope": 2,
                        "term": "(fibonacci T12 X6)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [
                            {
                                "lhs": {

popout

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

job log

popout

actions all output return to Logic Progr 19030