/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:49:13,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:49:13,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:49:13,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:49:13,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:49:13,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:49:13,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:49:13,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:49:13,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:49:13,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:49:13,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:49:13,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:49:13,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:49:13,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:49:13,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:49:13,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:49:13,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:49:13,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:49:13,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:49:13,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:49:13,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:49:13,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:49:13,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:49:13,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:49:13,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:49:13,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:49:13,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:49:13,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:49:13,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:49:13,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:49:13,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:49:13,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:49:13,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:49:13,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:49:13,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:49:13,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:49:13,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:49:13,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:49:13,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:49:13,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:49:13,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:49:13,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:49:13,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:49:13,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:49:13,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:49:13,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:49:13,797 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:49:13,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:49:13,797 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:49:13,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:49:13,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:49:13,799 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:49:13,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:49:13,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:49:13,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:49:13,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:49:13,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:49:13,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:49:13,801 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 21:49:14,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:49:14,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:49:14,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:49:14,131 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:49:14,132 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:49:14,132 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-08 21:49:14,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b9326/2b78962c24b54af0b889a4e942bd1dec/FLAGdb9baf6e3 [2020-07-08 21:49:14,637 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:49:14,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-08 21:49:14,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b9326/2b78962c24b54af0b889a4e942bd1dec/FLAGdb9baf6e3 [2020-07-08 21:49:15,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b9326/2b78962c24b54af0b889a4e942bd1dec [2020-07-08 21:49:15,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:49:15,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:49:15,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:15,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:49:15,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:49:15,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461264cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15, skipping insertion in model container [2020-07-08 21:49:15,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:49:15,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:49:15,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:15,295 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:49:15,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:49:15,327 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:49:15,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15 WrapperNode [2020-07-08 21:49:15,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:49:15,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:49:15,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:49:15,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:49:15,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... [2020-07-08 21:49:15,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:49:15,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:49:15,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:49:15,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:49:15,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:49:15,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:49:15,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:49:15,510 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-08 21:49:15,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:49:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:49:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 21:49:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-08 21:49:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:49:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:49:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:49:15,760 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:49:15,761 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 21:49:15,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:15 BoogieIcfgContainer [2020-07-08 21:49:15,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:49:15,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:49:15,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:49:15,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:49:15,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:49:15" (1/3) ... [2020-07-08 21:49:15,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad3e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:15, skipping insertion in model container [2020-07-08 21:49:15,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:49:15" (2/3) ... [2020-07-08 21:49:15,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad3e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:49:15, skipping insertion in model container [2020-07-08 21:49:15,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:49:15" (3/3) ... [2020-07-08 21:49:15,774 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-08 21:49:15,786 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:49:15,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:49:15,815 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:49:15,841 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:49:15,841 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:49:15,841 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:49:15,842 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:49:15,842 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:49:15,842 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:49:15,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:49:15,843 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:49:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-08 21:49:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 21:49:15,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:15,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:15,877 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:15,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-08 21:49:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:15,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950571548] [2020-07-08 21:49:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 21:49:16,123 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-08 21:49:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:16,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,191 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-08 21:49:16,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-08 21:49:16,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-08 21:49:16,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-08 21:49:16,193 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-08 21:49:16,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-08 21:49:16,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-08 21:49:16,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-08 21:49:16,195 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-08 21:49:16,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:16,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:16,203 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-08 21:49:16,204 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-08 21:49:16,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-08 21:49:16,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-08 21:49:16,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-08 21:49:16,209 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-08 21:49:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 21:49:16,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950571548] [2020-07-08 21:49:16,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:16,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 21:49:16,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805262650] [2020-07-08 21:49:16,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 21:49:16,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:16,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 21:49:16,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:16,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 21:49:16,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 21:49:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:16,296 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-08 21:49:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:16,648 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 21:49:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 21:49:16,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 21:49:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-08 21:49:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-08 21:49:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-08 21:49:16,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:16,781 INFO L225 Difference]: With dead ends: 48 [2020-07-08 21:49:16,781 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 21:49:16,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:49:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 21:49:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 21:49:16,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:16,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 21:49:16,864 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 21:49:16,865 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 21:49:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:16,872 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 21:49:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 21:49:16,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:16,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:16,874 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 21:49:16,874 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 21:49:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:16,879 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-08 21:49:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 21:49:16,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:16,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:16,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:16,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 21:49:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-08 21:49:16,887 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-08 21:49:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:16,887 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-08 21:49:16,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 21:49:16,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-08 21:49:16,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 21:49:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 21:49:16,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:16,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:16,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:49:16,937 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-08 21:49:16,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:16,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893278039] [2020-07-08 21:49:16,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:16,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 21:49:16,981 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-08 21:49:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,020 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-08 21:49:17,020 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-08 21:49:17,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 21:49:17,021 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-08 21:49:17,021 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-08 21:49:17,022 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-08 21:49:17,022 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-08 21:49:17,022 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-08 21:49:17,023 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-08 21:49:17,024 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,024 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,025 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,026 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,027 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:17,028 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-08 21:49:17,029 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-08 21:49:17,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-08 21:49:17,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-08 21:49:17,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-08 21:49:17,032 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-08 21:49:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 21:49:17,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893278039] [2020-07-08 21:49:17,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:49:17,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 21:49:17,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524058255] [2020-07-08 21:49:17,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 21:49:17,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:17,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 21:49:17,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:17,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 21:49:17,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:17,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 21:49:17,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:49:17,063 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-08 21:49:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:17,266 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-08 21:49:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 21:49:17,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-08 21:49:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 21:49:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 21:49:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-08 21:49:17,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-08 21:49:17,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:17,331 INFO L225 Difference]: With dead ends: 38 [2020-07-08 21:49:17,332 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 21:49:17,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:49:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 21:49:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-08 21:49:17,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:17,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-08 21:49:17,368 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-08 21:49:17,368 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-08 21:49:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:17,372 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-08 21:49:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-08 21:49:17,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:17,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:17,374 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-08 21:49:17,374 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-08 21:49:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:17,378 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-08 21:49:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-08 21:49:17,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:17,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:17,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:17,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 21:49:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-08 21:49:17,383 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-08 21:49:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:17,383 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-08 21:49:17,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 21:49:17,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-08 21:49:17,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-08 21:49:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 21:49:17,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:17,434 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:17,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:49:17,434 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-08 21:49:17,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:17,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984059688] [2020-07-08 21:49:17,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 21:49:17,494 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-08 21:49:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,615 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 21:49:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:17,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 21:49:17,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 21:49:17,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 21:49:17,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 21:49:17,625 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 21:49:17,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 21:49:17,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-08 21:49:17,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-08 21:49:17,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-08 21:49:17,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,637 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 21:49:17,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-08 21:49:17,638 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-08 21:49:17,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 21:49:17,638 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 21:49:17,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 21:49:17,639 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 21:49:17,640 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 21:49:17,640 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-08 21:49:17,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-08 21:49:17,641 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-08 21:49:17,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-08 21:49:17,643 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-08 21:49:17,644 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-08 21:49:17,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-08 21:49:17,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 21:49:17,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-08 21:49:17,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-08 21:49:17,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-08 21:49:17,654 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-08 21:49:17,655 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-08 21:49:17,655 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-08 21:49:17,656 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 21:49:17,657 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-08 21:49:17,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-08 21:49:17,659 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-08 21:49:17,660 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:17,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,662 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:17,665 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-08 21:49:17,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-08 21:49:17,666 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-08 21:49:17,666 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-08 21:49:17,667 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-08 21:49:17,667 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-08 21:49:17,671 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-08 21:49:17,671 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-08 21:49:17,672 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-08 21:49:17,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-08 21:49:17,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-08 21:49:17,673 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-08 21:49:17,674 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-08 21:49:17,674 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-08 21:49:17,674 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-08 21:49:17,675 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-08 21:49:17,675 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-08 21:49:17,675 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-08 21:49:17,676 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-08 21:49:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 21:49:17,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984059688] [2020-07-08 21:49:17,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:17,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 21:49:17,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867233079] [2020-07-08 21:49:17,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 21:49:17,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:17,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:49:17,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:17,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:49:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:49:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:49:17,735 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-08 21:49:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,043 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-08 21:49:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 21:49:18,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 21:49:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-08 21:49:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:49:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-08 21:49:18,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-08 21:49:18,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,128 INFO L225 Difference]: With dead ends: 54 [2020-07-08 21:49:18,129 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 21:49:18,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 21:49:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 21:49:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 21:49:18,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:18,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 21:49:18,169 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 21:49:18,170 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 21:49:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,173 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 21:49:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 21:49:18,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:18,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:18,174 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 21:49:18,174 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 21:49:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,177 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 21:49:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 21:49:18,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:18,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:18,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:18,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 21:49:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-08 21:49:18,181 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-08 21:49:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:18,182 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-08 21:49:18,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:49:18,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2020-07-08 21:49:18,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 21:49:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 21:49:18,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:18,243 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:18,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:49:18,244 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-08 21:49:18,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:18,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6637762] [2020-07-08 21:49:18,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:18,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 21:49:18,285 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-08 21:49:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:18,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,371 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,374 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:18,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 21:49:18,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 21:49:18,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 21:49:18,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 21:49:18,385 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-08 21:49:18,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,389 INFO L280 TraceCheckUtils]: 5: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,390 INFO L280 TraceCheckUtils]: 6: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,393 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:18,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:18,394 INFO L263 TraceCheckUtils]: 11: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-08 21:49:18,394 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 21:49:18,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 21:49:18,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 21:49:18,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 21:49:18,397 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,400 INFO L280 TraceCheckUtils]: 20: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,400 INFO L280 TraceCheckUtils]: 21: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume true; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,401 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {812#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-08 21:49:18,403 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2020-07-08 21:49:18,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 21:49:18,403 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-08 21:49:18,404 INFO L263 TraceCheckUtils]: 3: Hoare triple {771#true} call #t~ret4 := main(); {771#true} is VALID [2020-07-08 21:49:18,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {771#true} is VALID [2020-07-08 21:49:18,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {771#true} ~x~0 := #t~nondet2; {771#true} is VALID [2020-07-08 21:49:18,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {771#true} havoc #t~nondet2; {771#true} is VALID [2020-07-08 21:49:18,405 INFO L263 TraceCheckUtils]: 7: Hoare triple {771#true} call #t~ret3 := fibonacci(~x~0); {771#true} is VALID [2020-07-08 21:49:18,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,406 INFO L280 TraceCheckUtils]: 9: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,407 INFO L263 TraceCheckUtils]: 11: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-08 21:49:18,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:18,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#(<= |fibonacci_#in~n| 1)} #res := 1; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#(<= |fibonacci_#in~n| 1)} assume true; {813#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:18,411 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {813#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:18,412 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:18,413 INFO L263 TraceCheckUtils]: 19: Hoare triple {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-08 21:49:18,413 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-08 21:49:18,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-08 21:49:18,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-08 21:49:18,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-08 21:49:18,415 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#true} {806#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,416 INFO L280 TraceCheckUtils]: 25: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,416 INFO L280 TraceCheckUtils]: 26: Hoare triple {812#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,418 INFO L280 TraceCheckUtils]: 28: Hoare triple {812#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {812#(<= |fibonacci_#in~n| 2)} assume true; {812#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:18,419 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {812#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-08 21:49:18,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {798#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {798#(<= main_~x~0 2)} is VALID [2020-07-08 21:49:18,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= main_~x~0 2)} ~result~0 := #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-08 21:49:18,421 INFO L280 TraceCheckUtils]: 33: Hoare triple {798#(<= main_~x~0 2)} havoc #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-08 21:49:18,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {798#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {772#false} is VALID [2020-07-08 21:49:18,422 INFO L280 TraceCheckUtils]: 35: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-08 21:49:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 21:49:18,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6637762] [2020-07-08 21:49:18,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:18,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 21:49:18,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295685275] [2020-07-08 21:49:18,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:18,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:18,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 21:49:18,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 21:49:18,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:18,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 21:49:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:49:18,463 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2020-07-08 21:49:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:18,902 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-08 21:49:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:18,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-08 21:49:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 21:49:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 21:49:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-08 21:49:18,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-08 21:49:18,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:18,996 INFO L225 Difference]: With dead ends: 58 [2020-07-08 21:49:18,996 INFO L226 Difference]: Without dead ends: 52 [2020-07-08 21:49:18,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-08 21:49:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-08 21:49:19,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:19,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-08 21:49:19,075 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 21:49:19,075 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 21:49:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:19,081 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-08 21:49:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 21:49:19,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:19,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:19,082 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-08 21:49:19,082 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-08 21:49:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:19,087 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-08 21:49:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 21:49:19,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:19,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:19,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:19,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 21:49:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-08 21:49:19,092 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-08 21:49:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:19,092 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-08 21:49:19,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 21:49:19,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2020-07-08 21:49:19,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-08 21:49:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-08 21:49:19,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:19,185 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:19,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:49:19,185 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-08 21:49:19,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:19,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679763640] [2020-07-08 21:49:19,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,224 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1143#true} {1143#true} #44#return; {1143#true} is VALID [2020-07-08 21:49:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 21:49:19,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 21:49:19,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,331 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 21:49:19,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 21:49:19,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,342 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 21:49:19,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 21:49:19,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 21:49:19,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,347 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,348 INFO L263 TraceCheckUtils]: 11: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 21:49:19,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 21:49:19,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 21:49:19,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,350 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,351 INFO L280 TraceCheckUtils]: 18: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,352 INFO L280 TraceCheckUtils]: 19: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,353 INFO L280 TraceCheckUtils]: 21: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,355 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 21:49:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:19,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,375 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 21:49:19,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {1143#true} assume !(1 == ~n); {1143#true} is VALID [2020-07-08 21:49:19,376 INFO L263 TraceCheckUtils]: 3: Hoare triple {1143#true} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 21:49:19,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,377 INFO L280 TraceCheckUtils]: 5: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,380 INFO L263 TraceCheckUtils]: 7: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 21:49:19,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,380 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 21:49:19,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 21:49:19,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,383 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,384 INFO L263 TraceCheckUtils]: 15: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 21:49:19,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 21:49:19,384 INFO L280 TraceCheckUtils]: 18: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 21:49:19,385 INFO L280 TraceCheckUtils]: 19: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,386 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,390 INFO L280 TraceCheckUtils]: 22: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,390 INFO L280 TraceCheckUtils]: 23: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,391 INFO L280 TraceCheckUtils]: 24: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,394 INFO L280 TraceCheckUtils]: 25: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,396 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 21:49:19,397 INFO L280 TraceCheckUtils]: 27: Hoare triple {1210#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 21:49:19,398 INFO L263 TraceCheckUtils]: 28: Hoare triple {1210#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 21:49:19,399 INFO L280 TraceCheckUtils]: 29: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,404 INFO L280 TraceCheckUtils]: 32: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,405 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 21:49:19,405 INFO L280 TraceCheckUtils]: 34: Hoare triple {1144#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1144#false} is VALID [2020-07-08 21:49:19,405 INFO L280 TraceCheckUtils]: 35: Hoare triple {1144#false} #res := #t~ret0 + #t~ret1; {1144#false} is VALID [2020-07-08 21:49:19,406 INFO L280 TraceCheckUtils]: 36: Hoare triple {1144#false} havoc #t~ret0; {1144#false} is VALID [2020-07-08 21:49:19,406 INFO L280 TraceCheckUtils]: 37: Hoare triple {1144#false} havoc #t~ret1; {1144#false} is VALID [2020-07-08 21:49:19,406 INFO L280 TraceCheckUtils]: 38: Hoare triple {1144#false} assume true; {1144#false} is VALID [2020-07-08 21:49:19,407 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1144#false} {1143#true} #48#return; {1144#false} is VALID [2020-07-08 21:49:19,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {1143#true} call ULTIMATE.init(); {1143#true} is VALID [2020-07-08 21:49:19,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1143#true} {1143#true} #44#return; {1143#true} is VALID [2020-07-08 21:49:19,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {1143#true} call #t~ret4 := main(); {1143#true} is VALID [2020-07-08 21:49:19,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {1143#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1143#true} is VALID [2020-07-08 21:49:19,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {1143#true} ~x~0 := #t~nondet2; {1143#true} is VALID [2020-07-08 21:49:19,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {1143#true} havoc #t~nondet2; {1143#true} is VALID [2020-07-08 21:49:19,418 INFO L263 TraceCheckUtils]: 7: Hoare triple {1143#true} call #t~ret3 := fibonacci(~x~0); {1143#true} is VALID [2020-07-08 21:49:19,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {1143#true} assume !(1 == ~n); {1143#true} is VALID [2020-07-08 21:49:19,419 INFO L263 TraceCheckUtils]: 11: Hoare triple {1143#true} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 21:49:19,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,421 INFO L280 TraceCheckUtils]: 13: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {1217#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,422 INFO L263 TraceCheckUtils]: 15: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1143#true} is VALID [2020-07-08 21:49:19,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,422 INFO L280 TraceCheckUtils]: 17: Hoare triple {1143#true} assume !(~n < 1); {1143#true} is VALID [2020-07-08 21:49:19,422 INFO L280 TraceCheckUtils]: 18: Hoare triple {1143#true} assume 1 == ~n; {1143#true} is VALID [2020-07-08 21:49:19,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {1143#true} #res := 1; {1143#true} is VALID [2020-07-08 21:49:19,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,424 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,425 INFO L280 TraceCheckUtils]: 22: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:19,425 INFO L263 TraceCheckUtils]: 23: Hoare triple {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 21:49:19,425 INFO L280 TraceCheckUtils]: 24: Hoare triple {1143#true} ~n := #in~n; {1143#true} is VALID [2020-07-08 21:49:19,425 INFO L280 TraceCheckUtils]: 25: Hoare triple {1143#true} assume ~n < 1; {1143#true} is VALID [2020-07-08 21:49:19,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {1143#true} #res := 0; {1143#true} is VALID [2020-07-08 21:49:19,426 INFO L280 TraceCheckUtils]: 27: Hoare triple {1143#true} assume true; {1143#true} is VALID [2020-07-08 21:49:19,427 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1143#true} {1218#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,428 INFO L280 TraceCheckUtils]: 29: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,429 INFO L280 TraceCheckUtils]: 30: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,429 INFO L280 TraceCheckUtils]: 31: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,430 INFO L280 TraceCheckUtils]: 32: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,430 INFO L280 TraceCheckUtils]: 33: Hoare triple {1230#(<= 2 |fibonacci_#in~n|)} assume true; {1230#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,431 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1230#(<= 2 |fibonacci_#in~n|)} {1143#true} #40#return; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 21:49:19,432 INFO L280 TraceCheckUtils]: 35: Hoare triple {1210#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1210#(<= 3 fibonacci_~n)} is VALID [2020-07-08 21:49:19,432 INFO L263 TraceCheckUtils]: 36: Hoare triple {1210#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1143#true} is VALID [2020-07-08 21:49:19,433 INFO L280 TraceCheckUtils]: 37: Hoare triple {1143#true} ~n := #in~n; {1216#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:19,434 INFO L280 TraceCheckUtils]: 38: Hoare triple {1216#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,434 INFO L280 TraceCheckUtils]: 39: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} #res := 0; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,435 INFO L280 TraceCheckUtils]: 40: Hoare triple {1231#(<= |fibonacci_#in~n| 0)} assume true; {1231#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 21:49:19,436 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1231#(<= |fibonacci_#in~n| 0)} {1210#(<= 3 fibonacci_~n)} #42#return; {1144#false} is VALID [2020-07-08 21:49:19,436 INFO L280 TraceCheckUtils]: 42: Hoare triple {1144#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1144#false} is VALID [2020-07-08 21:49:19,436 INFO L280 TraceCheckUtils]: 43: Hoare triple {1144#false} #res := #t~ret0 + #t~ret1; {1144#false} is VALID [2020-07-08 21:49:19,437 INFO L280 TraceCheckUtils]: 44: Hoare triple {1144#false} havoc #t~ret0; {1144#false} is VALID [2020-07-08 21:49:19,437 INFO L280 TraceCheckUtils]: 45: Hoare triple {1144#false} havoc #t~ret1; {1144#false} is VALID [2020-07-08 21:49:19,437 INFO L280 TraceCheckUtils]: 46: Hoare triple {1144#false} assume true; {1144#false} is VALID [2020-07-08 21:49:19,437 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1144#false} {1143#true} #48#return; {1144#false} is VALID [2020-07-08 21:49:19,437 INFO L280 TraceCheckUtils]: 48: Hoare triple {1144#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1144#false} is VALID [2020-07-08 21:49:19,438 INFO L280 TraceCheckUtils]: 49: Hoare triple {1144#false} ~result~0 := #t~ret3; {1144#false} is VALID [2020-07-08 21:49:19,438 INFO L280 TraceCheckUtils]: 50: Hoare triple {1144#false} havoc #t~ret3; {1144#false} is VALID [2020-07-08 21:49:19,438 INFO L280 TraceCheckUtils]: 51: Hoare triple {1144#false} assume !(5 != ~x~0 || 3 == ~result~0); {1144#false} is VALID [2020-07-08 21:49:19,438 INFO L280 TraceCheckUtils]: 52: Hoare triple {1144#false} assume !false; {1144#false} is VALID [2020-07-08 21:49:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-08 21:49:19,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679763640] [2020-07-08 21:49:19,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:19,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 21:49:19,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970257554] [2020-07-08 21:49:19,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 21:49:19,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:19,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 21:49:19,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:19,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 21:49:19,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 21:49:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 21:49:19,493 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 8 states. [2020-07-08 21:49:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:19,966 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-08 21:49:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 21:49:19,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-08 21:49:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 21:49:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 21:49:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-08 21:49:19,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-08 21:49:20,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:20,067 INFO L225 Difference]: With dead ends: 110 [2020-07-08 21:49:20,067 INFO L226 Difference]: Without dead ends: 66 [2020-07-08 21:49:20,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-08 21:49:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-08 21:49:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-08 21:49:20,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:20,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 54 states. [2020-07-08 21:49:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 54 states. [2020-07-08 21:49:20,162 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 54 states. [2020-07-08 21:49:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:20,167 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-08 21:49:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-08 21:49:20,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:20,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:20,169 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 66 states. [2020-07-08 21:49:20,169 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 66 states. [2020-07-08 21:49:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:20,174 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-08 21:49:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-08 21:49:20,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:20,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:20,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:20,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 21:49:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-08 21:49:20,180 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-08 21:49:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:20,180 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-08 21:49:20,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 21:49:20,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2020-07-08 21:49:20,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-08 21:49:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 21:49:20,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:20,279 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:20,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 21:49:20,279 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-08 21:49:20,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:20,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042256587] [2020-07-08 21:49:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,320 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1699#true} {1699#true} #44#return; {1699#true} is VALID [2020-07-08 21:49:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,464 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 21:49:20,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 21:49:20,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,472 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 21:49:20,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,477 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,478 INFO L263 TraceCheckUtils]: 11: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 21:49:20,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 21:49:20,479 INFO L280 TraceCheckUtils]: 14: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 21:49:20,479 INFO L280 TraceCheckUtils]: 15: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,480 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,481 INFO L280 TraceCheckUtils]: 17: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,481 INFO L280 TraceCheckUtils]: 18: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,481 INFO L280 TraceCheckUtils]: 19: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,482 INFO L280 TraceCheckUtils]: 20: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,482 INFO L280 TraceCheckUtils]: 21: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,489 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:20,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 21:49:20,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 21:49:20,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 21:49:20,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,499 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,501 INFO L263 TraceCheckUtils]: 3: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 21:49:20,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,503 INFO L280 TraceCheckUtils]: 5: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,504 INFO L263 TraceCheckUtils]: 7: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 21:49:20,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,506 INFO L280 TraceCheckUtils]: 10: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,507 INFO L280 TraceCheckUtils]: 12: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,510 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,511 INFO L263 TraceCheckUtils]: 15: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 21:49:20,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,512 INFO L280 TraceCheckUtils]: 17: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 21:49:20,512 INFO L280 TraceCheckUtils]: 18: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 21:49:20,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,519 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,521 INFO L280 TraceCheckUtils]: 24: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,522 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,523 INFO L280 TraceCheckUtils]: 27: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,523 INFO L263 TraceCheckUtils]: 28: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 21:49:20,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,523 INFO L280 TraceCheckUtils]: 30: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 21:49:20,523 INFO L280 TraceCheckUtils]: 31: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 21:49:20,524 INFO L280 TraceCheckUtils]: 32: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 21:49:20,524 INFO L280 TraceCheckUtils]: 33: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,526 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,527 INFO L280 TraceCheckUtils]: 35: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,528 INFO L280 TraceCheckUtils]: 36: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,529 INFO L280 TraceCheckUtils]: 37: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,529 INFO L280 TraceCheckUtils]: 38: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,529 INFO L280 TraceCheckUtils]: 39: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume true; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,530 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1776#(<= |fibonacci_#in~n| 3)} {1699#true} #48#return; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 21:49:20,532 INFO L263 TraceCheckUtils]: 0: Hoare triple {1699#true} call ULTIMATE.init(); {1699#true} is VALID [2020-07-08 21:49:20,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1699#true} {1699#true} #44#return; {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L263 TraceCheckUtils]: 3: Hoare triple {1699#true} call #t~ret4 := main(); {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {1699#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {1699#true} ~x~0 := #t~nondet2; {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {1699#true} havoc #t~nondet2; {1699#true} is VALID [2020-07-08 21:49:20,533 INFO L263 TraceCheckUtils]: 7: Hoare triple {1699#true} call #t~ret3 := fibonacci(~x~0); {1699#true} is VALID [2020-07-08 21:49:20,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,535 INFO L263 TraceCheckUtils]: 11: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 21:49:20,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,535 INFO L280 TraceCheckUtils]: 13: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,536 INFO L280 TraceCheckUtils]: 14: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,536 INFO L263 TraceCheckUtils]: 15: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1699#true} is VALID [2020-07-08 21:49:20,536 INFO L280 TraceCheckUtils]: 16: Hoare triple {1699#true} ~n := #in~n; {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1745#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:20,537 INFO L280 TraceCheckUtils]: 18: Hoare triple {1745#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} #res := 1; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {1790#(<= |fibonacci_#in~n| 1)} assume true; {1790#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:20,539 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1790#(<= |fibonacci_#in~n| 1)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,539 INFO L280 TraceCheckUtils]: 22: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,539 INFO L263 TraceCheckUtils]: 23: Hoare triple {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 21:49:20,539 INFO L280 TraceCheckUtils]: 24: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,540 INFO L280 TraceCheckUtils]: 25: Hoare triple {1699#true} assume ~n < 1; {1699#true} is VALID [2020-07-08 21:49:20,540 INFO L280 TraceCheckUtils]: 26: Hoare triple {1699#true} #res := 0; {1699#true} is VALID [2020-07-08 21:49:20,540 INFO L280 TraceCheckUtils]: 27: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,541 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1699#true} {1783#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,542 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,543 INFO L280 TraceCheckUtils]: 31: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,543 INFO L280 TraceCheckUtils]: 32: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,544 INFO L280 TraceCheckUtils]: 33: Hoare triple {1789#(<= |fibonacci_#in~n| 2)} assume true; {1789#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:20,545 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1789#(<= |fibonacci_#in~n| 2)} {1745#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,546 INFO L280 TraceCheckUtils]: 35: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:20,546 INFO L263 TraceCheckUtils]: 36: Hoare triple {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1699#true} is VALID [2020-07-08 21:49:20,546 INFO L280 TraceCheckUtils]: 37: Hoare triple {1699#true} ~n := #in~n; {1699#true} is VALID [2020-07-08 21:49:20,547 INFO L280 TraceCheckUtils]: 38: Hoare triple {1699#true} assume !(~n < 1); {1699#true} is VALID [2020-07-08 21:49:20,547 INFO L280 TraceCheckUtils]: 39: Hoare triple {1699#true} assume 1 == ~n; {1699#true} is VALID [2020-07-08 21:49:20,547 INFO L280 TraceCheckUtils]: 40: Hoare triple {1699#true} #res := 1; {1699#true} is VALID [2020-07-08 21:49:20,547 INFO L280 TraceCheckUtils]: 41: Hoare triple {1699#true} assume true; {1699#true} is VALID [2020-07-08 21:49:20,549 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1699#true} {1769#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,550 INFO L280 TraceCheckUtils]: 43: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,550 INFO L280 TraceCheckUtils]: 44: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,551 INFO L280 TraceCheckUtils]: 45: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,551 INFO L280 TraceCheckUtils]: 46: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,552 INFO L280 TraceCheckUtils]: 47: Hoare triple {1776#(<= |fibonacci_#in~n| 3)} assume true; {1776#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:20,553 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1776#(<= |fibonacci_#in~n| 3)} {1699#true} #48#return; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 21:49:20,553 INFO L280 TraceCheckUtils]: 49: Hoare triple {1744#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 21:49:20,553 INFO L280 TraceCheckUtils]: 50: Hoare triple {1744#(<= main_~x~0 3)} ~result~0 := #t~ret3; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 21:49:20,554 INFO L280 TraceCheckUtils]: 51: Hoare triple {1744#(<= main_~x~0 3)} havoc #t~ret3; {1744#(<= main_~x~0 3)} is VALID [2020-07-08 21:49:20,554 INFO L280 TraceCheckUtils]: 52: Hoare triple {1744#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {1700#false} is VALID [2020-07-08 21:49:20,554 INFO L280 TraceCheckUtils]: 53: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2020-07-08 21:49:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-08 21:49:20,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042256587] [2020-07-08 21:49:20,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:20,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 21:49:20,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805371249] [2020-07-08 21:49:20,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-08 21:49:20,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:20,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 21:49:20,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:20,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 21:49:20,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 21:49:20,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 21:49:20,612 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 9 states. [2020-07-08 21:49:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:21,115 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-08 21:49:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 21:49:21,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-08 21:49:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 21:49:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-08 21:49:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 21:49:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-08 21:49:21,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-08 21:49:21,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:21,212 INFO L225 Difference]: With dead ends: 88 [2020-07-08 21:49:21,212 INFO L226 Difference]: Without dead ends: 82 [2020-07-08 21:49:21,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-08 21:49:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-08 21:49:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-08 21:49:21,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:21,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 76 states. [2020-07-08 21:49:21,344 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 76 states. [2020-07-08 21:49:21,344 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 76 states. [2020-07-08 21:49:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:21,351 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-08 21:49:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-08 21:49:21,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:21,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:21,353 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 82 states. [2020-07-08 21:49:21,353 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 82 states. [2020-07-08 21:49:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:21,360 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-08 21:49:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-08 21:49:21,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:21,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:21,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:21,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-08 21:49:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-08 21:49:21,367 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-08 21:49:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:21,368 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-08 21:49:21,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 21:49:21,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 102 transitions. [2020-07-08 21:49:21,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-08 21:49:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-08 21:49:21,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:21,523 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:21,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 21:49:21,524 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-08 21:49:21,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:21,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988390184] [2020-07-08 21:49:21,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,582 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2288#true} {2288#true} #44#return; {2288#true} is VALID [2020-07-08 21:49:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,740 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:21,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:21,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:21,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,749 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,751 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:21,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,751 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,752 INFO L280 TraceCheckUtils]: 7: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,762 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,767 INFO L263 TraceCheckUtils]: 11: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:21,767 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:21,767 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:21,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:21,768 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,772 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,773 INFO L280 TraceCheckUtils]: 17: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,774 INFO L280 TraceCheckUtils]: 18: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,775 INFO L280 TraceCheckUtils]: 20: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,775 INFO L280 TraceCheckUtils]: 21: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,776 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:21,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:21,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:21,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:21,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,791 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,793 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:21,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,809 INFO L263 TraceCheckUtils]: 7: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:21,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:21,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:21,819 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,821 INFO L263 TraceCheckUtils]: 15: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:21,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:21,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:21,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:21,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,822 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,823 INFO L280 TraceCheckUtils]: 22: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,824 INFO L280 TraceCheckUtils]: 23: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,825 INFO L280 TraceCheckUtils]: 24: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:21,826 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,827 INFO L280 TraceCheckUtils]: 27: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:21,827 INFO L263 TraceCheckUtils]: 28: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:21,827 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:21,828 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:21,828 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:21,828 INFO L280 TraceCheckUtils]: 32: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:21,828 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:21,829 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,830 INFO L280 TraceCheckUtils]: 35: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,830 INFO L280 TraceCheckUtils]: 36: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,831 INFO L280 TraceCheckUtils]: 37: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,832 INFO L280 TraceCheckUtils]: 38: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,832 INFO L280 TraceCheckUtils]: 39: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:21,833 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 21:49:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,049 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,056 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,057 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,058 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,059 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,059 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,059 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,059 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,060 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,060 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,061 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 21:49:22,061 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,063 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,083 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,086 INFO L263 TraceCheckUtils]: 3: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,087 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,087 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,088 INFO L263 TraceCheckUtils]: 7: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,089 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,089 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,090 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,090 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,090 INFO L263 TraceCheckUtils]: 15: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,091 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,091 INFO L280 TraceCheckUtils]: 17: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,092 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 21:49:22,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,097 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,098 INFO L263 TraceCheckUtils]: 28: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,099 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,099 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,099 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,099 INFO L280 TraceCheckUtils]: 32: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,101 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,101 INFO L280 TraceCheckUtils]: 35: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,102 INFO L280 TraceCheckUtils]: 36: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,102 INFO L280 TraceCheckUtils]: 37: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,103 INFO L280 TraceCheckUtils]: 38: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,103 INFO L280 TraceCheckUtils]: 39: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,105 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:22,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,123 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,125 INFO L263 TraceCheckUtils]: 3: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,125 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,127 INFO L280 TraceCheckUtils]: 6: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,127 INFO L263 TraceCheckUtils]: 7: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,128 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,128 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,128 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,128 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,129 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,130 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,130 INFO L280 TraceCheckUtils]: 18: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,130 INFO L263 TraceCheckUtils]: 19: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,130 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,130 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,131 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,131 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,131 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,137 INFO L280 TraceCheckUtils]: 25: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,137 INFO L280 TraceCheckUtils]: 26: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,137 INFO L280 TraceCheckUtils]: 27: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 21:49:22,137 INFO L280 TraceCheckUtils]: 28: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,137 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,156 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,159 INFO L280 TraceCheckUtils]: 31: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,160 INFO L263 TraceCheckUtils]: 32: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,160 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,160 INFO L280 TraceCheckUtils]: 34: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,161 INFO L280 TraceCheckUtils]: 35: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,161 INFO L280 TraceCheckUtils]: 36: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,161 INFO L280 TraceCheckUtils]: 37: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,163 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,163 INFO L280 TraceCheckUtils]: 39: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,164 INFO L280 TraceCheckUtils]: 40: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,165 INFO L280 TraceCheckUtils]: 41: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,165 INFO L280 TraceCheckUtils]: 42: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,166 INFO L280 TraceCheckUtils]: 43: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,167 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,168 INFO L280 TraceCheckUtils]: 45: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,168 INFO L263 TraceCheckUtils]: 46: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,168 INFO L280 TraceCheckUtils]: 47: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,168 INFO L280 TraceCheckUtils]: 48: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,169 INFO L280 TraceCheckUtils]: 49: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,169 INFO L280 TraceCheckUtils]: 50: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,169 INFO L280 TraceCheckUtils]: 51: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,170 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,171 INFO L280 TraceCheckUtils]: 53: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,171 INFO L280 TraceCheckUtils]: 54: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,172 INFO L280 TraceCheckUtils]: 55: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,172 INFO L280 TraceCheckUtils]: 56: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,173 INFO L280 TraceCheckUtils]: 57: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,174 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 21:49:22,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,179 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,181 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,182 INFO L263 TraceCheckUtils]: 7: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,182 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,183 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,184 INFO L263 TraceCheckUtils]: 11: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,185 INFO L280 TraceCheckUtils]: 14: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,186 INFO L280 TraceCheckUtils]: 15: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,186 INFO L280 TraceCheckUtils]: 16: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,188 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,189 INFO L280 TraceCheckUtils]: 18: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,189 INFO L263 TraceCheckUtils]: 19: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,190 INFO L280 TraceCheckUtils]: 22: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,191 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,192 INFO L280 TraceCheckUtils]: 25: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,192 INFO L280 TraceCheckUtils]: 26: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,194 INFO L280 TraceCheckUtils]: 28: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,194 INFO L280 TraceCheckUtils]: 29: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,196 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,196 INFO L280 TraceCheckUtils]: 31: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,197 INFO L263 TraceCheckUtils]: 32: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,197 INFO L280 TraceCheckUtils]: 33: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,197 INFO L280 TraceCheckUtils]: 34: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,198 INFO L280 TraceCheckUtils]: 35: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,198 INFO L280 TraceCheckUtils]: 36: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,198 INFO L280 TraceCheckUtils]: 37: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,199 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,200 INFO L280 TraceCheckUtils]: 39: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,201 INFO L280 TraceCheckUtils]: 40: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,201 INFO L280 TraceCheckUtils]: 41: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,202 INFO L280 TraceCheckUtils]: 42: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,203 INFO L280 TraceCheckUtils]: 43: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,204 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 21:49:22,205 INFO L280 TraceCheckUtils]: 45: Hoare triple {2445#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 21:49:22,205 INFO L263 TraceCheckUtils]: 46: Hoare triple {2445#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,205 INFO L280 TraceCheckUtils]: 47: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,206 INFO L280 TraceCheckUtils]: 48: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,207 INFO L280 TraceCheckUtils]: 49: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,207 INFO L263 TraceCheckUtils]: 50: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,208 INFO L280 TraceCheckUtils]: 51: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,209 INFO L280 TraceCheckUtils]: 52: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,210 INFO L280 TraceCheckUtils]: 53: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,210 INFO L263 TraceCheckUtils]: 54: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,210 INFO L280 TraceCheckUtils]: 55: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,210 INFO L280 TraceCheckUtils]: 56: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,211 INFO L280 TraceCheckUtils]: 57: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,211 INFO L263 TraceCheckUtils]: 58: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,211 INFO L280 TraceCheckUtils]: 59: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,211 INFO L280 TraceCheckUtils]: 60: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,212 INFO L280 TraceCheckUtils]: 61: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,212 INFO L280 TraceCheckUtils]: 62: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,212 INFO L280 TraceCheckUtils]: 63: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,212 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,213 INFO L280 TraceCheckUtils]: 65: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,213 INFO L263 TraceCheckUtils]: 66: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,213 INFO L280 TraceCheckUtils]: 67: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,213 INFO L280 TraceCheckUtils]: 68: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,213 INFO L280 TraceCheckUtils]: 69: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,214 INFO L280 TraceCheckUtils]: 70: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,214 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,214 INFO L280 TraceCheckUtils]: 72: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,214 INFO L280 TraceCheckUtils]: 73: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,215 INFO L280 TraceCheckUtils]: 74: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 21:49:22,215 INFO L280 TraceCheckUtils]: 75: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,215 INFO L280 TraceCheckUtils]: 76: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,217 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,218 INFO L280 TraceCheckUtils]: 78: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,218 INFO L263 TraceCheckUtils]: 79: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,218 INFO L280 TraceCheckUtils]: 80: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,218 INFO L280 TraceCheckUtils]: 81: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,219 INFO L280 TraceCheckUtils]: 82: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,219 INFO L280 TraceCheckUtils]: 83: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,219 INFO L280 TraceCheckUtils]: 84: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,220 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,221 INFO L280 TraceCheckUtils]: 86: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,222 INFO L280 TraceCheckUtils]: 87: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,222 INFO L280 TraceCheckUtils]: 88: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,223 INFO L280 TraceCheckUtils]: 89: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,224 INFO L280 TraceCheckUtils]: 90: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,225 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,226 INFO L280 TraceCheckUtils]: 92: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,226 INFO L263 TraceCheckUtils]: 93: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,227 INFO L280 TraceCheckUtils]: 94: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,227 INFO L280 TraceCheckUtils]: 95: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,227 INFO L280 TraceCheckUtils]: 96: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,227 INFO L280 TraceCheckUtils]: 97: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,228 INFO L280 TraceCheckUtils]: 98: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,229 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,230 INFO L280 TraceCheckUtils]: 100: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,230 INFO L280 TraceCheckUtils]: 101: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,231 INFO L280 TraceCheckUtils]: 102: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,232 INFO L280 TraceCheckUtils]: 103: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,232 INFO L280 TraceCheckUtils]: 104: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,233 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 21:49:22,234 INFO L280 TraceCheckUtils]: 106: Hoare triple {2289#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2289#false} is VALID [2020-07-08 21:49:22,234 INFO L280 TraceCheckUtils]: 107: Hoare triple {2289#false} #res := #t~ret0 + #t~ret1; {2289#false} is VALID [2020-07-08 21:49:22,234 INFO L280 TraceCheckUtils]: 108: Hoare triple {2289#false} havoc #t~ret0; {2289#false} is VALID [2020-07-08 21:49:22,234 INFO L280 TraceCheckUtils]: 109: Hoare triple {2289#false} havoc #t~ret1; {2289#false} is VALID [2020-07-08 21:49:22,235 INFO L280 TraceCheckUtils]: 110: Hoare triple {2289#false} assume true; {2289#false} is VALID [2020-07-08 21:49:22,235 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2289#false} {2288#true} #48#return; {2289#false} is VALID [2020-07-08 21:49:22,260 INFO L263 TraceCheckUtils]: 0: Hoare triple {2288#true} call ULTIMATE.init(); {2288#true} is VALID [2020-07-08 21:49:22,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,261 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2288#true} {2288#true} #44#return; {2288#true} is VALID [2020-07-08 21:49:22,261 INFO L263 TraceCheckUtils]: 3: Hoare triple {2288#true} call #t~ret4 := main(); {2288#true} is VALID [2020-07-08 21:49:22,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {2288#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {2288#true} ~x~0 := #t~nondet2; {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {2288#true} havoc #t~nondet2; {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L263 TraceCheckUtils]: 7: Hoare triple {2288#true} call #t~ret3 := fibonacci(~x~0); {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,262 INFO L263 TraceCheckUtils]: 11: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,267 INFO L263 TraceCheckUtils]: 15: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,267 INFO L280 TraceCheckUtils]: 16: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,268 INFO L280 TraceCheckUtils]: 17: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,268 INFO L280 TraceCheckUtils]: 18: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,269 INFO L263 TraceCheckUtils]: 19: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,269 INFO L280 TraceCheckUtils]: 20: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,270 INFO L280 TraceCheckUtils]: 21: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,271 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} #res := 1; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= |fibonacci_#in~n| 1)} assume true; {2550#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:22,272 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2550#(<= |fibonacci_#in~n| 1)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,273 INFO L280 TraceCheckUtils]: 26: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,273 INFO L263 TraceCheckUtils]: 27: Hoare triple {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,273 INFO L280 TraceCheckUtils]: 28: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,274 INFO L280 TraceCheckUtils]: 29: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,274 INFO L280 TraceCheckUtils]: 30: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,274 INFO L280 TraceCheckUtils]: 31: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,275 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2288#true} {2543#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,276 INFO L280 TraceCheckUtils]: 33: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,276 INFO L280 TraceCheckUtils]: 34: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,276 INFO L280 TraceCheckUtils]: 35: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,277 INFO L280 TraceCheckUtils]: 36: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,277 INFO L280 TraceCheckUtils]: 37: Hoare triple {2549#(<= |fibonacci_#in~n| 2)} assume true; {2549#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:22,279 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2549#(<= |fibonacci_#in~n| 2)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,279 INFO L280 TraceCheckUtils]: 39: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,280 INFO L263 TraceCheckUtils]: 40: Hoare triple {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,280 INFO L280 TraceCheckUtils]: 41: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,280 INFO L280 TraceCheckUtils]: 42: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,280 INFO L280 TraceCheckUtils]: 43: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,280 INFO L280 TraceCheckUtils]: 44: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,280 INFO L280 TraceCheckUtils]: 45: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,282 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2288#true} {2529#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,282 INFO L280 TraceCheckUtils]: 47: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,283 INFO L280 TraceCheckUtils]: 48: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,283 INFO L280 TraceCheckUtils]: 49: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,284 INFO L280 TraceCheckUtils]: 50: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,284 INFO L280 TraceCheckUtils]: 51: Hoare triple {2536#(<= |fibonacci_#in~n| 3)} assume true; {2536#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:22,285 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2536#(<= |fibonacci_#in~n| 3)} {2288#true} #40#return; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 21:49:22,286 INFO L280 TraceCheckUtils]: 53: Hoare triple {2445#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2445#(<= fibonacci_~n 4)} is VALID [2020-07-08 21:49:22,286 INFO L263 TraceCheckUtils]: 54: Hoare triple {2445#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,287 INFO L280 TraceCheckUtils]: 55: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,287 INFO L280 TraceCheckUtils]: 56: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,288 INFO L280 TraceCheckUtils]: 57: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,288 INFO L263 TraceCheckUtils]: 58: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,288 INFO L280 TraceCheckUtils]: 59: Hoare triple {2288#true} ~n := #in~n; {2505#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,289 INFO L280 TraceCheckUtils]: 60: Hoare triple {2505#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,290 INFO L280 TraceCheckUtils]: 61: Hoare triple {2600#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,290 INFO L263 TraceCheckUtils]: 62: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,290 INFO L280 TraceCheckUtils]: 63: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,290 INFO L280 TraceCheckUtils]: 64: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L280 TraceCheckUtils]: 65: Hoare triple {2288#true} assume !(1 == ~n); {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L263 TraceCheckUtils]: 66: Hoare triple {2288#true} call #t~ret0 := fibonacci(~n - 1); {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L280 TraceCheckUtils]: 67: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L280 TraceCheckUtils]: 68: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L280 TraceCheckUtils]: 69: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,291 INFO L280 TraceCheckUtils]: 70: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L280 TraceCheckUtils]: 71: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2288#true} {2288#true} #40#return; {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L280 TraceCheckUtils]: 73: Hoare triple {2288#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L263 TraceCheckUtils]: 74: Hoare triple {2288#true} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L280 TraceCheckUtils]: 75: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,292 INFO L280 TraceCheckUtils]: 76: Hoare triple {2288#true} assume ~n < 1; {2288#true} is VALID [2020-07-08 21:49:22,293 INFO L280 TraceCheckUtils]: 77: Hoare triple {2288#true} #res := 0; {2288#true} is VALID [2020-07-08 21:49:22,293 INFO L280 TraceCheckUtils]: 78: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,293 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2288#true} {2288#true} #42#return; {2288#true} is VALID [2020-07-08 21:49:22,293 INFO L280 TraceCheckUtils]: 80: Hoare triple {2288#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2288#true} is VALID [2020-07-08 21:49:22,294 INFO L280 TraceCheckUtils]: 81: Hoare triple {2288#true} #res := #t~ret0 + #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,294 INFO L280 TraceCheckUtils]: 82: Hoare triple {2288#true} havoc #t~ret0; {2288#true} is VALID [2020-07-08 21:49:22,294 INFO L280 TraceCheckUtils]: 83: Hoare triple {2288#true} havoc #t~ret1; {2288#true} is VALID [2020-07-08 21:49:22,295 INFO L280 TraceCheckUtils]: 84: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,297 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,298 INFO L280 TraceCheckUtils]: 86: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,298 INFO L263 TraceCheckUtils]: 87: Hoare triple {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,298 INFO L280 TraceCheckUtils]: 88: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,298 INFO L280 TraceCheckUtils]: 89: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,298 INFO L280 TraceCheckUtils]: 90: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,299 INFO L280 TraceCheckUtils]: 91: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,299 INFO L280 TraceCheckUtils]: 92: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,300 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {2288#true} {2601#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,300 INFO L280 TraceCheckUtils]: 94: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,301 INFO L280 TraceCheckUtils]: 95: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,301 INFO L280 TraceCheckUtils]: 96: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,302 INFO L280 TraceCheckUtils]: 97: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,303 INFO L280 TraceCheckUtils]: 98: Hoare triple {2631#(<= 2 |fibonacci_#in~n|)} assume true; {2631#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,304 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2631#(<= 2 |fibonacci_#in~n|)} {2505#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,305 INFO L280 TraceCheckUtils]: 100: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:22,305 INFO L263 TraceCheckUtils]: 101: Hoare triple {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2288#true} is VALID [2020-07-08 21:49:22,305 INFO L280 TraceCheckUtils]: 102: Hoare triple {2288#true} ~n := #in~n; {2288#true} is VALID [2020-07-08 21:49:22,305 INFO L280 TraceCheckUtils]: 103: Hoare triple {2288#true} assume !(~n < 1); {2288#true} is VALID [2020-07-08 21:49:22,305 INFO L280 TraceCheckUtils]: 104: Hoare triple {2288#true} assume 1 == ~n; {2288#true} is VALID [2020-07-08 21:49:22,306 INFO L280 TraceCheckUtils]: 105: Hoare triple {2288#true} #res := 1; {2288#true} is VALID [2020-07-08 21:49:22,306 INFO L280 TraceCheckUtils]: 106: Hoare triple {2288#true} assume true; {2288#true} is VALID [2020-07-08 21:49:22,307 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {2288#true} {2592#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,307 INFO L280 TraceCheckUtils]: 108: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,308 INFO L280 TraceCheckUtils]: 109: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,308 INFO L280 TraceCheckUtils]: 110: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,309 INFO L280 TraceCheckUtils]: 111: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,310 INFO L280 TraceCheckUtils]: 112: Hoare triple {2599#(<= 3 |fibonacci_#in~n|)} assume true; {2599#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:22,311 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2599#(<= 3 |fibonacci_#in~n|)} {2445#(<= fibonacci_~n 4)} #42#return; {2289#false} is VALID [2020-07-08 21:49:22,311 INFO L280 TraceCheckUtils]: 114: Hoare triple {2289#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2289#false} is VALID [2020-07-08 21:49:22,311 INFO L280 TraceCheckUtils]: 115: Hoare triple {2289#false} #res := #t~ret0 + #t~ret1; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L280 TraceCheckUtils]: 116: Hoare triple {2289#false} havoc #t~ret0; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L280 TraceCheckUtils]: 117: Hoare triple {2289#false} havoc #t~ret1; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L280 TraceCheckUtils]: 118: Hoare triple {2289#false} assume true; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {2289#false} {2288#true} #48#return; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L280 TraceCheckUtils]: 120: Hoare triple {2289#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2289#false} is VALID [2020-07-08 21:49:22,312 INFO L280 TraceCheckUtils]: 121: Hoare triple {2289#false} ~result~0 := #t~ret3; {2289#false} is VALID [2020-07-08 21:49:22,313 INFO L280 TraceCheckUtils]: 122: Hoare triple {2289#false} havoc #t~ret3; {2289#false} is VALID [2020-07-08 21:49:22,313 INFO L280 TraceCheckUtils]: 123: Hoare triple {2289#false} assume !(5 != ~x~0 || 3 == ~result~0); {2289#false} is VALID [2020-07-08 21:49:22,313 INFO L280 TraceCheckUtils]: 124: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2020-07-08 21:49:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 123 proven. 170 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2020-07-08 21:49:22,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988390184] [2020-07-08 21:49:22,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:22,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 21:49:22,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345526962] [2020-07-08 21:49:22,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2020-07-08 21:49:22,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:22,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 21:49:22,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:22,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 21:49:22,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 21:49:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-08 21:49:22,433 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 14 states. [2020-07-08 21:49:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:23,291 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2020-07-08 21:49:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 21:49:23,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2020-07-08 21:49:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 21:49:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 21:49:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 21:49:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2020-07-08 21:49:23,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2020-07-08 21:49:23,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:23,445 INFO L225 Difference]: With dead ends: 137 [2020-07-08 21:49:23,445 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 21:49:23,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-07-08 21:49:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 21:49:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-07-08 21:49:23,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:23,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 59 states. [2020-07-08 21:49:23,539 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 59 states. [2020-07-08 21:49:23,539 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 59 states. [2020-07-08 21:49:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:23,544 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-08 21:49:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2020-07-08 21:49:23,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:23,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:23,545 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 68 states. [2020-07-08 21:49:23,545 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 68 states. [2020-07-08 21:49:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:23,552 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-08 21:49:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2020-07-08 21:49:23,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:23,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:23,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:23,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 21:49:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-07-08 21:49:23,557 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 125 [2020-07-08 21:49:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:23,558 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-08 21:49:23,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 21:49:23,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2020-07-08 21:49:23,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2020-07-08 21:49:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-08 21:49:23,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:23,647 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:23,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 21:49:23,647 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-08 21:49:23,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:23,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1929551611] [2020-07-08 21:49:23,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,694 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3185#true} {3185#true} #44#return; {3185#true} is VALID [2020-07-08 21:49:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,844 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,858 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,859 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,862 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,862 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,864 INFO L280 TraceCheckUtils]: 7: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,866 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,867 INFO L263 TraceCheckUtils]: 11: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,867 INFO L280 TraceCheckUtils]: 13: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,869 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,869 INFO L280 TraceCheckUtils]: 17: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,870 INFO L280 TraceCheckUtils]: 18: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,870 INFO L280 TraceCheckUtils]: 19: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,871 INFO L280 TraceCheckUtils]: 20: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,872 INFO L280 TraceCheckUtils]: 21: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,873 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,881 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,883 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,884 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,884 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,884 INFO L263 TraceCheckUtils]: 7: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,887 INFO L280 TraceCheckUtils]: 11: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,887 INFO L280 TraceCheckUtils]: 12: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,888 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,889 INFO L263 TraceCheckUtils]: 15: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,890 INFO L280 TraceCheckUtils]: 17: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,890 INFO L280 TraceCheckUtils]: 19: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,891 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,892 INFO L280 TraceCheckUtils]: 21: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,892 INFO L280 TraceCheckUtils]: 22: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,893 INFO L280 TraceCheckUtils]: 23: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,894 INFO L280 TraceCheckUtils]: 24: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,894 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,896 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,896 INFO L280 TraceCheckUtils]: 27: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,897 INFO L263 TraceCheckUtils]: 28: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,897 INFO L280 TraceCheckUtils]: 29: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,897 INFO L280 TraceCheckUtils]: 30: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,897 INFO L280 TraceCheckUtils]: 31: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,897 INFO L280 TraceCheckUtils]: 32: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,898 INFO L280 TraceCheckUtils]: 33: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,899 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,899 INFO L280 TraceCheckUtils]: 35: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,900 INFO L280 TraceCheckUtils]: 36: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,900 INFO L280 TraceCheckUtils]: 37: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,901 INFO L280 TraceCheckUtils]: 38: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,901 INFO L280 TraceCheckUtils]: 39: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,903 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,916 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 21:49:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:23,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,921 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 21:49:23,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 21:49:23,922 INFO L263 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,923 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,923 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 21:49:23,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L263 TraceCheckUtils]: 11: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L280 TraceCheckUtils]: 15: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,924 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 21:49:23,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 21:49:23,925 INFO L280 TraceCheckUtils]: 19: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 21:49:23,925 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 21:49:23,925 INFO L280 TraceCheckUtils]: 21: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,927 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,929 INFO L263 TraceCheckUtils]: 3: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,930 INFO L263 TraceCheckUtils]: 7: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,933 INFO L263 TraceCheckUtils]: 11: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,934 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,934 INFO L280 TraceCheckUtils]: 13: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,935 INFO L280 TraceCheckUtils]: 14: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,935 INFO L280 TraceCheckUtils]: 15: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,936 INFO L280 TraceCheckUtils]: 16: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,937 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,938 INFO L280 TraceCheckUtils]: 18: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,938 INFO L263 TraceCheckUtils]: 19: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,938 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,939 INFO L280 TraceCheckUtils]: 21: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,939 INFO L280 TraceCheckUtils]: 22: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,939 INFO L280 TraceCheckUtils]: 23: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,940 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,940 INFO L280 TraceCheckUtils]: 25: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,941 INFO L280 TraceCheckUtils]: 26: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,942 INFO L280 TraceCheckUtils]: 27: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,942 INFO L280 TraceCheckUtils]: 28: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,943 INFO L280 TraceCheckUtils]: 29: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,944 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,945 INFO L280 TraceCheckUtils]: 31: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,945 INFO L263 TraceCheckUtils]: 32: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,945 INFO L280 TraceCheckUtils]: 33: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,945 INFO L280 TraceCheckUtils]: 34: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,946 INFO L280 TraceCheckUtils]: 35: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,946 INFO L280 TraceCheckUtils]: 36: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,946 INFO L280 TraceCheckUtils]: 37: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,947 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,948 INFO L280 TraceCheckUtils]: 39: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,948 INFO L280 TraceCheckUtils]: 40: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,949 INFO L280 TraceCheckUtils]: 41: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,949 INFO L280 TraceCheckUtils]: 42: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,950 INFO L280 TraceCheckUtils]: 43: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,951 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,952 INFO L280 TraceCheckUtils]: 45: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,952 INFO L263 TraceCheckUtils]: 46: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,952 INFO L280 TraceCheckUtils]: 47: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,953 INFO L280 TraceCheckUtils]: 48: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,953 INFO L280 TraceCheckUtils]: 49: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 21:49:23,953 INFO L263 TraceCheckUtils]: 50: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,953 INFO L280 TraceCheckUtils]: 51: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,953 INFO L280 TraceCheckUtils]: 52: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,954 INFO L280 TraceCheckUtils]: 53: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,954 INFO L280 TraceCheckUtils]: 54: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,954 INFO L280 TraceCheckUtils]: 55: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,954 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 21:49:23,955 INFO L280 TraceCheckUtils]: 57: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,955 INFO L263 TraceCheckUtils]: 58: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,955 INFO L280 TraceCheckUtils]: 59: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,955 INFO L280 TraceCheckUtils]: 60: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,955 INFO L280 TraceCheckUtils]: 61: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,956 INFO L280 TraceCheckUtils]: 62: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,956 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 21:49:23,956 INFO L280 TraceCheckUtils]: 64: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,956 INFO L280 TraceCheckUtils]: 65: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 21:49:23,956 INFO L280 TraceCheckUtils]: 66: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 21:49:23,957 INFO L280 TraceCheckUtils]: 67: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 21:49:23,957 INFO L280 TraceCheckUtils]: 68: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,958 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,959 INFO L280 TraceCheckUtils]: 70: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,959 INFO L280 TraceCheckUtils]: 71: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,960 INFO L280 TraceCheckUtils]: 72: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,960 INFO L280 TraceCheckUtils]: 73: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,961 INFO L280 TraceCheckUtils]: 74: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume true; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:23,962 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3332#(<= |fibonacci_#in~n| 4)} {3185#true} #48#return; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 21:49:23,967 INFO L263 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2020-07-08 21:49:23,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,967 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3185#true} {3185#true} #44#return; {3185#true} is VALID [2020-07-08 21:49:23,967 INFO L263 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret4 := main(); {3185#true} is VALID [2020-07-08 21:49:23,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {3185#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,968 INFO L280 TraceCheckUtils]: 5: Hoare triple {3185#true} ~x~0 := #t~nondet2; {3185#true} is VALID [2020-07-08 21:49:23,968 INFO L280 TraceCheckUtils]: 6: Hoare triple {3185#true} havoc #t~nondet2; {3185#true} is VALID [2020-07-08 21:49:23,968 INFO L263 TraceCheckUtils]: 7: Hoare triple {3185#true} call #t~ret3 := fibonacci(~x~0); {3185#true} is VALID [2020-07-08 21:49:23,969 INFO L280 TraceCheckUtils]: 8: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,970 INFO L280 TraceCheckUtils]: 9: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,970 INFO L280 TraceCheckUtils]: 10: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,970 INFO L263 TraceCheckUtils]: 11: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,972 INFO L280 TraceCheckUtils]: 13: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,972 INFO L280 TraceCheckUtils]: 14: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,972 INFO L263 TraceCheckUtils]: 15: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,973 INFO L280 TraceCheckUtils]: 16: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,973 INFO L280 TraceCheckUtils]: 17: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,974 INFO L280 TraceCheckUtils]: 18: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,974 INFO L263 TraceCheckUtils]: 19: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,975 INFO L280 TraceCheckUtils]: 20: Hoare triple {3185#true} ~n := #in~n; {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,975 INFO L280 TraceCheckUtils]: 21: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3266#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:23,976 INFO L280 TraceCheckUtils]: 22: Hoare triple {3266#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,976 INFO L280 TraceCheckUtils]: 23: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} #res := 1; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,977 INFO L280 TraceCheckUtils]: 24: Hoare triple {3377#(<= |fibonacci_#in~n| 1)} assume true; {3377#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:23,978 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3377#(<= |fibonacci_#in~n| 1)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,979 INFO L280 TraceCheckUtils]: 26: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,980 INFO L263 TraceCheckUtils]: 27: Hoare triple {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,980 INFO L280 TraceCheckUtils]: 28: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,980 INFO L280 TraceCheckUtils]: 29: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:23,980 INFO L280 TraceCheckUtils]: 30: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:23,980 INFO L280 TraceCheckUtils]: 31: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,982 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3185#true} {3370#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,982 INFO L280 TraceCheckUtils]: 33: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,983 INFO L280 TraceCheckUtils]: 34: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,984 INFO L280 TraceCheckUtils]: 35: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,984 INFO L280 TraceCheckUtils]: 36: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,985 INFO L280 TraceCheckUtils]: 37: Hoare triple {3376#(<= |fibonacci_#in~n| 2)} assume true; {3376#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 21:49:23,987 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3376#(<= |fibonacci_#in~n| 2)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,988 INFO L280 TraceCheckUtils]: 39: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,988 INFO L263 TraceCheckUtils]: 40: Hoare triple {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,988 INFO L280 TraceCheckUtils]: 41: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,988 INFO L280 TraceCheckUtils]: 42: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,989 INFO L280 TraceCheckUtils]: 43: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,989 INFO L280 TraceCheckUtils]: 44: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,989 INFO L280 TraceCheckUtils]: 45: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,990 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3185#true} {3356#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,991 INFO L280 TraceCheckUtils]: 47: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,992 INFO L280 TraceCheckUtils]: 48: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,992 INFO L280 TraceCheckUtils]: 49: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,993 INFO L280 TraceCheckUtils]: 50: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,994 INFO L280 TraceCheckUtils]: 51: Hoare triple {3363#(<= |fibonacci_#in~n| 3)} assume true; {3363#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 21:49:23,995 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3363#(<= |fibonacci_#in~n| 3)} {3266#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,996 INFO L280 TraceCheckUtils]: 53: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:23,996 INFO L263 TraceCheckUtils]: 54: Hoare triple {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,997 INFO L280 TraceCheckUtils]: 55: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,997 INFO L280 TraceCheckUtils]: 56: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,997 INFO L280 TraceCheckUtils]: 57: Hoare triple {3185#true} assume !(1 == ~n); {3185#true} is VALID [2020-07-08 21:49:23,998 INFO L263 TraceCheckUtils]: 58: Hoare triple {3185#true} call #t~ret0 := fibonacci(~n - 1); {3185#true} is VALID [2020-07-08 21:49:23,998 INFO L280 TraceCheckUtils]: 59: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:23,998 INFO L280 TraceCheckUtils]: 60: Hoare triple {3185#true} assume !(~n < 1); {3185#true} is VALID [2020-07-08 21:49:23,998 INFO L280 TraceCheckUtils]: 61: Hoare triple {3185#true} assume 1 == ~n; {3185#true} is VALID [2020-07-08 21:49:23,998 INFO L280 TraceCheckUtils]: 62: Hoare triple {3185#true} #res := 1; {3185#true} is VALID [2020-07-08 21:49:23,999 INFO L280 TraceCheckUtils]: 63: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:23,999 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3185#true} {3185#true} #40#return; {3185#true} is VALID [2020-07-08 21:49:23,999 INFO L280 TraceCheckUtils]: 65: Hoare triple {3185#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:23,999 INFO L263 TraceCheckUtils]: 66: Hoare triple {3185#true} call #t~ret1 := fibonacci(~n - 2); {3185#true} is VALID [2020-07-08 21:49:23,999 INFO L280 TraceCheckUtils]: 67: Hoare triple {3185#true} ~n := #in~n; {3185#true} is VALID [2020-07-08 21:49:24,000 INFO L280 TraceCheckUtils]: 68: Hoare triple {3185#true} assume ~n < 1; {3185#true} is VALID [2020-07-08 21:49:24,000 INFO L280 TraceCheckUtils]: 69: Hoare triple {3185#true} #res := 0; {3185#true} is VALID [2020-07-08 21:49:24,000 INFO L280 TraceCheckUtils]: 70: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:24,000 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3185#true} {3185#true} #42#return; {3185#true} is VALID [2020-07-08 21:49:24,001 INFO L280 TraceCheckUtils]: 72: Hoare triple {3185#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3185#true} is VALID [2020-07-08 21:49:24,001 INFO L280 TraceCheckUtils]: 73: Hoare triple {3185#true} #res := #t~ret0 + #t~ret1; {3185#true} is VALID [2020-07-08 21:49:24,001 INFO L280 TraceCheckUtils]: 74: Hoare triple {3185#true} havoc #t~ret0; {3185#true} is VALID [2020-07-08 21:49:24,001 INFO L280 TraceCheckUtils]: 75: Hoare triple {3185#true} havoc #t~ret1; {3185#true} is VALID [2020-07-08 21:49:24,001 INFO L280 TraceCheckUtils]: 76: Hoare triple {3185#true} assume true; {3185#true} is VALID [2020-07-08 21:49:24,003 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3185#true} {3308#(and (<= fibonacci_~n 4) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,003 INFO L280 TraceCheckUtils]: 78: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,004 INFO L280 TraceCheckUtils]: 79: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,004 INFO L280 TraceCheckUtils]: 80: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,005 INFO L280 TraceCheckUtils]: 81: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,005 INFO L280 TraceCheckUtils]: 82: Hoare triple {3332#(<= |fibonacci_#in~n| 4)} assume true; {3332#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-08 21:49:24,006 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3332#(<= |fibonacci_#in~n| 4)} {3185#true} #48#return; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 21:49:24,007 INFO L280 TraceCheckUtils]: 84: Hoare triple {3265#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 21:49:24,008 INFO L280 TraceCheckUtils]: 85: Hoare triple {3265#(<= main_~x~0 4)} ~result~0 := #t~ret3; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 21:49:24,008 INFO L280 TraceCheckUtils]: 86: Hoare triple {3265#(<= main_~x~0 4)} havoc #t~ret3; {3265#(<= main_~x~0 4)} is VALID [2020-07-08 21:49:24,009 INFO L280 TraceCheckUtils]: 87: Hoare triple {3265#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {3186#false} is VALID [2020-07-08 21:49:24,009 INFO L280 TraceCheckUtils]: 88: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2020-07-08 21:49:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-07-08 21:49:24,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1929551611] [2020-07-08 21:49:24,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:24,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 21:49:24,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213400649] [2020-07-08 21:49:24,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2020-07-08 21:49:24,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:24,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 21:49:24,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:24,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 21:49:24,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 21:49:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-07-08 21:49:24,120 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 11 states. [2020-07-08 21:49:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:24,653 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2020-07-08 21:49:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 21:49:24,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2020-07-08 21:49:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 21:49:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-08 21:49:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 21:49:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2020-07-08 21:49:24,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2020-07-08 21:49:24,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:24,744 INFO L225 Difference]: With dead ends: 71 [2020-07-08 21:49:24,745 INFO L226 Difference]: Without dead ends: 65 [2020-07-08 21:49:24,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-08 21:49:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-08 21:49:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-08 21:49:24,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:24,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-08 21:49:24,857 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-08 21:49:24,857 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-08 21:49:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:24,862 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-08 21:49:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 21:49:24,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:24,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:24,863 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-08 21:49:24,863 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-08 21:49:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:24,868 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-08 21:49:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 21:49:24,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:24,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:24,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:24,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-08 21:49:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2020-07-08 21:49:24,874 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 89 [2020-07-08 21:49:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:24,874 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2020-07-08 21:49:24,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 21:49:24,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 79 transitions. [2020-07-08 21:49:24,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-08 21:49:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-08 21:49:24,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:24,983 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:24,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 21:49:24,983 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-08 21:49:24,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:24,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1823335035] [2020-07-08 21:49:24,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,073 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3795#true} {3795#true} #44#return; {3795#true} is VALID [2020-07-08 21:49:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,226 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,232 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,244 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,247 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,248 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,252 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,253 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,254 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,254 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,255 INFO L280 TraceCheckUtils]: 11: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,255 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,255 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,255 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,256 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,256 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,256 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,257 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,257 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,257 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,257 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,258 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,258 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,258 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,258 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,258 INFO L263 TraceCheckUtils]: 28: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,259 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,259 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,259 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,259 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,259 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,260 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,260 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,260 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,260 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,260 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,261 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,261 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,270 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,271 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,275 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,275 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,278 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,278 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,285 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,285 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,285 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,286 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,286 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,290 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,291 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,295 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,296 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,296 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,297 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,297 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,297 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,301 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,301 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,301 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,301 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,302 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,302 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,302 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,302 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,303 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,303 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,303 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,304 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,305 INFO L263 TraceCheckUtils]: 32: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,305 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,305 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,305 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,305 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,306 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,306 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,306 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,306 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,306 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,307 INFO L280 TraceCheckUtils]: 42: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,307 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,307 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,307 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,308 INFO L263 TraceCheckUtils]: 46: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,308 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,308 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,308 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,308 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,309 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,309 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,309 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,309 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,309 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,310 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,310 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,310 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,310 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,310 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,311 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,311 INFO L280 TraceCheckUtils]: 62: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,311 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,311 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,312 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,312 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,312 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,312 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,312 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,313 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,313 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,313 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,313 INFO L280 TraceCheckUtils]: 73: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,313 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,314 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,538 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,543 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,544 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,545 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,545 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,546 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,547 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,547 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,547 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,549 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,556 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,558 INFO L263 TraceCheckUtils]: 3: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,559 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,559 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,560 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,560 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,560 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,561 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,561 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,561 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,562 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,562 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,562 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,562 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,562 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,563 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,563 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,564 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,565 INFO L280 TraceCheckUtils]: 27: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,565 INFO L263 TraceCheckUtils]: 28: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,565 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,566 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,566 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,566 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,566 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,567 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,568 INFO L280 TraceCheckUtils]: 35: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,569 INFO L280 TraceCheckUtils]: 36: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,569 INFO L280 TraceCheckUtils]: 37: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,570 INFO L280 TraceCheckUtils]: 38: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,570 INFO L280 TraceCheckUtils]: 39: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,572 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,591 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,596 INFO L280 TraceCheckUtils]: 3: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,596 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,598 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,598 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,599 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,599 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,600 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,600 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,600 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,601 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,602 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,607 INFO L263 TraceCheckUtils]: 7: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,607 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,608 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,609 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,609 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,609 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,609 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,610 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,610 INFO L280 TraceCheckUtils]: 23: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,610 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,610 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,610 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,611 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,611 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,611 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,612 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,613 INFO L280 TraceCheckUtils]: 31: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,613 INFO L263 TraceCheckUtils]: 32: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,613 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,613 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,614 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,614 INFO L280 TraceCheckUtils]: 36: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,614 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,615 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,616 INFO L280 TraceCheckUtils]: 39: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,617 INFO L280 TraceCheckUtils]: 41: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,618 INFO L280 TraceCheckUtils]: 42: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,618 INFO L280 TraceCheckUtils]: 43: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,619 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,620 INFO L280 TraceCheckUtils]: 45: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,620 INFO L263 TraceCheckUtils]: 46: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,621 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,622 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,622 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,622 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,622 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,622 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,623 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,623 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,623 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,623 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,623 INFO L280 TraceCheckUtils]: 62: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,624 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,624 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,624 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,624 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,624 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,625 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,626 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,626 INFO L280 TraceCheckUtils]: 70: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,627 INFO L280 TraceCheckUtils]: 71: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,628 INFO L280 TraceCheckUtils]: 72: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,628 INFO L280 TraceCheckUtils]: 73: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,629 INFO L280 TraceCheckUtils]: 74: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,630 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:49:25,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,653 INFO L280 TraceCheckUtils]: 3: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,654 INFO L280 TraceCheckUtils]: 4: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,658 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 21:49:25,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,661 INFO L263 TraceCheckUtils]: 7: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,664 INFO L263 TraceCheckUtils]: 11: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,664 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,664 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,664 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,665 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,665 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,665 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,666 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,666 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,666 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,666 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,667 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,667 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,667 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,667 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,667 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,668 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,668 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,668 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,669 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,670 INFO L280 TraceCheckUtils]: 35: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,670 INFO L263 TraceCheckUtils]: 36: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,670 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,670 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,670 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,671 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,671 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,672 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,673 INFO L280 TraceCheckUtils]: 43: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,673 INFO L280 TraceCheckUtils]: 44: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,674 INFO L280 TraceCheckUtils]: 45: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,674 INFO L280 TraceCheckUtils]: 46: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,675 INFO L280 TraceCheckUtils]: 47: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,676 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,677 INFO L280 TraceCheckUtils]: 49: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,677 INFO L263 TraceCheckUtils]: 50: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,677 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L263 TraceCheckUtils]: 54: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 56: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 58: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,678 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,679 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,680 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,686 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,689 INFO L280 TraceCheckUtils]: 74: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,690 INFO L280 TraceCheckUtils]: 75: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,691 INFO L280 TraceCheckUtils]: 76: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,691 INFO L280 TraceCheckUtils]: 77: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,692 INFO L280 TraceCheckUtils]: 78: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,693 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,694 INFO L280 TraceCheckUtils]: 80: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,694 INFO L263 TraceCheckUtils]: 81: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,694 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,695 INFO L280 TraceCheckUtils]: 83: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,696 INFO L280 TraceCheckUtils]: 84: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,696 INFO L280 TraceCheckUtils]: 85: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,697 INFO L280 TraceCheckUtils]: 86: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,698 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 21:49:25,698 INFO L280 TraceCheckUtils]: 88: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 21:49:25,698 INFO L280 TraceCheckUtils]: 89: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,699 INFO L280 TraceCheckUtils]: 90: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 21:49:25,699 INFO L280 TraceCheckUtils]: 91: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,699 INFO L280 TraceCheckUtils]: 92: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 21:49:25,699 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,708 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,708 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L263 TraceCheckUtils]: 11: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,709 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,710 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,710 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,710 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,710 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,711 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,711 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,711 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,711 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,712 INFO L280 TraceCheckUtils]: 29: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,713 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,713 INFO L280 TraceCheckUtils]: 31: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,713 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,713 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,713 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L263 TraceCheckUtils]: 36: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,714 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,715 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,715 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,715 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,715 INFO L280 TraceCheckUtils]: 44: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,715 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,716 INFO L280 TraceCheckUtils]: 46: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,716 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,716 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,716 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,716 INFO L263 TraceCheckUtils]: 50: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L263 TraceCheckUtils]: 54: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,717 INFO L280 TraceCheckUtils]: 56: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L280 TraceCheckUtils]: 58: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,718 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,719 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,719 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,719 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,719 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,719 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,720 INFO L280 TraceCheckUtils]: 68: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,720 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,720 INFO L280 TraceCheckUtils]: 70: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,720 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,720 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L280 TraceCheckUtils]: 75: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L280 TraceCheckUtils]: 76: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L280 TraceCheckUtils]: 77: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,721 INFO L280 TraceCheckUtils]: 78: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,722 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,723 INFO L280 TraceCheckUtils]: 80: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,723 INFO L263 TraceCheckUtils]: 81: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,723 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,724 INFO L280 TraceCheckUtils]: 83: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,724 INFO L280 TraceCheckUtils]: 84: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,724 INFO L263 TraceCheckUtils]: 85: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,724 INFO L280 TraceCheckUtils]: 86: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,725 INFO L280 TraceCheckUtils]: 87: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,726 INFO L280 TraceCheckUtils]: 88: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,726 INFO L263 TraceCheckUtils]: 89: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,726 INFO L280 TraceCheckUtils]: 90: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,727 INFO L280 TraceCheckUtils]: 91: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,728 INFO L280 TraceCheckUtils]: 92: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,728 INFO L263 TraceCheckUtils]: 93: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,728 INFO L280 TraceCheckUtils]: 94: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,729 INFO L280 TraceCheckUtils]: 95: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,729 INFO L280 TraceCheckUtils]: 96: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,729 INFO L263 TraceCheckUtils]: 97: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,729 INFO L280 TraceCheckUtils]: 98: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,729 INFO L280 TraceCheckUtils]: 99: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L280 TraceCheckUtils]: 100: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L280 TraceCheckUtils]: 101: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L280 TraceCheckUtils]: 102: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L280 TraceCheckUtils]: 104: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,730 INFO L263 TraceCheckUtils]: 105: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L280 TraceCheckUtils]: 106: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L280 TraceCheckUtils]: 107: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L280 TraceCheckUtils]: 108: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L280 TraceCheckUtils]: 109: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,731 INFO L280 TraceCheckUtils]: 111: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,732 INFO L280 TraceCheckUtils]: 112: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,732 INFO L280 TraceCheckUtils]: 113: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,732 INFO L280 TraceCheckUtils]: 114: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,732 INFO L280 TraceCheckUtils]: 115: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,733 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,734 INFO L280 TraceCheckUtils]: 117: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,734 INFO L263 TraceCheckUtils]: 118: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,734 INFO L280 TraceCheckUtils]: 119: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,735 INFO L280 TraceCheckUtils]: 120: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,735 INFO L280 TraceCheckUtils]: 121: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,735 INFO L280 TraceCheckUtils]: 122: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,735 INFO L280 TraceCheckUtils]: 123: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,736 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,737 INFO L280 TraceCheckUtils]: 125: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,737 INFO L280 TraceCheckUtils]: 126: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,738 INFO L280 TraceCheckUtils]: 127: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,738 INFO L280 TraceCheckUtils]: 128: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,739 INFO L280 TraceCheckUtils]: 129: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,740 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,741 INFO L280 TraceCheckUtils]: 131: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,741 INFO L263 TraceCheckUtils]: 132: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,741 INFO L280 TraceCheckUtils]: 133: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L280 TraceCheckUtils]: 134: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L280 TraceCheckUtils]: 135: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L263 TraceCheckUtils]: 136: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L280 TraceCheckUtils]: 137: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L280 TraceCheckUtils]: 138: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,742 INFO L280 TraceCheckUtils]: 139: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,743 INFO L280 TraceCheckUtils]: 140: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,743 INFO L280 TraceCheckUtils]: 141: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,743 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,743 INFO L280 TraceCheckUtils]: 143: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,743 INFO L263 TraceCheckUtils]: 144: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,744 INFO L280 TraceCheckUtils]: 145: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,744 INFO L280 TraceCheckUtils]: 146: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,744 INFO L280 TraceCheckUtils]: 147: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,744 INFO L280 TraceCheckUtils]: 148: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,744 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,745 INFO L280 TraceCheckUtils]: 150: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,745 INFO L280 TraceCheckUtils]: 151: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,745 INFO L280 TraceCheckUtils]: 152: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,745 INFO L280 TraceCheckUtils]: 153: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,745 INFO L280 TraceCheckUtils]: 154: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,746 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,747 INFO L280 TraceCheckUtils]: 156: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,748 INFO L280 TraceCheckUtils]: 157: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,748 INFO L280 TraceCheckUtils]: 158: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,749 INFO L280 TraceCheckUtils]: 159: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,749 INFO L280 TraceCheckUtils]: 160: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,750 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,751 INFO L280 TraceCheckUtils]: 162: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,751 INFO L263 TraceCheckUtils]: 163: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,752 INFO L280 TraceCheckUtils]: 164: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,753 INFO L280 TraceCheckUtils]: 165: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,753 INFO L280 TraceCheckUtils]: 166: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,754 INFO L280 TraceCheckUtils]: 167: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,754 INFO L280 TraceCheckUtils]: 168: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,755 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L280 TraceCheckUtils]: 170: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L280 TraceCheckUtils]: 171: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L280 TraceCheckUtils]: 172: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L280 TraceCheckUtils]: 173: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L280 TraceCheckUtils]: 174: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 21:49:25,756 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,757 INFO L280 TraceCheckUtils]: 176: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,758 INFO L280 TraceCheckUtils]: 177: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,758 INFO L280 TraceCheckUtils]: 178: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,759 INFO L280 TraceCheckUtils]: 179: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,759 INFO L280 TraceCheckUtils]: 180: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume true; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,760 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {4153#(<= 6 |fibonacci_#in~n|)} {3795#true} #48#return; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 21:49:25,779 INFO L263 TraceCheckUtils]: 0: Hoare triple {3795#true} call ULTIMATE.init(); {3795#true} is VALID [2020-07-08 21:49:25,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3795#true} {3795#true} #44#return; {3795#true} is VALID [2020-07-08 21:49:25,780 INFO L263 TraceCheckUtils]: 3: Hoare triple {3795#true} call #t~ret4 := main(); {3795#true} is VALID [2020-07-08 21:49:25,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {3795#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {3795#true} ~x~0 := #t~nondet2; {3795#true} is VALID [2020-07-08 21:49:25,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {3795#true} havoc #t~nondet2; {3795#true} is VALID [2020-07-08 21:49:25,781 INFO L263 TraceCheckUtils]: 7: Hoare triple {3795#true} call #t~ret3 := fibonacci(~x~0); {3795#true} is VALID [2020-07-08 21:49:25,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,783 INFO L280 TraceCheckUtils]: 10: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,783 INFO L263 TraceCheckUtils]: 11: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,783 INFO L280 TraceCheckUtils]: 13: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,783 INFO L263 TraceCheckUtils]: 15: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L280 TraceCheckUtils]: 17: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L263 TraceCheckUtils]: 19: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L280 TraceCheckUtils]: 20: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,784 INFO L280 TraceCheckUtils]: 21: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L280 TraceCheckUtils]: 22: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L263 TraceCheckUtils]: 23: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L280 TraceCheckUtils]: 24: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L280 TraceCheckUtils]: 26: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,785 INFO L280 TraceCheckUtils]: 27: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L280 TraceCheckUtils]: 28: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L280 TraceCheckUtils]: 30: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L263 TraceCheckUtils]: 31: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L280 TraceCheckUtils]: 32: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,786 INFO L280 TraceCheckUtils]: 33: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,787 INFO L280 TraceCheckUtils]: 34: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,787 INFO L280 TraceCheckUtils]: 35: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,787 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,787 INFO L280 TraceCheckUtils]: 37: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,787 INFO L280 TraceCheckUtils]: 38: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L280 TraceCheckUtils]: 39: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L280 TraceCheckUtils]: 40: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L280 TraceCheckUtils]: 41: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L280 TraceCheckUtils]: 43: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,788 INFO L263 TraceCheckUtils]: 44: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L280 TraceCheckUtils]: 45: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L280 TraceCheckUtils]: 46: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L280 TraceCheckUtils]: 47: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L280 TraceCheckUtils]: 48: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L280 TraceCheckUtils]: 49: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,789 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L280 TraceCheckUtils]: 51: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L280 TraceCheckUtils]: 52: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L280 TraceCheckUtils]: 53: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L280 TraceCheckUtils]: 54: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L280 TraceCheckUtils]: 55: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,790 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,791 INFO L280 TraceCheckUtils]: 57: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,791 INFO L263 TraceCheckUtils]: 58: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,791 INFO L280 TraceCheckUtils]: 59: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,791 INFO L280 TraceCheckUtils]: 60: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,791 INFO L280 TraceCheckUtils]: 61: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L263 TraceCheckUtils]: 62: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L280 TraceCheckUtils]: 63: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L280 TraceCheckUtils]: 64: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L280 TraceCheckUtils]: 65: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L280 TraceCheckUtils]: 66: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,792 INFO L280 TraceCheckUtils]: 67: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,793 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,793 INFO L280 TraceCheckUtils]: 69: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L263 TraceCheckUtils]: 70: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L280 TraceCheckUtils]: 71: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L280 TraceCheckUtils]: 72: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L280 TraceCheckUtils]: 73: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L280 TraceCheckUtils]: 74: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,794 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L280 TraceCheckUtils]: 76: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L280 TraceCheckUtils]: 77: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L280 TraceCheckUtils]: 78: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L280 TraceCheckUtils]: 79: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L280 TraceCheckUtils]: 80: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,795 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,796 INFO L280 TraceCheckUtils]: 82: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,796 INFO L280 TraceCheckUtils]: 83: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,796 INFO L280 TraceCheckUtils]: 84: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,796 INFO L280 TraceCheckUtils]: 85: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,796 INFO L280 TraceCheckUtils]: 86: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,797 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3795#true} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,797 INFO L280 TraceCheckUtils]: 88: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,797 INFO L263 TraceCheckUtils]: 89: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,797 INFO L280 TraceCheckUtils]: 90: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,798 INFO L280 TraceCheckUtils]: 91: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,798 INFO L280 TraceCheckUtils]: 92: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,798 INFO L263 TraceCheckUtils]: 93: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,798 INFO L280 TraceCheckUtils]: 94: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,799 INFO L280 TraceCheckUtils]: 95: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,799 INFO L280 TraceCheckUtils]: 96: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,799 INFO L263 TraceCheckUtils]: 97: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,799 INFO L280 TraceCheckUtils]: 98: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,800 INFO L280 TraceCheckUtils]: 99: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,800 INFO L280 TraceCheckUtils]: 100: Hoare triple {4418#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,801 INFO L263 TraceCheckUtils]: 101: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L280 TraceCheckUtils]: 102: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L280 TraceCheckUtils]: 103: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L280 TraceCheckUtils]: 104: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L263 TraceCheckUtils]: 105: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L280 TraceCheckUtils]: 106: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,801 INFO L280 TraceCheckUtils]: 107: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,802 INFO L280 TraceCheckUtils]: 108: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,802 INFO L280 TraceCheckUtils]: 109: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,802 INFO L280 TraceCheckUtils]: 110: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,802 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,802 INFO L280 TraceCheckUtils]: 112: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,803 INFO L263 TraceCheckUtils]: 113: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,803 INFO L280 TraceCheckUtils]: 114: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,803 INFO L280 TraceCheckUtils]: 115: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,803 INFO L280 TraceCheckUtils]: 116: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,804 INFO L280 TraceCheckUtils]: 117: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,804 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,804 INFO L280 TraceCheckUtils]: 119: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,804 INFO L280 TraceCheckUtils]: 120: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,804 INFO L280 TraceCheckUtils]: 121: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,805 INFO L280 TraceCheckUtils]: 122: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,805 INFO L280 TraceCheckUtils]: 123: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,806 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #40#return; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,806 INFO L280 TraceCheckUtils]: 125: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,807 INFO L263 TraceCheckUtils]: 126: Hoare triple {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,807 INFO L280 TraceCheckUtils]: 127: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,807 INFO L280 TraceCheckUtils]: 128: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,807 INFO L280 TraceCheckUtils]: 129: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,807 INFO L280 TraceCheckUtils]: 130: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,807 INFO L280 TraceCheckUtils]: 131: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,808 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {3795#true} {4419#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,809 INFO L280 TraceCheckUtils]: 133: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,810 INFO L280 TraceCheckUtils]: 134: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,810 INFO L280 TraceCheckUtils]: 135: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,811 INFO L280 TraceCheckUtils]: 136: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,811 INFO L280 TraceCheckUtils]: 137: Hoare triple {4449#(<= 2 |fibonacci_#in~n|)} assume true; {4449#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,813 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4449#(<= 2 |fibonacci_#in~n|)} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,814 INFO L280 TraceCheckUtils]: 139: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 21:49:25,814 INFO L263 TraceCheckUtils]: 140: Hoare triple {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,814 INFO L280 TraceCheckUtils]: 141: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,814 INFO L280 TraceCheckUtils]: 142: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,814 INFO L280 TraceCheckUtils]: 143: Hoare triple {3795#true} assume !(1 == ~n); {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L263 TraceCheckUtils]: 144: Hoare triple {3795#true} call #t~ret0 := fibonacci(~n - 1); {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L280 TraceCheckUtils]: 145: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L280 TraceCheckUtils]: 146: Hoare triple {3795#true} assume !(~n < 1); {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L280 TraceCheckUtils]: 147: Hoare triple {3795#true} assume 1 == ~n; {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L280 TraceCheckUtils]: 148: Hoare triple {3795#true} #res := 1; {3795#true} is VALID [2020-07-08 21:49:25,815 INFO L280 TraceCheckUtils]: 149: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,816 INFO L275 TraceCheckUtils]: 150: Hoare quadruple {3795#true} {3795#true} #40#return; {3795#true} is VALID [2020-07-08 21:49:25,816 INFO L280 TraceCheckUtils]: 151: Hoare triple {3795#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,816 INFO L263 TraceCheckUtils]: 152: Hoare triple {3795#true} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,816 INFO L280 TraceCheckUtils]: 153: Hoare triple {3795#true} ~n := #in~n; {3795#true} is VALID [2020-07-08 21:49:25,817 INFO L280 TraceCheckUtils]: 154: Hoare triple {3795#true} assume ~n < 1; {3795#true} is VALID [2020-07-08 21:49:25,817 INFO L280 TraceCheckUtils]: 155: Hoare triple {3795#true} #res := 0; {3795#true} is VALID [2020-07-08 21:49:25,817 INFO L280 TraceCheckUtils]: 156: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,818 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {3795#true} {3795#true} #42#return; {3795#true} is VALID [2020-07-08 21:49:25,818 INFO L280 TraceCheckUtils]: 158: Hoare triple {3795#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3795#true} is VALID [2020-07-08 21:49:25,818 INFO L280 TraceCheckUtils]: 159: Hoare triple {3795#true} #res := #t~ret0 + #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,818 INFO L280 TraceCheckUtils]: 160: Hoare triple {3795#true} havoc #t~ret0; {3795#true} is VALID [2020-07-08 21:49:25,818 INFO L280 TraceCheckUtils]: 161: Hoare triple {3795#true} havoc #t~ret1; {3795#true} is VALID [2020-07-08 21:49:25,819 INFO L280 TraceCheckUtils]: 162: Hoare triple {3795#true} assume true; {3795#true} is VALID [2020-07-08 21:49:25,826 INFO L275 TraceCheckUtils]: 163: Hoare quadruple {3795#true} {4393#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #42#return; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,827 INFO L280 TraceCheckUtils]: 164: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,828 INFO L280 TraceCheckUtils]: 165: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,828 INFO L280 TraceCheckUtils]: 166: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,829 INFO L280 TraceCheckUtils]: 167: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,830 INFO L280 TraceCheckUtils]: 168: Hoare triple {4417#(<= 3 |fibonacci_#in~n|)} assume true; {4417#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,831 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4417#(<= 3 |fibonacci_#in~n|)} {3795#true} #40#return; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,832 INFO L280 TraceCheckUtils]: 170: Hoare triple {4345#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4345#(<= 4 fibonacci_~n)} is VALID [2020-07-08 21:49:25,832 INFO L263 TraceCheckUtils]: 171: Hoare triple {4345#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3795#true} is VALID [2020-07-08 21:49:25,832 INFO L280 TraceCheckUtils]: 172: Hoare triple {3795#true} ~n := #in~n; {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,833 INFO L280 TraceCheckUtils]: 173: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3982#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,834 INFO L280 TraceCheckUtils]: 174: Hoare triple {3982#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,834 INFO L280 TraceCheckUtils]: 175: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} #res := 1; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,835 INFO L280 TraceCheckUtils]: 176: Hoare triple {4472#(<= |fibonacci_#in~n| 1)} assume true; {4472#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 21:49:25,836 INFO L275 TraceCheckUtils]: 177: Hoare quadruple {4472#(<= |fibonacci_#in~n| 1)} {4345#(<= 4 fibonacci_~n)} #42#return; {3796#false} is VALID [2020-07-08 21:49:25,836 INFO L280 TraceCheckUtils]: 178: Hoare triple {3796#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3796#false} is VALID [2020-07-08 21:49:25,837 INFO L280 TraceCheckUtils]: 179: Hoare triple {3796#false} #res := #t~ret0 + #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,837 INFO L280 TraceCheckUtils]: 180: Hoare triple {3796#false} havoc #t~ret0; {3796#false} is VALID [2020-07-08 21:49:25,837 INFO L280 TraceCheckUtils]: 181: Hoare triple {3796#false} havoc #t~ret1; {3796#false} is VALID [2020-07-08 21:49:25,837 INFO L280 TraceCheckUtils]: 182: Hoare triple {3796#false} assume true; {3796#false} is VALID [2020-07-08 21:49:25,838 INFO L275 TraceCheckUtils]: 183: Hoare quadruple {3796#false} {3982#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,838 INFO L280 TraceCheckUtils]: 184: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,839 INFO L280 TraceCheckUtils]: 185: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,840 INFO L280 TraceCheckUtils]: 186: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,841 INFO L280 TraceCheckUtils]: 187: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,841 INFO L280 TraceCheckUtils]: 188: Hoare triple {4153#(<= 6 |fibonacci_#in~n|)} assume true; {4153#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-08 21:49:25,842 INFO L275 TraceCheckUtils]: 189: Hoare quadruple {4153#(<= 6 |fibonacci_#in~n|)} {3795#true} #48#return; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 21:49:25,843 INFO L280 TraceCheckUtils]: 190: Hoare triple {3981#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 21:49:25,844 INFO L280 TraceCheckUtils]: 191: Hoare triple {3981#(<= 6 main_~x~0)} ~result~0 := #t~ret3; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 21:49:25,844 INFO L280 TraceCheckUtils]: 192: Hoare triple {3981#(<= 6 main_~x~0)} havoc #t~ret3; {3981#(<= 6 main_~x~0)} is VALID [2020-07-08 21:49:25,845 INFO L280 TraceCheckUtils]: 193: Hoare triple {3981#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {3796#false} is VALID [2020-07-08 21:49:25,845 INFO L280 TraceCheckUtils]: 194: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2020-07-08 21:49:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 410 proven. 102 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2020-07-08 21:49:25,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1823335035] [2020-07-08 21:49:25,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 21:49:25,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-08 21:49:25,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887726236] [2020-07-08 21:49:25,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2020-07-08 21:49:25,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:49:25,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 21:49:25,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:25,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 21:49:25,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:49:25,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 21:49:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-08 21:49:25,990 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 12 states. [2020-07-08 21:49:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:26,875 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2020-07-08 21:49:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 21:49:26,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2020-07-08 21:49:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:49:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 21:49:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2020-07-08 21:49:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 21:49:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2020-07-08 21:49:26,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2020-07-08 21:49:27,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:27,019 INFO L225 Difference]: With dead ends: 141 [2020-07-08 21:49:27,019 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 21:49:27,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-08 21:49:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 21:49:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-08 21:49:27,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:49:27,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-08 21:49:27,133 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 21:49:27,134 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 21:49:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:27,138 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-07-08 21:49:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 21:49:27,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:27,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:27,139 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 21:49:27,140 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 21:49:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:49:27,142 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-07-08 21:49:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 21:49:27,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:49:27,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:49:27,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:49:27,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:49:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 21:49:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2020-07-08 21:49:27,146 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 195 [2020-07-08 21:49:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:49:27,146 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2020-07-08 21:49:27,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 21:49:27,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 76 transitions. [2020-07-08 21:49:27,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 21:49:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2020-07-08 21:49:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-08 21:49:27,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:49:27,236 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 21:49:27,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 21:49:27,236 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:49:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:49:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-07-08 21:49:27,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:49:27,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307611207] [2020-07-08 21:49:27,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:49:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:49:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:49:27,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 21:49:27,296 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:103) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement$AtomicTraceElementBuilder.build(AtomicTraceElement.java:308) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createATESequence(IcfgProgramExecution.java:227) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 21:49:27,302 INFO L168 Benchmark]: Toolchain (without parser) took 12237.83 ms. Allocated memory was 144.7 MB in the beginning and 370.7 MB in the end (delta: 226.0 MB). Free memory was 101.6 MB in the beginning and 269.8 MB in the end (delta: -168.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,303 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.01 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,304 INFO L168 Benchmark]: Boogie Preprocessor took 118.74 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.7 MB in the beginning and 182.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,305 INFO L168 Benchmark]: RCFGBuilder took 318.39 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 165.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,305 INFO L168 Benchmark]: TraceAbstraction took 11533.29 ms. Allocated memory was 203.4 MB in the beginning and 370.7 MB in the end (delta: 167.2 MB). Free memory was 164.3 MB in the beginning and 269.8 MB in the end (delta: -105.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2020-07-08 21:49:27,308 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 262.01 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.74 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.7 MB in the beginning and 182.2 MB in the end (delta: -90.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.39 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 165.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11533.29 ms. Allocated memory was 203.4 MB in the beginning and 370.7 MB in the end (delta: 167.2 MB). Free memory was 164.3 MB in the beginning and 269.8 MB in the end (delta: -105.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;: de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...