./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:01:19,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:01:19,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:01:19,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:01:19,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:01:19,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:01:19,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:01:19,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:01:19,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:01:19,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:01:19,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:01:19,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:01:19,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:01:19,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:01:19,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:01:19,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:01:19,632 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:01:19,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:01:19,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:01:19,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:01:19,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:01:19,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:01:19,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:01:19,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:01:19,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:01:19,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:01:19,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:01:19,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:01:19,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:01:19,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:01:19,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:01:19,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:01:19,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:01:19,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:01:19,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:01:19,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:01:19,643 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:01:19,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:01:19,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:01:19,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:01:19,652 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:01:19,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:01:19,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:01:19,652 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:01:19,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:01:19,653 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:01:19,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:01:19,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:01:19,655 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:01:19,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:01:19,656 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_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2018-11-23 00:01:19,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:01:19,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:01:19,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:01:19,690 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:01:19,690 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:01:19,691 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:01:19,725 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/data/b635b561f/5a86b41ff8d5408b997005f38bcac705/FLAGc4483ae3b [2018-11-23 00:01:20,117 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:01:20,117 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/sv-benchmarks/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:01:20,121 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/data/b635b561f/5a86b41ff8d5408b997005f38bcac705/FLAGc4483ae3b [2018-11-23 00:01:20,132 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/data/b635b561f/5a86b41ff8d5408b997005f38bcac705 [2018-11-23 00:01:20,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:01:20,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:01:20,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:01:20,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:01:20,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:01:20,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20, skipping insertion in model container [2018-11-23 00:01:20,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:01:20,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:01:20,260 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:01:20,262 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:01:20,271 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:01:20,279 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:01:20,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20 WrapperNode [2018-11-23 00:01:20,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:01:20,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:01:20,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:01:20,280 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:01:20,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:01:20,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:01:20,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:01:20,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:01:20,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... [2018-11-23 00:01:20,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:01:20,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:01:20,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:01:20,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:01:20,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-23 00:01:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-23 00:01:20,390 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-23 00:01:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:01:20,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:01:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:01:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:01:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:01:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:01:20,504 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:01:20,504 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:01:20,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:20 BoogieIcfgContainer [2018-11-23 00:01:20,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:01:20,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:01:20,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:01:20,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:01:20,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:01:20" (1/3) ... [2018-11-23 00:01:20,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a436c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:20, skipping insertion in model container [2018-11-23 00:01:20,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:01:20" (2/3) ... [2018-11-23 00:01:20,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a436c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:01:20, skipping insertion in model container [2018-11-23 00:01:20,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:20" (3/3) ... [2018-11-23 00:01:20,511 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 00:01:20,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:01:20,526 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:01:20,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:01:20,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:01:20,566 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:01:20,566 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:01:20,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:01:20,567 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:01:20,567 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:01:20,567 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:01:20,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:01:20,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:01:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 00:01:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 00:01:20,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:20,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:20,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:20,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-23 00:01:20,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:20,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:20,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:20,726 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 00:01:20,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:20,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:01:20,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:01:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:01:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:20,741 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 00:01:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:20,833 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 00:01:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:01:20,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 00:01:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:20,842 INFO L225 Difference]: With dead ends: 35 [2018-11-23 00:01:20,842 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 00:01:20,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:01:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 00:01:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 00:01:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 00:01:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 00:01:20,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-23 00:01:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:20,871 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 00:01:20,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:01:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 00:01:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:01:20,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:20,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:20,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:20,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-23 00:01:20,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:20,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:20,918 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 00:01:20,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:01:20,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:01:20,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:01:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:01:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:01:20,920 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-23 00:01:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:20,977 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 00:01:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:01:20,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 00:01:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:20,978 INFO L225 Difference]: With dead ends: 27 [2018-11-23 00:01:20,978 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 00:01:20,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:01:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 00:01:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 00:01:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 00:01:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 00:01:20,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-23 00:01:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:20,984 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 00:01:20,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:01:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 00:01:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:01:20,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:20,985 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:20,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:20,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-23 00:01:20,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:20,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:20,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:20,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:20,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,055 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 00:01:21,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:21,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:01:21,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:21,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 00:01:21,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:01:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:01:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:01:21,155 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-23 00:01:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:21,252 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 00:01:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:01:21,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 00:01:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:21,253 INFO L225 Difference]: With dead ends: 38 [2018-11-23 00:01:21,253 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 00:01:21,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 00:01:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 00:01:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 00:01:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 00:01:21,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-23 00:01:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:21,257 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 00:01:21,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:01:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 00:01:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:01:21,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:21,258 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:21,258 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:21,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-23 00:01:21,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:21,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,309 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 00:01:21,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:21,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:21,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:21,331 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 00:01:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:21,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 00:01:21,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:01:21,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:01:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:01:21,350 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-23 00:01:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:21,403 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-23 00:01:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:01:21,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 00:01:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:21,404 INFO L225 Difference]: With dead ends: 32 [2018-11-23 00:01:21,405 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 00:01:21,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:01:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 00:01:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 00:01:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 00:01:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-23 00:01:21,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-23 00:01:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:21,411 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 00:01:21,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:01:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-23 00:01:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 00:01:21,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:21,413 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:21,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:21,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:21,413 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-23 00:01:21,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:21,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:01:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,474 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 00:01:21,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:21,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:21,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:01:21,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:01:21,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:21,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 00:01:21,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:21,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-23 00:01:21,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:01:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:01:21,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:01:21,574 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-11-23 00:01:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:21,667 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-23 00:01:21,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:01:21,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-23 00:01:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:21,669 INFO L225 Difference]: With dead ends: 42 [2018-11-23 00:01:21,669 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 00:01:21,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:01:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 00:01:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 00:01:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 00:01:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-23 00:01:21,677 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-23 00:01:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:21,677 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-23 00:01:21,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:01:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-23 00:01:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 00:01:21,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:21,680 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:21,680 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-11-23 00:01:21,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-23 00:01:21,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:21,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:01:21,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 00:01:21,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:21,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-23 00:01:21,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:21,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-23 00:01:21,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:01:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:01:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:21,897 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-23 00:01:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:22,137 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-23 00:01:22,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:01:22,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-23 00:01:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:22,142 INFO L225 Difference]: With dead ends: 76 [2018-11-23 00:01:22,142 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 00:01:22,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-23 00:01:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 00:01:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-23 00:01:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:01:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-23 00:01:22,153 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-23 00:01:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:22,154 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-23 00:01:22,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:01:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-23 00:01:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 00:01:22,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:22,156 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:22,156 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:22,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-11-23 00:01:22,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-23 00:01:22,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:22,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:22,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:01:22,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:01:22,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:22,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 00:01:22,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:22,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-23 00:01:22,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:01:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:01:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:01:22,281 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-23 00:01:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:22,359 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-23 00:01:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:01:22,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-23 00:01:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:22,361 INFO L225 Difference]: With dead ends: 52 [2018-11-23 00:01:22,361 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:01:22,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:01:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 00:01:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:01:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-23 00:01:22,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-23 00:01:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:22,370 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-23 00:01:22,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:01:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-23 00:01:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 00:01:22,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:22,373 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:22,373 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:22,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 995062905, now seen corresponding path program 5 times [2018-11-23 00:01:22,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:22,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 195 proven. 269 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2018-11-23 00:01:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:22,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 00:01:22,529 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 00:01:22,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:22,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 958 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-11-23 00:01:22,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:22,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 00:01:22,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:01:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:01:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:01:22,577 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2018-11-23 00:01:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:22,667 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-11-23 00:01:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:01:22,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-23 00:01:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:22,668 INFO L225 Difference]: With dead ends: 88 [2018-11-23 00:01:22,668 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:01:22,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:01:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:01:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:01:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-11-23 00:01:22,673 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 192 [2018-11-23 00:01:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:22,674 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-11-23 00:01:22,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:01:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-11-23 00:01:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 00:01:22,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:22,676 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:22,676 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:22,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 6 times [2018-11-23 00:01:22,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:01:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 145 proven. 154 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-23 00:01:22,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:01:22,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:01:22,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 00:01:22,815 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-23 00:01:22,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:01:22,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:01:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 147 proven. 149 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-11-23 00:01:22,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:01:22,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-11-23 00:01:22,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:01:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:01:22,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:01:22,869 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 12 states. [2018-11-23 00:01:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:01:22,940 INFO L93 Difference]: Finished difference Result 68 states and 116 transitions. [2018-11-23 00:01:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:01:22,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2018-11-23 00:01:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:01:22,941 INFO L225 Difference]: With dead ends: 68 [2018-11-23 00:01:22,942 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:01:22,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:01:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:01:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:01:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:01:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 00:01:22,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 123 [2018-11-23 00:01:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:01:22,947 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 00:01:22,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:01:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 00:01:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 00:01:22,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:01:22,950 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:01:22,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:01:22,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:01:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 7 times [2018-11-23 00:01:22,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:01:22,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:01:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:01:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:01:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:01:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:01:22,990 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #34#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~x~0=5] [?] CALL call #t~ret3 := fibonacci(~x~0); VAL [|fibonacci_#in~n|=5] [?] ~n := #in~n; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(~n < 1); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(1 == ~n); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=4] [?] ~n := #in~n; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(~n < 1); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(1 == ~n); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #30#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] assume true; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] RET #30#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #32#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3, |fibonacci_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] assume true; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] RET #38#return; VAL [main_~x~0=5, |main_#t~ret3|=5] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; VAL [main_~result~0=5, main_~x~0=5] [?] assume !(5 != ~x~0 || 3 == ~result~0); VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30-L34] assume !(5 != ~x~0 || 3 == ~result~0); VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30-L34] assume !(5 != ~x~0 || 3 == ~result~0); VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-23 00:01:23,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:01:23 BoogieIcfgContainer [2018-11-23 00:01:23,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:01:23,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:01:23,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:01:23,081 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:01:23,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:01:20" (3/4) ... [2018-11-23 00:01:23,083 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #34#return; [?] CALL call #t~ret4 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~x~0=5] [?] CALL call #t~ret3 := fibonacci(~x~0); VAL [|fibonacci_#in~n|=5] [?] ~n := #in~n; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(~n < 1); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] assume !(1 == ~n); VAL [fibonacci_~n=5, |fibonacci_#in~n|=5] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=4] [?] ~n := #in~n; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(~n < 1); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] assume !(1 == ~n); VAL [fibonacci_~n=4, |fibonacci_#in~n|=4] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #30#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#t~ret0|=2, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] assume true; VAL [fibonacci_~n=4, |fibonacci_#in~n|=4, |fibonacci_#res|=3] [?] RET #30#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=3] [?] ~n := #in~n; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(~n < 1); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] assume !(1 == ~n); VAL [fibonacci_~n=3, |fibonacci_#in~n|=3] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=2] [?] ~n := #in~n; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(~n < 1); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] assume !(1 == ~n); VAL [fibonacci_~n=2, |fibonacci_#in~n|=2] [?] CALL call #t~ret0 := fibonacci(~n - 1); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=0] [?] ~n := #in~n; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0] [?] assume ~n < 1;#res := 0; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] assume true; VAL [fibonacci_~n=0, |fibonacci_#in~n|=0, |fibonacci_#res|=0] [?] RET #32#return; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=2, |fibonacci_#in~n|=2, |fibonacci_#res|=1] [?] RET #30#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1] [?] CALL call #t~ret1 := fibonacci(~n - 2); VAL [|fibonacci_#in~n|=1] [?] ~n := #in~n; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume !(~n < 1); VAL [fibonacci_~n=1, |fibonacci_#in~n|=1] [?] assume 1 == ~n;#res := 1; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] assume true; VAL [fibonacci_~n=1, |fibonacci_#in~n|=1, |fibonacci_#res|=1] [?] RET #32#return; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#t~ret0|=1, |fibonacci_#t~ret1|=1] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] assume true; VAL [fibonacci_~n=3, |fibonacci_#in~n|=3, |fibonacci_#res|=2] [?] RET #32#return; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#t~ret0|=3, |fibonacci_#t~ret1|=2] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] assume true; VAL [fibonacci_~n=5, |fibonacci_#in~n|=5, |fibonacci_#res|=5] [?] RET #38#return; VAL [main_~x~0=5, |main_#t~ret3|=5] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; VAL [main_~result~0=5, main_~x~0=5] [?] assume !(5 != ~x~0 || 3 == ~result~0); VAL [main_~result~0=5, main_~x~0=5] [?] assume !false; VAL [main_~result~0=5, main_~x~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30-L34] assume !(5 != ~x~0 || 3 == ~result~0); VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17-L23] assume !(~n < 1); VAL [#in~n=5, ~n=5] [L19-L23] assume !(1 == ~n); VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17-L23] assume !(~n < 1); VAL [#in~n=4, ~n=4] [L19-L23] assume !(1 == ~n); VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L12] ensures true; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17-L23] assume !(~n < 1); VAL [#in~n=3, ~n=3] [L19-L23] assume !(1 == ~n); VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17-L23] assume !(~n < 1); VAL [#in~n=2, ~n=2] [L19-L23] assume !(1 == ~n); VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17-L23] assume ~n < 1; [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L12] ensures true; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L12] ensures true; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17-L23] assume !(~n < 1); VAL [#in~n=1, ~n=1] [L19-L23] assume 1 == ~n; [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L12] ensures true; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L12] ensures true; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L12] ensures true; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30-L34] assume !(5 != ~x~0 || 3 == ~result~0); VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L28] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L28] ~x~0 := #t~nondet2; [L28] havoc #t~nondet2; VAL [~x~0=5] [L29] CALL call #t~ret3 := fibonacci(~x~0); VAL [#in~n=5] [L16-L24] ~n := #in~n; VAL [#in~n=5, ~n=5] [L17] COND FALSE !(~n < 1) VAL [#in~n=5, ~n=5] [L19] COND FALSE !(1 == ~n) VAL [#in~n=5, ~n=5] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4] [L16-L24] ~n := #in~n; VAL [#in~n=4, ~n=4] [L17] COND FALSE !(~n < 1) VAL [#in~n=4, ~n=4] [L19] COND FALSE !(1 == ~n) VAL [#in~n=4, ~n=4] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=4, #t~ret0=2, ~n=4] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=4, #t~ret0=2, #t~ret1=1, ~n=4] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=4, #res=3, ~n=4] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=5, #t~ret0=3, ~n=5] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3] [L16-L24] ~n := #in~n; VAL [#in~n=3, ~n=3] [L17] COND FALSE !(~n < 1) VAL [#in~n=3, ~n=3] [L19] COND FALSE !(1 == ~n) VAL [#in~n=3, ~n=3] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2] [L16-L24] ~n := #in~n; VAL [#in~n=2, ~n=2] [L17] COND FALSE !(~n < 1) VAL [#in~n=2, ~n=2] [L19] COND FALSE !(1 == ~n) VAL [#in~n=2, ~n=2] [L22] CALL call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=2, #t~ret0=1, ~n=2] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=0] [L16-L24] ~n := #in~n; VAL [#in~n=0, ~n=0] [L17] COND TRUE ~n < 1 [L18] #res := 0; VAL [#in~n=0, #res=0, ~n=0] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=2, #t~ret0=1, #t~ret1=0, ~n=2] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=2, #res=1, ~n=2] [L22] RET call #t~ret0 := fibonacci(~n - 1); VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; VAL [#in~n=3, #t~ret0=1, ~n=3] [L22] CALL call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=1] [L16-L24] ~n := #in~n; VAL [#in~n=1, ~n=1] [L17] COND FALSE !(~n < 1) VAL [#in~n=1, ~n=1] [L19] COND TRUE 1 == ~n [L20] #res := 1; VAL [#in~n=1, #res=1, ~n=1] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=3, #t~ret0=1, #t~ret1=1, ~n=3] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=3, #res=2, ~n=3] [L22] RET call #t~ret1 := fibonacci(~n - 2); VAL [#in~n=5, #t~ret0=3, #t~ret1=2, ~n=5] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L22] #res := #t~ret0 + #t~ret1; [L22] havoc #t~ret0; [L22] havoc #t~ret1; VAL [#in~n=5, #res=5, ~n=5] [L29] RET call #t~ret3 := fibonacci(~x~0); VAL [#t~ret3=5, ~x~0=5] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] ~result~0 := #t~ret3; [L29] havoc #t~ret3; VAL [~result~0=5, ~x~0=5] [L30] COND FALSE !(5 != ~x~0 || 3 == ~result~0) VAL [~result~0=5, ~x~0=5] [L33] assert false; VAL [~result~0=5, ~x~0=5] [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] ----- [2018-11-23 00:01:23,364 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd65da13-8fee-49ff-b593-f630b2b59a06/bin-2019/uautomizer/witness.graphml [2018-11-23 00:01:23,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:01:23,365 INFO L168 Benchmark]: Toolchain (without parser) took 3230.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 958.1 MB in the beginning and 984.9 MB in the end (delta: -26.8 MB). Peak memory consumption was 179.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,366 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:01:23,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,367 INFO L168 Benchmark]: Boogie Preprocessor took 13.68 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:01:23,367 INFO L168 Benchmark]: RCFGBuilder took 194.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,367 INFO L168 Benchmark]: TraceAbstraction took 2574.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 990.3 MB in the end (delta: 120.9 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,368 INFO L168 Benchmark]: Witness Printer took 283.73 ms. Allocated memory is still 1.2 GB. Free memory was 990.3 MB in the beginning and 984.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:01:23,369 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 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.68 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 194.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2574.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 990.3 MB in the end (delta: 120.9 MB). Peak memory consumption was 198.0 MB. Max. memory is 11.5 GB. * Witness Printer took 283.73 ms. Allocated memory is still 1.2 GB. Free memory was 990.3 MB in the beginning and 984.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 2.5s OverallTime, 10 OverallIterations, 27 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 137 SDslu, 467 SDs, 0 SdLazy, 535 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 584 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=7, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1155 ConstructedInterpolants, 0 QuantifiedInterpolants, 185573 SizeOfPredicates, 27 NumberOfNonLiveVariables, 897 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 6024/6808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...