./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_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_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/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 f0bc64117ef8398002009c167867d7baf0a85044 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:49:08,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:49:08,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:49:08,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:49:08,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:49:08,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:49:08,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:49:08,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:49:08,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:49:08,342 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:49:08,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:49:08,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:49:08,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:49:08,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:49:08,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:49:08,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:49:08,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:49:08,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:49:08,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:49:08,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:49:08,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:49:08,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:49:08,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:49:08,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:49:08,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:49:08,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:49:08,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:49:08,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:49:08,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:49:08,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:49:08,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:49:08,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:49:08,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:49:08,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:49:08,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:49:08,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:49:08,359 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:49:08,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:49:08,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:49:08,370 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:49:08,370 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:49:08,371 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:49:08,371 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:49:08,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:49:08,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:49:08,373 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:49:08,373 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:49:08,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:49:08,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:49:08,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:49:08,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:49:08,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:49:08,374 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:49:08,374 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:49:08,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:49:08,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:49:08,375 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_dde35f78-0cee-41ca-94b1-fdab5808ea7a/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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-11-23 02:49:08,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:49:08,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:49:08,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:49:08,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:49:08,408 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:49:08,409 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 02:49:08,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/data/e87698686/892739b6c63640f5bf5b328c2d75e395/FLAGadc25b0f5 [2018-11-23 02:49:08,833 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:49:08,833 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 02:49:08,837 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/data/e87698686/892739b6c63640f5bf5b328c2d75e395/FLAGadc25b0f5 [2018-11-23 02:49:08,846 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/data/e87698686/892739b6c63640f5bf5b328c2d75e395 [2018-11-23 02:49:08,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:49:08,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:49:08,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:49:08,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:49:08,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:49:08,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:08,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f375ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08, skipping insertion in model container [2018-11-23 02:49:08,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:08,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:49:08,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:49:08,967 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:49:08,969 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:49:08,977 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:49:08,985 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:49:08,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08 WrapperNode [2018-11-23 02:49:08,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:49:08,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:49:08,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:49:08,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:49:08,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:08,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:49:09,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:49:09,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:49:09,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:49:09,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... [2018-11-23 02:49:09,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:49:09,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:49:09,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:49:09,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:49:09,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/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 02:49:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-23 02:49:09,100 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-23 02:49:09,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:49:09,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:49:09,209 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:49:09,209 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:49:09,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:09 BoogieIcfgContainer [2018-11-23 02:49:09,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:49:09,210 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:49:09,210 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:49:09,219 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:49:09,220 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:09" (1/1) ... [2018-11-23 02:49:09,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:49:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-11-23 02:49:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 02:49:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 02:49:09,258 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:09,365 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 02:49:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-23 02:49:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-23 02:49:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:49:09,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:09,525 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 02:49:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 35 transitions. [2018-11-23 02:49:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-11-23 02:49:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:49:09,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:09,719 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 02:49:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 25 states and 34 transitions. [2018-11-23 02:49:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2018-11-23 02:49:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:49:09,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:09,907 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 02:49:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 32 states and 49 transitions. [2018-11-23 02:49:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2018-11-23 02:49:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:49:10,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:10,147 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 02:49:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 32 states and 48 transitions. [2018-11-23 02:49:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2018-11-23 02:49:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:49:10,247 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:10,307 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 02:49:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 37 states and 60 transitions. [2018-11-23 02:49:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2018-11-23 02:49:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 02:49:10,441 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:10,473 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 02:49:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 39 states and 64 transitions. [2018-11-23 02:49:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2018-11-23 02:49:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 02:49:10,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:10,676 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 02:49:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 82 transitions. [2018-11-23 02:49:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 82 transitions. [2018-11-23 02:49:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 02:49:10,917 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-11-23 02:49:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 53 states and 102 transitions. [2018-11-23 02:49:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 102 transitions. [2018-11-23 02:49:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-23 02:49:11,287 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4113 backedges. 171 proven. 747 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2018-11-23 02:49:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 60 states and 124 transitions. [2018-11-23 02:49:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 124 transitions. [2018-11-23 02:49:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-23 02:49:11,815 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9549 backedges. 1067 proven. 389 refuted. 0 times theorem prover too weak. 8093 trivial. 0 not checked. [2018-11-23 02:49:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 65 states and 144 transitions. [2018-11-23 02:49:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 144 transitions. [2018-11-23 02:49:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-11-23 02:49:12,271 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14031 backedges. 488 proven. 1800 refuted. 0 times theorem prover too weak. 11743 trivial. 0 not checked. [2018-11-23 02:49:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 67 states and 146 transitions. [2018-11-23 02:49:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 146 transitions. [2018-11-23 02:49:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-23 02:49:13,208 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 299 proven. 1577 refuted. 0 times theorem prover too weak. 9071 trivial. 0 not checked. [2018-11-23 02:49:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 69 states and 150 transitions. [2018-11-23 02:49:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 150 transitions. [2018-11-23 02:49:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-11-23 02:49:13,505 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 39393 backedges. 970 proven. 4246 refuted. 0 times theorem prover too weak. 34177 trivial. 0 not checked. [2018-11-23 02:49:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 71 states and 152 transitions. [2018-11-23 02:49:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 152 transitions. [2018-11-23 02:49:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-11-23 02:49:14,113 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 935 proven. 3838 refuted. 0 times theorem prover too weak. 20337 trivial. 0 not checked. [2018-11-23 02:49:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 73 states and 154 transitions. [2018-11-23 02:49:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 154 transitions. [2018-11-23 02:49:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-11-23 02:49:14,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1915 proven. 3262 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2018-11-23 02:49:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 75 states and 156 transitions. [2018-11-23 02:49:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 156 transitions. [2018-11-23 02:49:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-11-23 02:49:15,369 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked. [2018-11-23 02:49:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 77 states and 158 transitions. [2018-11-23 02:49:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 158 transitions. [2018-11-23 02:49:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-11-23 02:49:16,037 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24027 backedges. 3672 proven. 1546 refuted. 0 times theorem prover too weak. 18809 trivial. 0 not checked. [2018-11-23 02:49:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 79 states and 160 transitions. [2018-11-23 02:49:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 160 transitions. [2018-11-23 02:49:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-23 02:49:16,544 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:16,790 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 19 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=8] [?] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [|fibonacci_#in~n|=8] [?] ~n := #in~n; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] assume !(~n < 1); VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] assume !(1 == ~n); VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=7] [?] ~n := #in~n; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] assume !(~n < 1); VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] assume !(1 == ~n); VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=6] [?] ~n := #in~n; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(~n < 1); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(1 == ~n); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] CALL call #t~ret0 := fibonacci(~n - 1); 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 #30#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5, |fibonacci_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] assume true; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] RET #30#return; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8, |fibonacci_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#res|=13] [?] assume true; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#res|=13] [?] RET #30#return; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=6] [?] ~n := #in~n; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(~n < 1); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(1 == ~n); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] CALL call #t~ret0 := fibonacci(~n - 1); 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 #30#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5, |fibonacci_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] assume true; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] RET #32#return; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13, |fibonacci_#t~ret1|=8] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#res|=21] [?] assume true; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#res|=21] [?] RET #34#return; VAL [ULTIMATE.start_main_~x~0=8, |ULTIMATE.start_main_#t~ret3|=21] [?] 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=21, ULTIMATE.start_main_~x~0=8] [?] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [ULTIMATE.start_main_~result~0=21, ULTIMATE.start_main_~x~0=8] [?] assume !false; VAL [ULTIMATE.start_main_~result~0=21, ULTIMATE.start_main_~x~0=8] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15-L21] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L17-L21] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15-L21] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L17-L21] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L14-L22] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L14-L22] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28-L32] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] ----- ----- 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; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15-L21] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L17-L21] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15-L21] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L17-L21] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L14-L22] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L14-L22] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28-L32] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28] COND FALSE !(main_~x~0 < 8 || main_~result~0 >= 34) VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] ----- ----- 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; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28] COND FALSE !(main_~x~0 < 8 || main_~result~0 >= 34) VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~x~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call #t~ret3 := fibonacci(~x~0); [L27] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L27] ~result~0 := #t~ret3; [L27] havoc #t~ret3; [L28] COND FALSE !(~x~0 < 8 || ~result~0 >= 34) [L31] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~x~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call #t~ret3 := fibonacci(~x~0); [L27] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L27] ~result~0 := #t~ret3; [L27] havoc #t~ret3; [L28] COND FALSE !(~x~0 < 8 || ~result~0 >= 34) [L31] assert false; [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() ----- [2018-11-23 02:49:17,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:49:17 ImpRootNode [2018-11-23 02:49:17,844 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:49:17,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:49:17,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:49:17,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:49:17,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:09" (3/4) ... [2018-11-23 02:49:17,848 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=8] [?] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [|fibonacci_#in~n|=8] [?] ~n := #in~n; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] assume !(~n < 1); VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] assume !(1 == ~n); VAL [fibonacci_~n=8, |fibonacci_#in~n|=8] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=7] [?] ~n := #in~n; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] assume !(~n < 1); VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] assume !(1 == ~n); VAL [fibonacci_~n=7, |fibonacci_#in~n|=7] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=6] [?] ~n := #in~n; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(~n < 1); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(1 == ~n); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] CALL call #t~ret0 := fibonacci(~n - 1); 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 #30#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5, |fibonacci_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] assume true; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] RET #30#return; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#t~ret0|=8, |fibonacci_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#res|=13] [?] assume true; VAL [fibonacci_~n=7, |fibonacci_#in~n|=7, |fibonacci_#res|=13] [?] RET #30#return; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=6] [?] ~n := #in~n; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(~n < 1); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] assume !(1 == ~n); VAL [fibonacci_~n=6, |fibonacci_#in~n|=6] [?] CALL call #t~ret0 := fibonacci(~n - 1); 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 #30#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5] [?] CALL call #t~ret1 := fibonacci(~n - 2); 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 #32#return; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#t~ret0|=5, |fibonacci_#t~ret1|=3] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] assume true; VAL [fibonacci_~n=6, |fibonacci_#in~n|=6, |fibonacci_#res|=8] [?] RET #32#return; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#t~ret0|=13, |fibonacci_#t~ret1|=8] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#res|=21] [?] assume true; VAL [fibonacci_~n=8, |fibonacci_#in~n|=8, |fibonacci_#res|=21] [?] RET #34#return; VAL [ULTIMATE.start_main_~x~0=8, |ULTIMATE.start_main_#t~ret3|=21] [?] 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=21, ULTIMATE.start_main_~x~0=8] [?] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [ULTIMATE.start_main_~result~0=21, ULTIMATE.start_main_~x~0=8] [?] assume !false; VAL [ULTIMATE.start_main_~result~0=21, ULTIMATE.start_main_~x~0=8] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15-L21] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L17-L21] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15-L21] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L17-L21] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L14-L22] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L14-L22] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28-L32] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] ----- ----- 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; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15-L21] assume !(~n < 1); VAL [#in~n=8, ~n=8] [L17-L21] assume !(1 == ~n); VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15-L21] assume !(~n < 1); VAL [#in~n=7, ~n=7] [L17-L21] assume !(1 == ~n); VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L14-L22] ensures true; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15-L21] assume !(~n < 1); VAL [#in~n=6, ~n=6] [L17-L21] assume !(1 == ~n); VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15-L21] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L17-L21] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L14-L22] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15-L21] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L17-L21] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15-L21] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L17-L21] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L14-L22] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15-L21] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L17-L21] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15-L21] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L17-L21] assume 1 == ~n; [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L14-L22] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15-L21] assume ~n < 1; [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L14-L22] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L14-L22] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L14-L22] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L14-L22] ensures true; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L14-L22] ensures true; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28-L32] assume !(main_~x~0 < 8 || main_~result~0 >= 34); VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28] COND FALSE !(main_~x~0 < 8 || main_~result~0 >= 34) VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] ----- ----- 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; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~x~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~x~0=8] [L27] CALL call main_#t~ret3 := fibonacci(main_~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call main_#t~ret3 := fibonacci(main_~x~0); VAL [main_#t~ret3=21, main_~x~0=8] [L27] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L27] main_~result~0 := main_#t~ret3; [L27] havoc main_#t~ret3; VAL [main_~result~0=21, main_~x~0=8] [L28] COND FALSE !(main_~x~0 < 8 || main_~result~0 >= 34) VAL [main_~result~0=21, main_~x~0=8] [L31] assert false; VAL [main_~result~0=21, main_~x~0=8] [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~x~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call #t~ret3 := fibonacci(~x~0); [L27] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L27] ~result~0 := #t~ret3; [L27] havoc #t~ret3; [L28] COND FALSE !(~x~0 < 8 || ~result~0 >= 34) [L31] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~x~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=8] [L14-L22] ~n := #in~n; VAL [#in~n=8, ~n=8] [L15] COND FALSE !(~n < 1) VAL [#in~n=8, ~n=8] [L17] COND FALSE !(1 == ~n) VAL [#in~n=8, ~n=8] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7] [L14-L22] ~n := #in~n; VAL [#in~n=7, ~n=7] [L15] COND FALSE !(~n < 1) VAL [#in~n=7, ~n=7] [L17] COND FALSE !(1 == ~n) VAL [#in~n=7, ~n=7] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=7, #t~ret0=8, ~n=7] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=7, #t~ret0=8, #t~ret1=5, ~n=7] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=7, #res=13, ~n=7] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=8, #t~ret0=13, ~n=8] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6] [L14-L22] ~n := #in~n; VAL [#in~n=6, ~n=6] [L15] COND FALSE !(~n < 1) VAL [#in~n=6, ~n=6] [L17] COND FALSE !(1 == ~n) VAL [#in~n=6, ~n=6] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5] [L14-L22] ~n := #in~n; VAL [#in~n=5, ~n=5] [L15] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L17] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=6, #t~ret0=5, ~n=6] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4] [L14-L22] ~n := #in~n; VAL [#in~n=4, ~n=4] [L15] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L17] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L14-L22] ~n := #in~n; VAL [#in~n=3, ~n=3] [L15] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L17] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L14-L22] ~n := #in~n; VAL [#in~n=2, ~n=2] [L15] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L17] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L20] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L14-L22] ~n := #in~n; VAL [#in~n=1, ~n=1] [L15] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L17] COND TRUE 1 == ~n [L18] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L20] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L20] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L14-L22] ~n := #in~n; VAL [#in~n=0, ~n=0] [L15] COND TRUE ~n < 1 [L16] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=6, #t~ret0=5, #t~ret1=3, ~n=6] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=6, #res=8, ~n=6] [L20] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=8, #t~ret0=13, #t~ret1=8, ~n=8] [L20] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L20] #res := #t~ret0 + #t~ret1; [L20] havoc #t~ret0; [L20] havoc #t~ret1; VAL [#in~n=8, #res=21, ~n=8] [L27] RET call #t~ret3 := fibonacci(~x~0); [L27] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L27] ~result~0 := #t~ret3; [L27] havoc #t~ret3; [L28] COND FALSE !(~x~0 < 8 || ~result~0 >= 34) [L31] assert false; [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() ----- [2018-11-23 02:49:21,261 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dde35f78-0cee-41ca-94b1-fdab5808ea7a/bin-2019/ukojak/witness.graphml [2018-11-23 02:49:21,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:49:21,262 INFO L168 Benchmark]: Toolchain (without parser) took 12414.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 531.1 MB). Free memory was 953.8 MB in the beginning and 841.3 MB in the end (delta: 112.4 MB). Peak memory consumption was 643.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,263 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:21,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.08 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,265 INFO L168 Benchmark]: Boogie Preprocessor took 13.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:21,265 INFO L168 Benchmark]: RCFGBuilder took 184.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,265 INFO L168 Benchmark]: CodeCheck took 8634.74 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 396.9 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 246.7 MB). Peak memory consumption was 643.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,265 INFO L168 Benchmark]: Witness Printer took 3416.39 ms. Allocated memory is still 1.6 GB. Free memory was 873.2 MB in the beginning and 841.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:21,267 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, 7.5s OverallTime, 19 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1883644 SDtfs, 1955836 SDslu, 3125240 SDs, 0 SdLazy, 8429762 SolverSat, 2287554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15134 GetRequests, 14463 SyntacticMatches, 523 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13770 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5860 NumberOfCodeBlocks, 5860 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5383 ConstructedInterpolants, 0 QuantifiedInterpolants, 3694527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 155286/177798 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: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.08 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 184.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 8634.74 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 396.9 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 246.7 MB). Peak memory consumption was 643.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3416.39 ms. Allocated memory is still 1.6 GB. Free memory was 873.2 MB in the beginning and 841.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...