./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:07:41,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:07:41,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:07:41,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:07:41,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:07:41,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:07:41,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:07:41,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:07:41,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:07:41,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:07:41,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:07:41,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:07:41,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:07:41,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:07:41,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:07:41,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:07:41,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:07:41,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:07:41,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:07:41,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:07:41,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:07:41,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:07:41,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:07:41,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:07:41,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:07:41,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:07:41,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:07:41,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:07:41,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:07:41,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:07:41,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:07:41,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:07:41,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:07:41,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:07:41,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:07:41,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:07:41,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:07:41,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:07:41,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:07:41,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:07:41,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:07:41,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:07:41,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:07:41,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:07:41,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:07:41,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:07:41,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:07:41,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:07:41,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:07:41,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:07:41,516 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:07:41,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:07:41,517 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:07:41,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:07:41,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:07:41,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:07:41,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:07:41,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:07:41,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:07:41,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:07:41,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:07:41,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:07:41,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:07:41,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:07:41,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:07:41,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:07:41,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:07:41,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:07:41,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:07:41,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:07:41,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! overflow) ) 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2022-02-21 03:07:41,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:07:41,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:07:41,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:07:41,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:07:41,776 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:07:41,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-02-21 03:07:41,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6aca3c2b/469f811d260f4f62937f40905e4bf2bc/FLAG3f74662b0 [2022-02-21 03:07:42,197 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:07:42,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2022-02-21 03:07:42,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6aca3c2b/469f811d260f4f62937f40905e4bf2bc/FLAG3f74662b0 [2022-02-21 03:07:42,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6aca3c2b/469f811d260f4f62937f40905e4bf2bc [2022-02-21 03:07:42,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:07:42,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:07:42,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:07:42,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:07:42,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:07:42,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c7e1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42, skipping insertion in model container [2022-02-21 03:07:42,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:07:42,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:07:42,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-02-21 03:07:42,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:07:42,426 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:07:42,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2022-02-21 03:07:42,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:07:42,457 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:07:42,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42 WrapperNode [2022-02-21 03:07:42,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:07:42,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:07:42,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:07:42,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:07:42,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,493 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2022-02-21 03:07:42,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:07:42,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:07:42,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:07:42,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:07:42,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:07:42,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:07:42,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:07:42,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:07:42,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (1/1) ... [2022-02-21 03:07:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:07:42,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:42,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:07:42,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:07:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-02-21 03:07:42,601 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-02-21 03:07:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:07:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:07:42,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:07:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:07:42,653 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:07:42,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:07:42,807 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:07:42,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:07:42,820 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:07:42,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:07:42 BoogieIcfgContainer [2022-02-21 03:07:42,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:07:42,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:07:42,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:07:42,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:07:42,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:07:42" (1/3) ... [2022-02-21 03:07:42,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135745c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:07:42, skipping insertion in model container [2022-02-21 03:07:42,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:07:42" (2/3) ... [2022-02-21 03:07:42,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135745c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:07:42, skipping insertion in model container [2022-02-21 03:07:42,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:07:42" (3/3) ... [2022-02-21 03:07:42,842 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2022-02-21 03:07:42,846 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:07:42,847 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:07:42,903 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:07:42,909 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:07:42,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:07:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:07:42,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:42,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:42,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 630876797, now seen corresponding path program 1 times [2022-02-21 03:07:42,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:42,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081931486] [2022-02-21 03:07:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:43,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-02-21 03:07:43,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {38#true} is VALID [2022-02-21 03:07:43,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {40#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-21 03:07:43,181 INFO L272 TraceCheckUtils]: 3: Hoare triple {40#(<= |ULTIMATE.start_main_~x~0#1| 46)} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {41#(<= |fibonacci_#in~n| 46)} is VALID [2022-02-21 03:07:43,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#(<= |fibonacci_#in~n| 46)} ~n := #in~n; {42#(<= fibonacci_~n 46)} is VALID [2022-02-21 03:07:43,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(<= fibonacci_~n 46)} assume !(~n < 1); {42#(<= fibonacci_~n 46)} is VALID [2022-02-21 03:07:43,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#(<= fibonacci_~n 46)} assume !(1 == ~n); {42#(<= fibonacci_~n 46)} is VALID [2022-02-21 03:07:43,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= fibonacci_~n 46)} assume !(~n - 1 <= 2147483647); {39#false} is VALID [2022-02-21 03:07:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:07:43,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:43,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081931486] [2022-02-21 03:07:43,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081931486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:43,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:43,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:07:43,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570416531] [2022-02-21 03:07:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:07:43,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:43,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:43,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:07:43,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:07:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:43,258 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,510 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-21 03:07:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:07:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:07:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-21 03:07:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-21 03:07:43,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-02-21 03:07:43,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:43,585 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:07:43,585 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 03:07:43,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:07:43,593 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:43,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 49 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:07:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 03:07:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-21 03:07:43,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:43,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,632 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,632 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,636 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 03:07:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:07:43,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:43,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:43,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-21 03:07:43,638 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-21 03:07:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,642 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-21 03:07:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:07:43,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:43,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:43,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:43,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-21 03:07:43,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2022-02-21 03:07:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:43,648 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:07:43,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:07:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:07:43,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:43,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:43,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:07:43,650 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1917655731, now seen corresponding path program 1 times [2022-02-21 03:07:43,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:43,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617140476] [2022-02-21 03:07:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:43,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {180#true} is VALID [2022-02-21 03:07:43,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {180#true} is VALID [2022-02-21 03:07:43,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {180#true} is VALID [2022-02-21 03:07:43,712 INFO L272 TraceCheckUtils]: 3: Hoare triple {180#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {180#true} is VALID [2022-02-21 03:07:43,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {180#true} ~n := #in~n; {180#true} is VALID [2022-02-21 03:07:43,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume !(~n < 1); {182#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:07:43,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(<= 1 fibonacci_~n)} assume !(1 == ~n); {182#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:07:43,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(<= 1 fibonacci_~n)} assume ~n - 1 <= 2147483647; {182#(<= 1 fibonacci_~n)} is VALID [2022-02-21 03:07:43,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(<= 1 fibonacci_~n)} assume !(~n - 1 >= -2147483648); {181#false} is VALID [2022-02-21 03:07:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:07:43,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:43,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617140476] [2022-02-21 03:07:43,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617140476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:43,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:43,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:07:43,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309774848] [2022-02-21 03:07:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:07:43,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:43,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:43,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:07:43,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:07:43,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:07:43,728 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,777 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:07:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:07:43,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:07:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-21 03:07:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-21 03:07:43,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-02-21 03:07:43,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:43,819 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:07:43,819 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 03:07:43,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:07:43,821 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:43,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 03:07:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:07:43,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:43,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,843 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,843 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,846 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-21 03:07:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:07:43,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:43,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:43,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-21 03:07:43,849 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-21 03:07:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,855 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-21 03:07:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:07:43,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:43,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:43,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:43,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:07:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-21 03:07:43,869 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2022-02-21 03:07:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:43,869 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-21 03:07:43,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:07:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-21 03:07:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:07:43,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:43,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:43,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:07:43,871 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -337751957, now seen corresponding path program 1 times [2022-02-21 03:07:43,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:43,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110653215] [2022-02-21 03:07:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:07:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:43,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~n := #in~n; {301#true} is VALID [2022-02-21 03:07:43,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume ~n < 1;#res := 0; {301#true} is VALID [2022-02-21 03:07:43,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-21 03:07:43,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} #55#return; {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} is VALID [2022-02-21 03:07:43,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-02-21 03:07:43,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {303#(not (<= (+ 2147483649 |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-21 03:07:43,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#(not (<= (+ 2147483649 |ULTIMATE.start_main_~x~0#1|) 0))} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} is VALID [2022-02-21 03:07:43,940 INFO L272 TraceCheckUtils]: 3: Hoare triple {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {301#true} is VALID [2022-02-21 03:07:43,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {301#true} ~n := #in~n; {301#true} is VALID [2022-02-21 03:07:43,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} assume ~n < 1;#res := 0; {301#true} is VALID [2022-02-21 03:07:43,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume true; {301#true} is VALID [2022-02-21 03:07:43,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {301#true} {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} #55#return; {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} is VALID [2022-02-21 03:07:43,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647;main_~result~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1; {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} is VALID [2022-02-21 03:07:43,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} assume main_~x~0#1 - 1 <= 2147483647; {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} is VALID [2022-02-21 03:07:43,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {304#(not (<= (+ |ULTIMATE.start_main_~x~0#1| 2147483648) 0))} assume !(main_~x~0#1 - 1 >= -2147483648); {302#false} is VALID [2022-02-21 03:07:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:07:43,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:43,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110653215] [2022-02-21 03:07:43,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110653215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:43,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:43,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:07:43,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218030454] [2022-02-21 03:07:43,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-21 03:07:43,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:43,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:07:43,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:43,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:07:43,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:07:43,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:07:43,957 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:07:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:43,995 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-21 03:07:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:07:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-21 03:07:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:07:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-21 03:07:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:07:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-21 03:07:43,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-21 03:07:44,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:44,024 INFO L225 Difference]: With dead ends: 25 [2022-02-21 03:07:44,024 INFO L226 Difference]: Without dead ends: 21 [2022-02-21 03:07:44,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:07:44,026 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:44,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-21 03:07:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:07:44,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:44,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,036 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,036 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:44,037 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-21 03:07:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:07:44,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:44,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:44,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-21 03:07:44,039 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-21 03:07:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:44,040 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-21 03:07:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:07:44,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:44,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:44,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:44,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-21 03:07:44,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2022-02-21 03:07:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:44,043 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-21 03:07:44,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:07:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-21 03:07:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:07:44,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:44,044 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:44,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:07:44,045 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash -332002831, now seen corresponding path program 1 times [2022-02-21 03:07:44,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:44,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391251666] [2022-02-21 03:07:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume ~n < 1;#res := 0; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {407#true} #51#return; {413#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:07:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume ~n < 1;#res := 0; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {413#(= |fibonacci_#t~ret4| 0)} #53#return; {418#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:07:44,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {407#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {407#true} is VALID [2022-02-21 03:07:44,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {407#true} is VALID [2022-02-21 03:07:44,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {407#true} is VALID [2022-02-21 03:07:44,148 INFO L272 TraceCheckUtils]: 3: Hoare triple {407#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {407#true} is VALID [2022-02-21 03:07:44,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} assume !(~n < 1); {407#true} is VALID [2022-02-21 03:07:44,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} assume !(1 == ~n); {407#true} is VALID [2022-02-21 03:07:44,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} assume ~n - 1 <= 2147483647; {407#true} is VALID [2022-02-21 03:07:44,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {407#true} assume ~n - 1 >= -2147483648; {407#true} is VALID [2022-02-21 03:07:44,149 INFO L272 TraceCheckUtils]: 9: Hoare triple {407#true} call #t~ret4 := fibonacci(~n - 1); {407#true} is VALID [2022-02-21 03:07:44,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#true} assume !(~n < 1); {407#true} is VALID [2022-02-21 03:07:44,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {407#true} assume !(1 == ~n); {407#true} is VALID [2022-02-21 03:07:44,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {407#true} assume ~n - 1 <= 2147483647; {407#true} is VALID [2022-02-21 03:07:44,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {407#true} assume ~n - 1 >= -2147483648; {407#true} is VALID [2022-02-21 03:07:44,150 INFO L272 TraceCheckUtils]: 15: Hoare triple {407#true} call #t~ret4 := fibonacci(~n - 1); {407#true} is VALID [2022-02-21 03:07:44,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {407#true} assume ~n < 1;#res := 0; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,153 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {407#true} #51#return; {413#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {413#(= |fibonacci_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {413#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {413#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 <= 2147483647; {413#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {413#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 >= -2147483648; {413#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,154 INFO L272 TraceCheckUtils]: 23: Hoare triple {413#(= |fibonacci_#t~ret4| 0)} call #t~ret5 := fibonacci(~n - 2); {407#true} is VALID [2022-02-21 03:07:44,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {407#true} ~n := #in~n; {407#true} is VALID [2022-02-21 03:07:44,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {407#true} assume ~n < 1;#res := 0; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,157 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {419#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {413#(= |fibonacci_#t~ret4| 0)} #53#return; {418#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:07:44,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {418#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {418#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} is VALID [2022-02-21 03:07:44,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {418#(and (= |fibonacci_#t~ret5| 0) (= |fibonacci_#t~ret4| 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {408#false} is VALID [2022-02-21 03:07:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:07:44,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:44,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391251666] [2022-02-21 03:07:44,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391251666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:44,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:44,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:07:44,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012196046] [2022-02-21 03:07:44,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-02-21 03:07:44,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:44,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:44,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:07:44,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:07:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:44,181 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:44,289 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:07:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:07:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-02-21 03:07:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-21 03:07:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-21 03:07:44,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-02-21 03:07:44,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:44,335 INFO L225 Difference]: With dead ends: 37 [2022-02-21 03:07:44,335 INFO L226 Difference]: Without dead ends: 35 [2022-02-21 03:07:44,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:44,344 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:44,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-21 03:07:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-02-21 03:07:44,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:44,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:07:44,362 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:07:44,363 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:07:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:44,376 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:07:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:07:44,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:44,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:44,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 35 states. [2022-02-21 03:07:44,381 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 35 states. [2022-02-21 03:07:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:44,385 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:07:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:07:44,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:44,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:44,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:44,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:07:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-21 03:07:44,391 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 30 [2022-02-21 03:07:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:44,391 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-21 03:07:44,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:07:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:07:44,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:44,392 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:44,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:07:44,393 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1690949841, now seen corresponding path program 1 times [2022-02-21 03:07:44,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:44,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776802382] [2022-02-21 03:07:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume ~n < 1;#res := 0; {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {569#true} #51#return; {575#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-21 03:07:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume 1 == ~n;#res := 1; {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,508 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {575#(= |fibonacci_#t~ret4| 0)} #53#return; {581#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:44,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-02-21 03:07:44,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {569#true} is VALID [2022-02-21 03:07:44,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:44,509 INFO L272 TraceCheckUtils]: 3: Hoare triple {569#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:44,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:44,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:44,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:44,510 INFO L272 TraceCheckUtils]: 9: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:44,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:44,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:44,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:44,511 INFO L272 TraceCheckUtils]: 15: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:44,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#true} assume ~n < 1;#res := 0; {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,513 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {582#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {569#true} #51#return; {575#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#(= |fibonacci_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {575#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {575#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 <= 2147483647; {575#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#(= |fibonacci_#t~ret4| 0)} assume ~n - 2 >= -2147483648; {575#(= |fibonacci_#t~ret4| 0)} is VALID [2022-02-21 03:07:44,515 INFO L272 TraceCheckUtils]: 23: Hoare triple {575#(= |fibonacci_#t~ret4| 0)} call #t~ret5 := fibonacci(~n - 2); {569#true} is VALID [2022-02-21 03:07:44,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {569#true} assume 1 == ~n;#res := 1; {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:44,517 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {583#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {575#(= |fibonacci_#t~ret4| 0)} #53#return; {581#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:44,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {581#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {581#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:44,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {581#(and (= |fibonacci_#t~ret4| 0) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {570#false} is VALID [2022-02-21 03:07:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:07:44,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:44,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776802382] [2022-02-21 03:07:44,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776802382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:44,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714431123] [2022-02-21 03:07:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:44,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:07:44,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:07:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:07:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:44,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:44,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-02-21 03:07:44,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {569#true} is VALID [2022-02-21 03:07:44,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:44,826 INFO L272 TraceCheckUtils]: 3: Hoare triple {569#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:44,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:44,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:44,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:44,838 INFO L272 TraceCheckUtils]: 9: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:44,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:44,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:44,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:44,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:44,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:44,839 INFO L272 TraceCheckUtils]: 15: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:44,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} ~n := #in~n; {635#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:44,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {635#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {639#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:44,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#(< |fibonacci_#in~n| 1)} assume true; {639#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:44,844 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {639#(< |fibonacci_#in~n| 1)} {569#true} #51#return; {646#(< fibonacci_~n 2)} is VALID [2022-02-21 03:07:44,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {646#(< fibonacci_~n 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {646#(< fibonacci_~n 2)} is VALID [2022-02-21 03:07:44,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {646#(< fibonacci_~n 2)} assume ~n - 2 <= 2147483647; {646#(< fibonacci_~n 2)} is VALID [2022-02-21 03:07:44,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {646#(< fibonacci_~n 2)} assume ~n - 2 >= -2147483648; {646#(< fibonacci_~n 2)} is VALID [2022-02-21 03:07:44,845 INFO L272 TraceCheckUtils]: 23: Hoare triple {646#(< fibonacci_~n 2)} call #t~ret5 := fibonacci(~n - 2); {569#true} is VALID [2022-02-21 03:07:44,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#true} ~n := #in~n; {662#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:44,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {662#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:44,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {666#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:44,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {666#(<= 1 |fibonacci_#in~n|)} assume true; {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:44,848 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {666#(<= 1 |fibonacci_#in~n|)} {646#(< fibonacci_~n 2)} #53#return; {570#false} is VALID [2022-02-21 03:07:44,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {570#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {570#false} is VALID [2022-02-21 03:07:44,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {570#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {570#false} is VALID [2022-02-21 03:07:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:07:44,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:45,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {570#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {570#false} is VALID [2022-02-21 03:07:45,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {570#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {570#false} is VALID [2022-02-21 03:07:45,223 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {666#(<= 1 |fibonacci_#in~n|)} {688#(< fibonacci_~n 3)} #53#return; {570#false} is VALID [2022-02-21 03:07:45,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {666#(<= 1 |fibonacci_#in~n|)} assume true; {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:45,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {666#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:45,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {701#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {666#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:45,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#true} ~n := #in~n; {701#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:07:45,225 INFO L272 TraceCheckUtils]: 23: Hoare triple {688#(< fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {569#true} is VALID [2022-02-21 03:07:45,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {688#(< fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {688#(< fibonacci_~n 3)} is VALID [2022-02-21 03:07:45,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {688#(< fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {688#(< fibonacci_~n 3)} is VALID [2022-02-21 03:07:45,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {688#(< fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {688#(< fibonacci_~n 3)} is VALID [2022-02-21 03:07:45,227 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {720#(< |fibonacci_#in~n| 2)} {569#true} #51#return; {688#(< fibonacci_~n 3)} is VALID [2022-02-21 03:07:45,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {720#(< |fibonacci_#in~n| 2)} assume true; {720#(< |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:45,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#(or (< |fibonacci_#in~n| 2) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {720#(< |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:45,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} ~n := #in~n; {727#(or (< |fibonacci_#in~n| 2) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:07:45,228 INFO L272 TraceCheckUtils]: 15: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:45,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:45,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:45,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:45,229 INFO L272 TraceCheckUtils]: 9: Hoare triple {569#true} call #t~ret4 := fibonacci(~n - 1); {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} assume ~n - 1 >= -2147483648; {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} assume ~n - 1 <= 2147483647; {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#true} assume !(1 == ~n); {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} assume !(~n < 1); {569#true} is VALID [2022-02-21 03:07:45,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {569#true} ~n := #in~n; {569#true} is VALID [2022-02-21 03:07:45,229 INFO L272 TraceCheckUtils]: 3: Hoare triple {569#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:45,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {569#true} is VALID [2022-02-21 03:07:45,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {569#true} is VALID [2022-02-21 03:07:45,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-02-21 03:07:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:07:45,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714431123] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:45,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:45,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-02-21 03:07:45,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960755822] [2022-02-21 03:07:45,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:45,231 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-02-21 03:07:45,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:45,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:45,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:45,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:07:45,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:07:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:07:45,270 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:45,995 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-02-21 03:07:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:07:45,996 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-02-21 03:07:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-02-21 03:07:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-02-21 03:07:46,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 81 transitions. [2022-02-21 03:07:46,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:46,084 INFO L225 Difference]: With dead ends: 91 [2022-02-21 03:07:46,084 INFO L226 Difference]: Without dead ends: 65 [2022-02-21 03:07:46,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:07:46,086 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 144 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:46,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 81 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:07:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-21 03:07:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-02-21 03:07:46,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:46,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,118 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,119 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:46,122 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-02-21 03:07:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-02-21 03:07:46,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:46,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:46,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) Second operand 65 states. [2022-02-21 03:07:46,124 INFO L87 Difference]: Start difference. First operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) Second operand 65 states. [2022-02-21 03:07:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:46,127 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-02-21 03:07:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-02-21 03:07:46,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:46,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:46,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:46,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-02-21 03:07:46,134 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2022-02-21 03:07:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:46,135 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-02-21 03:07:46,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-21 03:07:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:07:46,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:46,136 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:46,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:07:46,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:46,344 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1550339203, now seen corresponding path program 2 times [2022-02-21 03:07:46,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:46,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918816352] [2022-02-21 03:07:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:07:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:46,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {1088#true} assume !(~n < 1); {1088#true} is VALID [2022-02-21 03:07:46,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {1088#true} assume 1 == ~n;#res := 1; {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,412 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1088#true} #51#return; {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 03:07:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:46,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1088#true} assume ~n < 1;#res := 0; {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #53#return; {1100#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:46,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {1088#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1088#true} is VALID [2022-02-21 03:07:46,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1088#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1088#true} is VALID [2022-02-21 03:07:46,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1088#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1088#true} is VALID [2022-02-21 03:07:46,432 INFO L272 TraceCheckUtils]: 3: Hoare triple {1088#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1088#true} is VALID [2022-02-21 03:07:46,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1088#true} assume !(~n < 1); {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1088#true} assume !(1 == ~n); {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1088#true} assume ~n - 1 <= 2147483647; {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {1088#true} assume ~n - 1 >= -2147483648; {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L272 TraceCheckUtils]: 9: Hoare triple {1088#true} call #t~ret4 := fibonacci(~n - 1); {1088#true} is VALID [2022-02-21 03:07:46,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {1088#true} assume !(~n < 1); {1088#true} is VALID [2022-02-21 03:07:46,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1088#true} assume 1 == ~n;#res := 1; {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,435 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1101#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1088#true} #51#return; {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:46,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:46,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 <= 2147483647; {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:46,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 >= -2147483648; {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:46,437 INFO L272 TraceCheckUtils]: 18: Hoare triple {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} call #t~ret5 := fibonacci(~n - 2); {1088#true} is VALID [2022-02-21 03:07:46,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#true} assume ~n < 1;#res := 0; {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:46,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1102#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1095#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #53#return; {1100#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:46,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {1100#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1100#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:46,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {1100#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1089#false} is VALID [2022-02-21 03:07:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:07:46,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:46,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918816352] [2022-02-21 03:07:46,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918816352] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:46,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434189899] [2022-02-21 03:07:46,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:07:46,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:46,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:46,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:07:46,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:07:46,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:07:46,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:07:46,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:07:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:46,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1088#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1088#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1088#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L272 TraceCheckUtils]: 3: Hoare triple {1088#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1088#true} assume !(~n < 1); {1088#true} is VALID [2022-02-21 03:07:46,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1088#true} assume !(1 == ~n); {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1088#true} assume ~n - 1 <= 2147483647; {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1088#true} assume ~n - 1 >= -2147483648; {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L272 TraceCheckUtils]: 9: Hoare triple {1088#true} call #t~ret4 := fibonacci(~n - 1); {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {1088#true} assume !(~n < 1); {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {1088#true} assume 1 == ~n;#res := 1; {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {1088#true} assume true; {1088#true} is VALID [2022-02-21 03:07:46,599 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1088#true} {1088#true} #51#return; {1088#true} is VALID [2022-02-21 03:07:46,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {1088#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1151#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:07:46,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1151#(<= |fibonacci_#t~ret4| 2147483647)} assume ~n - 2 <= 2147483647; {1151#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:07:46,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1151#(<= |fibonacci_#t~ret4| 2147483647)} assume ~n - 2 >= -2147483648; {1151#(<= |fibonacci_#t~ret4| 2147483647)} is VALID [2022-02-21 03:07:46,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {1151#(<= |fibonacci_#t~ret4| 2147483647)} call #t~ret5 := fibonacci(~n - 2); {1088#true} is VALID [2022-02-21 03:07:46,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {1088#true} ~n := #in~n; {1088#true} is VALID [2022-02-21 03:07:46,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#true} assume ~n < 1;#res := 0; {1167#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:46,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1167#(<= |fibonacci_#res| 0)} assume true; {1167#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:46,602 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1167#(<= |fibonacci_#res| 0)} {1151#(<= |fibonacci_#t~ret4| 2147483647)} #53#return; {1174#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} is VALID [2022-02-21 03:07:46,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {1174#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1174#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} is VALID [2022-02-21 03:07:46,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 2147483647))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1089#false} is VALID [2022-02-21 03:07:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:07:46,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:07:46,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434189899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:46,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:07:46,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-02-21 03:07:46,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033391110] [2022-02-21 03:07:46,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-21 03:07:46,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:46,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:46,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:46,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:07:46,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:46,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:07:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:07:46,622 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:46,712 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-21 03:07:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:07:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-21 03:07:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:07:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:07:46,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-21 03:07:46,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:46,744 INFO L225 Difference]: With dead ends: 61 [2022-02-21 03:07:46,744 INFO L226 Difference]: Without dead ends: 60 [2022-02-21 03:07:46,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:07:46,745 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:46,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-21 03:07:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-02-21 03:07:46,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:46,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,773 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,773 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:46,776 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-21 03:07:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-21 03:07:46,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:46,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:46,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) Second operand 60 states. [2022-02-21 03:07:46,778 INFO L87 Difference]: Start difference. First operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) Second operand 60 states. [2022-02-21 03:07:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:46,781 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-21 03:07:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-21 03:07:46,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:46,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:46,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:46,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2022-02-21 03:07:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-02-21 03:07:46,784 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2022-02-21 03:07:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:46,785 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-02-21 03:07:46,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:07:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-02-21 03:07:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:07:46,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:46,786 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:46,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:07:46,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:07:47,000 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1559363195, now seen corresponding path program 1 times [2022-02-21 03:07:47,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:47,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160088365] [2022-02-21 03:07:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:47,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume 1 == ~n;#res := 1; {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,080 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1434#true} #51#return; {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-21 03:07:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:47,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume ~n < 1;#res := 0; {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #53#return; {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:47,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1434#true} is VALID [2022-02-21 03:07:47,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1434#true} is VALID [2022-02-21 03:07:47,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,121 INFO L272 TraceCheckUtils]: 3: Hoare triple {1434#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,122 INFO L272 TraceCheckUtils]: 9: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L272 TraceCheckUtils]: 15: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume 1 == ~n;#res := 1; {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,129 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1447#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1434#true} #51#return; {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:47,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:47,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 <= 2147483647; {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:47,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} assume ~n - 2 >= -2147483648; {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} is VALID [2022-02-21 03:07:47,131 INFO L272 TraceCheckUtils]: 24: Hoare triple {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} call #t~ret5 := fibonacci(~n - 2); {1434#true} is VALID [2022-02-21 03:07:47,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {1434#true} assume ~n < 1;#res := 0; {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:47,133 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1448#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {1441#(= (+ (- 1) |fibonacci_#t~ret4|) 0)} #53#return; {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:47,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:47,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume #t~ret4 + #t~ret5 <= 2147483647; {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} is VALID [2022-02-21 03:07:47,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {1446#(and (= |fibonacci_#t~ret5| 0) (= (+ (- 1) |fibonacci_#t~ret4|) 0))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1435#false} is VALID [2022-02-21 03:07:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:07:47,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:47,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160088365] [2022-02-21 03:07:47,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160088365] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:47,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150500637] [2022-02-21 03:07:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:47,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:47,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:07:47,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:07:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:47,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:07:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:47,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:47,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1434#true} is VALID [2022-02-21 03:07:47,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L272 TraceCheckUtils]: 3: Hoare triple {1434#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L272 TraceCheckUtils]: 9: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,309 INFO L272 TraceCheckUtils]: 15: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume 1 == ~n;#res := 1; {1506#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:07:47,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {1506#(<= 1 |fibonacci_#res|)} assume true; {1506#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:07:47,311 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1506#(<= 1 |fibonacci_#res|)} {1434#true} #51#return; {1513#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {1513#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1513#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {1513#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {1513#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {1513#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {1513#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,312 INFO L272 TraceCheckUtils]: 24: Hoare triple {1513#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1434#true} is VALID [2022-02-21 03:07:47,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {1434#true} assume ~n < 1;#res := 0; {1434#true} is VALID [2022-02-21 03:07:47,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {1434#true} assume true; {1434#true} is VALID [2022-02-21 03:07:47,313 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1434#true} {1513#(<= 1 |fibonacci_#t~ret4|)} #53#return; {1513#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {1513#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1541#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} is VALID [2022-02-21 03:07:47,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {1541#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} assume #t~ret4 + #t~ret5 <= 2147483647; {1541#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} is VALID [2022-02-21 03:07:47,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {1541#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 (+ |fibonacci_#t~ret5| 2147483648)))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1435#false} is VALID [2022-02-21 03:07:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:07:47,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:47,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {1548#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {1435#false} is VALID [2022-02-21 03:07:47,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {1548#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume #t~ret4 + #t~ret5 <= 2147483647; {1548#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:47,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {1555#(<= 0 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1548#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:47,488 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1434#true} {1555#(<= 0 |fibonacci_#t~ret4|)} #53#return; {1555#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {1434#true} assume true; {1434#true} is VALID [2022-02-21 03:07:47,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {1434#true} assume ~n < 1;#res := 0; {1434#true} is VALID [2022-02-21 03:07:47,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,489 INFO L272 TraceCheckUtils]: 24: Hoare triple {1555#(<= 0 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {1434#true} is VALID [2022-02-21 03:07:47,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {1555#(<= 0 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {1555#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {1555#(<= 0 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {1555#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {1555#(<= 0 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1555#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,491 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1586#(<= 0 |fibonacci_#res|)} {1434#true} #51#return; {1555#(<= 0 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:07:47,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1586#(<= 0 |fibonacci_#res|)} assume true; {1586#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:07:47,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume 1 == ~n;#res := 1; {1586#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:07:47,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,492 INFO L272 TraceCheckUtils]: 15: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L272 TraceCheckUtils]: 9: Hoare triple {1434#true} call #t~ret4 := fibonacci(~n - 1); {1434#true} is VALID [2022-02-21 03:07:47,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume ~n - 1 >= -2147483648; {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} assume ~n - 1 <= 2147483647; {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume !(1 == ~n); {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} assume !(~n < 1); {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} ~n := #in~n; {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L272 TraceCheckUtils]: 3: Hoare triple {1434#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1434#true} is VALID [2022-02-21 03:07:47,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1434#true} is VALID [2022-02-21 03:07:47,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1434#true} is VALID [2022-02-21 03:07:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 03:07:47,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150500637] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:47,499 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:47,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-02-21 03:07:47,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530445459] [2022-02-21 03:07:47,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-02-21 03:07:47,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:47,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:47,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:47,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:07:47,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:07:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:07:47,538 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:47,803 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-02-21 03:07:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:07:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-02-21 03:07:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-02-21 03:07:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-02-21 03:07:47,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2022-02-21 03:07:47,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:47,856 INFO L225 Difference]: With dead ends: 70 [2022-02-21 03:07:47,857 INFO L226 Difference]: Without dead ends: 69 [2022-02-21 03:07:47,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:07:47,858 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:47,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:07:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-21 03:07:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-21 03:07:47,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:47,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:07:47,905 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:07:47,905 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:07:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:47,914 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-02-21 03:07:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-02-21 03:07:47,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:47,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:47,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) Second operand 69 states. [2022-02-21 03:07:47,918 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) Second operand 69 states. [2022-02-21 03:07:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:47,925 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-02-21 03:07:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-02-21 03:07:47,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:47,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:47,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:47,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 12 states have call predecessors, (27), 7 states have call successors, (27) [2022-02-21 03:07:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2022-02-21 03:07:47,932 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 32 [2022-02-21 03:07:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:47,933 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2022-02-21 03:07:47,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:07:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2022-02-21 03:07:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:07:47,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:47,934 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:47,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:07:48,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:48,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 631942748, now seen corresponding path program 1 times [2022-02-21 03:07:48,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:48,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858068393] [2022-02-21 03:07:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:07:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,265 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume ~n < 1;#res := 0; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1986#(<= |fibonacci_#res| 0)} assume true; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1986#(<= |fibonacci_#res| 0)} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L272 TraceCheckUtils]: 5: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:48,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:48,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} assume ~n < 1;#res := 0; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {1986#(<= |fibonacci_#res| 0)} assume true; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1986#(<= |fibonacci_#res| 0)} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,288 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-21 03:07:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:48,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:48,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {1974#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1942#true} is VALID [2022-02-21 03:07:48,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1942#true} is VALID [2022-02-21 03:07:48,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:48,313 INFO L272 TraceCheckUtils]: 3: Hoare triple {1942#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:48,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L272 TraceCheckUtils]: 9: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:48,314 INFO L272 TraceCheckUtils]: 15: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:48,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,316 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,317 INFO L272 TraceCheckUtils]: 24: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:48,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {1942#true} assume ~n < 1;#res := 0; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {1986#(<= |fibonacci_#res| 0)} assume true; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,318 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1986#(<= |fibonacci_#res| 0)} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 <= 2147483647; {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} is VALID [2022-02-21 03:07:48,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {1984#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 1)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,320 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,325 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:48,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:48,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:48,327 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1987#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {1974#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {1974#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1974#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {1974#(and (= (+ (- 1) |fibonacci_#t~ret5|) 0) (<= |fibonacci_#t~ret4| 1))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1943#false} is VALID [2022-02-21 03:07:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-21 03:07:48,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:48,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858068393] [2022-02-21 03:07:48,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858068393] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:48,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154067512] [2022-02-21 03:07:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:48,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:48,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:07:48,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:07:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:07:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:48,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L272 TraceCheckUtils]: 3: Hoare triple {1942#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:48,677 INFO L272 TraceCheckUtils]: 9: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L272 TraceCheckUtils]: 15: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,681 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,682 INFO L272 TraceCheckUtils]: 24: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:48,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {1942#true} assume ~n < 1;#res := 0; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {1986#(<= |fibonacci_#res| 0)} assume true; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:48,683 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1986#(<= |fibonacci_#res| 0)} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 <= 2147483647; {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {2075#(and (<= |fibonacci_#t~ret5| 0) (<= |fibonacci_#t~ret4| 1))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,685 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1942#true} #51#return; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 <= 2147483647; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} assume ~n - 2 >= -2147483648; {1968#(<= |fibonacci_#t~ret4| 1)} is VALID [2022-02-21 03:07:48,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(<= |fibonacci_#t~ret4| 1)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:48,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:48,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:48,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:48,687 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {1968#(<= |fibonacci_#t~ret4| 1)} #53#return; {2118#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {2118#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2118#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} is VALID [2022-02-21 03:07:48,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {2118#(and (<= |fibonacci_#t~ret5| 1) (<= |fibonacci_#t~ret4| 1))} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1943#false} is VALID [2022-02-21 03:07:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-21 03:07:48,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:49,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {2125#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume !(#t~ret4 + #t~ret5 <= 2147483647); {1943#false} is VALID [2022-02-21 03:07:49,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {2125#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2125#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:07:49,343 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1985#(<= |fibonacci_#res| 1)} {2132#(<= |fibonacci_#t~ret4| 2147483646)} #53#return; {2125#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483647)} is VALID [2022-02-21 03:07:49,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {1985#(<= |fibonacci_#res| 1)} assume true; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:49,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {1985#(<= |fibonacci_#res| 1)} is VALID [2022-02-21 03:07:49,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:49,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:49,345 INFO L272 TraceCheckUtils]: 37: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:49,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 >= -2147483648; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 <= 2147483647; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,347 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2163#(<= |fibonacci_#res| 2147483646)} {1942#true} #51#return; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {2163#(<= |fibonacci_#res| 2147483646)} assume true; {2163#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:07:49,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2163#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:07:49,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume #t~ret4 + #t~ret5 <= 2147483647; {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:07:49,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:07:49,350 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1986#(<= |fibonacci_#res| 0)} {2132#(<= |fibonacci_#t~ret4| 2147483646)} #53#return; {2170#(<= (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|) 2147483646)} is VALID [2022-02-21 03:07:49,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {1986#(<= |fibonacci_#res| 0)} assume true; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:49,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {1942#true} assume ~n < 1;#res := 0; {1986#(<= |fibonacci_#res| 0)} is VALID [2022-02-21 03:07:49,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:49,351 INFO L272 TraceCheckUtils]: 24: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} call #t~ret5 := fibonacci(~n - 2); {1942#true} is VALID [2022-02-21 03:07:49,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 >= -2147483648; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume ~n - 2 <= 2147483647; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {2132#(<= |fibonacci_#t~ret4| 2147483646)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,352 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2163#(<= |fibonacci_#res| 2147483646)} {1942#true} #51#return; {2132#(<= |fibonacci_#t~ret4| 2147483646)} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {2163#(<= |fibonacci_#res| 2147483646)} assume true; {2163#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#true} assume 1 == ~n;#res := 1; {2163#(<= |fibonacci_#res| 2147483646)} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:49,353 INFO L272 TraceCheckUtils]: 15: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:49,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L272 TraceCheckUtils]: 9: Hoare triple {1942#true} call #t~ret4 := fibonacci(~n - 1); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#true} assume ~n - 1 >= -2147483648; {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1942#true} assume ~n - 1 <= 2147483647; {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1942#true} assume !(1 == ~n); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1942#true} assume !(~n < 1); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {1942#true} ~n := #in~n; {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L272 TraceCheckUtils]: 3: Hoare triple {1942#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:49,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1942#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {1942#true} is VALID [2022-02-21 03:07:49,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1942#true} is VALID [2022-02-21 03:07:49,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1942#true} is VALID [2022-02-21 03:07:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-21 03:07:49,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154067512] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:49,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:49,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-02-21 03:07:49,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571284407] [2022-02-21 03:07:49,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:49,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-02-21 03:07:49,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:49,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:07:49,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:49,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:07:49,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:49,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:07:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:07:49,392 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:07:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:49,742 INFO L93 Difference]: Finished difference Result 138 states and 205 transitions. [2022-02-21 03:07:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-21 03:07:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-02-21 03:07:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:07:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 87 transitions. [2022-02-21 03:07:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:07:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 87 transitions. [2022-02-21 03:07:49,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 87 transitions. [2022-02-21 03:07:49,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:49,818 INFO L225 Difference]: With dead ends: 138 [2022-02-21 03:07:49,818 INFO L226 Difference]: Without dead ends: 137 [2022-02-21 03:07:49,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:07:49,819 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:49,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 141 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:07:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-21 03:07:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2022-02-21 03:07:49,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:49,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:49,870 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:49,870 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:49,879 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2022-02-21 03:07:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2022-02-21 03:07:49,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:49,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:49,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 137 states. [2022-02-21 03:07:49,881 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 137 states. [2022-02-21 03:07:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:49,890 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2022-02-21 03:07:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2022-02-21 03:07:49,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:49,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:49,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:49,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:07:49,899 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 45 [2022-02-21 03:07:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:49,900 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:07:49,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-21 03:07:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:07:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-21 03:07:49,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:49,901 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:07:49,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:07:50,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:50,115 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1516546273, now seen corresponding path program 1 times [2022-02-21 03:07:50,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:50,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489796290] [2022-02-21 03:07:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-21 03:07:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L272 TraceCheckUtils]: 5: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {2811#true} assume ~n - 2 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#true} assume ~n - 2 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {2811#true} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {2811#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2811#true} is VALID [2022-02-21 03:07:50,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,195 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 03:07:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L272 TraceCheckUtils]: 5: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {2811#true} assume ~n - 2 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {2811#true} assume ~n - 2 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {2811#true} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,200 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {2811#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {2811#true} assume ~n - 2 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {2811#true} assume ~n - 2 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {2811#true} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {2811#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-21 03:07:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume 1 == ~n;#res := 1; {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,219 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #53#return; {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L272 TraceCheckUtils]: 3: Hoare triple {2811#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,219 INFO L272 TraceCheckUtils]: 9: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L272 TraceCheckUtils]: 15: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L272 TraceCheckUtils]: 21: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {2811#true} assume !(1 == ~n); {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {2811#true} assume ~n - 1 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2811#true} assume ~n - 1 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L272 TraceCheckUtils]: 27: Hoare triple {2811#true} call #t~ret4 := fibonacci(~n - 1); {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {2811#true} assume ~n - 2 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {2811#true} assume ~n - 2 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,221 INFO L272 TraceCheckUtils]: 35: Hoare triple {2811#true} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {2811#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {2811#true} assume ~n - 2 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {2811#true} assume ~n - 2 >= -2147483648; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L272 TraceCheckUtils]: 48: Hoare triple {2811#true} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {2811#true} assume ~n < 1;#res := 0; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,222 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2811#true} {2811#true} #53#return; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {2811#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 <= 2147483647; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {2811#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {2811#true} assume true; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2811#true} {2811#true} #51#return; {2811#true} is VALID [2022-02-21 03:07:50,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {2811#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,224 INFO L272 TraceCheckUtils]: 61: Hoare triple {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {2811#true} is VALID [2022-02-21 03:07:50,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {2811#true} ~n := #in~n; {2811#true} is VALID [2022-02-21 03:07:50,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {2811#true} assume !(~n < 1); {2811#true} is VALID [2022-02-21 03:07:50,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {2811#true} assume 1 == ~n;#res := 1; {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} assume true; {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,225 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2897#(and (<= |fibonacci_#res| 1) (<= 1 |fibonacci_#res|))} {2855#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #53#return; {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:50,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:50,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume #t~ret4 + #t~ret5 <= 2147483647; {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} is VALID [2022-02-21 03:07:50,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {2861#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (= (+ (- 1) |fibonacci_#t~ret5|) 0))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {2812#false} is VALID [2022-02-21 03:07:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-02-21 03:07:50,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:50,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489796290] [2022-02-21 03:07:50,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489796290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:50,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:50,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:07:50,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107042375] [2022-02-21 03:07:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-02-21 03:07:50,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:50,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:50,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:07:50,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:07:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:50,250 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,398 INFO L93 Difference]: Finished difference Result 112 states and 174 transitions. [2022-02-21 03:07:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:07:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-02-21 03:07:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:07:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:07:50,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-21 03:07:50,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:50,437 INFO L225 Difference]: With dead ends: 112 [2022-02-21 03:07:50,437 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 03:07:50,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:50,439 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:50,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 03:07:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-02-21 03:07:50,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:50,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,500 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,500 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,509 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:07:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:07:50,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:50,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:50,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:07:50,512 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:07:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,521 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:07:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:07:50,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:50,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:50,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:50,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:07:50,530 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 70 [2022-02-21 03:07:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:50,530 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:07:50,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:07:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-21 03:07:50,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:50,533 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:07:50,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:07:50,533 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash -514534523, now seen corresponding path program 2 times [2022-02-21 03:07:50,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:50,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722356658] [2022-02-21 03:07:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,642 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3359#true} is VALID [2022-02-21 03:07:50,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L272 TraceCheckUtils]: 5: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} assume ~n - 2 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} assume ~n - 2 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {3359#true} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3359#true} is VALID [2022-02-21 03:07:50,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,652 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,655 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L272 TraceCheckUtils]: 5: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} assume ~n - 2 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} assume ~n - 2 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L272 TraceCheckUtils]: 20: Hoare triple {3359#true} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3359#true} is VALID [2022-02-21 03:07:50,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,685 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} assume ~n - 2 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {3359#true} assume ~n - 2 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L272 TraceCheckUtils]: 33: Hoare triple {3359#true} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,688 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-21 03:07:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:50,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #53#return; {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {3359#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L272 TraceCheckUtils]: 3: Hoare triple {3359#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,707 INFO L272 TraceCheckUtils]: 9: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L272 TraceCheckUtils]: 15: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L272 TraceCheckUtils]: 21: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {3359#true} assume !(1 == ~n); {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} assume ~n - 1 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} assume ~n - 1 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,710 INFO L272 TraceCheckUtils]: 27: Hoare triple {3359#true} call #t~ret4 := fibonacci(~n - 1); {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} assume ~n - 2 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} assume ~n - 2 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L272 TraceCheckUtils]: 36: Hoare triple {3359#true} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {3359#true} assume ~n - 2 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {3359#true} assume ~n - 2 >= -2147483648; {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L272 TraceCheckUtils]: 49: Hoare triple {3359#true} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {3359#true} assume !(~n < 1); {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {3359#true} assume 1 == ~n;#res := 1; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3359#true} {3359#true} #53#return; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {3359#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3359#true} is VALID [2022-02-21 03:07:50,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {3359#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3359#true} is VALID [2022-02-21 03:07:50,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {3359#true} assume true; {3359#true} is VALID [2022-02-21 03:07:50,715 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3359#true} {3359#true} #51#return; {3359#true} is VALID [2022-02-21 03:07:50,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {3359#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:07:50,716 INFO L272 TraceCheckUtils]: 63: Hoare triple {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {3359#true} is VALID [2022-02-21 03:07:50,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {3359#true} ~n := #in~n; {3359#true} is VALID [2022-02-21 03:07:50,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {3359#true} assume ~n < 1;#res := 0; {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,717 INFO L290 TraceCheckUtils]: 66: Hoare triple {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} assume true; {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} is VALID [2022-02-21 03:07:50,718 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3449#(and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|))} {3405#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #53#return; {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:07:50,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:07:50,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume #t~ret4 + #t~ret5 <= 2147483647; {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} is VALID [2022-02-21 03:07:50,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {3410#(and (= |fibonacci_#t~ret5| 0) (<= 0 (+ |fibonacci_#t~ret4| 2147483648)))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {3360#false} is VALID [2022-02-21 03:07:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-02-21 03:07:50,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:50,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722356658] [2022-02-21 03:07:50,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722356658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:07:50,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:07:50,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:07:50,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497922552] [2022-02-21 03:07:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:07:50,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-02-21 03:07:50,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:07:50,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:50,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:07:50,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:07:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:07:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:50,752 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,882 INFO L93 Difference]: Finished difference Result 112 states and 174 transitions. [2022-02-21 03:07:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:07:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-02-21 03:07:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:07:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:07:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:07:50,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-21 03:07:50,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:07:50,915 INFO L225 Difference]: With dead ends: 112 [2022-02-21 03:07:50,915 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 03:07:50,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:07:50,916 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:07:50,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:07:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 03:07:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2022-02-21 03:07:50,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:07:50,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,972 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,973 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,979 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:07:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:07:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:50,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:07:50,981 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) Second operand 111 states. [2022-02-21 03:07:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:07:50,987 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2022-02-21 03:07:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2022-02-21 03:07:50,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:07:50,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:07:50,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:07:50,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:07:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2022-02-21 03:07:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2022-02-21 03:07:50,994 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 71 [2022-02-21 03:07:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:07:50,994 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2022-02-21 03:07:50,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:07:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-21 03:07:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-21 03:07:50,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:07:50,996 INFO L514 BasicCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2022-02-21 03:07:50,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:07:50,997 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:07:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:07:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1888640856, now seen corresponding path program 2 times [2022-02-21 03:07:50,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:07:50,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418283433] [2022-02-21 03:07:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:07:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:07:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:07:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {4033#(<= |fibonacci_#in~n| 1)} assume true; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,126 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4033#(<= |fibonacci_#in~n| 1)} {4021#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3911#true} {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,134 INFO L272 TraceCheckUtils]: 5: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {4033#(<= |fibonacci_#in~n| 1)} assume true; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4033#(<= |fibonacci_#in~n| 1)} {4021#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,137 INFO L272 TraceCheckUtils]: 14: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,138 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3911#true} {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume true; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,140 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4032#(<= |fibonacci_#in~n| 2)} {3911#true} #51#return; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-21 03:07:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,232 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L272 TraceCheckUtils]: 5: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L272 TraceCheckUtils]: 14: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,239 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,241 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:07:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,282 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:07:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,286 INFO L272 TraceCheckUtils]: 5: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L272 TraceCheckUtils]: 14: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,289 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:07:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L272 TraceCheckUtils]: 5: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L272 TraceCheckUtils]: 20: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,296 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L272 TraceCheckUtils]: 33: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,299 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,300 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4034#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {4034#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,303 INFO L272 TraceCheckUtils]: 5: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L272 TraceCheckUtils]: 11: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L272 TraceCheckUtils]: 20: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,305 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,307 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,308 INFO L272 TraceCheckUtils]: 33: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L272 TraceCheckUtils]: 39: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L272 TraceCheckUtils]: 45: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,311 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L272 TraceCheckUtils]: 54: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,312 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L272 TraceCheckUtils]: 67: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,315 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,316 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume true; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,318 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {4104#(<= 2 |fibonacci_#in~n|)} {3937#(<= fibonacci_~n 3)} #53#return; {3912#false} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L272 TraceCheckUtils]: 3: Hoare triple {3911#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L272 TraceCheckUtils]: 9: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,321 INFO L272 TraceCheckUtils]: 15: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,323 INFO L272 TraceCheckUtils]: 21: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {4033#(<= |fibonacci_#in~n| 1)} assume true; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4033#(<= |fibonacci_#in~n| 1)} {4021#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,326 INFO L272 TraceCheckUtils]: 30: Hoare triple {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,328 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3911#true} {4027#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume true; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,330 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4032#(<= |fibonacci_#in~n| 2)} {3911#true} #51#return; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,331 INFO L272 TraceCheckUtils]: 43: Hoare triple {3937#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {3911#true} ~n := #in~n; {4021#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {4021#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4034#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {4034#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,333 INFO L272 TraceCheckUtils]: 49: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L272 TraceCheckUtils]: 55: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L272 TraceCheckUtils]: 64: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 66: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,336 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,336 INFO L290 TraceCheckUtils]: 71: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,337 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,338 INFO L290 TraceCheckUtils]: 75: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:07:51,338 INFO L272 TraceCheckUtils]: 77: Hoare triple {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 80: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 81: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 82: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L272 TraceCheckUtils]: 83: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 85: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,339 INFO L290 TraceCheckUtils]: 86: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 87: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L272 TraceCheckUtils]: 89: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 90: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 91: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 92: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L290 TraceCheckUtils]: 93: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,340 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L272 TraceCheckUtils]: 98: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 100: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,341 INFO L290 TraceCheckUtils]: 101: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L290 TraceCheckUtils]: 105: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L290 TraceCheckUtils]: 106: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,342 INFO L290 TraceCheckUtils]: 108: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 109: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 110: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L272 TraceCheckUtils]: 111: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 112: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 113: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 114: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L290 TraceCheckUtils]: 115: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,343 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,344 INFO L290 TraceCheckUtils]: 117: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,344 INFO L290 TraceCheckUtils]: 118: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,344 INFO L290 TraceCheckUtils]: 119: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,344 INFO L290 TraceCheckUtils]: 120: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,345 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3911#true} {4035#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,345 INFO L290 TraceCheckUtils]: 122: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,345 INFO L290 TraceCheckUtils]: 123: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,346 INFO L290 TraceCheckUtils]: 124: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,346 INFO L290 TraceCheckUtils]: 125: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume true; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,347 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {4104#(<= 2 |fibonacci_#in~n|)} {3937#(<= fibonacci_~n 3)} #53#return; {3912#false} is VALID [2022-02-21 03:07:51,347 INFO L290 TraceCheckUtils]: 127: Hoare triple {3912#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3912#false} is VALID [2022-02-21 03:07:51,347 INFO L290 TraceCheckUtils]: 128: Hoare triple {3912#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3912#false} is VALID [2022-02-21 03:07:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 73 proven. 158 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-02-21 03:07:51,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:07:51,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418283433] [2022-02-21 03:07:51,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418283433] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:07:51,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466777040] [2022-02-21 03:07:51,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:07:51,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:07:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:07:51,351 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:07:51,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:07:51,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:07:51,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:07:51,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:07:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:07:51,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:07:51,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3911#true} is VALID [2022-02-21 03:07:51,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3911#true} is VALID [2022-02-21 03:07:51,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:51,938 INFO L272 TraceCheckUtils]: 3: Hoare triple {3911#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:51,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L272 TraceCheckUtils]: 9: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,940 INFO L272 TraceCheckUtils]: 15: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} ~n := #in~n; {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,942 INFO L272 TraceCheckUtils]: 21: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} ~n := #in~n; {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {4203#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:07:51,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {4203#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {4033#(<= |fibonacci_#in~n| 1)} assume true; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:51,945 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4033#(<= |fibonacci_#in~n| 1)} {4203#(<= |fibonacci_#in~n| fibonacci_~n)} #51#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,946 INFO L272 TraceCheckUtils]: 30: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,956 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3911#true} {4032#(<= |fibonacci_#in~n| 2)} #53#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume true; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:51,958 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4032#(<= |fibonacci_#in~n| 2)} {3911#true} #51#return; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:51,959 INFO L272 TraceCheckUtils]: 43: Hoare triple {3937#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {3911#true} ~n := #in~n; {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,961 INFO L272 TraceCheckUtils]: 49: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {3911#true} ~n := #in~n; {4288#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {4288#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,962 INFO L290 TraceCheckUtils]: 52: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,963 INFO L272 TraceCheckUtils]: 55: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,963 INFO L290 TraceCheckUtils]: 59: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,976 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3911#true} {4310#(<= 1 |fibonacci_#in~n|)} #51#return; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,977 INFO L272 TraceCheckUtils]: 64: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,978 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3911#true} {4310#(<= 1 |fibonacci_#in~n|)} #53#return; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume true; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,980 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4310#(<= 1 |fibonacci_#in~n|)} {4288#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,981 INFO L290 TraceCheckUtils]: 74: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,981 INFO L290 TraceCheckUtils]: 75: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,982 INFO L272 TraceCheckUtils]: 77: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 79: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 80: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 81: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L272 TraceCheckUtils]: 83: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 84: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 85: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 86: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:51,982 INFO L290 TraceCheckUtils]: 87: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 88: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L272 TraceCheckUtils]: 89: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 90: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 91: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 92: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 93: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 95: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 96: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,983 INFO L290 TraceCheckUtils]: 97: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L272 TraceCheckUtils]: 98: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L290 TraceCheckUtils]: 99: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L290 TraceCheckUtils]: 100: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L290 TraceCheckUtils]: 101: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L290 TraceCheckUtils]: 103: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,985 INFO L290 TraceCheckUtils]: 104: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 105: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 106: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 108: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 109: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 110: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L272 TraceCheckUtils]: 111: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 112: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 113: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 114: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:51,986 INFO L290 TraceCheckUtils]: 115: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,987 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:51,987 INFO L290 TraceCheckUtils]: 117: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,987 INFO L290 TraceCheckUtils]: 118: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:51,987 INFO L290 TraceCheckUtils]: 119: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:51,987 INFO L290 TraceCheckUtils]: 120: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:51,988 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3911#true} {4104#(<= 2 |fibonacci_#in~n|)} #53#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,988 INFO L290 TraceCheckUtils]: 122: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,988 INFO L290 TraceCheckUtils]: 123: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,989 INFO L290 TraceCheckUtils]: 124: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,989 INFO L290 TraceCheckUtils]: 125: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume true; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:51,990 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {4104#(<= 2 |fibonacci_#in~n|)} {3937#(<= fibonacci_~n 3)} #53#return; {3912#false} is VALID [2022-02-21 03:07:51,990 INFO L290 TraceCheckUtils]: 127: Hoare triple {3912#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3912#false} is VALID [2022-02-21 03:07:51,990 INFO L290 TraceCheckUtils]: 128: Hoare triple {3912#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3912#false} is VALID [2022-02-21 03:07:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 85 proven. 206 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-02-21 03:07:51,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:07:53,243 INFO L290 TraceCheckUtils]: 128: Hoare triple {3912#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {3912#false} is VALID [2022-02-21 03:07:53,243 INFO L290 TraceCheckUtils]: 127: Hoare triple {3912#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3912#false} is VALID [2022-02-21 03:07:53,244 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {4104#(<= 2 |fibonacci_#in~n|)} {3937#(<= fibonacci_~n 3)} #53#return; {3912#false} is VALID [2022-02-21 03:07:53,244 INFO L290 TraceCheckUtils]: 125: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume true; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,245 INFO L290 TraceCheckUtils]: 124: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,245 INFO L290 TraceCheckUtils]: 123: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,245 INFO L290 TraceCheckUtils]: 122: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,246 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {3911#true} {4104#(<= 2 |fibonacci_#in~n|)} #53#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 120: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 119: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 118: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 117: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 115: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 114: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:53,246 INFO L290 TraceCheckUtils]: 113: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 112: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L272 TraceCheckUtils]: 111: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 110: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 105: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 104: Hoare triple {3911#true} assume #t~ret4 + #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L290 TraceCheckUtils]: 103: Hoare triple {3911#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,247 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {3911#true} {3911#true} #53#return; {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L290 TraceCheckUtils]: 100: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L290 TraceCheckUtils]: 99: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L272 TraceCheckUtils]: 98: Hoare triple {3911#true} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L290 TraceCheckUtils]: 97: Hoare triple {3911#true} assume ~n - 2 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {3911#true} assume ~n - 2 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 95: Hoare triple {3911#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {3911#true} {3911#true} #51#return; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 93: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L272 TraceCheckUtils]: 89: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 88: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 87: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:53,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,250 INFO L272 TraceCheckUtils]: 83: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,250 INFO L290 TraceCheckUtils]: 82: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L272 TraceCheckUtils]: 77: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {4104#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,253 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4310#(<= 1 |fibonacci_#in~n|)} {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #51#return; {4104#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume true; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,255 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3911#true} {4310#(<= 1 |fibonacci_#in~n|)} #53#return; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:53,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,255 INFO L272 TraceCheckUtils]: 64: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,256 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3911#true} {4310#(<= 1 |fibonacci_#in~n|)} #51#return; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,257 INFO L290 TraceCheckUtils]: 59: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {3911#true} assume 1 == ~n;#res := 1; {3911#true} is VALID [2022-02-21 03:07:53,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,257 INFO L272 TraceCheckUtils]: 55: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {4310#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {4780#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {4310#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:07:53,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {3911#true} ~n := #in~n; {4780#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:07:53,259 INFO L272 TraceCheckUtils]: 49: Hoare triple {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:53,259 INFO L290 TraceCheckUtils]: 47: Hoare triple {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:53,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:53,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:53,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {3911#true} ~n := #in~n; {4710#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:07:53,260 INFO L272 TraceCheckUtils]: 43: Hoare triple {3937#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:53,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:53,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:53,262 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4032#(<= |fibonacci_#in~n| 2)} {3911#true} #51#return; {3937#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:07:53,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume true; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,263 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3911#true} {4032#(<= |fibonacci_#in~n| 2)} #53#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {3911#true} assume true; {3911#true} is VALID [2022-02-21 03:07:53,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {3911#true} assume ~n < 1;#res := 0; {3911#true} is VALID [2022-02-21 03:07:53,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,264 INFO L272 TraceCheckUtils]: 30: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {3911#true} is VALID [2022-02-21 03:07:53,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {4032#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,265 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4033#(<= |fibonacci_#in~n| 1)} {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #51#return; {4032#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:07:53,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {4033#(<= |fibonacci_#in~n| 1)} assume true; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:53,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {4863#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {4033#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:07:53,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {4863#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {4863#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:07:53,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#true} ~n := #in~n; {4863#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:07:53,267 INFO L272 TraceCheckUtils]: 21: Hoare triple {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:53,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:53,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:53,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#true} ~n := #in~n; {4853#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:07:53,269 INFO L272 TraceCheckUtils]: 15: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L272 TraceCheckUtils]: 9: Hoare triple {3911#true} call #t~ret4 := fibonacci(~n - 1); {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {3911#true} assume ~n - 1 >= -2147483648; {3911#true} is VALID [2022-02-21 03:07:53,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {3911#true} assume ~n - 1 <= 2147483647; {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {3911#true} assume !(1 == ~n); {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {3911#true} assume !(~n < 1); {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {3911#true} ~n := #in~n; {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L272 TraceCheckUtils]: 3: Hoare triple {3911#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {3911#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {3911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3911#true} is VALID [2022-02-21 03:07:53,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {3911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3911#true} is VALID [2022-02-21 03:07:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 85 proven. 209 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-21 03:07:53,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466777040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:07:53,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:07:53,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 17 [2022-02-21 03:07:53,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86264762] [2022-02-21 03:07:53,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:07:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 129 [2022-02-21 03:08:08,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:08:08,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:08:08,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:08,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:08:08,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:08:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:08:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:08:08,108 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:08:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:08,565 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2022-02-21 03:08:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:08:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 129 [2022-02-21 03:08:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:08:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:08:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-21 03:08:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:08:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-21 03:08:08,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2022-02-21 03:08:08,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:08,645 INFO L225 Difference]: With dead ends: 178 [2022-02-21 03:08:08,645 INFO L226 Difference]: Without dead ends: 83 [2022-02-21 03:08:08,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:08:08,647 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 107 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:08:08,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 69 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:08:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-21 03:08:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2022-02-21 03:08:08,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:08:08,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:08:08,689 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:08:08,689 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:08:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:08,693 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-02-21 03:08:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2022-02-21 03:08:08,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:08,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:08,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) Second operand 83 states. [2022-02-21 03:08:08,697 INFO L87 Difference]: Start difference. First operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) Second operand 83 states. [2022-02-21 03:08:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:08,701 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-02-21 03:08:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2022-02-21 03:08:08,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:08,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:08,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:08:08,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:08:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 53 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (26), 12 states have call predecessors, (26), 6 states have call successors, (26) [2022-02-21 03:08:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-02-21 03:08:08,705 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 129 [2022-02-21 03:08:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:08:08,705 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-02-21 03:08:08,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 12 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2022-02-21 03:08:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-02-21 03:08:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-21 03:08:08,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:08:08,707 INFO L514 BasicCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 1, 1, 1, 1, 1] [2022-02-21 03:08:08,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-21 03:08:08,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-21 03:08:08,925 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:08:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:08:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1421380986, now seen corresponding path program 3 times [2022-02-21 03:08:08,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:08:08,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012963702] [2022-02-21 03:08:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:08:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:08:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:08:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,089 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,113 INFO L272 TraceCheckUtils]: 5: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,115 INFO L272 TraceCheckUtils]: 14: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,116 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume true; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,118 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5536#(<= 2 |fibonacci_#in~n|)} {5386#true} #51#return; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5537#(<= |fibonacci_#in~n| 0)} assume true; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5537#(<= |fibonacci_#in~n| 0)} {5519#(<= 3 fibonacci_~n)} #53#return; {5387#false} is VALID [2022-02-21 03:08:09,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,133 INFO L272 TraceCheckUtils]: 5: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,136 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,137 INFO L272 TraceCheckUtils]: 20: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,138 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume true; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,140 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5536#(<= 2 |fibonacci_#in~n|)} {5386#true} #51#return; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {5519#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {5519#(<= 3 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {5519#(<= 3 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,141 INFO L272 TraceCheckUtils]: 33: Hoare triple {5519#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {5537#(<= |fibonacci_#in~n| 0)} assume true; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,143 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5537#(<= |fibonacci_#in~n| 0)} {5519#(<= 3 fibonacci_~n)} #53#return; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {5387#false} assume true; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5387#false} {5386#true} #51#return; {5387#false} is VALID [2022-02-21 03:08:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-21 03:08:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,196 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L272 TraceCheckUtils]: 5: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L272 TraceCheckUtils]: 14: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,202 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L272 TraceCheckUtils]: 5: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,208 INFO L272 TraceCheckUtils]: 11: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L272 TraceCheckUtils]: 20: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L272 TraceCheckUtils]: 33: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,212 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:08:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,216 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L272 TraceCheckUtils]: 5: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,218 INFO L272 TraceCheckUtils]: 17: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L272 TraceCheckUtils]: 26: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,221 INFO L272 TraceCheckUtils]: 39: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L272 TraceCheckUtils]: 53: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,447 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5386#true} {5387#false} #53#return; {5387#false} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5386#true} is VALID [2022-02-21 03:08:09,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L272 TraceCheckUtils]: 3: Hoare triple {5386#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L272 TraceCheckUtils]: 9: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L272 TraceCheckUtils]: 15: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,456 INFO L272 TraceCheckUtils]: 21: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {5525#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,459 INFO L272 TraceCheckUtils]: 27: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,460 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:09,461 INFO L272 TraceCheckUtils]: 36: Hoare triple {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,462 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5386#true} {5526#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {5536#(<= 2 |fibonacci_#in~n|)} assume true; {5536#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,464 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5536#(<= 2 |fibonacci_#in~n|)} {5386#true} #51#return; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {5519#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {5519#(<= 3 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {5519#(<= 3 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5519#(<= 3 fibonacci_~n)} is VALID [2022-02-21 03:08:09,465 INFO L272 TraceCheckUtils]: 49: Hoare triple {5519#(<= 3 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {5386#true} ~n := #in~n; {5524#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {5524#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {5537#(<= |fibonacci_#in~n| 0)} assume true; {5537#(<= |fibonacci_#in~n| 0)} is VALID [2022-02-21 03:08:09,467 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5537#(<= |fibonacci_#in~n| 0)} {5519#(<= 3 fibonacci_~n)} #53#return; {5387#false} is VALID [2022-02-21 03:08:09,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {5387#false} assume true; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5387#false} {5386#true} #51#return; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {5387#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {5387#false} assume ~n - 2 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {5387#false} assume ~n - 2 >= -2147483648; {5387#false} is VALID [2022-02-21 03:08:09,468 INFO L272 TraceCheckUtils]: 62: Hoare triple {5387#false} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L272 TraceCheckUtils]: 68: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L272 TraceCheckUtils]: 74: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L272 TraceCheckUtils]: 80: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L290 TraceCheckUtils]: 87: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L290 TraceCheckUtils]: 88: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L272 TraceCheckUtils]: 89: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L290 TraceCheckUtils]: 90: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L290 TraceCheckUtils]: 91: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,472 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 94: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 95: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 96: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 97: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L272 TraceCheckUtils]: 102: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 114: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L290 TraceCheckUtils]: 115: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,475 INFO L272 TraceCheckUtils]: 116: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 117: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 118: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 119: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 120: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 122: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 123: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,476 INFO L290 TraceCheckUtils]: 124: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,477 INFO L290 TraceCheckUtils]: 125: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,477 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5386#true} {5387#false} #53#return; {5387#false} is VALID [2022-02-21 03:08:09,477 INFO L290 TraceCheckUtils]: 127: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:09,477 INFO L290 TraceCheckUtils]: 128: Hoare triple {5387#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5387#false} is VALID [2022-02-21 03:08:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 55 proven. 134 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-02-21 03:08:09,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:08:09,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012963702] [2022-02-21 03:08:09,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012963702] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:08:09,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515849107] [2022-02-21 03:08:09,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:08:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:09,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:08:09,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:08:09,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:08:09,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-21 03:08:09,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:08:09,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:08:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:09,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:08:09,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5386#true} is VALID [2022-02-21 03:08:09,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5386#true} is VALID [2022-02-21 03:08:09,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:09,991 INFO L272 TraceCheckUtils]: 3: Hoare triple {5386#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:09,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L272 TraceCheckUtils]: 9: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L272 TraceCheckUtils]: 15: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L272 TraceCheckUtils]: 21: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,993 INFO L272 TraceCheckUtils]: 27: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L272 TraceCheckUtils]: 36: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L272 TraceCheckUtils]: 49: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L272 TraceCheckUtils]: 62: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L290 TraceCheckUtils]: 66: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L290 TraceCheckUtils]: 67: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,997 INFO L272 TraceCheckUtils]: 68: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,998 INFO L290 TraceCheckUtils]: 69: Hoare triple {5386#true} ~n := #in~n; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,998 INFO L290 TraceCheckUtils]: 70: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,998 INFO L290 TraceCheckUtils]: 72: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 73: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:09,999 INFO L272 TraceCheckUtils]: 74: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L290 TraceCheckUtils]: 79: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:09,999 INFO L272 TraceCheckUtils]: 80: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 81: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 83: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 86: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 87: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 88: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L272 TraceCheckUtils]: 89: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:10,000 INFO L290 TraceCheckUtils]: 91: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L290 TraceCheckUtils]: 92: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L290 TraceCheckUtils]: 94: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L290 TraceCheckUtils]: 95: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L290 TraceCheckUtils]: 96: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:10,001 INFO L290 TraceCheckUtils]: 97: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:10,002 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5386#true} {5835#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,002 INFO L290 TraceCheckUtils]: 99: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,002 INFO L290 TraceCheckUtils]: 100: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,002 INFO L290 TraceCheckUtils]: 101: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,003 INFO L272 TraceCheckUtils]: 102: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:10,003 INFO L290 TraceCheckUtils]: 103: Hoare triple {5386#true} ~n := #in~n; {5835#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,003 INFO L290 TraceCheckUtils]: 104: Hoare triple {5835#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,004 INFO L290 TraceCheckUtils]: 105: Hoare triple {5941#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,004 INFO L290 TraceCheckUtils]: 106: Hoare triple {5941#(<= 1 |fibonacci_#in~n|)} assume true; {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,005 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5941#(<= 1 |fibonacci_#in~n|)} {5835#(<= fibonacci_~n |fibonacci_#in~n|)} #53#return; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,005 INFO L290 TraceCheckUtils]: 108: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,005 INFO L290 TraceCheckUtils]: 109: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,006 INFO L290 TraceCheckUtils]: 110: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,006 INFO L290 TraceCheckUtils]: 111: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume true; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:10,006 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5951#(<= 3 |fibonacci_#in~n|)} {5386#true} #51#return; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:10,007 INFO L290 TraceCheckUtils]: 113: Hoare triple {5967#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:10,007 INFO L290 TraceCheckUtils]: 114: Hoare triple {5967#(<= 4 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:10,007 INFO L290 TraceCheckUtils]: 115: Hoare triple {5967#(<= 4 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:10,007 INFO L272 TraceCheckUtils]: 116: Hoare triple {5967#(<= 4 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:10,008 INFO L290 TraceCheckUtils]: 117: Hoare triple {5386#true} ~n := #in~n; {5983#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:10,008 INFO L290 TraceCheckUtils]: 118: Hoare triple {5983#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {5983#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:10,008 INFO L290 TraceCheckUtils]: 119: Hoare triple {5983#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {5990#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:10,009 INFO L290 TraceCheckUtils]: 120: Hoare triple {5990#(<= |fibonacci_#in~n| 1)} assume true; {5990#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:10,009 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5990#(<= |fibonacci_#in~n| 1)} {5967#(<= 4 fibonacci_~n)} #53#return; {5387#false} is VALID [2022-02-21 03:08:10,009 INFO L290 TraceCheckUtils]: 122: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L290 TraceCheckUtils]: 123: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L290 TraceCheckUtils]: 124: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L290 TraceCheckUtils]: 125: Hoare triple {5387#false} assume true; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5387#false} {5386#true} #53#return; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L290 TraceCheckUtils]: 127: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:10,010 INFO L290 TraceCheckUtils]: 128: Hoare triple {5387#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5387#false} is VALID [2022-02-21 03:08:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 200 proven. 21 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2022-02-21 03:08:10,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 128: Hoare triple {5387#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 127: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {5387#false} {5386#true} #53#return; {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 125: Hoare triple {5387#false} assume true; {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 124: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 123: Hoare triple {5387#false} assume #t~ret4 + #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:11,111 INFO L290 TraceCheckUtils]: 122: Hoare triple {5387#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5387#false} is VALID [2022-02-21 03:08:11,112 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {5990#(<= |fibonacci_#in~n| 1)} {5967#(<= 4 fibonacci_~n)} #53#return; {5387#false} is VALID [2022-02-21 03:08:11,112 INFO L290 TraceCheckUtils]: 120: Hoare triple {5990#(<= |fibonacci_#in~n| 1)} assume true; {5990#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:11,113 INFO L290 TraceCheckUtils]: 119: Hoare triple {6051#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {5990#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:11,113 INFO L290 TraceCheckUtils]: 118: Hoare triple {6051#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {6051#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:08:11,113 INFO L290 TraceCheckUtils]: 117: Hoare triple {5386#true} ~n := #in~n; {6051#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:08:11,113 INFO L272 TraceCheckUtils]: 116: Hoare triple {5967#(<= 4 fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,114 INFO L290 TraceCheckUtils]: 115: Hoare triple {5967#(<= 4 fibonacci_~n)} assume ~n - 2 >= -2147483648; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:11,114 INFO L290 TraceCheckUtils]: 114: Hoare triple {5967#(<= 4 fibonacci_~n)} assume ~n - 2 <= 2147483647; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:11,114 INFO L290 TraceCheckUtils]: 113: Hoare triple {5967#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:11,115 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {5951#(<= 3 |fibonacci_#in~n|)} {5386#true} #51#return; {5967#(<= 4 fibonacci_~n)} is VALID [2022-02-21 03:08:11,115 INFO L290 TraceCheckUtils]: 111: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume true; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,116 INFO L290 TraceCheckUtils]: 110: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,116 INFO L290 TraceCheckUtils]: 109: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,116 INFO L290 TraceCheckUtils]: 108: Hoare triple {5951#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,117 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {5941#(<= 1 |fibonacci_#in~n|)} {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #53#return; {5951#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,118 INFO L290 TraceCheckUtils]: 106: Hoare triple {5941#(<= 1 |fibonacci_#in~n|)} assume true; {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {5941#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {6101#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {5941#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:11,119 INFO L290 TraceCheckUtils]: 103: Hoare triple {5386#true} ~n := #in~n; {6101#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:08:11,119 INFO L272 TraceCheckUtils]: 102: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,119 INFO L290 TraceCheckUtils]: 101: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 >= -2147483648; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,119 INFO L290 TraceCheckUtils]: 100: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 2 <= 2147483647; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,120 INFO L290 TraceCheckUtils]: 99: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,120 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {5386#true} {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #51#return; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,120 INFO L290 TraceCheckUtils]: 97: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,120 INFO L290 TraceCheckUtils]: 96: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:11,120 INFO L290 TraceCheckUtils]: 95: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,120 INFO L290 TraceCheckUtils]: 94: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 92: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 91: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 90: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L272 TraceCheckUtils]: 89: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 88: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 87: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 86: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 83: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:11,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,123 INFO L272 TraceCheckUtils]: 80: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,124 INFO L272 TraceCheckUtils]: 74: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,126 INFO L290 TraceCheckUtils]: 73: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,127 INFO L290 TraceCheckUtils]: 72: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {5386#true} ~n := #in~n; {6088#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:11,128 INFO L272 TraceCheckUtils]: 68: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L272 TraceCheckUtils]: 62: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:11,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L272 TraceCheckUtils]: 49: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {5386#true} assume #t~ret4 + #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {5386#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,129 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5386#true} {5386#true} #53#return; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {5386#true} assume ~n < 1;#res := 0; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L272 TraceCheckUtils]: 36: Hoare triple {5386#true} call #t~ret5 := fibonacci(~n - 2); {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {5386#true} assume ~n - 2 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {5386#true} assume ~n - 2 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {5386#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,130 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5386#true} {5386#true} #51#return; {5386#true} is VALID [2022-02-21 03:08:11,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {5386#true} assume true; {5386#true} is VALID [2022-02-21 03:08:11,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {5386#true} assume 1 == ~n;#res := 1; {5386#true} is VALID [2022-02-21 03:08:11,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,131 INFO L272 TraceCheckUtils]: 27: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,132 INFO L272 TraceCheckUtils]: 21: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L272 TraceCheckUtils]: 15: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,133 INFO L272 TraceCheckUtils]: 9: Hoare triple {5386#true} call #t~ret4 := fibonacci(~n - 1); {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#true} assume ~n - 1 >= -2147483648; {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#true} assume ~n - 1 <= 2147483647; {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#true} assume !(1 == ~n); {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {5386#true} assume !(~n < 1); {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {5386#true} ~n := #in~n; {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L272 TraceCheckUtils]: 3: Hoare triple {5386#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {5386#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {5386#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5386#true} is VALID [2022-02-21 03:08:11,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {5386#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5386#true} is VALID [2022-02-21 03:08:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 200 proven. 22 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-02-21 03:08:11,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515849107] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:08:11,135 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:08:11,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2022-02-21 03:08:11,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297139642] [2022-02-21 03:08:11,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:08:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 129 [2022-02-21 03:08:11,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:08:11,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:08:11,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:11,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:08:11,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:08:11,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:08:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:08:11,257 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:08:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:11,668 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2022-02-21 03:08:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:08:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Word has length 129 [2022-02-21 03:08:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:08:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:08:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-02-21 03:08:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:08:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-02-21 03:08:11,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2022-02-21 03:08:11,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:11,734 INFO L225 Difference]: With dead ends: 125 [2022-02-21 03:08:11,734 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 03:08:11,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:08:11,735 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:08:11,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 101 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:08:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 03:08:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-21 03:08:11,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:08:11,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:08:11,773 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:08:11,773 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:08:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:11,776 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-21 03:08:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:08:11,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:11,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:11,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) Second operand 59 states. [2022-02-21 03:08:11,777 INFO L87 Difference]: Start difference. First operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) Second operand 59 states. [2022-02-21 03:08:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:11,779 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-21 03:08:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:08:11,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:11,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:11,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:08:11,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:08:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-02-21 03:08:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-02-21 03:08:11,782 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 129 [2022-02-21 03:08:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:08:11,782 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-02-21 03:08:11,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 7 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-02-21 03:08:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-21 03:08:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-02-21 03:08:11,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:08:11,784 INFO L514 BasicCegarLoop]: trace histogram [17, 15, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 3, 1, 1, 1, 1, 1] [2022-02-21 03:08:11,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:08:11,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:12,000 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:08:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:08:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -823240014, now seen corresponding path program 4 times [2022-02-21 03:08:12,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:08:12,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296626928] [2022-02-21 03:08:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:08:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:08:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:08:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,167 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6747#true} {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,177 INFO L272 TraceCheckUtils]: 5: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,182 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6747#true} {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume true; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6794#(<= |fibonacci_#in~n| 2)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,189 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6747#true} {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,191 INFO L272 TraceCheckUtils]: 5: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,193 INFO L272 TraceCheckUtils]: 11: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,195 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,197 INFO L272 TraceCheckUtils]: 20: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,198 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6747#true} {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume true; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,200 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6794#(<= |fibonacci_#in~n| 2)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,202 INFO L272 TraceCheckUtils]: 33: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,203 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6747#true} {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume true; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,205 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6915#(<= |fibonacci_#in~n| 3)} {6747#true} #51#return; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-21 03:08:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,272 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L272 TraceCheckUtils]: 5: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,282 INFO L272 TraceCheckUtils]: 14: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,284 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,294 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6927#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {6927#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,296 INFO L272 TraceCheckUtils]: 5: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L272 TraceCheckUtils]: 11: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,298 INFO L272 TraceCheckUtils]: 20: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,300 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,302 INFO L272 TraceCheckUtils]: 33: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,303 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume true; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,305 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6958#(<= 2 |fibonacci_#in~n|)} {6795#(<= fibonacci_~n 2)} #51#return; {6748#false} is VALID [2022-02-21 03:08:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-02-21 03:08:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,332 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L272 TraceCheckUtils]: 5: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,338 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,342 INFO L272 TraceCheckUtils]: 5: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,344 INFO L272 TraceCheckUtils]: 20: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L272 TraceCheckUtils]: 33: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6747#true} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:12,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L272 TraceCheckUtils]: 3: Hoare triple {6747#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,349 INFO L272 TraceCheckUtils]: 9: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,351 INFO L272 TraceCheckUtils]: 15: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,353 INFO L272 TraceCheckUtils]: 21: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:12,355 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,357 INFO L272 TraceCheckUtils]: 30: Hoare triple {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,358 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6747#true} {6921#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume true; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,360 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6794#(<= |fibonacci_#in~n| 2)} {6884#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,361 INFO L272 TraceCheckUtils]: 43: Hoare triple {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,362 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6747#true} {6909#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume true; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:12,368 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6915#(<= |fibonacci_#in~n| 3)} {6747#true} #51#return; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:12,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {6793#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:12,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:12,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:12,369 INFO L272 TraceCheckUtils]: 57: Hoare triple {6793#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:12,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:12,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(~n < 1); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:12,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(1 == ~n); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:12,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 <= 2147483647; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:12,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 >= -2147483648; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:12,371 INFO L272 TraceCheckUtils]: 63: Hoare triple {6795#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {6747#true} ~n := #in~n; {6884#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {6884#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {6927#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {6927#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,372 INFO L290 TraceCheckUtils]: 67: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,372 INFO L290 TraceCheckUtils]: 68: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,372 INFO L272 TraceCheckUtils]: 69: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L272 TraceCheckUtils]: 75: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L272 TraceCheckUtils]: 84: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 85: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 86: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 87: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,373 INFO L290 TraceCheckUtils]: 89: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,374 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 94: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 95: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:12,375 INFO L272 TraceCheckUtils]: 97: Hoare triple {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,376 INFO L290 TraceCheckUtils]: 101: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,376 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6747#true} {6928#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,377 INFO L290 TraceCheckUtils]: 103: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,377 INFO L290 TraceCheckUtils]: 104: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,377 INFO L290 TraceCheckUtils]: 105: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,378 INFO L290 TraceCheckUtils]: 106: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume true; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:12,378 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6958#(<= 2 |fibonacci_#in~n|)} {6795#(<= fibonacci_~n 2)} #51#return; {6748#false} is VALID [2022-02-21 03:08:12,378 INFO L290 TraceCheckUtils]: 108: Hoare triple {6748#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:12,378 INFO L290 TraceCheckUtils]: 109: Hoare triple {6748#false} assume ~n - 2 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:12,378 INFO L290 TraceCheckUtils]: 110: Hoare triple {6748#false} assume ~n - 2 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:12,379 INFO L272 TraceCheckUtils]: 111: Hoare triple {6748#false} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 112: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 114: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 115: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 116: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L272 TraceCheckUtils]: 117: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 118: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 119: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 122: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L272 TraceCheckUtils]: 123: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 124: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 125: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 126: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,379 INFO L290 TraceCheckUtils]: 127: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 129: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 130: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 131: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L272 TraceCheckUtils]: 132: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 133: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 134: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 135: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 137: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 138: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 139: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L290 TraceCheckUtils]: 140: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,380 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:12,381 INFO L290 TraceCheckUtils]: 142: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 143: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 144: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L272 TraceCheckUtils]: 145: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 146: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 147: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 148: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 149: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 151: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,383 INFO L290 TraceCheckUtils]: 152: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:12,384 INFO L290 TraceCheckUtils]: 153: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:12,384 INFO L290 TraceCheckUtils]: 154: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:12,384 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {6747#true} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:12,384 INFO L290 TraceCheckUtils]: 156: Hoare triple {6748#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:12,384 INFO L290 TraceCheckUtils]: 157: Hoare triple {6748#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6748#false} is VALID [2022-02-21 03:08:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 100 proven. 343 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-02-21 03:08:12,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:08:12,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296626928] [2022-02-21 03:08:12,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296626928] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:08:12,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744561739] [2022-02-21 03:08:12,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:08:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:08:12,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:08:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:08:12,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:08:12,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:08:12,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:08:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:12,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L272 TraceCheckUtils]: 3: Hoare triple {6747#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:13,030 INFO L272 TraceCheckUtils]: 9: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#true} ~n := #in~n; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,033 INFO L272 TraceCheckUtils]: 15: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} ~n := #in~n; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,035 INFO L272 TraceCheckUtils]: 21: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} ~n := #in~n; {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {7039#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:13,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {7039#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:13,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:13,037 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {7039#(<= |fibonacci_#in~n| fibonacci_~n)} #51#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,038 INFO L272 TraceCheckUtils]: 30: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:13,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:13,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:13,039 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6747#true} {6794#(<= |fibonacci_#in~n| 2)} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume true; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,041 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6794#(<= |fibonacci_#in~n| 2)} {7039#(<= |fibonacci_#in~n| fibonacci_~n)} #51#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,041 INFO L272 TraceCheckUtils]: 43: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:13,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:13,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:13,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:13,052 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6747#true} {6915#(<= |fibonacci_#in~n| 3)} #53#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume true; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:13,055 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6915#(<= |fibonacci_#in~n| 3)} {6747#true} #51#return; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:13,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {6793#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:13,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:13,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:13,057 INFO L272 TraceCheckUtils]: 57: Hoare triple {6793#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:13,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:13,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(~n < 1); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:13,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(1 == ~n); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:13,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 <= 2147483647; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:13,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 >= -2147483648; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:13,059 INFO L272 TraceCheckUtils]: 63: Hoare triple {6795#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,059 INFO L290 TraceCheckUtils]: 64: Hoare triple {6747#true} ~n := #in~n; {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,061 INFO L272 TraceCheckUtils]: 69: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {6747#true} ~n := #in~n; {7202#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {7202#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,064 INFO L272 TraceCheckUtils]: 75: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:13,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:13,064 INFO L290 TraceCheckUtils]: 78: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:13,064 INFO L290 TraceCheckUtils]: 79: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:13,065 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6747#true} {7224#(<= 1 |fibonacci_#in~n|)} #51#return; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,066 INFO L272 TraceCheckUtils]: 84: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:13,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:13,067 INFO L290 TraceCheckUtils]: 87: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:13,067 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6747#true} {7224#(<= 1 |fibonacci_#in~n|)} #53#return; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,068 INFO L290 TraceCheckUtils]: 89: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,068 INFO L290 TraceCheckUtils]: 90: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,068 INFO L290 TraceCheckUtils]: 91: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,069 INFO L290 TraceCheckUtils]: 92: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume true; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,070 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {7224#(<= 1 |fibonacci_#in~n|)} {7202#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,070 INFO L290 TraceCheckUtils]: 94: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,071 INFO L290 TraceCheckUtils]: 95: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,071 INFO L290 TraceCheckUtils]: 96: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,071 INFO L272 TraceCheckUtils]: 97: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:13,071 INFO L290 TraceCheckUtils]: 98: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:13,071 INFO L290 TraceCheckUtils]: 99: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:13,071 INFO L290 TraceCheckUtils]: 100: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:13,072 INFO L290 TraceCheckUtils]: 101: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:13,072 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6747#true} {6958#(<= 2 |fibonacci_#in~n|)} #53#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,073 INFO L290 TraceCheckUtils]: 103: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,073 INFO L290 TraceCheckUtils]: 104: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,073 INFO L290 TraceCheckUtils]: 105: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,074 INFO L290 TraceCheckUtils]: 106: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume true; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:13,075 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6958#(<= 2 |fibonacci_#in~n|)} {6795#(<= fibonacci_~n 2)} #51#return; {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 108: Hoare triple {6748#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 109: Hoare triple {6748#false} assume ~n - 2 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 110: Hoare triple {6748#false} assume ~n - 2 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L272 TraceCheckUtils]: 111: Hoare triple {6748#false} call #t~ret5 := fibonacci(~n - 2); {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 112: Hoare triple {6748#false} ~n := #in~n; {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 113: Hoare triple {6748#false} assume !(~n < 1); {6748#false} is VALID [2022-02-21 03:08:13,075 INFO L290 TraceCheckUtils]: 114: Hoare triple {6748#false} assume !(1 == ~n); {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 115: Hoare triple {6748#false} assume ~n - 1 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 116: Hoare triple {6748#false} assume ~n - 1 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L272 TraceCheckUtils]: 117: Hoare triple {6748#false} call #t~ret4 := fibonacci(~n - 1); {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 118: Hoare triple {6748#false} ~n := #in~n; {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 119: Hoare triple {6748#false} assume !(~n < 1); {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 120: Hoare triple {6748#false} assume !(1 == ~n); {6748#false} is VALID [2022-02-21 03:08:13,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {6748#false} assume ~n - 1 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 122: Hoare triple {6748#false} assume ~n - 1 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L272 TraceCheckUtils]: 123: Hoare triple {6748#false} call #t~ret4 := fibonacci(~n - 1); {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 124: Hoare triple {6748#false} ~n := #in~n; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 125: Hoare triple {6748#false} assume !(~n < 1); {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 126: Hoare triple {6748#false} assume 1 == ~n;#res := 1; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 127: Hoare triple {6748#false} assume true; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {6748#false} {6748#false} #51#return; {6748#false} is VALID [2022-02-21 03:08:13,077 INFO L290 TraceCheckUtils]: 129: Hoare triple {6748#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L290 TraceCheckUtils]: 130: Hoare triple {6748#false} assume ~n - 2 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L290 TraceCheckUtils]: 131: Hoare triple {6748#false} assume ~n - 2 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L272 TraceCheckUtils]: 132: Hoare triple {6748#false} call #t~ret5 := fibonacci(~n - 2); {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L290 TraceCheckUtils]: 133: Hoare triple {6748#false} ~n := #in~n; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L290 TraceCheckUtils]: 134: Hoare triple {6748#false} assume ~n < 1;#res := 0; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L290 TraceCheckUtils]: 135: Hoare triple {6748#false} assume true; {6748#false} is VALID [2022-02-21 03:08:13,078 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {6748#false} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 137: Hoare triple {6748#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 138: Hoare triple {6748#false} assume #t~ret4 + #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 139: Hoare triple {6748#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 140: Hoare triple {6748#false} assume true; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {6748#false} {6748#false} #51#return; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 142: Hoare triple {6748#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 143: Hoare triple {6748#false} assume ~n - 2 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,079 INFO L290 TraceCheckUtils]: 144: Hoare triple {6748#false} assume ~n - 2 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L272 TraceCheckUtils]: 145: Hoare triple {6748#false} call #t~ret5 := fibonacci(~n - 2); {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L290 TraceCheckUtils]: 146: Hoare triple {6748#false} ~n := #in~n; {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L290 TraceCheckUtils]: 147: Hoare triple {6748#false} assume !(~n < 1); {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L290 TraceCheckUtils]: 148: Hoare triple {6748#false} assume 1 == ~n;#res := 1; {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L290 TraceCheckUtils]: 149: Hoare triple {6748#false} assume true; {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {6748#false} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:13,080 INFO L290 TraceCheckUtils]: 151: Hoare triple {6748#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L290 TraceCheckUtils]: 152: Hoare triple {6748#false} assume #t~ret4 + #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L290 TraceCheckUtils]: 153: Hoare triple {6748#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L290 TraceCheckUtils]: 154: Hoare triple {6748#false} assume true; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {6748#false} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L290 TraceCheckUtils]: 156: Hoare triple {6748#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:13,081 INFO L290 TraceCheckUtils]: 157: Hoare triple {6748#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6748#false} is VALID [2022-02-21 03:08:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 463 proven. 189 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-02-21 03:08:13,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 157: Hoare triple {6748#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {6748#false} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 156: Hoare triple {6748#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:14,766 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {6747#true} {6748#false} #53#return; {6748#false} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 154: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 153: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 152: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 151: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 149: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 148: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 147: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L272 TraceCheckUtils]: 145: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 144: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 143: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 142: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 140: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 139: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 138: Hoare triple {6747#true} assume #t~ret4 + #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 137: Hoare triple {6747#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {6747#true} {6747#true} #53#return; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 135: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 134: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 133: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L272 TraceCheckUtils]: 132: Hoare triple {6747#true} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,767 INFO L290 TraceCheckUtils]: 131: Hoare triple {6747#true} assume ~n - 2 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 130: Hoare triple {6747#true} assume ~n - 2 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 129: Hoare triple {6747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {6747#true} {6747#true} #51#return; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 127: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 126: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 125: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 124: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L272 TraceCheckUtils]: 123: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:14,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 120: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 119: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 118: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L272 TraceCheckUtils]: 117: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 116: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 115: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 114: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 113: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 112: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L272 TraceCheckUtils]: 111: Hoare triple {6748#false} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 110: Hoare triple {6748#false} assume ~n - 2 >= -2147483648; {6748#false} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 109: Hoare triple {6748#false} assume ~n - 2 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:14,769 INFO L290 TraceCheckUtils]: 108: Hoare triple {6748#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6748#false} is VALID [2022-02-21 03:08:14,770 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6958#(<= 2 |fibonacci_#in~n|)} {6795#(<= fibonacci_~n 2)} #51#return; {6748#false} is VALID [2022-02-21 03:08:14,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume true; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,858 INFO L290 TraceCheckUtils]: 104: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,859 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {6747#true} {6958#(<= 2 |fibonacci_#in~n|)} #53#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,859 INFO L290 TraceCheckUtils]: 101: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,859 INFO L290 TraceCheckUtils]: 100: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:14,860 INFO L290 TraceCheckUtils]: 99: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,860 INFO L290 TraceCheckUtils]: 98: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,860 INFO L272 TraceCheckUtils]: 97: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,860 INFO L290 TraceCheckUtils]: 95: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {6958#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,861 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {7224#(<= 1 |fibonacci_#in~n|)} {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #51#return; {6958#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,862 INFO L290 TraceCheckUtils]: 92: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume true; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,862 INFO L290 TraceCheckUtils]: 91: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,862 INFO L290 TraceCheckUtils]: 90: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,863 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {6747#true} {7224#(<= 1 |fibonacci_#in~n|)} #53#return; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:14,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,863 INFO L272 TraceCheckUtils]: 84: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,864 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6747#true} {7224#(<= 1 |fibonacci_#in~n|)} #51#return; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,865 INFO L272 TraceCheckUtils]: 75: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {7224#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {7748#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {7224#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:14,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {6747#true} ~n := #in~n; {7748#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:08:14,866 INFO L272 TraceCheckUtils]: 69: Hoare triple {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:14,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:14,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:14,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:14,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {6747#true} ~n := #in~n; {7678#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:14,869 INFO L272 TraceCheckUtils]: 63: Hoare triple {6795#(<= fibonacci_~n 2)} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 >= -2147483648; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:14,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {6795#(<= fibonacci_~n 2)} assume ~n - 1 <= 2147483647; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:14,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(1 == ~n); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:14,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {6795#(<= fibonacci_~n 2)} assume !(~n < 1); {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:14,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} ~n := #in~n; {6795#(<= fibonacci_~n 2)} is VALID [2022-02-21 03:08:14,879 INFO L272 TraceCheckUtils]: 57: Hoare triple {6793#(<= fibonacci_~n 4)} call #t~ret5 := fibonacci(~n - 2); {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 >= -2147483648; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:14,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {6793#(<= fibonacci_~n 4)} assume ~n - 2 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:14,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {6793#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:14,882 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6915#(<= |fibonacci_#in~n| 3)} {6747#true} #51#return; {6793#(<= fibonacci_~n 4)} is VALID [2022-02-21 03:08:14,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume true; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,884 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6747#true} {6915#(<= |fibonacci_#in~n| 3)} #53#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {6747#true} assume 1 == ~n;#res := 1; {6747#true} is VALID [2022-02-21 03:08:14,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume ~n - 2 >= -2147483648; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume ~n - 2 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {6915#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,887 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6794#(<= |fibonacci_#in~n| 2)} {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} #51#return; {6915#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:14,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume true; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,889 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6747#true} {6794#(<= |fibonacci_#in~n| 2)} #53#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {6747#true} assume true; {6747#true} is VALID [2022-02-21 03:08:14,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {6747#true} assume ~n < 1;#res := 0; {6747#true} is VALID [2022-02-21 03:08:14,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,890 INFO L272 TraceCheckUtils]: 30: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} call #t~ret5 := fibonacci(~n - 2); {6747#true} is VALID [2022-02-21 03:08:14,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume ~n - 2 >= -2147483648; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume ~n - 2 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {6794#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,891 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6926#(<= |fibonacci_#in~n| 1)} {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #51#return; {6794#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:14,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {6926#(<= |fibonacci_#in~n| 1)} assume true; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:14,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {7895#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume 1 == ~n;#res := 1; {6926#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:14,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {7895#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} assume !(~n < 1); {7895#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:08:14,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {6747#true} ~n := #in~n; {7895#(or (not (<= fibonacci_~n 1)) (<= |fibonacci_#in~n| 1))} is VALID [2022-02-21 03:08:14,892 INFO L272 TraceCheckUtils]: 21: Hoare triple {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:14,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:14,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:14,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:14,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {6747#true} ~n := #in~n; {7885#(or (< 2 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:14,894 INFO L272 TraceCheckUtils]: 15: Hoare triple {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 >= -2147483648; {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:08:14,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume ~n - 1 <= 2147483647; {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:08:14,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(1 == ~n); {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:08:14,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} assume !(~n < 1); {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#true} ~n := #in~n; {7842#(or (< 3 fibonacci_~n) (<= |fibonacci_#in~n| 3))} is VALID [2022-02-21 03:08:14,896 INFO L272 TraceCheckUtils]: 9: Hoare triple {6747#true} call #t~ret4 := fibonacci(~n - 1); {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#true} assume ~n - 1 >= -2147483648; {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {6747#true} assume ~n - 1 <= 2147483647; {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {6747#true} assume !(1 == ~n); {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {6747#true} assume !(~n < 1); {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {6747#true} ~n := #in~n; {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L272 TraceCheckUtils]: 3: Hoare triple {6747#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {6747#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {6747#true} is VALID [2022-02-21 03:08:14,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {6747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6747#true} is VALID [2022-02-21 03:08:14,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {6747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {6747#true} is VALID [2022-02-21 03:08:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 107 proven. 410 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-02-21 03:08:14,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744561739] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:08:14,898 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:08:14,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 21 [2022-02-21 03:08:14,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287550681] [2022-02-21 03:08:14,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:08:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) Word has length 158 [2022-02-21 03:08:16,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:08:16,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2022-02-21 03:08:16,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:16,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-21 03:08:16,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:08:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 03:08:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:08:16,518 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2022-02-21 03:08:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:16,996 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2022-02-21 03:08:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:08:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) Word has length 158 [2022-02-21 03:08:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:08:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2022-02-21 03:08:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 102 transitions. [2022-02-21 03:08:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2022-02-21 03:08:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 102 transitions. [2022-02-21 03:08:17,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 102 transitions. [2022-02-21 03:08:17,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:17,092 INFO L225 Difference]: With dead ends: 128 [2022-02-21 03:08:17,092 INFO L226 Difference]: Without dead ends: 75 [2022-02-21 03:08:17,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2022-02-21 03:08:17,094 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 168 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:08:17,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 75 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:08:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-21 03:08:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-02-21 03:08:17,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:08:17,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:17,138 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:17,138 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:17,142 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-21 03:08:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-21 03:08:17,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:17,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:17,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 75 states. [2022-02-21 03:08:17,144 INFO L87 Difference]: Start difference. First operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 75 states. [2022-02-21 03:08:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:17,146 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-21 03:08:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-02-21 03:08:17,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:17,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:17,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:08:17,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:08:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-02-21 03:08:17,152 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 158 [2022-02-21 03:08:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:08:17,152 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-02-21 03:08:17,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.857142857142857) internal successors, (123), 21 states have internal predecessors, (123), 17 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 10 states have call predecessors, (24), 16 states have call successors, (24) [2022-02-21 03:08:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-02-21 03:08:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:08:17,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:08:17,154 INFO L514 BasicCegarLoop]: trace histogram [10, 8, 8, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2022-02-21 03:08:17,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:08:17,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:17,364 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:08:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:08:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1596262010, now seen corresponding path program 3 times [2022-02-21 03:08:17,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:08:17,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084214417] [2022-02-21 03:08:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:08:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:08:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-21 03:08:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,507 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,521 INFO L272 TraceCheckUtils]: 5: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,524 INFO L272 TraceCheckUtils]: 14: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,525 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,527 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,537 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,537 INFO L272 TraceCheckUtils]: 5: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L272 TraceCheckUtils]: 11: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,540 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,541 INFO L272 TraceCheckUtils]: 20: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,543 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,545 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,546 INFO L272 TraceCheckUtils]: 33: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,548 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8455#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {8455#(<= 2 |fibonacci_#res|)} assume true; {8455#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,550 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8455#(<= 2 |fibonacci_#res|)} {8352#true} #51#return; {8398#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-21 03:08:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,574 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,584 INFO L272 TraceCheckUtils]: 5: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,589 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8398#(<= 2 |fibonacci_#t~ret4|)} #53#return; {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8352#true} is VALID [2022-02-21 03:08:17,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8352#true} is VALID [2022-02-21 03:08:17,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:17,589 INFO L272 TraceCheckUtils]: 3: Hoare triple {8352#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:17,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L272 TraceCheckUtils]: 9: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L272 TraceCheckUtils]: 15: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L272 TraceCheckUtils]: 21: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L272 TraceCheckUtils]: 27: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,593 INFO L272 TraceCheckUtils]: 36: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,594 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,596 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,597 INFO L272 TraceCheckUtils]: 49: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,598 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {8454#(<= 2 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8455#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {8455#(<= 2 |fibonacci_#res|)} assume true; {8455#(<= 2 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,600 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8455#(<= 2 |fibonacci_#res|)} {8352#true} #51#return; {8398#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {8398#(<= 2 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8398#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {8398#(<= 2 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8398#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {8398#(<= 2 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8398#(<= 2 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,601 INFO L272 TraceCheckUtils]: 63: Hoare triple {8398#(<= 2 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L272 TraceCheckUtils]: 69: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,602 INFO L290 TraceCheckUtils]: 71: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,602 INFO L290 TraceCheckUtils]: 72: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,603 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,603 INFO L272 TraceCheckUtils]: 78: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,604 INFO L290 TraceCheckUtils]: 79: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,605 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,606 INFO L290 TraceCheckUtils]: 85: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,607 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8398#(<= 2 |fibonacci_#t~ret4|)} #53#return; {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,607 INFO L290 TraceCheckUtils]: 88: Hoare triple {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:17,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {8423#(<= 3 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {8353#false} is VALID [2022-02-21 03:08:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-02-21 03:08:17,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:08:17,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084214417] [2022-02-21 03:08:17,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084214417] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:08:17,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788728490] [2022-02-21 03:08:17,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:08:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:08:17,610 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:08:17,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:08:17,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:08:17,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:08:17,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:08:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L272 TraceCheckUtils]: 3: Hoare triple {8352#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L272 TraceCheckUtils]: 9: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L272 TraceCheckUtils]: 15: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L272 TraceCheckUtils]: 21: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,948 INFO L272 TraceCheckUtils]: 27: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {8352#true} assume ~n - 2 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {8352#true} assume ~n - 2 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L272 TraceCheckUtils]: 36: Hoare triple {8352#true} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8352#true} {8352#true} #53#return; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {8352#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {8352#true} assume ~n - 2 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {8352#true} assume ~n - 2 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L272 TraceCheckUtils]: 49: Hoare triple {8352#true} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8352#true} {8352#true} #53#return; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {8352#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8352#true} is VALID [2022-02-21 03:08:17,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:17,953 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:17,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:17,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 <= 2147483647; {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:17,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} assume ~n - 2 >= -2147483648; {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:17,956 INFO L272 TraceCheckUtils]: 63: Hoare triple {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:17,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:17,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:17,957 INFO L272 TraceCheckUtils]: 69: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:17,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:17,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,958 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:17,959 INFO L272 TraceCheckUtils]: 78: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:17,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:17,960 INFO L290 TraceCheckUtils]: 80: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,960 INFO L290 TraceCheckUtils]: 81: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,961 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,961 INFO L290 TraceCheckUtils]: 83: Hoare triple {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,962 INFO L290 TraceCheckUtils]: 85: Hoare triple {8727#(and (<= 1 |fibonacci_#t~ret4|) (<= 0 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,962 INFO L290 TraceCheckUtils]: 86: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:17,963 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8660#(<= 0 (+ |fibonacci_#t~ret4| 2147483648))} #53#return; {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,963 INFO L290 TraceCheckUtils]: 88: Hoare triple {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,963 INFO L290 TraceCheckUtils]: 89: Hoare triple {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} is VALID [2022-02-21 03:08:17,964 INFO L290 TraceCheckUtils]: 90: Hoare triple {8743#(and (<= 0 (+ |fibonacci_#t~ret4| 2147483648)) (<= 1 |fibonacci_#t~ret5|))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {8353#false} is VALID [2022-02-21 03:08:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-02-21 03:08:17,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:08:18,570 INFO L290 TraceCheckUtils]: 90: Hoare triple {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume !(#t~ret4 + #t~ret5 >= -2147483648); {8353#false} is VALID [2022-02-21 03:08:18,571 INFO L290 TraceCheckUtils]: 89: Hoare triple {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume #t~ret4 + #t~ret5 <= 2147483647; {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:18,571 INFO L290 TraceCheckUtils]: 88: Hoare triple {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:18,572 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} #53#return; {8753#(<= 0 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4| 2147483648))} is VALID [2022-02-21 03:08:18,572 INFO L290 TraceCheckUtils]: 86: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume #t~ret4 + #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,574 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8467#(<= 0 |fibonacci_#res|)} {8448#(<= 1 |fibonacci_#t~ret4|)} #53#return; {8465#(<= 1 (+ |fibonacci_#t~ret5| |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {8467#(<= 0 |fibonacci_#res|)} assume true; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8467#(<= 0 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,575 INFO L272 TraceCheckUtils]: 78: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:18,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 >= -2147483648; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:18,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume ~n - 2 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:18,577 INFO L290 TraceCheckUtils]: 75: Hoare triple {8448#(<= 1 |fibonacci_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:18,578 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8466#(<= 1 |fibonacci_#res|)} {8352#true} #51#return; {8448#(<= 1 |fibonacci_#t~ret4|)} is VALID [2022-02-21 03:08:18,578 INFO L290 TraceCheckUtils]: 73: Hoare triple {8466#(<= 1 |fibonacci_#res|)} assume true; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8466#(<= 1 |fibonacci_#res|)} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 71: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 70: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L272 TraceCheckUtils]: 69: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 68: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L272 TraceCheckUtils]: 63: Hoare triple {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:18,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} assume ~n - 2 >= -2147483648; {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} assume ~n - 2 <= 2147483647; {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8763#(<= 0 (+ 2147483649 |fibonacci_#t~ret4|))} is VALID [2022-02-21 03:08:18,580 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8352#true} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {8352#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8352#true} {8352#true} #53#return; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L272 TraceCheckUtils]: 49: Hoare triple {8352#true} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {8352#true} assume ~n - 2 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {8352#true} assume ~n - 2 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {8352#true} assume #t~ret4 + #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {8352#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8352#true} {8352#true} #53#return; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {8352#true} assume ~n < 1;#res := 0; {8352#true} is VALID [2022-02-21 03:08:18,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L272 TraceCheckUtils]: 36: Hoare triple {8352#true} call #t~ret5 := fibonacci(~n - 2); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {8352#true} assume ~n - 2 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {8352#true} assume ~n - 2 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {8352#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8352#true} {8352#true} #51#return; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {8352#true} assume true; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {8352#true} assume 1 == ~n;#res := 1; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L272 TraceCheckUtils]: 27: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L272 TraceCheckUtils]: 21: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L272 TraceCheckUtils]: 15: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L272 TraceCheckUtils]: 9: Hoare triple {8352#true} call #t~ret4 := fibonacci(~n - 1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {8352#true} assume ~n - 1 >= -2147483648; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {8352#true} assume ~n - 1 <= 2147483647; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {8352#true} assume !(1 == ~n); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {8352#true} assume !(~n < 1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {8352#true} ~n := #in~n; {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L272 TraceCheckUtils]: 3: Hoare triple {8352#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {8352#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {8352#true} is VALID [2022-02-21 03:08:18,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {8352#true} is VALID [2022-02-21 03:08:18,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {8352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {8352#true} is VALID [2022-02-21 03:08:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-02-21 03:08:18,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788728490] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:08:18,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:08:18,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-02-21 03:08:18,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700162031] [2022-02-21 03:08:18,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:08:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 91 [2022-02-21 03:08:18,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:08:18,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:08:18,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:18,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:08:18,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:08:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:08:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:08:18,630 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:08:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:18,833 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-21 03:08:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:08:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 91 [2022-02-21 03:08:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:08:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:08:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-21 03:08:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:08:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-21 03:08:18,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-02-21 03:08:18,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:08:18,879 INFO L225 Difference]: With dead ends: 65 [2022-02-21 03:08:18,879 INFO L226 Difference]: Without dead ends: 64 [2022-02-21 03:08:18,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:08:18,880 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:08:18,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:08:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-21 03:08:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-21 03:08:18,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:08:18,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:18,935 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:18,935 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:18,937 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-21 03:08:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:08:18,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:18,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:18,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 64 states. [2022-02-21 03:08:18,938 INFO L87 Difference]: Start difference. First operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Second operand 64 states. [2022-02-21 03:08:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:08:18,939 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-21 03:08:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:08:18,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:08:18,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:08:18,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:08:18,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:08:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-21 03:08:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-21 03:08:18,942 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 91 [2022-02-21 03:08:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:08:18,942 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-21 03:08:18,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-21 03:08:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-21 03:08:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-02-21 03:08:18,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:08:18,945 INFO L514 BasicCegarLoop]: trace histogram [25, 23, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 5, 1, 1, 1, 1, 1] [2022-02-21 03:08:18,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:08:19,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-21 03:08:19,160 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:08:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:08:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1496476088, now seen corresponding path program 5 times [2022-02-21 03:08:19,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:08:19,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005302299] [2022-02-21 03:08:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:08:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:08:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:08:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {9639#(<= |fibonacci_#in~n| 1)} assume true; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,403 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9639#(<= |fibonacci_#in~n| 1)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9312#true} {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,410 INFO L272 TraceCheckUtils]: 5: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {9639#(<= |fibonacci_#in~n| 1)} assume true; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9639#(<= |fibonacci_#in~n| 1)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,414 INFO L272 TraceCheckUtils]: 14: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,415 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9312#true} {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,417 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,424 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,426 INFO L272 TraceCheckUtils]: 5: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {9639#(<= |fibonacci_#in~n| 1)} assume true; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,430 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9639#(<= |fibonacci_#in~n| 1)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,431 INFO L272 TraceCheckUtils]: 20: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,432 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9312#true} {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,434 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,438 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9312#true} {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume true; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,440 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9398#(<= |fibonacci_#in~n| 3)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:08:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,454 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L272 TraceCheckUtils]: 14: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9312#true} {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,464 INFO L272 TraceCheckUtils]: 5: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,466 INFO L272 TraceCheckUtils]: 11: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,468 INFO L272 TraceCheckUtils]: 17: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= |fibonacci_#in~n| 1)} assume true; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,470 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9639#(<= |fibonacci_#in~n| 1)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,471 INFO L272 TraceCheckUtils]: 26: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,473 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9312#true} {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,475 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,476 INFO L272 TraceCheckUtils]: 39: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,477 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9312#true} {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume true; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,479 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9398#(<= |fibonacci_#in~n| 3)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,481 INFO L272 TraceCheckUtils]: 53: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,481 INFO L290 TraceCheckUtils]: 58: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L272 TraceCheckUtils]: 59: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L272 TraceCheckUtils]: 68: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L290 TraceCheckUtils]: 71: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,482 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,483 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9312#true} {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,484 INFO L290 TraceCheckUtils]: 78: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,484 INFO L290 TraceCheckUtils]: 79: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume true; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,485 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9597#(<= |fibonacci_#in~n| 4)} {9312#true} #51#return; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-02-21 03:08:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,534 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,539 INFO L272 TraceCheckUtils]: 14: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,541 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L272 TraceCheckUtils]: 11: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,546 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L272 TraceCheckUtils]: 20: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,547 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L272 TraceCheckUtils]: 33: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,549 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-21 03:08:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,560 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L272 TraceCheckUtils]: 14: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,566 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L272 TraceCheckUtils]: 17: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,569 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L272 TraceCheckUtils]: 26: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,570 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L272 TraceCheckUtils]: 39: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,573 INFO L272 TraceCheckUtils]: 53: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L272 TraceCheckUtils]: 59: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 61: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,575 INFO L272 TraceCheckUtils]: 68: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 71: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,576 INFO L290 TraceCheckUtils]: 75: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L290 TraceCheckUtils]: 76: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,578 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9312#true} {9399#(<= fibonacci_~n 3)} #51#return; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-02-21 03:08:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:08:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,640 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:08:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L272 TraceCheckUtils]: 5: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L272 TraceCheckUtils]: 14: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,647 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 03:08:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,654 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9764#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {9764#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,657 INFO L272 TraceCheckUtils]: 5: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L272 TraceCheckUtils]: 11: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L272 TraceCheckUtils]: 20: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,661 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,662 INFO L272 TraceCheckUtils]: 33: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,663 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume true; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,665 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {9795#(<= 2 |fibonacci_#in~n|)} {9399#(<= fibonacci_~n 3)} #53#return; {9313#false} is VALID [2022-02-21 03:08:19,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9312#true} is VALID [2022-02-21 03:08:19,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {9312#true} is VALID [2022-02-21 03:08:19,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:19,666 INFO L272 TraceCheckUtils]: 3: Hoare triple {9312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:19,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,667 INFO L272 TraceCheckUtils]: 9: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,669 INFO L272 TraceCheckUtils]: 15: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,671 INFO L272 TraceCheckUtils]: 21: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,672 INFO L272 TraceCheckUtils]: 27: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {9639#(<= |fibonacci_#in~n| 1)} assume true; {9639#(<= |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:19,675 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9639#(<= |fibonacci_#in~n| 1)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,676 INFO L272 TraceCheckUtils]: 36: Hoare triple {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,677 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9312#true} {9633#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:19,679 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,682 INFO L272 TraceCheckUtils]: 49: Hoare triple {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,683 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9312#true} {9622#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 <= 2147483647; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} assume true; {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,685 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9398#(<= |fibonacci_#in~n| 3)} {9527#(= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,686 INFO L272 TraceCheckUtils]: 63: Hoare triple {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L272 TraceCheckUtils]: 69: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 72: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L272 TraceCheckUtils]: 78: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,688 INFO L290 TraceCheckUtils]: 79: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,690 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9312#true} {9572#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,690 INFO L290 TraceCheckUtils]: 88: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,691 INFO L290 TraceCheckUtils]: 91: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume true; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:19,692 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9597#(<= |fibonacci_#in~n| 4)} {9312#true} #51#return; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:19,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {9397#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:19,693 INFO L290 TraceCheckUtils]: 94: Hoare triple {9397#(<= fibonacci_~n 5)} assume ~n - 2 <= 2147483647; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:19,693 INFO L290 TraceCheckUtils]: 95: Hoare triple {9397#(<= fibonacci_~n 5)} assume ~n - 2 >= -2147483648; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:19,693 INFO L272 TraceCheckUtils]: 96: Hoare triple {9397#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:19,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,694 INFO L290 TraceCheckUtils]: 98: Hoare triple {9399#(<= fibonacci_~n 3)} assume !(~n < 1); {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,694 INFO L290 TraceCheckUtils]: 99: Hoare triple {9399#(<= fibonacci_~n 3)} assume !(1 == ~n); {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,695 INFO L290 TraceCheckUtils]: 100: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 1 <= 2147483647; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,695 INFO L290 TraceCheckUtils]: 101: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 1 >= -2147483648; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,695 INFO L272 TraceCheckUtils]: 102: Hoare triple {9399#(<= fibonacci_~n 3)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,695 INFO L290 TraceCheckUtils]: 103: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,695 INFO L290 TraceCheckUtils]: 104: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 105: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 106: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 107: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L272 TraceCheckUtils]: 108: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 109: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 110: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 111: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,696 INFO L290 TraceCheckUtils]: 112: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 113: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L272 TraceCheckUtils]: 114: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 115: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 116: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 117: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 118: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L290 TraceCheckUtils]: 119: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,697 INFO L272 TraceCheckUtils]: 120: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 121: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 122: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 123: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 124: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 126: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 127: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,698 INFO L290 TraceCheckUtils]: 128: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L272 TraceCheckUtils]: 129: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 130: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 131: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 132: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 134: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 135: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,699 INFO L290 TraceCheckUtils]: 136: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 137: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 139: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 140: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 141: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L272 TraceCheckUtils]: 142: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 143: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,700 INFO L290 TraceCheckUtils]: 144: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 145: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 146: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 148: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 149: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 150: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,701 INFO L290 TraceCheckUtils]: 151: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L290 TraceCheckUtils]: 153: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L290 TraceCheckUtils]: 154: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L290 TraceCheckUtils]: 155: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L272 TraceCheckUtils]: 156: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L290 TraceCheckUtils]: 157: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,702 INFO L290 TraceCheckUtils]: 158: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 159: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 160: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 161: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L272 TraceCheckUtils]: 162: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 163: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 164: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 165: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,703 INFO L290 TraceCheckUtils]: 166: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L290 TraceCheckUtils]: 168: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L290 TraceCheckUtils]: 169: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L290 TraceCheckUtils]: 170: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L272 TraceCheckUtils]: 171: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,704 INFO L290 TraceCheckUtils]: 172: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 173: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 174: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 176: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 177: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 178: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,705 INFO L290 TraceCheckUtils]: 179: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,706 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,706 INFO L290 TraceCheckUtils]: 181: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,706 INFO L290 TraceCheckUtils]: 182: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,706 INFO L290 TraceCheckUtils]: 183: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,706 INFO L290 TraceCheckUtils]: 184: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,707 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {9312#true} {9399#(<= fibonacci_~n 3)} #51#return; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,707 INFO L290 TraceCheckUtils]: 186: Hoare triple {9399#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,708 INFO L290 TraceCheckUtils]: 187: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 2 <= 2147483647; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,708 INFO L290 TraceCheckUtils]: 188: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 2 >= -2147483648; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:19,708 INFO L272 TraceCheckUtils]: 189: Hoare triple {9399#(<= fibonacci_~n 3)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,708 INFO L290 TraceCheckUtils]: 190: Hoare triple {9312#true} ~n := #in~n; {9527#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,709 INFO L290 TraceCheckUtils]: 191: Hoare triple {9527#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {9764#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,709 INFO L290 TraceCheckUtils]: 192: Hoare triple {9764#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,710 INFO L290 TraceCheckUtils]: 193: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,710 INFO L290 TraceCheckUtils]: 194: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,710 INFO L272 TraceCheckUtils]: 195: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,710 INFO L290 TraceCheckUtils]: 196: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 197: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 198: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 199: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 200: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L272 TraceCheckUtils]: 201: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 202: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 203: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,711 INFO L290 TraceCheckUtils]: 204: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L290 TraceCheckUtils]: 205: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L290 TraceCheckUtils]: 207: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L290 TraceCheckUtils]: 208: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L290 TraceCheckUtils]: 209: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L272 TraceCheckUtils]: 210: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,712 INFO L290 TraceCheckUtils]: 211: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 212: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 213: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 215: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 216: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 217: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:19,713 INFO L290 TraceCheckUtils]: 218: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,714 INFO L284 TraceCheckUtils]: 219: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #51#return; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,715 INFO L290 TraceCheckUtils]: 220: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,715 INFO L290 TraceCheckUtils]: 221: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 <= 2147483647; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,715 INFO L290 TraceCheckUtils]: 222: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume ~n - 2 >= -2147483648; {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:19,715 INFO L272 TraceCheckUtils]: 223: Hoare triple {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:19,716 INFO L290 TraceCheckUtils]: 224: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:19,716 INFO L290 TraceCheckUtils]: 225: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:19,716 INFO L290 TraceCheckUtils]: 226: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:19,716 INFO L290 TraceCheckUtils]: 227: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:19,717 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {9312#true} {9765#(and (not (<= fibonacci_~n 1)) (= fibonacci_~n |fibonacci_#in~n|))} #53#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,717 INFO L290 TraceCheckUtils]: 229: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,718 INFO L290 TraceCheckUtils]: 230: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,718 INFO L290 TraceCheckUtils]: 231: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,718 INFO L290 TraceCheckUtils]: 232: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume true; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:19,719 INFO L284 TraceCheckUtils]: 233: Hoare quadruple {9795#(<= 2 |fibonacci_#in~n|)} {9399#(<= fibonacci_~n 3)} #53#return; {9313#false} is VALID [2022-02-21 03:08:19,719 INFO L290 TraceCheckUtils]: 234: Hoare triple {9313#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:19,719 INFO L290 TraceCheckUtils]: 235: Hoare triple {9313#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {9313#false} is VALID [2022-02-21 03:08:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 245 proven. 631 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2022-02-21 03:08:19,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:08:19,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005302299] [2022-02-21 03:08:19,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005302299] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:08:19,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277646566] [2022-02-21 03:08:19,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:08:19,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:08:19,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:08:19,724 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:08:19,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:08:19,848 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-02-21 03:08:19,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:08:19,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:08:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:08:19,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:08:20,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L272 TraceCheckUtils]: 3: Hoare triple {9312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L272 TraceCheckUtils]: 9: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} ~n := #in~n; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,842 INFO L272 TraceCheckUtils]: 15: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L272 TraceCheckUtils]: 21: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:20,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L272 TraceCheckUtils]: 36: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,843 INFO L272 TraceCheckUtils]: 49: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:20,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,845 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9312#true} {9838#(<= |fibonacci_#in~n| fibonacci_~n)} #51#return; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 >= -2147483648; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,845 INFO L272 TraceCheckUtils]: 63: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {9312#true} ~n := #in~n; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,846 INFO L290 TraceCheckUtils]: 66: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 1 >= -2147483648; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,847 INFO L272 TraceCheckUtils]: 69: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:20,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,848 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9312#true} {9838#(<= |fibonacci_#in~n| fibonacci_~n)} #51#return; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 <= 2147483647; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n - 2 >= -2147483648; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,848 INFO L272 TraceCheckUtils]: 78: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,849 INFO L290 TraceCheckUtils]: 79: Hoare triple {9312#true} ~n := #in~n; {9838#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2022-02-21 03:08:20,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {9838#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {10049#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:20,850 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#(< |fibonacci_#in~n| 1)} assume true; {10049#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:20,850 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10049#(< |fibonacci_#in~n| 1)} {9838#(<= |fibonacci_#in~n| fibonacci_~n)} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:20,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:20,851 INFO L290 TraceCheckUtils]: 84: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:20,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:20,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:20,852 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {9838#(<= |fibonacci_#in~n| fibonacci_~n)} #53#return; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:20,852 INFO L290 TraceCheckUtils]: 88: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:20,852 INFO L290 TraceCheckUtils]: 89: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 <= 2147483647; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:20,853 INFO L290 TraceCheckUtils]: 90: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:20,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} assume true; {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:20,854 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9597#(<= |fibonacci_#in~n| 4)} {9312#true} #51#return; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:20,854 INFO L290 TraceCheckUtils]: 93: Hoare triple {9397#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:20,854 INFO L290 TraceCheckUtils]: 94: Hoare triple {9397#(<= fibonacci_~n 5)} assume ~n - 2 <= 2147483647; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:20,854 INFO L290 TraceCheckUtils]: 95: Hoare triple {9397#(<= fibonacci_~n 5)} assume ~n - 2 >= -2147483648; {9397#(<= fibonacci_~n 5)} is VALID [2022-02-21 03:08:20,855 INFO L272 TraceCheckUtils]: 96: Hoare triple {9397#(<= fibonacci_~n 5)} call #t~ret5 := fibonacci(~n - 2); {9398#(<= |fibonacci_#in~n| 3)} is VALID [2022-02-21 03:08:20,855 INFO L290 TraceCheckUtils]: 97: Hoare triple {9398#(<= |fibonacci_#in~n| 3)} ~n := #in~n; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:20,855 INFO L290 TraceCheckUtils]: 98: Hoare triple {9399#(<= fibonacci_~n 3)} assume !(~n < 1); {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:20,856 INFO L290 TraceCheckUtils]: 99: Hoare triple {9399#(<= fibonacci_~n 3)} assume !(1 == ~n); {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:20,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 1 <= 2147483647; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:20,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {9399#(<= fibonacci_~n 3)} assume ~n - 1 >= -2147483648; {9399#(<= fibonacci_~n 3)} is VALID [2022-02-21 03:08:20,856 INFO L272 TraceCheckUtils]: 102: Hoare triple {9399#(<= fibonacci_~n 3)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,857 INFO L290 TraceCheckUtils]: 103: Hoare triple {9312#true} ~n := #in~n; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,858 INFO L290 TraceCheckUtils]: 107: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,858 INFO L272 TraceCheckUtils]: 108: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,858 INFO L290 TraceCheckUtils]: 109: Hoare triple {9312#true} ~n := #in~n; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,858 INFO L290 TraceCheckUtils]: 110: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,859 INFO L290 TraceCheckUtils]: 111: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,859 INFO L290 TraceCheckUtils]: 112: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,859 INFO L290 TraceCheckUtils]: 113: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,859 INFO L272 TraceCheckUtils]: 114: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,860 INFO L290 TraceCheckUtils]: 115: Hoare triple {9312#true} ~n := #in~n; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,860 INFO L290 TraceCheckUtils]: 116: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,860 INFO L290 TraceCheckUtils]: 117: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,860 INFO L290 TraceCheckUtils]: 118: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 <= 2147483647; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,861 INFO L290 TraceCheckUtils]: 119: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume ~n - 1 >= -2147483648; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,861 INFO L272 TraceCheckUtils]: 120: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,861 INFO L290 TraceCheckUtils]: 121: Hoare triple {9312#true} ~n := #in~n; {10119#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,861 INFO L290 TraceCheckUtils]: 122: Hoare triple {10119#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,862 INFO L290 TraceCheckUtils]: 123: Hoare triple {10177#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,862 INFO L290 TraceCheckUtils]: 124: Hoare triple {10177#(<= 1 |fibonacci_#in~n|)} assume true; {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,863 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {10177#(<= 1 |fibonacci_#in~n|)} {10119#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,863 INFO L290 TraceCheckUtils]: 126: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,863 INFO L290 TraceCheckUtils]: 127: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,863 INFO L290 TraceCheckUtils]: 128: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,864 INFO L272 TraceCheckUtils]: 129: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,864 INFO L290 TraceCheckUtils]: 130: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,864 INFO L290 TraceCheckUtils]: 131: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:20,864 INFO L290 TraceCheckUtils]: 132: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,864 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {9312#true} {9795#(<= 2 |fibonacci_#in~n|)} #53#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,864 INFO L290 TraceCheckUtils]: 134: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,865 INFO L290 TraceCheckUtils]: 135: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,865 INFO L290 TraceCheckUtils]: 136: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,865 INFO L290 TraceCheckUtils]: 137: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume true; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,866 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {9795#(<= 2 |fibonacci_#in~n|)} {10119#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,866 INFO L290 TraceCheckUtils]: 139: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,866 INFO L290 TraceCheckUtils]: 140: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,867 INFO L290 TraceCheckUtils]: 141: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,867 INFO L272 TraceCheckUtils]: 142: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,867 INFO L290 TraceCheckUtils]: 143: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,867 INFO L290 TraceCheckUtils]: 144: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,867 INFO L290 TraceCheckUtils]: 145: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:20,867 INFO L290 TraceCheckUtils]: 146: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,868 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {9312#true} {10226#(<= 3 |fibonacci_#in~n|)} #53#return; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,868 INFO L290 TraceCheckUtils]: 148: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,868 INFO L290 TraceCheckUtils]: 149: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,868 INFO L290 TraceCheckUtils]: 150: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,869 INFO L290 TraceCheckUtils]: 151: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume true; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,869 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {10226#(<= 3 |fibonacci_#in~n|)} {10119#(<= fibonacci_~n |fibonacci_#in~n|)} #51#return; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 153: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 154: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 155: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,870 INFO L272 TraceCheckUtils]: 156: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 157: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 158: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 159: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 160: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L290 TraceCheckUtils]: 161: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,870 INFO L272 TraceCheckUtils]: 162: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 163: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 164: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 165: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 166: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 168: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 169: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 170: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L272 TraceCheckUtils]: 171: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 172: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 173: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 174: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 176: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 177: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 178: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:20,871 INFO L290 TraceCheckUtils]: 179: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:20,872 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {9312#true} {10269#(<= 4 |fibonacci_#in~n|)} #53#return; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,872 INFO L290 TraceCheckUtils]: 181: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,872 INFO L290 TraceCheckUtils]: 182: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,873 INFO L290 TraceCheckUtils]: 183: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,873 INFO L290 TraceCheckUtils]: 184: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume true; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:20,874 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {10269#(<= 4 |fibonacci_#in~n|)} {9399#(<= fibonacci_~n 3)} #51#return; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 186: Hoare triple {9313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 187: Hoare triple {9313#false} assume ~n - 2 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 188: Hoare triple {9313#false} assume ~n - 2 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L272 TraceCheckUtils]: 189: Hoare triple {9313#false} call #t~ret5 := fibonacci(~n - 2); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 190: Hoare triple {9313#false} ~n := #in~n; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 191: Hoare triple {9313#false} assume !(~n < 1); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 192: Hoare triple {9313#false} assume !(1 == ~n); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 193: Hoare triple {9313#false} assume ~n - 1 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 194: Hoare triple {9313#false} assume ~n - 1 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L272 TraceCheckUtils]: 195: Hoare triple {9313#false} call #t~ret4 := fibonacci(~n - 1); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 196: Hoare triple {9313#false} ~n := #in~n; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 197: Hoare triple {9313#false} assume !(~n < 1); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 198: Hoare triple {9313#false} assume !(1 == ~n); {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 199: Hoare triple {9313#false} assume ~n - 1 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L290 TraceCheckUtils]: 200: Hoare triple {9313#false} assume ~n - 1 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:20,874 INFO L272 TraceCheckUtils]: 201: Hoare triple {9313#false} call #t~ret4 := fibonacci(~n - 1); {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 202: Hoare triple {9313#false} ~n := #in~n; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 203: Hoare triple {9313#false} assume !(~n < 1); {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 204: Hoare triple {9313#false} assume 1 == ~n;#res := 1; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 205: Hoare triple {9313#false} assume true; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {9313#false} {9313#false} #51#return; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 207: Hoare triple {9313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 208: Hoare triple {9313#false} assume ~n - 2 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 209: Hoare triple {9313#false} assume ~n - 2 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L272 TraceCheckUtils]: 210: Hoare triple {9313#false} call #t~ret5 := fibonacci(~n - 2); {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 211: Hoare triple {9313#false} ~n := #in~n; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 212: Hoare triple {9313#false} assume ~n < 1;#res := 0; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 213: Hoare triple {9313#false} assume true; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {9313#false} {9313#false} #53#return; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 215: Hoare triple {9313#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 216: Hoare triple {9313#false} assume #t~ret4 + #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 217: Hoare triple {9313#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9313#false} is VALID [2022-02-21 03:08:20,875 INFO L290 TraceCheckUtils]: 218: Hoare triple {9313#false} assume true; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L284 TraceCheckUtils]: 219: Hoare quadruple {9313#false} {9313#false} #51#return; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 220: Hoare triple {9313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 221: Hoare triple {9313#false} assume ~n - 2 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 222: Hoare triple {9313#false} assume ~n - 2 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L272 TraceCheckUtils]: 223: Hoare triple {9313#false} call #t~ret5 := fibonacci(~n - 2); {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 224: Hoare triple {9313#false} ~n := #in~n; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 225: Hoare triple {9313#false} assume !(~n < 1); {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 226: Hoare triple {9313#false} assume 1 == ~n;#res := 1; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 227: Hoare triple {9313#false} assume true; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {9313#false} {9313#false} #53#return; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 229: Hoare triple {9313#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 230: Hoare triple {9313#false} assume #t~ret4 + #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 231: Hoare triple {9313#false} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 232: Hoare triple {9313#false} assume true; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L284 TraceCheckUtils]: 233: Hoare quadruple {9313#false} {9313#false} #53#return; {9313#false} is VALID [2022-02-21 03:08:20,876 INFO L290 TraceCheckUtils]: 234: Hoare triple {9313#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:20,877 INFO L290 TraceCheckUtils]: 235: Hoare triple {9313#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {9313#false} is VALID [2022-02-21 03:08:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 1033 proven. 361 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-02-21 03:08:20,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:08:23,734 INFO L290 TraceCheckUtils]: 235: Hoare triple {9313#false} assume !(#t~ret4 + #t~ret5 <= 2147483647); {9313#false} is VALID [2022-02-21 03:08:23,735 INFO L290 TraceCheckUtils]: 234: Hoare triple {9313#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:23,735 INFO L284 TraceCheckUtils]: 233: Hoare quadruple {9312#true} {9313#false} #53#return; {9313#false} is VALID [2022-02-21 03:08:23,735 INFO L290 TraceCheckUtils]: 232: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,735 INFO L290 TraceCheckUtils]: 231: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:23,735 INFO L290 TraceCheckUtils]: 230: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,735 INFO L290 TraceCheckUtils]: 229: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,735 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 227: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 226: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 225: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 224: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L272 TraceCheckUtils]: 223: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 222: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,736 INFO L290 TraceCheckUtils]: 221: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L290 TraceCheckUtils]: 220: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L284 TraceCheckUtils]: 219: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L290 TraceCheckUtils]: 218: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L290 TraceCheckUtils]: 217: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L290 TraceCheckUtils]: 216: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L290 TraceCheckUtils]: 215: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,737 INFO L284 TraceCheckUtils]: 214: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:23,738 INFO L290 TraceCheckUtils]: 213: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,738 INFO L290 TraceCheckUtils]: 212: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:23,738 INFO L290 TraceCheckUtils]: 211: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,738 INFO L272 TraceCheckUtils]: 210: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,738 INFO L290 TraceCheckUtils]: 209: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 208: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 207: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L284 TraceCheckUtils]: 206: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 205: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 204: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 203: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,739 INFO L290 TraceCheckUtils]: 202: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L272 TraceCheckUtils]: 201: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 200: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 199: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 198: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 197: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 196: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L272 TraceCheckUtils]: 195: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 194: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,740 INFO L290 TraceCheckUtils]: 193: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 192: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 191: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 190: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,741 INFO L272 TraceCheckUtils]: 189: Hoare triple {9313#false} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 188: Hoare triple {9313#false} assume ~n - 2 >= -2147483648; {9313#false} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 187: Hoare triple {9313#false} assume ~n - 2 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:23,741 INFO L290 TraceCheckUtils]: 186: Hoare triple {9313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9313#false} is VALID [2022-02-21 03:08:23,742 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {10269#(<= 4 |fibonacci_#in~n|)} {10669#(< fibonacci_~n 5)} #51#return; {9313#false} is VALID [2022-02-21 03:08:23,743 INFO L290 TraceCheckUtils]: 184: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume true; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,743 INFO L290 TraceCheckUtils]: 183: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,743 INFO L290 TraceCheckUtils]: 182: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,744 INFO L290 TraceCheckUtils]: 181: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,744 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {9312#true} {10269#(<= 4 |fibonacci_#in~n|)} #53#return; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,744 INFO L290 TraceCheckUtils]: 179: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 178: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 177: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 176: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 174: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 173: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L290 TraceCheckUtils]: 172: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,745 INFO L272 TraceCheckUtils]: 171: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 170: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 169: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 168: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 166: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 165: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 164: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,746 INFO L290 TraceCheckUtils]: 163: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L272 TraceCheckUtils]: 162: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L290 TraceCheckUtils]: 161: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L290 TraceCheckUtils]: 160: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L290 TraceCheckUtils]: 159: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L290 TraceCheckUtils]: 158: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L290 TraceCheckUtils]: 157: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,747 INFO L272 TraceCheckUtils]: 156: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,748 INFO L290 TraceCheckUtils]: 155: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,748 INFO L290 TraceCheckUtils]: 154: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,748 INFO L290 TraceCheckUtils]: 153: Hoare triple {10269#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,749 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {10226#(<= 3 |fibonacci_#in~n|)} {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} #51#return; {10269#(<= 4 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,750 INFO L290 TraceCheckUtils]: 151: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume true; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,750 INFO L290 TraceCheckUtils]: 150: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,750 INFO L290 TraceCheckUtils]: 149: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,750 INFO L290 TraceCheckUtils]: 148: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,751 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {9312#true} {10226#(<= 3 |fibonacci_#in~n|)} #53#return; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,751 INFO L290 TraceCheckUtils]: 146: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,751 INFO L290 TraceCheckUtils]: 145: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,751 INFO L290 TraceCheckUtils]: 144: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,752 INFO L290 TraceCheckUtils]: 143: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,752 INFO L272 TraceCheckUtils]: 142: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,752 INFO L290 TraceCheckUtils]: 141: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,752 INFO L290 TraceCheckUtils]: 140: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,753 INFO L290 TraceCheckUtils]: 139: Hoare triple {10226#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,754 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {9795#(<= 2 |fibonacci_#in~n|)} {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} #51#return; {10226#(<= 3 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,754 INFO L290 TraceCheckUtils]: 137: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume true; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,755 INFO L290 TraceCheckUtils]: 136: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,755 INFO L290 TraceCheckUtils]: 135: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume #t~ret4 + #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,755 INFO L290 TraceCheckUtils]: 134: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,756 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {9312#true} {9795#(<= 2 |fibonacci_#in~n|)} #53#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,756 INFO L290 TraceCheckUtils]: 132: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,756 INFO L290 TraceCheckUtils]: 131: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:23,756 INFO L290 TraceCheckUtils]: 130: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,756 INFO L272 TraceCheckUtils]: 129: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,756 INFO L290 TraceCheckUtils]: 128: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 >= -2147483648; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,757 INFO L290 TraceCheckUtils]: 127: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume ~n - 2 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,757 INFO L290 TraceCheckUtils]: 126: Hoare triple {9795#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,758 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {10177#(<= 1 |fibonacci_#in~n|)} {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} #51#return; {9795#(<= 2 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,758 INFO L290 TraceCheckUtils]: 124: Hoare triple {10177#(<= 1 |fibonacci_#in~n|)} assume true; {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,758 INFO L290 TraceCheckUtils]: 123: Hoare triple {10177#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,759 INFO L290 TraceCheckUtils]: 122: Hoare triple {10874#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} assume !(~n < 1); {10177#(<= 1 |fibonacci_#in~n|)} is VALID [2022-02-21 03:08:23,759 INFO L290 TraceCheckUtils]: 121: Hoare triple {9312#true} ~n := #in~n; {10874#(or (<= 1 |fibonacci_#in~n|) (< fibonacci_~n 1))} is VALID [2022-02-21 03:08:23,759 INFO L272 TraceCheckUtils]: 120: Hoare triple {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,759 INFO L290 TraceCheckUtils]: 119: Hoare triple {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 >= -2147483648; {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:23,760 INFO L290 TraceCheckUtils]: 118: Hoare triple {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume ~n - 1 <= 2147483647; {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:23,760 INFO L290 TraceCheckUtils]: 117: Hoare triple {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(1 == ~n); {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:23,760 INFO L290 TraceCheckUtils]: 116: Hoare triple {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} assume !(~n < 1); {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:23,761 INFO L290 TraceCheckUtils]: 115: Hoare triple {9312#true} ~n := #in~n; {10861#(or (<= 2 |fibonacci_#in~n|) (< fibonacci_~n 2))} is VALID [2022-02-21 03:08:23,761 INFO L272 TraceCheckUtils]: 114: Hoare triple {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 >= -2147483648; {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:23,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume ~n - 1 <= 2147483647; {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:23,762 INFO L290 TraceCheckUtils]: 111: Hoare triple {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(1 == ~n); {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:23,762 INFO L290 TraceCheckUtils]: 110: Hoare triple {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} assume !(~n < 1); {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:23,762 INFO L290 TraceCheckUtils]: 109: Hoare triple {9312#true} ~n := #in~n; {10818#(or (<= 3 |fibonacci_#in~n|) (< fibonacci_~n 3))} is VALID [2022-02-21 03:08:23,763 INFO L272 TraceCheckUtils]: 108: Hoare triple {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,763 INFO L290 TraceCheckUtils]: 107: Hoare triple {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 >= -2147483648; {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:23,763 INFO L290 TraceCheckUtils]: 106: Hoare triple {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume ~n - 1 <= 2147483647; {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:23,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(1 == ~n); {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:23,764 INFO L290 TraceCheckUtils]: 104: Hoare triple {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} assume !(~n < 1); {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:23,764 INFO L290 TraceCheckUtils]: 103: Hoare triple {9312#true} ~n := #in~n; {10772#(or (< fibonacci_~n 4) (<= 4 |fibonacci_#in~n|))} is VALID [2022-02-21 03:08:23,764 INFO L272 TraceCheckUtils]: 102: Hoare triple {10669#(< fibonacci_~n 5)} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {10669#(< fibonacci_~n 5)} assume ~n - 1 >= -2147483648; {10669#(< fibonacci_~n 5)} is VALID [2022-02-21 03:08:23,765 INFO L290 TraceCheckUtils]: 100: Hoare triple {10669#(< fibonacci_~n 5)} assume ~n - 1 <= 2147483647; {10669#(< fibonacci_~n 5)} is VALID [2022-02-21 03:08:23,765 INFO L290 TraceCheckUtils]: 99: Hoare triple {10669#(< fibonacci_~n 5)} assume !(1 == ~n); {10669#(< fibonacci_~n 5)} is VALID [2022-02-21 03:08:23,765 INFO L290 TraceCheckUtils]: 98: Hoare triple {10669#(< fibonacci_~n 5)} assume !(~n < 1); {10669#(< fibonacci_~n 5)} is VALID [2022-02-21 03:08:23,766 INFO L290 TraceCheckUtils]: 97: Hoare triple {9597#(<= |fibonacci_#in~n| 4)} ~n := #in~n; {10669#(< fibonacci_~n 5)} is VALID [2022-02-21 03:08:23,766 INFO L272 TraceCheckUtils]: 96: Hoare triple {10941#(<= fibonacci_~n 6)} call #t~ret5 := fibonacci(~n - 2); {9597#(<= |fibonacci_#in~n| 4)} is VALID [2022-02-21 03:08:23,766 INFO L290 TraceCheckUtils]: 95: Hoare triple {10941#(<= fibonacci_~n 6)} assume ~n - 2 >= -2147483648; {10941#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:08:23,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {10941#(<= fibonacci_~n 6)} assume ~n - 2 <= 2147483647; {10941#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:08:23,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {10941#(<= fibonacci_~n 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10941#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:08:23,768 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10957#(<= |fibonacci_#in~n| 5)} {9312#true} #51#return; {10941#(<= fibonacci_~n 6)} is VALID [2022-02-21 03:08:23,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {10957#(<= |fibonacci_#in~n| 5)} assume true; {10957#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:08:23,768 INFO L290 TraceCheckUtils]: 90: Hoare triple {10957#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {10957#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:08:23,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {10957#(<= |fibonacci_#in~n| 5)} assume #t~ret4 + #t~ret5 <= 2147483647; {10957#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:08:23,769 INFO L290 TraceCheckUtils]: 88: Hoare triple {10957#(<= |fibonacci_#in~n| 5)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {10957#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:08:23,769 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {9638#(<= |fibonacci_#in~n| 2)} {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} #53#return; {10957#(<= |fibonacci_#in~n| 5)} is VALID [2022-02-21 03:08:23,770 INFO L290 TraceCheckUtils]: 86: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume true; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:23,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:23,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume #t~ret4 + #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:23,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {9638#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:23,771 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10049#(< |fibonacci_#in~n| 1)} {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #53#return; {9638#(<= |fibonacci_#in~n| 2)} is VALID [2022-02-21 03:08:23,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#(< |fibonacci_#in~n| 1)} assume true; {10049#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:23,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {11002#(or (< |fibonacci_#in~n| 1) (not (< fibonacci_~n 1)))} assume ~n < 1;#res := 0; {10049#(< |fibonacci_#in~n| 1)} is VALID [2022-02-21 03:08:23,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {9312#true} ~n := #in~n; {11002#(or (< |fibonacci_#in~n| 1) (not (< fibonacci_~n 1)))} is VALID [2022-02-21 03:08:23,772 INFO L272 TraceCheckUtils]: 78: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 2 >= -2147483648; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 2 <= 2147483647; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,773 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9312#true} {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} #51#return; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,774 INFO L272 TraceCheckUtils]: 69: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 >= -2147483648; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume ~n - 1 <= 2147483647; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(1 == ~n); {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} assume !(~n < 1); {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {9312#true} ~n := #in~n; {10992#(or (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 2))} is VALID [2022-02-21 03:08:23,775 INFO L272 TraceCheckUtils]: 63: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 2 >= -2147483648; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 2 <= 2147483647; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,777 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9312#true} {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} #51#return; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L272 TraceCheckUtils]: 49: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 >= -2147483648;#res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {9312#true} assume #t~ret4 + #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {9312#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9312#true} {9312#true} #53#return; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {9312#true} assume ~n < 1;#res := 0; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L272 TraceCheckUtils]: 36: Hoare triple {9312#true} call #t~ret5 := fibonacci(~n - 2); {9312#true} is VALID [2022-02-21 03:08:23,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {9312#true} assume ~n - 2 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {9312#true} assume ~n - 2 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {9312#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9312#true} {9312#true} #51#return; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {9312#true} assume true; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {9312#true} assume 1 == ~n;#res := 1; {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L272 TraceCheckUtils]: 27: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L272 TraceCheckUtils]: 21: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,782 INFO L272 TraceCheckUtils]: 15: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 1 >= -2147483648; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume ~n - 1 <= 2147483647; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(1 == ~n); {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} assume !(~n < 1); {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#true} ~n := #in~n; {10973#(or (<= 5 fibonacci_~n) (<= |fibonacci_#in~n| 5))} is VALID [2022-02-21 03:08:23,784 INFO L272 TraceCheckUtils]: 9: Hoare triple {9312#true} call #t~ret4 := fibonacci(~n - 1); {9312#true} is VALID [2022-02-21 03:08:23,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {9312#true} assume ~n - 1 >= -2147483648; {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {9312#true} assume ~n - 1 <= 2147483647; {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {9312#true} assume !(1 == ~n); {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {9312#true} assume !(~n < 1); {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {9312#true} ~n := #in~n; {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L272 TraceCheckUtils]: 3: Hoare triple {9312#true} call main_#t~ret7#1 := fibonacci(main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {9312#true} assume !(main_~x~0#1 > 46 || -2147483648 == main_~x~0#1); {9312#true} is VALID [2022-02-21 03:08:23,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {9312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {9312#true} is VALID [2022-02-21 03:08:23,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {9312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9312#true} is VALID [2022-02-21 03:08:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 413 proven. 655 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-02-21 03:08:23,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277646566] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:08:23,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:08:23,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 19] total 31 [2022-02-21 03:08:23,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006968969] [2022-02-21 03:08:23,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:08:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.290322580645161) internal successors, (164), 31 states have internal predecessors, (164), 21 states have call successors, (30), 4 states have call predecessors, (30), 12 states have return successors, (35), 19 states have call predecessors, (35), 19 states have call successors, (35) Word has length 236