./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:18:23,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:18:23,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:18:23,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:18:23,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:18:23,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:18:23,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:18:23,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:18:23,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:18:23,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:18:23,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:18:23,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:18:23,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:18:23,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:18:23,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:18:23,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:18:23,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:18:23,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:18:23,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:18:23,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:18:23,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:18:23,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:18:23,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:18:23,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:18:23,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:18:23,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:18:23,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:18:23,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:18:23,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:18:23,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:18:23,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:18:23,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:18:23,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:18:23,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:18:23,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:18:23,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:18:23,567 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 07:18:23,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:18:23,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:18:23,575 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:18:23,575 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:18:23,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:18:23,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:18:23,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:18:23,577 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:18:23,577 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:18:23,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:18:23,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:18:23,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:18:23,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:18:23,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-11-23 07:18:23,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:18:23,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:18:23,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:18:23,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:18:23,620 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:18:23,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:18:23,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/data/2fc0ff82c/4db3c6823fe047f4bcfa7f927f6e4a43/FLAG2d107bebd [2018-11-23 07:18:24,059 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:18:24,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:18:24,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/data/2fc0ff82c/4db3c6823fe047f4bcfa7f927f6e4a43/FLAG2d107bebd [2018-11-23 07:18:24,074 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/data/2fc0ff82c/4db3c6823fe047f4bcfa7f927f6e4a43 [2018-11-23 07:18:24,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:18:24,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:18:24,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:18:24,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:18:24,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:18:24,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24, skipping insertion in model container [2018-11-23 07:18:24,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:18:24,098 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:18:24,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:18:24,207 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:18:24,216 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:18:24,225 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:18:24,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24 WrapperNode [2018-11-23 07:18:24,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:18:24,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:18:24,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:18:24,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:18:24,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:18:24,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:18:24,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:18:24,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:18:24,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:18:24,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:18:24,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:18:24,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:18:24,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:18:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:18:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-23 07:18:24,336 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-23 07:18:24,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:18:24,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:18:24,448 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:18:24,448 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 07:18:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:18:24 BoogieIcfgContainer [2018-11-23 07:18:24,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:18:24,449 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:18:24,449 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:18:24,459 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:18:24,459 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:18:24" (1/1) ... [2018-11-23 07:18:24,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:18:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-11-23 07:18:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 07:18:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:18:24,507 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:18:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-23 07:18:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-23 07:18:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:18:24,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:18:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2018-11-23 07:18:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-11-23 07:18:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:18:24,917 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 07:18:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2018-11-23 07:18:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-11-23 07:18:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:18:25,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 07:18:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2018-11-23 07:18:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2018-11-23 07:18:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:18:25,406 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 07:18:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 48 transitions. [2018-11-23 07:18:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2018-11-23 07:18:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 07:18:25,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 07:18:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 37 states and 60 transitions. [2018-11-23 07:18:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2018-11-23 07:18:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 07:18:25,737 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 07:18:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 39 states and 64 transitions. [2018-11-23 07:18:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2018-11-23 07:18:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 07:18:25,885 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 07:18:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 44 states and 78 transitions. [2018-11-23 07:18:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-11-23 07:18:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 07:18:26,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-23 07:18:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 82 transitions. [2018-11-23 07:18:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions. [2018-11-23 07:18:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 07:18:26,291 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:18:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 145 proven. 154 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-23 07:18:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:18:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 53 states and 83 transitions. [2018-11-23 07:18:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2018-11-23 07:18:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 07:18:27,468 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:18:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:18:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:18:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:18:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:18:27,599 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 11 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~x~0=5] [?] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [|fibonacci_#in~n|=5] [?] ~n := #in~n; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(~n < 1); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(1 == ~n); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=4] [?] ~n := #in~n; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(~n < 1); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(1 == ~n); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #30#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] assume true; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] RET #30#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #32#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3, |fibonacci_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] assume true; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] RET #34#return; VAL [ULTIMATE.start_main_~x~0=5, |ULTIMATE.start_main_#t~ret3|=5] [?] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;main_~result~0 := main_#t~ret3;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] assume !false; VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30-L34] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30-L34] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30] COND FALSE !(5 != main_~x~0 || 3 == main_~result~0) VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30] COND FALSE !(5 != main_~x~0 || 3 == main_~result~0) VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) [L33] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) [L33] assert false; [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() ----- [2018-11-23 07:18:27,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:18:27 ImpRootNode [2018-11-23 07:18:27,732 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:18:27,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:18:27,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:18:27,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:18:27,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:18:24" (3/4) ... [2018-11-23 07:18:27,742 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~x~0=5] [?] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [|fibonacci_#in~n|=5] [?] ~n := #in~n; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(~n < 1); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(1 == ~n); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=4] [?] ~n := #in~n; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(~n < 1); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(1 == ~n); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #30#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] assume true; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] RET #30#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #32#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3, |fibonacci_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] assume true; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] RET #34#return; VAL [ULTIMATE.start_main_~x~0=5, |ULTIMATE.start_main_#t~ret3|=5] [?] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;main_~result~0 := main_#t~ret3;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] assume !false; VAL [ULTIMATE.start_main_~result~0=5, ULTIMATE.start_main_~x~0=5] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30-L34] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30-L34] assume !(5 != main_~x~0 || 3 == main_~result~0); VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30] COND FALSE !(5 != main_~x~0 || 3 == main_~result~0) VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L28] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L28] main_~x~0 := main_#t~nondet2; [L28] havoc main_#t~nondet2; VAL [main_~x~0=5] [L29] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=5, main_~x~0=5] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] main_~result~0 := main_#t~ret3; [L29] havoc main_#t~ret3; VAL [main_~result~0=5, main_~x~0=5] [L30] COND FALSE !(5 != main_~x~0 || 3 == main_~result~0) VAL [main_~result~0=5, main_~x~0=5] [L33] assert false; VAL [main_~result~0=5, main_~x~0=5] [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) [L33] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) [L33] assert false; [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() ----- [2018-11-23 07:18:27,944 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b26bfda4-6b73-4a3b-a149-5b4e53f2223e/bin-2019/ukojak/witness.graphml [2018-11-23 07:18:27,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:18:27,945 INFO L168 Benchmark]: Toolchain (without parser) took 3868.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 959.2 MB in the beginning and 997.5 MB in the end (delta: -38.3 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,948 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:18:27,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.62 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,949 INFO L168 Benchmark]: Boogie Preprocessor took 10.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:18:27,949 INFO L168 Benchmark]: RCFGBuilder took 193.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,949 INFO L168 Benchmark]: CodeCheck took 3290.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,950 INFO L168 Benchmark]: Witness Printer took 205.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:18:27,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 18 locations, 1 error locations. UNSAFE Result, 3.1s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7348 SDtfs, 7606 SDslu, 12120 SDs, 0 SdLazy, 32662 SolverSat, 8896 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3049 GetRequests, 2845 SyntacticMatches, 106 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 54102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 1182/1543 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.62 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.43 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * CodeCheck took 3290.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 42.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. * Witness Printer took 205.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...