/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:54:55,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:54:55,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:54:55,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:54:55,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:54:55,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:54:55,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:54:55,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:54:55,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:54:55,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:54:55,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:54:55,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:54:55,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:54:55,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:54:55,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:54:55,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:54:55,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:54:55,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:54:55,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:54:55,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:54:55,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:54:55,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:54:55,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:54:55,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:54:55,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:54:55,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:54:55,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:54:55,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:54:55,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:54:55,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:54:55,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:54:55,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:54:55,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:54:55,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:54:55,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:54:55,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:54:55,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:54:55,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:54:55,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:54:55,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:54:55,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:54:55,142 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 15:54:55,172 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:54:55,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:54:55,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:54:55,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:54:55,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:54:55,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:54:55,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:54:55,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:54:55,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:54:55,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:54:55,178 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:54:55,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:54:55,178 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:54:55,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:54:55,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:54:55,179 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:54:55,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:54:55,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:54:55,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:54:55,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:54:55,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:54:55,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:54:55,181 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:54:55,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:54:55,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:54:55,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:54:55,501 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:54:55,502 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:54:55,503 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-08 15:54:55,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6088366/49ec327d0c3c41f6a4f5b95fb2d41638/FLAG07d1a3122 [2020-07-08 15:54:56,030 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:54:56,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-08 15:54:56,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6088366/49ec327d0c3c41f6a4f5b95fb2d41638/FLAG07d1a3122 [2020-07-08 15:54:56,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6088366/49ec327d0c3c41f6a4f5b95fb2d41638 [2020-07-08 15:54:56,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:54:56,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:54:56,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:56,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:54:56,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:54:56,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715cd5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56, skipping insertion in model container [2020-07-08 15:54:56,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:54:56,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:54:56,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:56,584 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:54:56,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:54:56,615 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:54:56,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56 WrapperNode [2020-07-08 15:54:56,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:54:56,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:54:56,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:54:56,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:54:56,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (1/1) ... [2020-07-08 15:54:56,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:54:56,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:54:56,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:54:56,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:54:56,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (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 15:54:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:54:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:54:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-08 15:54:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:54:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:54:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 15:54:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-08 15:54:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:54:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:54:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:54:57,081 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:54:57,082 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 15:54:57,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:57 BoogieIcfgContainer [2020-07-08 15:54:57,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:54:57,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:54:57,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:54:57,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:54:57,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:54:56" (1/3) ... [2020-07-08 15:54:57,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599a2f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:57, skipping insertion in model container [2020-07-08 15:54:57,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:54:56" (2/3) ... [2020-07-08 15:54:57,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599a2f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:54:57, skipping insertion in model container [2020-07-08 15:54:57,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:54:57" (3/3) ... [2020-07-08 15:54:57,096 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-07-08 15:54:57,108 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:54:57,117 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:54:57,132 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:54:57,155 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:54:57,155 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:54:57,155 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:54:57,155 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:54:57,155 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:54:57,155 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:54:57,156 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:54:57,156 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:54:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-08 15:54:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 15:54:57,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:57,185 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 15:54:57,185 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-07-08 15:54:57,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:57,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656973533] [2020-07-08 15:54:57,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:57,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 15:54:57,434 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-08 15:54:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:57,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~n := #in~n; {49#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:57,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {50#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:57,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#(<= |fibonacci_#in~n| 0)} #res := 0; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:57,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:57,526 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} {38#true} #53#return; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:57,527 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2020-07-08 15:54:57,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 15:54:57,528 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-08 15:54:57,529 INFO L263 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret4 := main(); {38#true} is VALID [2020-07-08 15:54:57,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {38#true} is VALID [2020-07-08 15:54:57,530 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} ~x~0 := #t~nondet2; {38#true} is VALID [2020-07-08 15:54:57,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} havoc #t~nondet2; {38#true} is VALID [2020-07-08 15:54:57,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {38#true} is VALID [2020-07-08 15:54:57,531 INFO L263 TraceCheckUtils]: 8: Hoare triple {38#true} call #t~ret3 := fibonacci(~x~0); {38#true} is VALID [2020-07-08 15:54:57,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} ~n := #in~n; {49#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:57,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {50#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:57,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#(<= |fibonacci_#in~n| 0)} #res := 0; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:57,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:57,539 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} {38#true} #53#return; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:57,540 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:57,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#(<= main_~x~0 |main_#t~ret3|)} ~result~0 := #t~ret3; {48#(<= main_~x~0 main_~result~0)} is VALID [2020-07-08 15:54:57,545 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#(<= main_~x~0 main_~result~0)} havoc #t~ret3; {48#(<= main_~x~0 main_~result~0)} is VALID [2020-07-08 15:54:57,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {39#false} is VALID [2020-07-08 15:54:57,547 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-08 15:54:57,550 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 15:54:57,550 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:57,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656973533] [2020-07-08 15:54:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:54:57,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906565109] [2020-07-08 15:54:57,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-08 15:54:57,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:57,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:54:57,617 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 15:54:57,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:54:57,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:54:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:54:57,631 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 7 states. [2020-07-08 15:54:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:58,300 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-08 15:54:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 15:54:58,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-08 15:54:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-08 15:54:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-08 15:54:58,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-08 15:54:58,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:58,437 INFO L225 Difference]: With dead ends: 50 [2020-07-08 15:54:58,437 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 15:54:58,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:54:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 15:54:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-08 15:54:58,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:58,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-08 15:54:58,519 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 15:54:58,519 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 15:54:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:58,526 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-08 15:54:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 15:54:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:58,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:58,528 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 15:54:58,528 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 15:54:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:58,533 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-08 15:54:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 15:54:58,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:58,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:58,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:58,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 15:54:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-08 15:54:58,541 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-07-08 15:54:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:58,541 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-08 15:54:58,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:54:58,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-08 15:54:58,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 15:54:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 15:54:58,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:58,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:54:58,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:54:58,588 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:58,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-07-08 15:54:58,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:58,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487001787] [2020-07-08 15:54:58,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-08 15:54:58,663 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {284#true} {284#true} #49#return; {284#true} is VALID [2020-07-08 15:54:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:58,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#true} ~n := #in~n; {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {297#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:58,719 INFO L280 TraceCheckUtils]: 3: Hoare triple {297#(<= |fibonacci_#in~n| 1)} #res := 1; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:58,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:58,721 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} {284#true} #53#return; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:58,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2020-07-08 15:54:58,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-08 15:54:58,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #49#return; {284#true} is VALID [2020-07-08 15:54:58,723 INFO L263 TraceCheckUtils]: 3: Hoare triple {284#true} call #t~ret4 := main(); {284#true} is VALID [2020-07-08 15:54:58,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {284#true} is VALID [2020-07-08 15:54:58,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {284#true} ~x~0 := #t~nondet2; {284#true} is VALID [2020-07-08 15:54:58,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {284#true} havoc #t~nondet2; {284#true} is VALID [2020-07-08 15:54:58,724 INFO L280 TraceCheckUtils]: 7: Hoare triple {284#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {284#true} is VALID [2020-07-08 15:54:58,724 INFO L263 TraceCheckUtils]: 8: Hoare triple {284#true} call #t~ret3 := fibonacci(~x~0); {284#true} is VALID [2020-07-08 15:54:58,725 INFO L280 TraceCheckUtils]: 9: Hoare triple {284#true} ~n := #in~n; {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:58,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {297#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:54:58,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {297#(<= |fibonacci_#in~n| 1)} #res := 1; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:58,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:54:58,729 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} {284#true} #53#return; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:58,730 INFO L280 TraceCheckUtils]: 15: Hoare triple {294#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 15:54:58,731 INFO L280 TraceCheckUtils]: 16: Hoare triple {294#(<= main_~x~0 |main_#t~ret3|)} ~result~0 := #t~ret3; {295#(<= main_~x~0 main_~result~0)} is VALID [2020-07-08 15:54:58,732 INFO L280 TraceCheckUtils]: 17: Hoare triple {295#(<= main_~x~0 main_~result~0)} havoc #t~ret3; {295#(<= main_~x~0 main_~result~0)} is VALID [2020-07-08 15:54:58,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {285#false} is VALID [2020-07-08 15:54:58,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2020-07-08 15:54:58,735 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 15:54:58,735 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:58,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487001787] [2020-07-08 15:54:58,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:58,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:54:58,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859038913] [2020-07-08 15:54:58,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-08 15:54:58,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:58,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:54:58,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:58,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:54:58,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:58,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:54:58,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:54:58,762 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2020-07-08 15:54:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,227 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 15:54:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 15:54:59,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-08 15:54:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 15:54:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:54:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 15:54:59,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-08 15:54:59,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,290 INFO L225 Difference]: With dead ends: 39 [2020-07-08 15:54:59,290 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 15:54:59,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:54:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 15:54:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-08 15:54:59,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:54:59,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2020-07-08 15:54:59,333 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2020-07-08 15:54:59,333 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2020-07-08 15:54:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,337 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-08 15:54:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-08 15:54:59,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,338 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2020-07-08 15:54:59,339 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2020-07-08 15:54:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,342 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-08 15:54:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-08 15:54:59,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:54:59,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:54:59,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:54:59,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:54:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 15:54:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-08 15:54:59,347 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-07-08 15:54:59,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:54:59,348 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-08 15:54:59,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:54:59,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-08 15:54:59,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 15:54:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 15:54:59,391 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:54:59,392 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, 1] [2020-07-08 15:54:59,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:54:59,392 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:54:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:54:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-07-08 15:54:59,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:54:59,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735783564] [2020-07-08 15:54:59,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:54:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-08 15:54:59,446 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {513#true} {513#true} #49#return; {513#true} is VALID [2020-07-08 15:54:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,512 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-08 15:54:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:54:59,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-08 15:54:59,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-08 15:54:59,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-08 15:54:59,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-08 15:54:59,519 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-08 15:54:59,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-08 15:54:59,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume !(~n < 1); {539#(< 0 fibonacci_~n)} is VALID [2020-07-08 15:54:59,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {539#(< 0 fibonacci_~n)} assume !(1 == ~n); {540#(< 1 fibonacci_~n)} is VALID [2020-07-08 15:54:59,522 INFO L263 TraceCheckUtils]: 3: Hoare triple {540#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {513#true} is VALID [2020-07-08 15:54:59,522 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,525 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-08 15:54:59,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#false} is VALID [2020-07-08 15:54:59,526 INFO L263 TraceCheckUtils]: 10: Hoare triple {514#false} call #t~ret1 := fibonacci(~n - 2); {513#true} is VALID [2020-07-08 15:54:59,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-08 15:54:59,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-08 15:54:59,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-08 15:54:59,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-08 15:54:59,527 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-08 15:54:59,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {514#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {514#false} is VALID [2020-07-08 15:54:59,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {514#false} #res := #t~ret0 + #t~ret1; {514#false} is VALID [2020-07-08 15:54:59,529 INFO L280 TraceCheckUtils]: 18: Hoare triple {514#false} havoc #t~ret1; {514#false} is VALID [2020-07-08 15:54:59,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {514#false} havoc #t~ret0; {514#false} is VALID [2020-07-08 15:54:59,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {514#false} assume true; {514#false} is VALID [2020-07-08 15:54:59,529 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {514#false} {513#true} #53#return; {514#false} is VALID [2020-07-08 15:54:59,530 INFO L263 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2020-07-08 15:54:59,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-08 15:54:59,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {513#true} {513#true} #49#return; {513#true} is VALID [2020-07-08 15:54:59,531 INFO L263 TraceCheckUtils]: 3: Hoare triple {513#true} call #t~ret4 := main(); {513#true} is VALID [2020-07-08 15:54:59,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {513#true} is VALID [2020-07-08 15:54:59,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {513#true} ~x~0 := #t~nondet2; {513#true} is VALID [2020-07-08 15:54:59,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {513#true} havoc #t~nondet2; {513#true} is VALID [2020-07-08 15:54:59,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {513#true} is VALID [2020-07-08 15:54:59,533 INFO L263 TraceCheckUtils]: 8: Hoare triple {513#true} call #t~ret3 := fibonacci(~x~0); {513#true} is VALID [2020-07-08 15:54:59,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-08 15:54:59,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#true} assume !(~n < 1); {539#(< 0 fibonacci_~n)} is VALID [2020-07-08 15:54:59,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(< 0 fibonacci_~n)} assume !(1 == ~n); {540#(< 1 fibonacci_~n)} is VALID [2020-07-08 15:54:59,535 INFO L263 TraceCheckUtils]: 12: Hoare triple {540#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {513#true} is VALID [2020-07-08 15:54:59,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:54:59,536 INFO L280 TraceCheckUtils]: 14: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:54:59,539 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-08 15:54:59,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {514#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#false} is VALID [2020-07-08 15:54:59,539 INFO L263 TraceCheckUtils]: 19: Hoare triple {514#false} call #t~ret1 := fibonacci(~n - 2); {513#true} is VALID [2020-07-08 15:54:59,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-08 15:54:59,540 INFO L280 TraceCheckUtils]: 21: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-08 15:54:59,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-08 15:54:59,541 INFO L280 TraceCheckUtils]: 23: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-08 15:54:59,541 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-08 15:54:59,541 INFO L280 TraceCheckUtils]: 25: Hoare triple {514#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {514#false} is VALID [2020-07-08 15:54:59,541 INFO L280 TraceCheckUtils]: 26: Hoare triple {514#false} #res := #t~ret0 + #t~ret1; {514#false} is VALID [2020-07-08 15:54:59,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {514#false} havoc #t~ret1; {514#false} is VALID [2020-07-08 15:54:59,542 INFO L280 TraceCheckUtils]: 28: Hoare triple {514#false} havoc #t~ret0; {514#false} is VALID [2020-07-08 15:54:59,542 INFO L280 TraceCheckUtils]: 29: Hoare triple {514#false} assume true; {514#false} is VALID [2020-07-08 15:54:59,543 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {514#false} {513#true} #53#return; {514#false} is VALID [2020-07-08 15:54:59,543 INFO L280 TraceCheckUtils]: 31: Hoare triple {514#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {514#false} is VALID [2020-07-08 15:54:59,543 INFO L280 TraceCheckUtils]: 32: Hoare triple {514#false} ~result~0 := #t~ret3; {514#false} is VALID [2020-07-08 15:54:59,543 INFO L280 TraceCheckUtils]: 33: Hoare triple {514#false} havoc #t~ret3; {514#false} is VALID [2020-07-08 15:54:59,544 INFO L280 TraceCheckUtils]: 34: Hoare triple {514#false} assume !(~result~0 >= ~x~0 - 1); {514#false} is VALID [2020-07-08 15:54:59,544 INFO L280 TraceCheckUtils]: 35: Hoare triple {514#false} assume !false; {514#false} is VALID [2020-07-08 15:54:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 15:54:59,546 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:54:59,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735783564] [2020-07-08 15:54:59,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:54:59,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 15:54:59,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808057518] [2020-07-08 15:54:59,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-08 15:54:59,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:54:59,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 15:54:59,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 15:54:59,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:54:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 15:54:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 15:54:59,600 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-07-08 15:54:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:54:59,872 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-07-08 15:54:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 15:54:59,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-08 15:54:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:54:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 15:54:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 15:54:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 15:54:59,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-08 15:54:59,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:54:59,986 INFO L225 Difference]: With dead ends: 55 [2020-07-08 15:54:59,987 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 15:54:59,988 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 15:54:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 15:55:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 15:55:00,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:00,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 15:55:00,054 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 15:55:00,055 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 15:55:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:00,058 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 15:55:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 15:55:00,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:00,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:00,059 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 15:55:00,059 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 15:55:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:00,062 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 15:55:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 15:55:00,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:00,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:00,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:00,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 15:55:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-08 15:55:00,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-07-08 15:55:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:00,068 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-08 15:55:00,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 15:55:00,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-08 15:55:00,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 15:55:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 15:55:00,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:00,116 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, 1] [2020-07-08 15:55:00,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 15:55:00,116 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-07-08 15:55:00,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:00,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767208919] [2020-07-08 15:55:00,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:55:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-08 15:55:00,200 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {805#true} {805#true} #49#return; {805#true} is VALID [2020-07-08 15:55:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,333 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:00,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-08 15:55:00,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-08 15:55:00,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,367 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:00,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,369 INFO L263 TraceCheckUtils]: 3: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {805#true} is VALID [2020-07-08 15:55:00,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,373 INFO L280 TraceCheckUtils]: 8: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,374 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,376 INFO L280 TraceCheckUtils]: 10: Hoare triple {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,376 INFO L263 TraceCheckUtils]: 11: Hoare triple {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {805#true} is VALID [2020-07-08 15:55:00,376 INFO L280 TraceCheckUtils]: 12: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-08 15:55:00,376 INFO L280 TraceCheckUtils]: 13: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-08 15:55:00,377 INFO L280 TraceCheckUtils]: 14: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,378 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,379 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:00,380 INFO L280 TraceCheckUtils]: 17: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:00,381 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,382 INFO L280 TraceCheckUtils]: 19: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,382 INFO L280 TraceCheckUtils]: 20: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,383 INFO L280 TraceCheckUtils]: 21: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,384 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {805#true} #53#return; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:00,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2020-07-08 15:55:00,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-08 15:55:00,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {805#true} {805#true} #49#return; {805#true} is VALID [2020-07-08 15:55:00,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {805#true} call #t~ret4 := main(); {805#true} is VALID [2020-07-08 15:55:00,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {805#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {805#true} is VALID [2020-07-08 15:55:00,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} ~x~0 := #t~nondet2; {805#true} is VALID [2020-07-08 15:55:00,388 INFO L280 TraceCheckUtils]: 6: Hoare triple {805#true} havoc #t~nondet2; {805#true} is VALID [2020-07-08 15:55:00,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {805#true} is VALID [2020-07-08 15:55:00,388 INFO L263 TraceCheckUtils]: 8: Hoare triple {805#true} call #t~ret3 := fibonacci(~x~0); {805#true} is VALID [2020-07-08 15:55:00,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,391 INFO L263 TraceCheckUtils]: 12: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {805#true} is VALID [2020-07-08 15:55:00,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,392 INFO L280 TraceCheckUtils]: 14: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:00,393 INFO L280 TraceCheckUtils]: 15: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:00,393 INFO L280 TraceCheckUtils]: 16: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,394 INFO L280 TraceCheckUtils]: 17: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,396 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,397 INFO L280 TraceCheckUtils]: 19: Hoare triple {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:00,397 INFO L263 TraceCheckUtils]: 20: Hoare triple {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {805#true} is VALID [2020-07-08 15:55:00,397 INFO L280 TraceCheckUtils]: 21: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-08 15:55:00,398 INFO L280 TraceCheckUtils]: 22: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-08 15:55:00,398 INFO L280 TraceCheckUtils]: 23: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,399 INFO L280 TraceCheckUtils]: 24: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:00,401 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:00,401 INFO L280 TraceCheckUtils]: 26: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:00,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,404 INFO L280 TraceCheckUtils]: 29: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,404 INFO L280 TraceCheckUtils]: 30: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:00,405 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {805#true} #53#return; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:00,406 INFO L280 TraceCheckUtils]: 32: Hoare triple {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:00,407 INFO L280 TraceCheckUtils]: 33: Hoare triple {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {833#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:00,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {833#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {833#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:00,408 INFO L280 TraceCheckUtils]: 35: Hoare triple {833#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {806#false} is VALID [2020-07-08 15:55:00,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-08 15:55:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 15:55:00,412 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:00,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767208919] [2020-07-08 15:55:00,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:00,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 15:55:00,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660679783] [2020-07-08 15:55:00,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 15:55:00,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:00,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 15:55:00,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:00,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 15:55:00,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:00,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 15:55:00,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 15:55:00,463 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 11 states. [2020-07-08 15:55:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,190 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-07-08 15:55:01,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 15:55:01,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 15:55:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 15:55:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-08 15:55:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 15:55:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-08 15:55:01,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-08 15:55:01,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:01,281 INFO L225 Difference]: With dead ends: 51 [2020-07-08 15:55:01,281 INFO L226 Difference]: Without dead ends: 45 [2020-07-08 15:55:01,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-07-08 15:55:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-08 15:55:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-08 15:55:01,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:01,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-08 15:55:01,361 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-08 15:55:01,362 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-08 15:55:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,368 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-08 15:55:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-08 15:55:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:01,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:01,370 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-08 15:55:01,370 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-08 15:55:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:01,374 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-08 15:55:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-08 15:55:01,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:01,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:01,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:01,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 15:55:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-07-08 15:55:01,383 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2020-07-08 15:55:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:01,383 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-08 15:55:01,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 15:55:01,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2020-07-08 15:55:01,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-07-08 15:55:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-08 15:55:01,458 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:01,458 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2020-07-08 15:55:01,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 15:55:01,458 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:01,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:01,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1985616609, now seen corresponding path program 1 times [2020-07-08 15:55:01,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:01,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1542548149] [2020-07-08 15:55:01,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:55:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,515 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #49#return; {1145#true} is VALID [2020-07-08 15:55:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} #res := 1; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} assume true; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,586 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1223#(<= |fibonacci_#in~n| 1)} {1145#true} #45#return; {1197#(<= fibonacci_~n 2)} is VALID [2020-07-08 15:55:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,641 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:01,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,667 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,670 INFO L263 TraceCheckUtils]: 3: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-08 15:55:01,670 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,670 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,671 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,671 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,671 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,672 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,672 INFO L280 TraceCheckUtils]: 10: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,673 INFO L263 TraceCheckUtils]: 11: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-08 15:55:01,673 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,673 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,673 INFO L280 TraceCheckUtils]: 14: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,674 INFO L280 TraceCheckUtils]: 15: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,675 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,680 INFO L280 TraceCheckUtils]: 22: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume true; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,681 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1237#(<= 1 |fibonacci_#in~n|)} {1197#(<= fibonacci_~n 2)} #47#return; {1146#false} is VALID [2020-07-08 15:55:01,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-08 15:55:01,683 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-08 15:55:01,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,685 INFO L280 TraceCheckUtils]: 6: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} #res := 1; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,686 INFO L280 TraceCheckUtils]: 8: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} assume true; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,686 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1223#(<= |fibonacci_#in~n| 1)} {1145#true} #45#return; {1197#(<= fibonacci_~n 2)} is VALID [2020-07-08 15:55:01,687 INFO L280 TraceCheckUtils]: 10: Hoare triple {1197#(<= fibonacci_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1197#(<= fibonacci_~n 2)} is VALID [2020-07-08 15:55:01,687 INFO L263 TraceCheckUtils]: 11: Hoare triple {1197#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-08 15:55:01,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,694 INFO L263 TraceCheckUtils]: 15: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-08 15:55:01,694 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,694 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,694 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,695 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,695 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,696 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,696 INFO L280 TraceCheckUtils]: 22: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,697 INFO L263 TraceCheckUtils]: 23: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-08 15:55:01,697 INFO L280 TraceCheckUtils]: 24: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,697 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,697 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,698 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,698 INFO L280 TraceCheckUtils]: 28: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,700 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,701 INFO L280 TraceCheckUtils]: 30: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,702 INFO L280 TraceCheckUtils]: 31: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,703 INFO L280 TraceCheckUtils]: 32: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,704 INFO L280 TraceCheckUtils]: 33: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,706 INFO L280 TraceCheckUtils]: 34: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume true; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,707 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1237#(<= 1 |fibonacci_#in~n|)} {1197#(<= fibonacci_~n 2)} #47#return; {1146#false} is VALID [2020-07-08 15:55:01,707 INFO L280 TraceCheckUtils]: 36: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-08 15:55:01,707 INFO L280 TraceCheckUtils]: 37: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-08 15:55:01,707 INFO L280 TraceCheckUtils]: 38: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-08 15:55:01,707 INFO L280 TraceCheckUtils]: 39: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-08 15:55:01,708 INFO L280 TraceCheckUtils]: 40: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-08 15:55:01,708 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1146#false} {1145#true} #53#return; {1146#false} is VALID [2020-07-08 15:55:01,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-08 15:55:01,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,710 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #49#return; {1145#true} is VALID [2020-07-08 15:55:01,711 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret4 := main(); {1145#true} is VALID [2020-07-08 15:55:01,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1145#true} is VALID [2020-07-08 15:55:01,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} ~x~0 := #t~nondet2; {1145#true} is VALID [2020-07-08 15:55:01,711 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} havoc #t~nondet2; {1145#true} is VALID [2020-07-08 15:55:01,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1145#true} is VALID [2020-07-08 15:55:01,712 INFO L263 TraceCheckUtils]: 8: Hoare triple {1145#true} call #t~ret3 := fibonacci(~x~0); {1145#true} is VALID [2020-07-08 15:55:01,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,712 INFO L280 TraceCheckUtils]: 11: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-08 15:55:01,713 INFO L263 TraceCheckUtils]: 12: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-08 15:55:01,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,715 INFO L280 TraceCheckUtils]: 16: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} #res := 1; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,716 INFO L280 TraceCheckUtils]: 17: Hoare triple {1223#(<= |fibonacci_#in~n| 1)} assume true; {1223#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:01,717 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1223#(<= |fibonacci_#in~n| 1)} {1145#true} #45#return; {1197#(<= fibonacci_~n 2)} is VALID [2020-07-08 15:55:01,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {1197#(<= fibonacci_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1197#(<= fibonacci_~n 2)} is VALID [2020-07-08 15:55:01,718 INFO L263 TraceCheckUtils]: 20: Hoare triple {1197#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-08 15:55:01,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {1145#true} ~n := #in~n; {1222#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,720 INFO L280 TraceCheckUtils]: 22: Hoare triple {1222#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,721 INFO L280 TraceCheckUtils]: 23: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,721 INFO L263 TraceCheckUtils]: 24: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-08 15:55:01,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,722 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,722 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,722 INFO L280 TraceCheckUtils]: 28: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,724 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,726 INFO L280 TraceCheckUtils]: 31: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:01,726 INFO L263 TraceCheckUtils]: 32: Hoare triple {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-08 15:55:01,726 INFO L280 TraceCheckUtils]: 33: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-08 15:55:01,727 INFO L280 TraceCheckUtils]: 34: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-08 15:55:01,727 INFO L280 TraceCheckUtils]: 35: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-08 15:55:01,727 INFO L280 TraceCheckUtils]: 36: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-08 15:55:01,727 INFO L280 TraceCheckUtils]: 37: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-08 15:55:01,729 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1145#true} {1224#(and (<= 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,729 INFO L280 TraceCheckUtils]: 39: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,732 INFO L280 TraceCheckUtils]: 40: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,734 INFO L280 TraceCheckUtils]: 41: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,737 INFO L280 TraceCheckUtils]: 42: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,737 INFO L280 TraceCheckUtils]: 43: Hoare triple {1237#(<= 1 |fibonacci_#in~n|)} assume true; {1237#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:01,739 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1237#(<= 1 |fibonacci_#in~n|)} {1197#(<= fibonacci_~n 2)} #47#return; {1146#false} is VALID [2020-07-08 15:55:01,739 INFO L280 TraceCheckUtils]: 45: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-08 15:55:01,740 INFO L280 TraceCheckUtils]: 46: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-08 15:55:01,740 INFO L280 TraceCheckUtils]: 47: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-08 15:55:01,740 INFO L280 TraceCheckUtils]: 48: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-08 15:55:01,741 INFO L280 TraceCheckUtils]: 49: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-08 15:55:01,741 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1146#false} {1145#true} #53#return; {1146#false} is VALID [2020-07-08 15:55:01,741 INFO L280 TraceCheckUtils]: 51: Hoare triple {1146#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1146#false} is VALID [2020-07-08 15:55:01,741 INFO L280 TraceCheckUtils]: 52: Hoare triple {1146#false} ~result~0 := #t~ret3; {1146#false} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 53: Hoare triple {1146#false} havoc #t~ret3; {1146#false} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 54: Hoare triple {1146#false} assume !(~result~0 >= ~x~0 - 1); {1146#false} is VALID [2020-07-08 15:55:01,742 INFO L280 TraceCheckUtils]: 55: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-08 15:55:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-08 15:55:01,748 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:01,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1542548149] [2020-07-08 15:55:01,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:01,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 15:55:01,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376874379] [2020-07-08 15:55:01,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-08 15:55:01,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:01,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 15:55:01,810 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 15:55:01,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 15:55:01,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 15:55:01,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 15:55:01,812 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2020-07-08 15:55:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,197 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2020-07-08 15:55:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 15:55:02,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-08 15:55:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:55:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-08 15:55:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 15:55:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-08 15:55:02,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-08 15:55:02,313 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 15:55:02,316 INFO L225 Difference]: With dead ends: 76 [2020-07-08 15:55:02,316 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 15:55:02,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:55:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 15:55:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-08 15:55:02,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:02,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:02,404 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:02,404 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,407 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 15:55:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 15:55:02,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:02,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:02,408 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:02,408 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:02,412 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-08 15:55:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 15:55:02,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:02,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:02,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:02,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 15:55:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-08 15:55:02,416 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 56 [2020-07-08 15:55:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:02,417 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-08 15:55:02,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 15:55:02,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2020-07-08 15:55:02,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-08 15:55:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-08 15:55:02,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:02,488 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, 1] [2020-07-08 15:55:02,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 15:55:02,489 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-07-08 15:55:02,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:02,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867517151] [2020-07-08 15:55:02,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:55:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,546 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1572#true} {1572#true} #49#return; {1572#true} is VALID [2020-07-08 15:55:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#true} assume 1 == ~n; {1572#true} is VALID [2020-07-08 15:55:02,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {1572#true} #res := 1; {1572#true} is VALID [2020-07-08 15:55:02,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,714 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#true} assume ~n < 1; {1572#true} is VALID [2020-07-08 15:55:02,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#true} #res := 0; {1572#true} is VALID [2020-07-08 15:55:02,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,722 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,725 INFO L263 TraceCheckUtils]: 3: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1572#true} is VALID [2020-07-08 15:55:02,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#true} assume 1 == ~n; {1572#true} is VALID [2020-07-08 15:55:02,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {1572#true} #res := 1; {1572#true} is VALID [2020-07-08 15:55:02,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,727 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,728 INFO L263 TraceCheckUtils]: 11: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1572#true} is VALID [2020-07-08 15:55:02,728 INFO L280 TraceCheckUtils]: 12: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {1572#true} assume ~n < 1; {1572#true} is VALID [2020-07-08 15:55:02,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {1572#true} #res := 0; {1572#true} is VALID [2020-07-08 15:55:02,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,730 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,731 INFO L280 TraceCheckUtils]: 18: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,732 INFO L280 TraceCheckUtils]: 19: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,732 INFO L280 TraceCheckUtils]: 20: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume true; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,734 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1659#(<= 2 |fibonacci_#in~n|)} {1572#true} #45#return; {1639#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:02,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} #res := 0; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} assume true; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,766 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1660#(<= |fibonacci_#in~n| 0)} {1639#(<= 3 fibonacci_~n)} #47#return; {1573#false} is VALID [2020-07-08 15:55:02,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {1572#true} assume !(1 == ~n); {1572#true} is VALID [2020-07-08 15:55:02,767 INFO L263 TraceCheckUtils]: 3: Hoare triple {1572#true} call #t~ret0 := fibonacci(~n - 1); {1572#true} is VALID [2020-07-08 15:55:02,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,770 INFO L263 TraceCheckUtils]: 7: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1572#true} is VALID [2020-07-08 15:55:02,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,771 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#true} assume 1 == ~n; {1572#true} is VALID [2020-07-08 15:55:02,771 INFO L280 TraceCheckUtils]: 11: Hoare triple {1572#true} #res := 1; {1572#true} is VALID [2020-07-08 15:55:02,772 INFO L280 TraceCheckUtils]: 12: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,772 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,773 INFO L280 TraceCheckUtils]: 14: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,773 INFO L263 TraceCheckUtils]: 15: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1572#true} is VALID [2020-07-08 15:55:02,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,773 INFO L280 TraceCheckUtils]: 17: Hoare triple {1572#true} assume ~n < 1; {1572#true} is VALID [2020-07-08 15:55:02,774 INFO L280 TraceCheckUtils]: 18: Hoare triple {1572#true} #res := 0; {1572#true} is VALID [2020-07-08 15:55:02,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,775 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,775 INFO L280 TraceCheckUtils]: 21: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,776 INFO L280 TraceCheckUtils]: 23: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,776 INFO L280 TraceCheckUtils]: 24: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,777 INFO L280 TraceCheckUtils]: 25: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume true; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,778 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1659#(<= 2 |fibonacci_#in~n|)} {1572#true} #45#return; {1639#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:02,778 INFO L280 TraceCheckUtils]: 27: Hoare triple {1639#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1639#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:02,778 INFO L263 TraceCheckUtils]: 28: Hoare triple {1639#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1572#true} is VALID [2020-07-08 15:55:02,779 INFO L280 TraceCheckUtils]: 29: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,779 INFO L280 TraceCheckUtils]: 30: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,780 INFO L280 TraceCheckUtils]: 31: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} #res := 0; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,780 INFO L280 TraceCheckUtils]: 32: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} assume true; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,781 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1660#(<= |fibonacci_#in~n| 0)} {1639#(<= 3 fibonacci_~n)} #47#return; {1573#false} is VALID [2020-07-08 15:55:02,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {1573#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1573#false} is VALID [2020-07-08 15:55:02,781 INFO L280 TraceCheckUtils]: 35: Hoare triple {1573#false} #res := #t~ret0 + #t~ret1; {1573#false} is VALID [2020-07-08 15:55:02,781 INFO L280 TraceCheckUtils]: 36: Hoare triple {1573#false} havoc #t~ret1; {1573#false} is VALID [2020-07-08 15:55:02,782 INFO L280 TraceCheckUtils]: 37: Hoare triple {1573#false} havoc #t~ret0; {1573#false} is VALID [2020-07-08 15:55:02,782 INFO L280 TraceCheckUtils]: 38: Hoare triple {1573#false} assume true; {1573#false} is VALID [2020-07-08 15:55:02,782 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1573#false} {1572#true} #53#return; {1573#false} is VALID [2020-07-08 15:55:02,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {1572#true} call ULTIMATE.init(); {1572#true} is VALID [2020-07-08 15:55:02,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,784 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1572#true} {1572#true} #49#return; {1572#true} is VALID [2020-07-08 15:55:02,784 INFO L263 TraceCheckUtils]: 3: Hoare triple {1572#true} call #t~ret4 := main(); {1572#true} is VALID [2020-07-08 15:55:02,785 INFO L280 TraceCheckUtils]: 4: Hoare triple {1572#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1572#true} is VALID [2020-07-08 15:55:02,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {1572#true} ~x~0 := #t~nondet2; {1572#true} is VALID [2020-07-08 15:55:02,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#true} havoc #t~nondet2; {1572#true} is VALID [2020-07-08 15:55:02,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {1572#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1572#true} is VALID [2020-07-08 15:55:02,785 INFO L263 TraceCheckUtils]: 8: Hoare triple {1572#true} call #t~ret3 := fibonacci(~x~0); {1572#true} is VALID [2020-07-08 15:55:02,786 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,786 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {1572#true} assume !(1 == ~n); {1572#true} is VALID [2020-07-08 15:55:02,786 INFO L263 TraceCheckUtils]: 12: Hoare triple {1572#true} call #t~ret0 := fibonacci(~n - 1); {1572#true} is VALID [2020-07-08 15:55:02,787 INFO L280 TraceCheckUtils]: 13: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,791 INFO L280 TraceCheckUtils]: 15: Hoare triple {1646#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,792 INFO L263 TraceCheckUtils]: 16: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {1572#true} is VALID [2020-07-08 15:55:02,792 INFO L280 TraceCheckUtils]: 17: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,792 INFO L280 TraceCheckUtils]: 18: Hoare triple {1572#true} assume !(~n < 1); {1572#true} is VALID [2020-07-08 15:55:02,792 INFO L280 TraceCheckUtils]: 19: Hoare triple {1572#true} assume 1 == ~n; {1572#true} is VALID [2020-07-08 15:55:02,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {1572#true} #res := 1; {1572#true} is VALID [2020-07-08 15:55:02,793 INFO L280 TraceCheckUtils]: 21: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,794 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:02,795 INFO L263 TraceCheckUtils]: 24: Hoare triple {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1572#true} is VALID [2020-07-08 15:55:02,795 INFO L280 TraceCheckUtils]: 25: Hoare triple {1572#true} ~n := #in~n; {1572#true} is VALID [2020-07-08 15:55:02,795 INFO L280 TraceCheckUtils]: 26: Hoare triple {1572#true} assume ~n < 1; {1572#true} is VALID [2020-07-08 15:55:02,795 INFO L280 TraceCheckUtils]: 27: Hoare triple {1572#true} #res := 0; {1572#true} is VALID [2020-07-08 15:55:02,795 INFO L280 TraceCheckUtils]: 28: Hoare triple {1572#true} assume true; {1572#true} is VALID [2020-07-08 15:55:02,797 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1572#true} {1647#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,797 INFO L280 TraceCheckUtils]: 30: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,798 INFO L280 TraceCheckUtils]: 31: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,798 INFO L280 TraceCheckUtils]: 32: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,799 INFO L280 TraceCheckUtils]: 33: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,799 INFO L280 TraceCheckUtils]: 34: Hoare triple {1659#(<= 2 |fibonacci_#in~n|)} assume true; {1659#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,801 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1659#(<= 2 |fibonacci_#in~n|)} {1572#true} #45#return; {1639#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:02,801 INFO L280 TraceCheckUtils]: 36: Hoare triple {1639#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1639#(<= 3 fibonacci_~n)} is VALID [2020-07-08 15:55:02,802 INFO L263 TraceCheckUtils]: 37: Hoare triple {1639#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1572#true} is VALID [2020-07-08 15:55:02,804 INFO L280 TraceCheckUtils]: 38: Hoare triple {1572#true} ~n := #in~n; {1645#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:02,806 INFO L280 TraceCheckUtils]: 39: Hoare triple {1645#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,808 INFO L280 TraceCheckUtils]: 40: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} #res := 0; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,809 INFO L280 TraceCheckUtils]: 41: Hoare triple {1660#(<= |fibonacci_#in~n| 0)} assume true; {1660#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 15:55:02,811 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1660#(<= |fibonacci_#in~n| 0)} {1639#(<= 3 fibonacci_~n)} #47#return; {1573#false} is VALID [2020-07-08 15:55:02,811 INFO L280 TraceCheckUtils]: 43: Hoare triple {1573#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1573#false} is VALID [2020-07-08 15:55:02,812 INFO L280 TraceCheckUtils]: 44: Hoare triple {1573#false} #res := #t~ret0 + #t~ret1; {1573#false} is VALID [2020-07-08 15:55:02,812 INFO L280 TraceCheckUtils]: 45: Hoare triple {1573#false} havoc #t~ret1; {1573#false} is VALID [2020-07-08 15:55:02,812 INFO L280 TraceCheckUtils]: 46: Hoare triple {1573#false} havoc #t~ret0; {1573#false} is VALID [2020-07-08 15:55:02,812 INFO L280 TraceCheckUtils]: 47: Hoare triple {1573#false} assume true; {1573#false} is VALID [2020-07-08 15:55:02,812 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1573#false} {1572#true} #53#return; {1573#false} is VALID [2020-07-08 15:55:02,813 INFO L280 TraceCheckUtils]: 49: Hoare triple {1573#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1573#false} is VALID [2020-07-08 15:55:02,813 INFO L280 TraceCheckUtils]: 50: Hoare triple {1573#false} ~result~0 := #t~ret3; {1573#false} is VALID [2020-07-08 15:55:02,813 INFO L280 TraceCheckUtils]: 51: Hoare triple {1573#false} havoc #t~ret3; {1573#false} is VALID [2020-07-08 15:55:02,813 INFO L280 TraceCheckUtils]: 52: Hoare triple {1573#false} assume !(~result~0 >= ~x~0 - 1); {1573#false} is VALID [2020-07-08 15:55:02,813 INFO L280 TraceCheckUtils]: 53: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2020-07-08 15:55:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-08 15:55:02,816 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:02,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867517151] [2020-07-08 15:55:02,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:02,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 15:55:02,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528493120] [2020-07-08 15:55:02,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-08 15:55:02,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:02,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 15:55:02,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:02,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 15:55:02,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 15:55:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 15:55:02,883 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2020-07-08 15:55:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,268 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2020-07-08 15:55:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 15:55:03,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-08 15:55:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 15:55:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-08 15:55:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 15:55:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-08 15:55:03,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-08 15:55:03,359 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 15:55:03,361 INFO L225 Difference]: With dead ends: 77 [2020-07-08 15:55:03,362 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 15:55:03,363 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 15:55:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 15:55:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-08 15:55:03,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:03,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:03,436 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:03,436 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,439 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 15:55:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 15:55:03,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:03,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:03,440 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:03,440 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-08 15:55:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:03,443 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 15:55:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 15:55:03,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:03,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:03,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:03,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 15:55:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-07-08 15:55:03,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 54 [2020-07-08 15:55:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:03,448 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-07-08 15:55:03,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 15:55:03,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2020-07-08 15:55:03,515 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 15:55:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 15:55:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 15:55:03,516 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:03,517 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, 1] [2020-07-08 15:55:03,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 15:55:03,517 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-07-08 15:55:03,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:03,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912884951] [2020-07-08 15:55:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:55:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} assume true; {1994#true} is VALID [2020-07-08 15:55:03,588 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1994#true} {1994#true} #49#return; {1994#true} is VALID [2020-07-08 15:55:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2086#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:03,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {2086#(<= |fibonacci_#in~n| 1)} #res := 1; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,792 INFO L280 TraceCheckUtils]: 4: Hoare triple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,794 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {1994#true} assume ~n < 1; {1994#true} is VALID [2020-07-08 15:55:03,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {1994#true} #res := 0; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {2088#(<= 0 |fibonacci_#res|)} assume true; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,829 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2088#(<= 0 |fibonacci_#res|)} {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,831 INFO L263 TraceCheckUtils]: 3: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1994#true} is VALID [2020-07-08 15:55:03,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2086#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:03,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {2086#(<= |fibonacci_#in~n| 1)} #res := 1; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,836 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,837 INFO L280 TraceCheckUtils]: 10: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,838 INFO L263 TraceCheckUtils]: 11: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1994#true} is VALID [2020-07-08 15:55:03,838 INFO L280 TraceCheckUtils]: 12: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,838 INFO L280 TraceCheckUtils]: 13: Hoare triple {1994#true} assume ~n < 1; {1994#true} is VALID [2020-07-08 15:55:03,841 INFO L280 TraceCheckUtils]: 14: Hoare triple {1994#true} #res := 0; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,841 INFO L280 TraceCheckUtils]: 15: Hoare triple {2088#(<= 0 |fibonacci_#res|)} assume true; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,843 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2088#(<= 0 |fibonacci_#res|)} {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,844 INFO L280 TraceCheckUtils]: 17: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,845 INFO L280 TraceCheckUtils]: 18: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,846 INFO L280 TraceCheckUtils]: 20: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,847 INFO L280 TraceCheckUtils]: 21: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,848 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:03,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {1994#true} assume !(~n < 1); {1994#true} is VALID [2020-07-08 15:55:03,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {1994#true} assume 1 == ~n; {1994#true} is VALID [2020-07-08 15:55:03,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {1994#true} #res := 1; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {2089#(<= 1 |fibonacci_#res|)} assume true; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,887 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2089#(<= 1 |fibonacci_#res|)} {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,890 INFO L263 TraceCheckUtils]: 3: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1994#true} is VALID [2020-07-08 15:55:03,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,892 INFO L263 TraceCheckUtils]: 7: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1994#true} is VALID [2020-07-08 15:55:03,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,900 INFO L280 TraceCheckUtils]: 10: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2086#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:03,901 INFO L280 TraceCheckUtils]: 11: Hoare triple {2086#(<= |fibonacci_#in~n| 1)} #res := 1; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,902 INFO L280 TraceCheckUtils]: 12: Hoare triple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,903 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,904 INFO L280 TraceCheckUtils]: 14: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,904 INFO L263 TraceCheckUtils]: 15: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1994#true} is VALID [2020-07-08 15:55:03,904 INFO L280 TraceCheckUtils]: 16: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,904 INFO L280 TraceCheckUtils]: 17: Hoare triple {1994#true} assume ~n < 1; {1994#true} is VALID [2020-07-08 15:55:03,905 INFO L280 TraceCheckUtils]: 18: Hoare triple {1994#true} #res := 0; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,906 INFO L280 TraceCheckUtils]: 19: Hoare triple {2088#(<= 0 |fibonacci_#res|)} assume true; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,907 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2088#(<= 0 |fibonacci_#res|)} {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,908 INFO L280 TraceCheckUtils]: 21: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,909 INFO L280 TraceCheckUtils]: 23: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,910 INFO L280 TraceCheckUtils]: 24: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,911 INFO L280 TraceCheckUtils]: 25: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,912 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,913 INFO L280 TraceCheckUtils]: 27: Hoare triple {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,913 INFO L263 TraceCheckUtils]: 28: Hoare triple {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1994#true} is VALID [2020-07-08 15:55:03,913 INFO L280 TraceCheckUtils]: 29: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,913 INFO L280 TraceCheckUtils]: 30: Hoare triple {1994#true} assume !(~n < 1); {1994#true} is VALID [2020-07-08 15:55:03,914 INFO L280 TraceCheckUtils]: 31: Hoare triple {1994#true} assume 1 == ~n; {1994#true} is VALID [2020-07-08 15:55:03,914 INFO L280 TraceCheckUtils]: 32: Hoare triple {1994#true} #res := 1; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,915 INFO L280 TraceCheckUtils]: 33: Hoare triple {2089#(<= 1 |fibonacci_#res|)} assume true; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,916 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2089#(<= 1 |fibonacci_#res|)} {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,917 INFO L280 TraceCheckUtils]: 35: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,918 INFO L280 TraceCheckUtils]: 36: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,919 INFO L280 TraceCheckUtils]: 37: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,920 INFO L280 TraceCheckUtils]: 38: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,920 INFO L280 TraceCheckUtils]: 39: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,921 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1994#true} #53#return; {2039#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:03,924 INFO L263 TraceCheckUtils]: 0: Hoare triple {1994#true} call ULTIMATE.init(); {1994#true} is VALID [2020-07-08 15:55:03,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {1994#true} assume true; {1994#true} is VALID [2020-07-08 15:55:03,924 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1994#true} {1994#true} #49#return; {1994#true} is VALID [2020-07-08 15:55:03,924 INFO L263 TraceCheckUtils]: 3: Hoare triple {1994#true} call #t~ret4 := main(); {1994#true} is VALID [2020-07-08 15:55:03,925 INFO L280 TraceCheckUtils]: 4: Hoare triple {1994#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1994#true} is VALID [2020-07-08 15:55:03,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {1994#true} ~x~0 := #t~nondet2; {1994#true} is VALID [2020-07-08 15:55:03,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {1994#true} havoc #t~nondet2; {1994#true} is VALID [2020-07-08 15:55:03,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {1994#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1994#true} is VALID [2020-07-08 15:55:03,925 INFO L263 TraceCheckUtils]: 8: Hoare triple {1994#true} call #t~ret3 := fibonacci(~x~0); {1994#true} is VALID [2020-07-08 15:55:03,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,927 INFO L263 TraceCheckUtils]: 12: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1994#true} is VALID [2020-07-08 15:55:03,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,929 INFO L263 TraceCheckUtils]: 16: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1994#true} is VALID [2020-07-08 15:55:03,929 INFO L280 TraceCheckUtils]: 17: Hoare triple {1994#true} ~n := #in~n; {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,929 INFO L280 TraceCheckUtils]: 18: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2041#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:03,930 INFO L280 TraceCheckUtils]: 19: Hoare triple {2041#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2086#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:03,930 INFO L280 TraceCheckUtils]: 20: Hoare triple {2086#(<= |fibonacci_#in~n| 1)} #res := 1; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,931 INFO L280 TraceCheckUtils]: 21: Hoare triple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,932 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2087#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,942 INFO L280 TraceCheckUtils]: 23: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,942 INFO L263 TraceCheckUtils]: 24: Hoare triple {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1994#true} is VALID [2020-07-08 15:55:03,942 INFO L280 TraceCheckUtils]: 25: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {1994#true} assume ~n < 1; {1994#true} is VALID [2020-07-08 15:55:03,943 INFO L280 TraceCheckUtils]: 27: Hoare triple {1994#true} #res := 0; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,944 INFO L280 TraceCheckUtils]: 28: Hoare triple {2088#(<= 0 |fibonacci_#res|)} assume true; {2088#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,945 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2088#(<= 0 |fibonacci_#res|)} {2080#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,946 INFO L280 TraceCheckUtils]: 30: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,946 INFO L280 TraceCheckUtils]: 31: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,947 INFO L280 TraceCheckUtils]: 32: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,947 INFO L280 TraceCheckUtils]: 33: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,948 INFO L280 TraceCheckUtils]: 34: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,949 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2041#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,950 INFO L280 TraceCheckUtils]: 36: Hoare triple {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:03,950 INFO L263 TraceCheckUtils]: 37: Hoare triple {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1994#true} is VALID [2020-07-08 15:55:03,950 INFO L280 TraceCheckUtils]: 38: Hoare triple {1994#true} ~n := #in~n; {1994#true} is VALID [2020-07-08 15:55:03,950 INFO L280 TraceCheckUtils]: 39: Hoare triple {1994#true} assume !(~n < 1); {1994#true} is VALID [2020-07-08 15:55:03,950 INFO L280 TraceCheckUtils]: 40: Hoare triple {1994#true} assume 1 == ~n; {1994#true} is VALID [2020-07-08 15:55:03,951 INFO L280 TraceCheckUtils]: 41: Hoare triple {1994#true} #res := 1; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,951 INFO L280 TraceCheckUtils]: 42: Hoare triple {2089#(<= 1 |fibonacci_#res|)} assume true; {2089#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:03,956 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2089#(<= 1 |fibonacci_#res|)} {2065#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,957 INFO L280 TraceCheckUtils]: 44: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:03,958 INFO L280 TraceCheckUtils]: 45: Hoare triple {2072#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,959 INFO L280 TraceCheckUtils]: 46: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,959 INFO L280 TraceCheckUtils]: 47: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,960 INFO L280 TraceCheckUtils]: 48: Hoare triple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:03,960 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2073#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1994#true} #53#return; {2039#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:03,961 INFO L280 TraceCheckUtils]: 50: Hoare triple {2039#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2039#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:03,961 INFO L280 TraceCheckUtils]: 51: Hoare triple {2039#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {2040#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:03,961 INFO L280 TraceCheckUtils]: 52: Hoare triple {2040#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {2040#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:03,962 INFO L280 TraceCheckUtils]: 53: Hoare triple {2040#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {1995#false} is VALID [2020-07-08 15:55:03,962 INFO L280 TraceCheckUtils]: 54: Hoare triple {1995#false} assume !false; {1995#false} is VALID [2020-07-08 15:55:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 15:55:03,966 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:03,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912884951] [2020-07-08 15:55:03,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:03,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 15:55:03,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74191018] [2020-07-08 15:55:03,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-08 15:55:03,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:03,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 15:55:04,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:04,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 15:55:04,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 15:55:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-08 15:55:04,039 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2020-07-08 15:55:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:04,997 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-08 15:55:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 15:55:04,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-08 15:55:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 15:55:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2020-07-08 15:55:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 15:55:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2020-07-08 15:55:05,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2020-07-08 15:55:05,102 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 15:55:05,105 INFO L225 Difference]: With dead ends: 61 [2020-07-08 15:55:05,106 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 15:55:05,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2020-07-08 15:55:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 15:55:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-07-08 15:55:05,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:05,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 45 states. [2020-07-08 15:55:05,202 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 45 states. [2020-07-08 15:55:05,202 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 45 states. [2020-07-08 15:55:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:05,206 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-08 15:55:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-08 15:55:05,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:05,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:05,207 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 55 states. [2020-07-08 15:55:05,207 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 55 states. [2020-07-08 15:55:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:05,211 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-08 15:55:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-08 15:55:05,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:05,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:05,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:05,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 15:55:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-08 15:55:05,215 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 55 [2020-07-08 15:55:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:05,215 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-08 15:55:05,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 15:55:05,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 53 transitions. [2020-07-08 15:55:05,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-08 15:55:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-08 15:55:05,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:05,299 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, 1] [2020-07-08 15:55:05,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 15:55:05,300 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -778718797, now seen corresponding path program 4 times [2020-07-08 15:55:05,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:05,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849941984] [2020-07-08 15:55:05,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:55:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,351 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2436#true} {2436#true} #49#return; {2436#true} is VALID [2020-07-08 15:55:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,436 INFO L280 TraceCheckUtils]: 3: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} #res := 1; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} assume true; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,437 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2595#(<= |fibonacci_#in~n| 1)} {2581#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,444 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2436#true} {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,446 INFO L263 TraceCheckUtils]: 3: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} #res := 1; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} assume true; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,450 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2595#(<= |fibonacci_#in~n| 1)} {2581#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,451 INFO L263 TraceCheckUtils]: 11: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,453 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2436#true} {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,454 INFO L280 TraceCheckUtils]: 17: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,454 INFO L280 TraceCheckUtils]: 18: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,455 INFO L280 TraceCheckUtils]: 19: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,456 INFO L280 TraceCheckUtils]: 20: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,456 INFO L280 TraceCheckUtils]: 21: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume true; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,457 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2594#(<= |fibonacci_#in~n| 2)} {2436#true} #45#return; {2539#(<= fibonacci_~n 3)} is VALID [2020-07-08 15:55:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,535 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2436#true} {2436#true} #45#return; {2436#true} is VALID [2020-07-08 15:55:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,540 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2436#true} {2436#true} #47#return; {2436#true} is VALID [2020-07-08 15:55:05,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,541 INFO L263 TraceCheckUtils]: 3: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,542 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2436#true} {2436#true} #45#return; {2436#true} is VALID [2020-07-08 15:55:05,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {2436#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,542 INFO L263 TraceCheckUtils]: 11: Hoare triple {2436#true} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,543 INFO L280 TraceCheckUtils]: 15: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,543 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2436#true} {2436#true} #47#return; {2436#true} is VALID [2020-07-08 15:55:05,543 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,544 INFO L280 TraceCheckUtils]: 18: Hoare triple {2436#true} #res := #t~ret0 + #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,544 INFO L280 TraceCheckUtils]: 19: Hoare triple {2436#true} havoc #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,544 INFO L280 TraceCheckUtils]: 20: Hoare triple {2436#true} havoc #t~ret0; {2436#true} is VALID [2020-07-08 15:55:05,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,545 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:05,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,553 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,555 INFO L263 TraceCheckUtils]: 3: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,555 INFO L280 TraceCheckUtils]: 6: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,556 INFO L263 TraceCheckUtils]: 7: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,556 INFO L280 TraceCheckUtils]: 10: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2436#true} {2436#true} #45#return; {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {2436#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L263 TraceCheckUtils]: 15: Hoare triple {2436#true} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L280 TraceCheckUtils]: 16: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,557 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,558 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2436#true} {2436#true} #47#return; {2436#true} is VALID [2020-07-08 15:55:05,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {2436#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {2436#true} #res := #t~ret0 + #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {2436#true} havoc #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {2436#true} havoc #t~ret0; {2436#true} is VALID [2020-07-08 15:55:05,559 INFO L280 TraceCheckUtils]: 25: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,560 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,560 INFO L280 TraceCheckUtils]: 27: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,561 INFO L263 TraceCheckUtils]: 28: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,561 INFO L280 TraceCheckUtils]: 30: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,561 INFO L280 TraceCheckUtils]: 31: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,561 INFO L280 TraceCheckUtils]: 32: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,561 INFO L280 TraceCheckUtils]: 33: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,562 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,563 INFO L280 TraceCheckUtils]: 35: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,563 INFO L280 TraceCheckUtils]: 36: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,564 INFO L280 TraceCheckUtils]: 37: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,564 INFO L280 TraceCheckUtils]: 38: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,565 INFO L280 TraceCheckUtils]: 39: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume true; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,566 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2627#(<= 2 |fibonacci_#in~n|)} {2539#(<= fibonacci_~n 3)} #47#return; {2437#false} is VALID [2020-07-08 15:55:05,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,569 INFO L280 TraceCheckUtils]: 5: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,570 INFO L263 TraceCheckUtils]: 7: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} #res := 1; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} assume true; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,575 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2595#(<= |fibonacci_#in~n| 1)} {2581#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,576 INFO L263 TraceCheckUtils]: 15: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,577 INFO L280 TraceCheckUtils]: 18: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,577 INFO L280 TraceCheckUtils]: 19: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,578 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2436#true} {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,579 INFO L280 TraceCheckUtils]: 21: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,580 INFO L280 TraceCheckUtils]: 22: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,581 INFO L280 TraceCheckUtils]: 23: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,582 INFO L280 TraceCheckUtils]: 24: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,582 INFO L280 TraceCheckUtils]: 25: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume true; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,584 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2594#(<= |fibonacci_#in~n| 2)} {2436#true} #45#return; {2539#(<= fibonacci_~n 3)} is VALID [2020-07-08 15:55:05,584 INFO L280 TraceCheckUtils]: 27: Hoare triple {2539#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2539#(<= fibonacci_~n 3)} is VALID [2020-07-08 15:55:05,584 INFO L263 TraceCheckUtils]: 28: Hoare triple {2539#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,585 INFO L280 TraceCheckUtils]: 29: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,586 INFO L280 TraceCheckUtils]: 30: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,587 INFO L280 TraceCheckUtils]: 31: Hoare triple {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,587 INFO L263 TraceCheckUtils]: 32: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,587 INFO L280 TraceCheckUtils]: 33: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,587 INFO L280 TraceCheckUtils]: 34: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,588 INFO L280 TraceCheckUtils]: 35: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,588 INFO L263 TraceCheckUtils]: 36: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,588 INFO L280 TraceCheckUtils]: 37: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,588 INFO L280 TraceCheckUtils]: 38: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,588 INFO L280 TraceCheckUtils]: 39: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,589 INFO L280 TraceCheckUtils]: 40: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,589 INFO L280 TraceCheckUtils]: 41: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,589 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2436#true} {2436#true} #45#return; {2436#true} is VALID [2020-07-08 15:55:05,589 INFO L280 TraceCheckUtils]: 43: Hoare triple {2436#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,589 INFO L263 TraceCheckUtils]: 44: Hoare triple {2436#true} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,590 INFO L280 TraceCheckUtils]: 45: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,590 INFO L280 TraceCheckUtils]: 46: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,590 INFO L280 TraceCheckUtils]: 47: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,590 INFO L280 TraceCheckUtils]: 48: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,590 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2436#true} {2436#true} #47#return; {2436#true} is VALID [2020-07-08 15:55:05,591 INFO L280 TraceCheckUtils]: 50: Hoare triple {2436#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,591 INFO L280 TraceCheckUtils]: 51: Hoare triple {2436#true} #res := #t~ret0 + #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,591 INFO L280 TraceCheckUtils]: 52: Hoare triple {2436#true} havoc #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,591 INFO L280 TraceCheckUtils]: 53: Hoare triple {2436#true} havoc #t~ret0; {2436#true} is VALID [2020-07-08 15:55:05,591 INFO L280 TraceCheckUtils]: 54: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,593 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,593 INFO L280 TraceCheckUtils]: 56: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,594 INFO L263 TraceCheckUtils]: 57: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,594 INFO L280 TraceCheckUtils]: 58: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,594 INFO L280 TraceCheckUtils]: 59: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,594 INFO L280 TraceCheckUtils]: 60: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,594 INFO L280 TraceCheckUtils]: 61: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,595 INFO L280 TraceCheckUtils]: 62: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,596 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,597 INFO L280 TraceCheckUtils]: 64: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,598 INFO L280 TraceCheckUtils]: 65: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,599 INFO L280 TraceCheckUtils]: 66: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,599 INFO L280 TraceCheckUtils]: 67: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,600 INFO L280 TraceCheckUtils]: 68: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume true; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,601 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {2627#(<= 2 |fibonacci_#in~n|)} {2539#(<= fibonacci_~n 3)} #47#return; {2437#false} is VALID [2020-07-08 15:55:05,602 INFO L280 TraceCheckUtils]: 70: Hoare triple {2437#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2437#false} is VALID [2020-07-08 15:55:05,602 INFO L280 TraceCheckUtils]: 71: Hoare triple {2437#false} #res := #t~ret0 + #t~ret1; {2437#false} is VALID [2020-07-08 15:55:05,602 INFO L280 TraceCheckUtils]: 72: Hoare triple {2437#false} havoc #t~ret1; {2437#false} is VALID [2020-07-08 15:55:05,603 INFO L280 TraceCheckUtils]: 73: Hoare triple {2437#false} havoc #t~ret0; {2437#false} is VALID [2020-07-08 15:55:05,603 INFO L280 TraceCheckUtils]: 74: Hoare triple {2437#false} assume true; {2437#false} is VALID [2020-07-08 15:55:05,603 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {2437#false} {2436#true} #53#return; {2437#false} is VALID [2020-07-08 15:55:05,611 INFO L263 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2020-07-08 15:55:05,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,612 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #49#return; {2436#true} is VALID [2020-07-08 15:55:05,612 INFO L263 TraceCheckUtils]: 3: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2020-07-08 15:55:05,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {2436#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := #t~nondet2; {2436#true} is VALID [2020-07-08 15:55:05,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {2436#true} havoc #t~nondet2; {2436#true} is VALID [2020-07-08 15:55:05,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {2436#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {2436#true} is VALID [2020-07-08 15:55:05,614 INFO L263 TraceCheckUtils]: 8: Hoare triple {2436#true} call #t~ret3 := fibonacci(~x~0); {2436#true} is VALID [2020-07-08 15:55:05,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,615 INFO L263 TraceCheckUtils]: 12: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,618 INFO L263 TraceCheckUtils]: 16: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,619 INFO L280 TraceCheckUtils]: 18: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,619 INFO L280 TraceCheckUtils]: 19: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,620 INFO L280 TraceCheckUtils]: 20: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} #res := 1; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,620 INFO L280 TraceCheckUtils]: 21: Hoare triple {2595#(<= |fibonacci_#in~n| 1)} assume true; {2595#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:05,622 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2595#(<= |fibonacci_#in~n| 1)} {2581#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,622 INFO L280 TraceCheckUtils]: 23: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,623 INFO L263 TraceCheckUtils]: 24: Hoare triple {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,623 INFO L280 TraceCheckUtils]: 25: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,623 INFO L280 TraceCheckUtils]: 26: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,624 INFO L280 TraceCheckUtils]: 27: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,624 INFO L280 TraceCheckUtils]: 28: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,626 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2436#true} {2588#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,626 INFO L280 TraceCheckUtils]: 30: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,627 INFO L280 TraceCheckUtils]: 31: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,628 INFO L280 TraceCheckUtils]: 32: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,628 INFO L280 TraceCheckUtils]: 33: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,629 INFO L280 TraceCheckUtils]: 34: Hoare triple {2594#(<= |fibonacci_#in~n| 2)} assume true; {2594#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:05,631 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2594#(<= |fibonacci_#in~n| 2)} {2436#true} #45#return; {2539#(<= fibonacci_~n 3)} is VALID [2020-07-08 15:55:05,631 INFO L280 TraceCheckUtils]: 36: Hoare triple {2539#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2539#(<= fibonacci_~n 3)} is VALID [2020-07-08 15:55:05,632 INFO L263 TraceCheckUtils]: 37: Hoare triple {2539#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,632 INFO L280 TraceCheckUtils]: 38: Hoare triple {2436#true} ~n := #in~n; {2581#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,634 INFO L280 TraceCheckUtils]: 39: Hoare triple {2581#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,635 INFO L280 TraceCheckUtils]: 40: Hoare triple {2596#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,635 INFO L263 TraceCheckUtils]: 41: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,635 INFO L280 TraceCheckUtils]: 42: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,636 INFO L280 TraceCheckUtils]: 43: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,636 INFO L280 TraceCheckUtils]: 44: Hoare triple {2436#true} assume !(1 == ~n); {2436#true} is VALID [2020-07-08 15:55:05,636 INFO L263 TraceCheckUtils]: 45: Hoare triple {2436#true} call #t~ret0 := fibonacci(~n - 1); {2436#true} is VALID [2020-07-08 15:55:05,637 INFO L280 TraceCheckUtils]: 46: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,637 INFO L280 TraceCheckUtils]: 47: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,637 INFO L280 TraceCheckUtils]: 48: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,637 INFO L280 TraceCheckUtils]: 49: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,638 INFO L280 TraceCheckUtils]: 50: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,638 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2436#true} {2436#true} #45#return; {2436#true} is VALID [2020-07-08 15:55:05,638 INFO L280 TraceCheckUtils]: 52: Hoare triple {2436#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,639 INFO L263 TraceCheckUtils]: 53: Hoare triple {2436#true} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,639 INFO L280 TraceCheckUtils]: 54: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,639 INFO L280 TraceCheckUtils]: 55: Hoare triple {2436#true} assume ~n < 1; {2436#true} is VALID [2020-07-08 15:55:05,640 INFO L280 TraceCheckUtils]: 56: Hoare triple {2436#true} #res := 0; {2436#true} is VALID [2020-07-08 15:55:05,640 INFO L280 TraceCheckUtils]: 57: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,640 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2436#true} {2436#true} #47#return; {2436#true} is VALID [2020-07-08 15:55:05,641 INFO L280 TraceCheckUtils]: 59: Hoare triple {2436#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2436#true} is VALID [2020-07-08 15:55:05,641 INFO L280 TraceCheckUtils]: 60: Hoare triple {2436#true} #res := #t~ret0 + #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,641 INFO L280 TraceCheckUtils]: 61: Hoare triple {2436#true} havoc #t~ret1; {2436#true} is VALID [2020-07-08 15:55:05,642 INFO L280 TraceCheckUtils]: 62: Hoare triple {2436#true} havoc #t~ret0; {2436#true} is VALID [2020-07-08 15:55:05,642 INFO L280 TraceCheckUtils]: 63: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,643 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,644 INFO L280 TraceCheckUtils]: 65: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:05,644 INFO L263 TraceCheckUtils]: 66: Hoare triple {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {2436#true} is VALID [2020-07-08 15:55:05,644 INFO L280 TraceCheckUtils]: 67: Hoare triple {2436#true} ~n := #in~n; {2436#true} is VALID [2020-07-08 15:55:05,645 INFO L280 TraceCheckUtils]: 68: Hoare triple {2436#true} assume !(~n < 1); {2436#true} is VALID [2020-07-08 15:55:05,645 INFO L280 TraceCheckUtils]: 69: Hoare triple {2436#true} assume 1 == ~n; {2436#true} is VALID [2020-07-08 15:55:05,645 INFO L280 TraceCheckUtils]: 70: Hoare triple {2436#true} #res := 1; {2436#true} is VALID [2020-07-08 15:55:05,645 INFO L280 TraceCheckUtils]: 71: Hoare triple {2436#true} assume true; {2436#true} is VALID [2020-07-08 15:55:05,647 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2436#true} {2597#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,647 INFO L280 TraceCheckUtils]: 73: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,648 INFO L280 TraceCheckUtils]: 74: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,648 INFO L280 TraceCheckUtils]: 75: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,649 INFO L280 TraceCheckUtils]: 76: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,650 INFO L280 TraceCheckUtils]: 77: Hoare triple {2627#(<= 2 |fibonacci_#in~n|)} assume true; {2627#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:05,651 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {2627#(<= 2 |fibonacci_#in~n|)} {2539#(<= fibonacci_~n 3)} #47#return; {2437#false} is VALID [2020-07-08 15:55:05,651 INFO L280 TraceCheckUtils]: 79: Hoare triple {2437#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2437#false} is VALID [2020-07-08 15:55:05,651 INFO L280 TraceCheckUtils]: 80: Hoare triple {2437#false} #res := #t~ret0 + #t~ret1; {2437#false} is VALID [2020-07-08 15:55:05,651 INFO L280 TraceCheckUtils]: 81: Hoare triple {2437#false} havoc #t~ret1; {2437#false} is VALID [2020-07-08 15:55:05,652 INFO L280 TraceCheckUtils]: 82: Hoare triple {2437#false} havoc #t~ret0; {2437#false} is VALID [2020-07-08 15:55:05,652 INFO L280 TraceCheckUtils]: 83: Hoare triple {2437#false} assume true; {2437#false} is VALID [2020-07-08 15:55:05,652 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {2437#false} {2436#true} #53#return; {2437#false} is VALID [2020-07-08 15:55:05,652 INFO L280 TraceCheckUtils]: 85: Hoare triple {2437#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2437#false} is VALID [2020-07-08 15:55:05,653 INFO L280 TraceCheckUtils]: 86: Hoare triple {2437#false} ~result~0 := #t~ret3; {2437#false} is VALID [2020-07-08 15:55:05,653 INFO L280 TraceCheckUtils]: 87: Hoare triple {2437#false} havoc #t~ret3; {2437#false} is VALID [2020-07-08 15:55:05,653 INFO L280 TraceCheckUtils]: 88: Hoare triple {2437#false} assume !(~result~0 >= ~x~0 - 1); {2437#false} is VALID [2020-07-08 15:55:05,653 INFO L280 TraceCheckUtils]: 89: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2020-07-08 15:55:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 17 proven. 42 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-08 15:55:05,660 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:05,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [849941984] [2020-07-08 15:55:05,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:05,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 15:55:05,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151975573] [2020-07-08 15:55:05,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-08 15:55:05,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:05,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 15:55:05,755 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 15:55:05,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 15:55:05,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 15:55:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-08 15:55:05,756 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 10 states. [2020-07-08 15:55:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:06,376 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-07-08 15:55:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 15:55:06,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-08 15:55:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 15:55:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-08 15:55:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 15:55:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-08 15:55:06,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2020-07-08 15:55:06,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:06,493 INFO L225 Difference]: With dead ends: 98 [2020-07-08 15:55:06,493 INFO L226 Difference]: Without dead ends: 62 [2020-07-08 15:55:06,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-07-08 15:55:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-08 15:55:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-07-08 15:55:06,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:06,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 56 states. [2020-07-08 15:55:06,627 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 56 states. [2020-07-08 15:55:06,627 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 56 states. [2020-07-08 15:55:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:06,631 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2020-07-08 15:55:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2020-07-08 15:55:06,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:06,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:06,632 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 62 states. [2020-07-08 15:55:06,632 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 62 states. [2020-07-08 15:55:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:06,636 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2020-07-08 15:55:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2020-07-08 15:55:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:06,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:06,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:06,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 15:55:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2020-07-08 15:55:06,640 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 90 [2020-07-08 15:55:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:06,641 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2020-07-08 15:55:06,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 15:55:06,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 68 transitions. [2020-07-08 15:55:06,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-07-08 15:55:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-08 15:55:06,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:06,763 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, 1] [2020-07-08 15:55:06,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 15:55:06,764 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 5 times [2020-07-08 15:55:06,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:06,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890967005] [2020-07-08 15:55:06,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 [2020-07-08 15:55:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:06,901 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3081#true} {3081#true} #49#return; {3081#true} is VALID [2020-07-08 15:55:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,048 INFO L280 TraceCheckUtils]: 3: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} #res := 1; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} assume true; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,050 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3343#(<= |fibonacci_#in~n| 1)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,057 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,058 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3081#true} {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,060 INFO L263 TraceCheckUtils]: 3: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,061 INFO L280 TraceCheckUtils]: 5: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} #res := 1; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,063 INFO L280 TraceCheckUtils]: 8: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} assume true; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,064 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3343#(<= |fibonacci_#in~n| 1)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,065 INFO L280 TraceCheckUtils]: 10: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,065 INFO L263 TraceCheckUtils]: 11: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,066 INFO L280 TraceCheckUtils]: 12: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,066 INFO L280 TraceCheckUtils]: 15: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,067 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3081#true} {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,068 INFO L280 TraceCheckUtils]: 17: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,069 INFO L280 TraceCheckUtils]: 18: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,069 INFO L280 TraceCheckUtils]: 19: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,070 INFO L280 TraceCheckUtils]: 20: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,070 INFO L280 TraceCheckUtils]: 21: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume true; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,072 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3342#(<= |fibonacci_#in~n| 2)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,077 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,078 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,079 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3081#true} {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,081 INFO L263 TraceCheckUtils]: 3: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,082 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,083 INFO L263 TraceCheckUtils]: 7: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,084 INFO L280 TraceCheckUtils]: 8: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,084 INFO L280 TraceCheckUtils]: 9: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,085 INFO L280 TraceCheckUtils]: 10: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,086 INFO L280 TraceCheckUtils]: 11: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} #res := 1; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} assume true; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,088 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3343#(<= |fibonacci_#in~n| 1)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,089 INFO L280 TraceCheckUtils]: 14: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,089 INFO L263 TraceCheckUtils]: 15: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,089 INFO L280 TraceCheckUtils]: 16: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,089 INFO L280 TraceCheckUtils]: 17: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,090 INFO L280 TraceCheckUtils]: 18: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,092 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3081#true} {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,094 INFO L280 TraceCheckUtils]: 22: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,095 INFO L280 TraceCheckUtils]: 24: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,095 INFO L280 TraceCheckUtils]: 25: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume true; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,097 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3342#(<= |fibonacci_#in~n| 2)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,098 INFO L263 TraceCheckUtils]: 28: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,098 INFO L280 TraceCheckUtils]: 29: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,098 INFO L280 TraceCheckUtils]: 30: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,099 INFO L280 TraceCheckUtils]: 31: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,099 INFO L280 TraceCheckUtils]: 32: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,100 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3081#true} {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,101 INFO L280 TraceCheckUtils]: 35: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,102 INFO L280 TraceCheckUtils]: 36: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,102 INFO L280 TraceCheckUtils]: 37: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,103 INFO L280 TraceCheckUtils]: 38: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,103 INFO L280 TraceCheckUtils]: 39: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume true; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,105 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3329#(<= |fibonacci_#in~n| 3)} {3081#true} #45#return; {3238#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,309 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,310 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,317 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,319 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,320 INFO L263 TraceCheckUtils]: 3: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,321 INFO L280 TraceCheckUtils]: 5: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,323 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {3081#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,324 INFO L263 TraceCheckUtils]: 11: Hoare triple {3081#true} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,324 INFO L280 TraceCheckUtils]: 13: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,326 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {3081#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {3081#true} #res := #t~ret0 + #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {3081#true} havoc #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,327 INFO L280 TraceCheckUtils]: 20: Hoare triple {3081#true} havoc #t~ret0; {3081#true} is VALID [2020-07-08 15:55:07,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,329 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,340 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,346 INFO L263 TraceCheckUtils]: 7: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,347 INFO L280 TraceCheckUtils]: 9: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,348 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {3081#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,349 INFO L263 TraceCheckUtils]: 15: Hoare triple {3081#true} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,351 INFO L280 TraceCheckUtils]: 19: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,351 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {3081#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,352 INFO L280 TraceCheckUtils]: 22: Hoare triple {3081#true} #res := #t~ret0 + #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {3081#true} havoc #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,352 INFO L280 TraceCheckUtils]: 24: Hoare triple {3081#true} havoc #t~ret0; {3081#true} is VALID [2020-07-08 15:55:07,353 INFO L280 TraceCheckUtils]: 25: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,354 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,355 INFO L280 TraceCheckUtils]: 27: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,356 INFO L263 TraceCheckUtils]: 28: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,356 INFO L280 TraceCheckUtils]: 29: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,357 INFO L280 TraceCheckUtils]: 30: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,357 INFO L280 TraceCheckUtils]: 31: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,357 INFO L280 TraceCheckUtils]: 32: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,358 INFO L280 TraceCheckUtils]: 33: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,360 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,361 INFO L280 TraceCheckUtils]: 35: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,361 INFO L280 TraceCheckUtils]: 36: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,362 INFO L280 TraceCheckUtils]: 37: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,363 INFO L280 TraceCheckUtils]: 38: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,364 INFO L280 TraceCheckUtils]: 39: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume true; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,366 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3424#(<= 2 |fibonacci_#in~n|)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:07,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,377 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3081#true} {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,379 INFO L263 TraceCheckUtils]: 3: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,380 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,381 INFO L280 TraceCheckUtils]: 5: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,382 INFO L280 TraceCheckUtils]: 6: Hoare triple {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,382 INFO L263 TraceCheckUtils]: 7: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,382 INFO L280 TraceCheckUtils]: 8: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,383 INFO L280 TraceCheckUtils]: 9: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,383 INFO L280 TraceCheckUtils]: 10: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,383 INFO L263 TraceCheckUtils]: 11: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,384 INFO L280 TraceCheckUtils]: 13: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,384 INFO L280 TraceCheckUtils]: 14: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,384 INFO L280 TraceCheckUtils]: 15: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,385 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {3081#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,385 INFO L263 TraceCheckUtils]: 19: Hoare triple {3081#true} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,386 INFO L280 TraceCheckUtils]: 20: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,386 INFO L280 TraceCheckUtils]: 21: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,386 INFO L280 TraceCheckUtils]: 22: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,387 INFO L280 TraceCheckUtils]: 23: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,387 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,388 INFO L280 TraceCheckUtils]: 25: Hoare triple {3081#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,388 INFO L280 TraceCheckUtils]: 26: Hoare triple {3081#true} #res := #t~ret0 + #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,388 INFO L280 TraceCheckUtils]: 27: Hoare triple {3081#true} havoc #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,389 INFO L280 TraceCheckUtils]: 28: Hoare triple {3081#true} havoc #t~ret0; {3081#true} is VALID [2020-07-08 15:55:07,389 INFO L280 TraceCheckUtils]: 29: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,391 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,392 INFO L280 TraceCheckUtils]: 31: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,392 INFO L263 TraceCheckUtils]: 32: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,393 INFO L280 TraceCheckUtils]: 33: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,393 INFO L280 TraceCheckUtils]: 34: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,393 INFO L280 TraceCheckUtils]: 35: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,394 INFO L280 TraceCheckUtils]: 37: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,396 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,397 INFO L280 TraceCheckUtils]: 39: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,398 INFO L280 TraceCheckUtils]: 40: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,399 INFO L280 TraceCheckUtils]: 41: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,399 INFO L280 TraceCheckUtils]: 42: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,400 INFO L280 TraceCheckUtils]: 43: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume true; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,402 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3424#(<= 2 |fibonacci_#in~n|)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,403 INFO L280 TraceCheckUtils]: 45: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,404 INFO L263 TraceCheckUtils]: 46: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,404 INFO L280 TraceCheckUtils]: 47: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,404 INFO L280 TraceCheckUtils]: 48: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,405 INFO L280 TraceCheckUtils]: 49: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,405 INFO L280 TraceCheckUtils]: 50: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,405 INFO L280 TraceCheckUtils]: 51: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,407 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3081#true} {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,408 INFO L280 TraceCheckUtils]: 53: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,409 INFO L280 TraceCheckUtils]: 54: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,410 INFO L280 TraceCheckUtils]: 55: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,411 INFO L280 TraceCheckUtils]: 56: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,412 INFO L280 TraceCheckUtils]: 57: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume true; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,413 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3392#(<= 3 |fibonacci_#in~n|)} {3238#(<= fibonacci_~n 4)} #47#return; {3082#false} is VALID [2020-07-08 15:55:07,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,420 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,421 INFO L263 TraceCheckUtils]: 3: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,422 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,423 INFO L280 TraceCheckUtils]: 5: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,424 INFO L263 TraceCheckUtils]: 7: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,427 INFO L263 TraceCheckUtils]: 11: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,429 INFO L280 TraceCheckUtils]: 13: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} #res := 1; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} assume true; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,433 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3343#(<= |fibonacci_#in~n| 1)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,434 INFO L280 TraceCheckUtils]: 18: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,434 INFO L263 TraceCheckUtils]: 19: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,435 INFO L280 TraceCheckUtils]: 20: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,435 INFO L280 TraceCheckUtils]: 21: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,435 INFO L280 TraceCheckUtils]: 22: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,436 INFO L280 TraceCheckUtils]: 23: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,437 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3081#true} {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,438 INFO L280 TraceCheckUtils]: 25: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,439 INFO L280 TraceCheckUtils]: 26: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,439 INFO L280 TraceCheckUtils]: 27: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,440 INFO L280 TraceCheckUtils]: 28: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,440 INFO L280 TraceCheckUtils]: 29: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume true; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,442 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3342#(<= |fibonacci_#in~n| 2)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,443 INFO L280 TraceCheckUtils]: 31: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,443 INFO L263 TraceCheckUtils]: 32: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,443 INFO L280 TraceCheckUtils]: 33: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,443 INFO L280 TraceCheckUtils]: 34: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,444 INFO L280 TraceCheckUtils]: 35: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,444 INFO L280 TraceCheckUtils]: 36: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,444 INFO L280 TraceCheckUtils]: 37: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,445 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3081#true} {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,446 INFO L280 TraceCheckUtils]: 39: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,447 INFO L280 TraceCheckUtils]: 40: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,448 INFO L280 TraceCheckUtils]: 41: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,449 INFO L280 TraceCheckUtils]: 42: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,450 INFO L280 TraceCheckUtils]: 43: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume true; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,452 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3329#(<= |fibonacci_#in~n| 3)} {3081#true} #45#return; {3238#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:07,453 INFO L280 TraceCheckUtils]: 45: Hoare triple {3238#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3238#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:07,453 INFO L263 TraceCheckUtils]: 46: Hoare triple {3238#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,454 INFO L280 TraceCheckUtils]: 47: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,455 INFO L280 TraceCheckUtils]: 48: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,456 INFO L280 TraceCheckUtils]: 49: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,456 INFO L263 TraceCheckUtils]: 50: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,457 INFO L280 TraceCheckUtils]: 51: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,458 INFO L280 TraceCheckUtils]: 52: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,460 INFO L280 TraceCheckUtils]: 53: Hoare triple {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,460 INFO L263 TraceCheckUtils]: 54: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,460 INFO L280 TraceCheckUtils]: 55: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,461 INFO L280 TraceCheckUtils]: 56: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,461 INFO L280 TraceCheckUtils]: 57: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,461 INFO L263 TraceCheckUtils]: 58: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,461 INFO L280 TraceCheckUtils]: 59: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,462 INFO L280 TraceCheckUtils]: 60: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,462 INFO L280 TraceCheckUtils]: 61: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,462 INFO L280 TraceCheckUtils]: 62: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,463 INFO L280 TraceCheckUtils]: 63: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,463 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,463 INFO L280 TraceCheckUtils]: 65: Hoare triple {3081#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,464 INFO L263 TraceCheckUtils]: 66: Hoare triple {3081#true} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,464 INFO L280 TraceCheckUtils]: 67: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,465 INFO L280 TraceCheckUtils]: 68: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,465 INFO L280 TraceCheckUtils]: 69: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,465 INFO L280 TraceCheckUtils]: 70: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,465 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,466 INFO L280 TraceCheckUtils]: 72: Hoare triple {3081#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,466 INFO L280 TraceCheckUtils]: 73: Hoare triple {3081#true} #res := #t~ret0 + #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,466 INFO L280 TraceCheckUtils]: 74: Hoare triple {3081#true} havoc #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,467 INFO L280 TraceCheckUtils]: 75: Hoare triple {3081#true} havoc #t~ret0; {3081#true} is VALID [2020-07-08 15:55:07,467 INFO L280 TraceCheckUtils]: 76: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,468 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,470 INFO L280 TraceCheckUtils]: 78: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,470 INFO L263 TraceCheckUtils]: 79: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,470 INFO L280 TraceCheckUtils]: 80: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,471 INFO L280 TraceCheckUtils]: 81: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,471 INFO L280 TraceCheckUtils]: 82: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,471 INFO L280 TraceCheckUtils]: 83: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,472 INFO L280 TraceCheckUtils]: 84: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,474 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,475 INFO L280 TraceCheckUtils]: 86: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,475 INFO L280 TraceCheckUtils]: 87: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,476 INFO L280 TraceCheckUtils]: 88: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,477 INFO L280 TraceCheckUtils]: 89: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,478 INFO L280 TraceCheckUtils]: 90: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume true; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,480 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {3424#(<= 2 |fibonacci_#in~n|)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,481 INFO L280 TraceCheckUtils]: 92: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,482 INFO L263 TraceCheckUtils]: 93: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,482 INFO L280 TraceCheckUtils]: 94: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,482 INFO L280 TraceCheckUtils]: 95: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,483 INFO L280 TraceCheckUtils]: 96: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,483 INFO L280 TraceCheckUtils]: 97: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,483 INFO L280 TraceCheckUtils]: 98: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,485 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {3081#true} {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,486 INFO L280 TraceCheckUtils]: 100: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,487 INFO L280 TraceCheckUtils]: 101: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,488 INFO L280 TraceCheckUtils]: 102: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,489 INFO L280 TraceCheckUtils]: 103: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,490 INFO L280 TraceCheckUtils]: 104: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume true; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,491 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {3392#(<= 3 |fibonacci_#in~n|)} {3238#(<= fibonacci_~n 4)} #47#return; {3082#false} is VALID [2020-07-08 15:55:07,491 INFO L280 TraceCheckUtils]: 106: Hoare triple {3082#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3082#false} is VALID [2020-07-08 15:55:07,492 INFO L280 TraceCheckUtils]: 107: Hoare triple {3082#false} #res := #t~ret0 + #t~ret1; {3082#false} is VALID [2020-07-08 15:55:07,492 INFO L280 TraceCheckUtils]: 108: Hoare triple {3082#false} havoc #t~ret1; {3082#false} is VALID [2020-07-08 15:55:07,492 INFO L280 TraceCheckUtils]: 109: Hoare triple {3082#false} havoc #t~ret0; {3082#false} is VALID [2020-07-08 15:55:07,492 INFO L280 TraceCheckUtils]: 110: Hoare triple {3082#false} assume true; {3082#false} is VALID [2020-07-08 15:55:07,493 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3082#false} {3081#true} #53#return; {3082#false} is VALID [2020-07-08 15:55:07,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {3081#true} call ULTIMATE.init(); {3081#true} is VALID [2020-07-08 15:55:07,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3081#true} {3081#true} #49#return; {3081#true} is VALID [2020-07-08 15:55:07,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {3081#true} call #t~ret4 := main(); {3081#true} is VALID [2020-07-08 15:55:07,512 INFO L280 TraceCheckUtils]: 4: Hoare triple {3081#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {3081#true} ~x~0 := #t~nondet2; {3081#true} is VALID [2020-07-08 15:55:07,512 INFO L280 TraceCheckUtils]: 6: Hoare triple {3081#true} havoc #t~nondet2; {3081#true} is VALID [2020-07-08 15:55:07,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {3081#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {3081#true} is VALID [2020-07-08 15:55:07,517 INFO L263 TraceCheckUtils]: 8: Hoare triple {3081#true} call #t~ret3 := fibonacci(~x~0); {3081#true} is VALID [2020-07-08 15:55:07,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,518 INFO L263 TraceCheckUtils]: 12: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,519 INFO L280 TraceCheckUtils]: 13: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,521 INFO L280 TraceCheckUtils]: 15: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,521 INFO L263 TraceCheckUtils]: 16: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,524 INFO L263 TraceCheckUtils]: 20: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,525 INFO L280 TraceCheckUtils]: 21: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,526 INFO L280 TraceCheckUtils]: 22: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,528 INFO L280 TraceCheckUtils]: 24: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} #res := 1; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,528 INFO L280 TraceCheckUtils]: 25: Hoare triple {3343#(<= |fibonacci_#in~n| 1)} assume true; {3343#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:07,530 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3343#(<= |fibonacci_#in~n| 1)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,532 INFO L280 TraceCheckUtils]: 27: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,532 INFO L263 TraceCheckUtils]: 28: Hoare triple {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,532 INFO L280 TraceCheckUtils]: 29: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,533 INFO L280 TraceCheckUtils]: 30: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,533 INFO L280 TraceCheckUtils]: 31: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,535 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3081#true} {3336#(and (<= fibonacci_~n 2) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,536 INFO L280 TraceCheckUtils]: 34: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,537 INFO L280 TraceCheckUtils]: 35: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,538 INFO L280 TraceCheckUtils]: 36: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,539 INFO L280 TraceCheckUtils]: 37: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,539 INFO L280 TraceCheckUtils]: 38: Hoare triple {3342#(<= |fibonacci_#in~n| 2)} assume true; {3342#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-08 15:55:07,541 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {3342#(<= |fibonacci_#in~n| 2)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,543 INFO L280 TraceCheckUtils]: 40: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,543 INFO L263 TraceCheckUtils]: 41: Hoare triple {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,543 INFO L280 TraceCheckUtils]: 42: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,544 INFO L280 TraceCheckUtils]: 43: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,544 INFO L280 TraceCheckUtils]: 44: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,544 INFO L280 TraceCheckUtils]: 45: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,545 INFO L280 TraceCheckUtils]: 46: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,546 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {3081#true} {3322#(and (<= fibonacci_~n 3) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,547 INFO L280 TraceCheckUtils]: 48: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,548 INFO L280 TraceCheckUtils]: 49: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,549 INFO L280 TraceCheckUtils]: 50: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,550 INFO L280 TraceCheckUtils]: 51: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,551 INFO L280 TraceCheckUtils]: 52: Hoare triple {3329#(<= |fibonacci_#in~n| 3)} assume true; {3329#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-08 15:55:07,552 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3329#(<= |fibonacci_#in~n| 3)} {3081#true} #45#return; {3238#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:07,553 INFO L280 TraceCheckUtils]: 54: Hoare triple {3238#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3238#(<= fibonacci_~n 4)} is VALID [2020-07-08 15:55:07,553 INFO L263 TraceCheckUtils]: 55: Hoare triple {3238#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,554 INFO L280 TraceCheckUtils]: 56: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,555 INFO L280 TraceCheckUtils]: 57: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,556 INFO L280 TraceCheckUtils]: 58: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,556 INFO L263 TraceCheckUtils]: 59: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,557 INFO L280 TraceCheckUtils]: 60: Hoare triple {3081#true} ~n := #in~n; {3298#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,558 INFO L280 TraceCheckUtils]: 61: Hoare triple {3298#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,560 INFO L280 TraceCheckUtils]: 62: Hoare triple {3393#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,560 INFO L263 TraceCheckUtils]: 63: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,560 INFO L280 TraceCheckUtils]: 64: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,560 INFO L280 TraceCheckUtils]: 65: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,560 INFO L280 TraceCheckUtils]: 66: Hoare triple {3081#true} assume !(1 == ~n); {3081#true} is VALID [2020-07-08 15:55:07,561 INFO L263 TraceCheckUtils]: 67: Hoare triple {3081#true} call #t~ret0 := fibonacci(~n - 1); {3081#true} is VALID [2020-07-08 15:55:07,561 INFO L280 TraceCheckUtils]: 68: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,561 INFO L280 TraceCheckUtils]: 69: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,561 INFO L280 TraceCheckUtils]: 70: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,562 INFO L280 TraceCheckUtils]: 71: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,562 INFO L280 TraceCheckUtils]: 72: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,562 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3081#true} {3081#true} #45#return; {3081#true} is VALID [2020-07-08 15:55:07,562 INFO L280 TraceCheckUtils]: 74: Hoare triple {3081#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,562 INFO L263 TraceCheckUtils]: 75: Hoare triple {3081#true} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,563 INFO L280 TraceCheckUtils]: 76: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,563 INFO L280 TraceCheckUtils]: 77: Hoare triple {3081#true} assume ~n < 1; {3081#true} is VALID [2020-07-08 15:55:07,563 INFO L280 TraceCheckUtils]: 78: Hoare triple {3081#true} #res := 0; {3081#true} is VALID [2020-07-08 15:55:07,563 INFO L280 TraceCheckUtils]: 79: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,563 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {3081#true} {3081#true} #47#return; {3081#true} is VALID [2020-07-08 15:55:07,564 INFO L280 TraceCheckUtils]: 81: Hoare triple {3081#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3081#true} is VALID [2020-07-08 15:55:07,564 INFO L280 TraceCheckUtils]: 82: Hoare triple {3081#true} #res := #t~ret0 + #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,564 INFO L280 TraceCheckUtils]: 83: Hoare triple {3081#true} havoc #t~ret1; {3081#true} is VALID [2020-07-08 15:55:07,564 INFO L280 TraceCheckUtils]: 84: Hoare triple {3081#true} havoc #t~ret0; {3081#true} is VALID [2020-07-08 15:55:07,564 INFO L280 TraceCheckUtils]: 85: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,565 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #45#return; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,566 INFO L280 TraceCheckUtils]: 87: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,566 INFO L263 TraceCheckUtils]: 88: Hoare triple {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,567 INFO L280 TraceCheckUtils]: 89: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,567 INFO L280 TraceCheckUtils]: 90: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,567 INFO L280 TraceCheckUtils]: 91: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,567 INFO L280 TraceCheckUtils]: 92: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,568 INFO L280 TraceCheckUtils]: 93: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,570 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {3081#true} {3394#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,571 INFO L280 TraceCheckUtils]: 95: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,572 INFO L280 TraceCheckUtils]: 96: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,572 INFO L280 TraceCheckUtils]: 97: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,573 INFO L280 TraceCheckUtils]: 98: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,574 INFO L280 TraceCheckUtils]: 99: Hoare triple {3424#(<= 2 |fibonacci_#in~n|)} assume true; {3424#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,576 INFO L275 TraceCheckUtils]: 100: Hoare quadruple {3424#(<= 2 |fibonacci_#in~n|)} {3298#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,577 INFO L280 TraceCheckUtils]: 101: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:07,578 INFO L263 TraceCheckUtils]: 102: Hoare triple {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3081#true} is VALID [2020-07-08 15:55:07,578 INFO L280 TraceCheckUtils]: 103: Hoare triple {3081#true} ~n := #in~n; {3081#true} is VALID [2020-07-08 15:55:07,578 INFO L280 TraceCheckUtils]: 104: Hoare triple {3081#true} assume !(~n < 1); {3081#true} is VALID [2020-07-08 15:55:07,579 INFO L280 TraceCheckUtils]: 105: Hoare triple {3081#true} assume 1 == ~n; {3081#true} is VALID [2020-07-08 15:55:07,579 INFO L280 TraceCheckUtils]: 106: Hoare triple {3081#true} #res := 1; {3081#true} is VALID [2020-07-08 15:55:07,579 INFO L280 TraceCheckUtils]: 107: Hoare triple {3081#true} assume true; {3081#true} is VALID [2020-07-08 15:55:07,581 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {3081#true} {3385#(and (<= 3 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,582 INFO L280 TraceCheckUtils]: 109: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,583 INFO L280 TraceCheckUtils]: 110: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,584 INFO L280 TraceCheckUtils]: 111: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,584 INFO L280 TraceCheckUtils]: 112: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,585 INFO L280 TraceCheckUtils]: 113: Hoare triple {3392#(<= 3 |fibonacci_#in~n|)} assume true; {3392#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:07,587 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {3392#(<= 3 |fibonacci_#in~n|)} {3238#(<= fibonacci_~n 4)} #47#return; {3082#false} is VALID [2020-07-08 15:55:07,587 INFO L280 TraceCheckUtils]: 115: Hoare triple {3082#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3082#false} is VALID [2020-07-08 15:55:07,588 INFO L280 TraceCheckUtils]: 116: Hoare triple {3082#false} #res := #t~ret0 + #t~ret1; {3082#false} is VALID [2020-07-08 15:55:07,588 INFO L280 TraceCheckUtils]: 117: Hoare triple {3082#false} havoc #t~ret1; {3082#false} is VALID [2020-07-08 15:55:07,588 INFO L280 TraceCheckUtils]: 118: Hoare triple {3082#false} havoc #t~ret0; {3082#false} is VALID [2020-07-08 15:55:07,588 INFO L280 TraceCheckUtils]: 119: Hoare triple {3082#false} assume true; {3082#false} is VALID [2020-07-08 15:55:07,589 INFO L275 TraceCheckUtils]: 120: Hoare quadruple {3082#false} {3081#true} #53#return; {3082#false} is VALID [2020-07-08 15:55:07,589 INFO L280 TraceCheckUtils]: 121: Hoare triple {3082#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3082#false} is VALID [2020-07-08 15:55:07,589 INFO L280 TraceCheckUtils]: 122: Hoare triple {3082#false} ~result~0 := #t~ret3; {3082#false} is VALID [2020-07-08 15:55:07,590 INFO L280 TraceCheckUtils]: 123: Hoare triple {3082#false} havoc #t~ret3; {3082#false} is VALID [2020-07-08 15:55:07,590 INFO L280 TraceCheckUtils]: 124: Hoare triple {3082#false} assume !(~result~0 >= ~x~0 - 1); {3082#false} is VALID [2020-07-08 15:55:07,590 INFO L280 TraceCheckUtils]: 125: Hoare triple {3082#false} assume !false; {3082#false} is VALID [2020-07-08 15:55:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-07-08 15:55:07,616 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:07,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890967005] [2020-07-08 15:55:07,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:07,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 15:55:07,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522649201] [2020-07-08 15:55:07,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2020-07-08 15:55:07,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:07,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 15:55:07,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 15:55:07,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 15:55:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-08 15:55:07,733 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 14 states. [2020-07-08 15:55:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:08,668 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2020-07-08 15:55:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 15:55:08,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2020-07-08 15:55:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 15:55:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-08 15:55:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 15:55:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-08 15:55:08,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2020-07-08 15:55:08,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:08,826 INFO L225 Difference]: With dead ends: 124 [2020-07-08 15:55:08,826 INFO L226 Difference]: Without dead ends: 77 [2020-07-08 15:55:08,827 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 15:55:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-08 15:55:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2020-07-08 15:55:08,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:08,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 68 states. [2020-07-08 15:55:08,994 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 68 states. [2020-07-08 15:55:08,994 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 68 states. [2020-07-08 15:55:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:08,997 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-07-08 15:55:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2020-07-08 15:55:08,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:08,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:08,999 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 77 states. [2020-07-08 15:55:08,999 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 77 states. [2020-07-08 15:55:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:09,002 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-07-08 15:55:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2020-07-08 15:55:09,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:09,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:09,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:09,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 15:55:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2020-07-08 15:55:09,006 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 126 [2020-07-08 15:55:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:09,007 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2020-07-08 15:55:09,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 15:55:09,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 85 transitions. [2020-07-08 15:55:09,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2020-07-08 15:55:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-08 15:55:09,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:55:09,138 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, 1] [2020-07-08 15:55:09,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 15:55:09,139 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:55:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:55:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 6 times [2020-07-08 15:55:09,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:55:09,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1663347570] [2020-07-08 15:55:09,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-08 15:55:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} assume true; {3988#true} is VALID [2020-07-08 15:55:09,243 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3988#true} {3988#true} #49#return; {3988#true} is VALID [2020-07-08 15:55:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4179#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:09,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {4179#(<= |fibonacci_#in~n| 1)} #res := 1; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,446 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,486 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,490 INFO L263 TraceCheckUtils]: 3: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4179#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:09,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {4179#(<= |fibonacci_#in~n| 1)} #res := 1; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,497 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,498 INFO L263 TraceCheckUtils]: 11: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,500 INFO L280 TraceCheckUtils]: 14: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,502 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,504 INFO L280 TraceCheckUtils]: 19: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,505 INFO L280 TraceCheckUtils]: 20: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,505 INFO L280 TraceCheckUtils]: 21: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,507 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,532 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,534 INFO L263 TraceCheckUtils]: 3: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,534 INFO L280 TraceCheckUtils]: 4: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,535 INFO L280 TraceCheckUtils]: 5: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,536 INFO L263 TraceCheckUtils]: 7: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,537 INFO L280 TraceCheckUtils]: 9: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,537 INFO L280 TraceCheckUtils]: 10: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4179#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:09,538 INFO L280 TraceCheckUtils]: 11: Hoare triple {4179#(<= |fibonacci_#in~n| 1)} #res := 1; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,539 INFO L280 TraceCheckUtils]: 12: Hoare triple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,540 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,541 INFO L263 TraceCheckUtils]: 15: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,544 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,545 INFO L280 TraceCheckUtils]: 21: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,546 INFO L280 TraceCheckUtils]: 22: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,547 INFO L280 TraceCheckUtils]: 23: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,547 INFO L280 TraceCheckUtils]: 24: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,548 INFO L280 TraceCheckUtils]: 25: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,549 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,550 INFO L280 TraceCheckUtils]: 27: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,551 INFO L263 TraceCheckUtils]: 28: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,551 INFO L280 TraceCheckUtils]: 29: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,551 INFO L280 TraceCheckUtils]: 30: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,551 INFO L280 TraceCheckUtils]: 31: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,552 INFO L280 TraceCheckUtils]: 32: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,553 INFO L280 TraceCheckUtils]: 33: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,554 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,555 INFO L280 TraceCheckUtils]: 35: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,556 INFO L280 TraceCheckUtils]: 36: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,557 INFO L280 TraceCheckUtils]: 37: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,558 INFO L280 TraceCheckUtils]: 38: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,558 INFO L280 TraceCheckUtils]: 39: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,559 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,614 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,617 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {3988#true} #45#return; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:55:09,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,627 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4189#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {3988#true} assume !(1 == ~n); {3988#true} is VALID [2020-07-08 15:55:09,628 INFO L263 TraceCheckUtils]: 3: Hoare triple {3988#true} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,632 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {3988#true} #45#return; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,632 INFO L280 TraceCheckUtils]: 10: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,632 INFO L263 TraceCheckUtils]: 11: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,633 INFO L280 TraceCheckUtils]: 13: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,634 INFO L280 TraceCheckUtils]: 15: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,635 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4189#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,637 INFO L280 TraceCheckUtils]: 18: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,637 INFO L280 TraceCheckUtils]: 19: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,638 INFO L280 TraceCheckUtils]: 20: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,638 INFO L280 TraceCheckUtils]: 21: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,640 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,644 INFO L263 TraceCheckUtils]: 7: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,645 INFO L280 TraceCheckUtils]: 8: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,646 INFO L263 TraceCheckUtils]: 11: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,647 INFO L280 TraceCheckUtils]: 13: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,648 INFO L280 TraceCheckUtils]: 14: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4179#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:09,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {4179#(<= |fibonacci_#in~n| 1)} #res := 1; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,649 INFO L280 TraceCheckUtils]: 16: Hoare triple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,650 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,651 INFO L263 TraceCheckUtils]: 19: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,651 INFO L280 TraceCheckUtils]: 20: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,652 INFO L280 TraceCheckUtils]: 21: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,652 INFO L280 TraceCheckUtils]: 22: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,653 INFO L280 TraceCheckUtils]: 23: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,654 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,656 INFO L280 TraceCheckUtils]: 26: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,656 INFO L280 TraceCheckUtils]: 27: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,657 INFO L280 TraceCheckUtils]: 28: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,658 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,659 INFO L280 TraceCheckUtils]: 31: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,659 INFO L263 TraceCheckUtils]: 32: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,660 INFO L280 TraceCheckUtils]: 34: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,660 INFO L280 TraceCheckUtils]: 35: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,661 INFO L280 TraceCheckUtils]: 36: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,661 INFO L280 TraceCheckUtils]: 37: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,662 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,663 INFO L280 TraceCheckUtils]: 39: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,664 INFO L280 TraceCheckUtils]: 40: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,664 INFO L280 TraceCheckUtils]: 41: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,665 INFO L280 TraceCheckUtils]: 42: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,665 INFO L280 TraceCheckUtils]: 43: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,667 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,668 INFO L280 TraceCheckUtils]: 45: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,668 INFO L263 TraceCheckUtils]: 46: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,668 INFO L280 TraceCheckUtils]: 47: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,668 INFO L280 TraceCheckUtils]: 48: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,668 INFO L280 TraceCheckUtils]: 49: Hoare triple {3988#true} assume !(1 == ~n); {3988#true} is VALID [2020-07-08 15:55:09,669 INFO L263 TraceCheckUtils]: 50: Hoare triple {3988#true} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,669 INFO L280 TraceCheckUtils]: 51: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,669 INFO L280 TraceCheckUtils]: 52: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,669 INFO L280 TraceCheckUtils]: 53: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,670 INFO L280 TraceCheckUtils]: 54: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,670 INFO L280 TraceCheckUtils]: 55: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,671 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {3988#true} #45#return; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,672 INFO L280 TraceCheckUtils]: 57: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,672 INFO L263 TraceCheckUtils]: 58: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,672 INFO L280 TraceCheckUtils]: 59: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,673 INFO L280 TraceCheckUtils]: 60: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,673 INFO L280 TraceCheckUtils]: 61: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,674 INFO L280 TraceCheckUtils]: 62: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,675 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4189#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,676 INFO L280 TraceCheckUtils]: 64: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,677 INFO L280 TraceCheckUtils]: 65: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,678 INFO L280 TraceCheckUtils]: 66: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,678 INFO L280 TraceCheckUtils]: 67: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,679 INFO L280 TraceCheckUtils]: 68: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,680 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,681 INFO L280 TraceCheckUtils]: 70: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,682 INFO L280 TraceCheckUtils]: 71: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,683 INFO L280 TraceCheckUtils]: 72: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,683 INFO L280 TraceCheckUtils]: 73: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,684 INFO L280 TraceCheckUtils]: 74: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,685 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {3988#true} #53#return; {4068#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:09,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {3988#true} call ULTIMATE.init(); {3988#true} is VALID [2020-07-08 15:55:09,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {3988#true} assume true; {3988#true} is VALID [2020-07-08 15:55:09,692 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3988#true} {3988#true} #49#return; {3988#true} is VALID [2020-07-08 15:55:09,692 INFO L263 TraceCheckUtils]: 3: Hoare triple {3988#true} call #t~ret4 := main(); {3988#true} is VALID [2020-07-08 15:55:09,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {3988#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3988#true} is VALID [2020-07-08 15:55:09,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {3988#true} ~x~0 := #t~nondet2; {3988#true} is VALID [2020-07-08 15:55:09,693 INFO L280 TraceCheckUtils]: 6: Hoare triple {3988#true} havoc #t~nondet2; {3988#true} is VALID [2020-07-08 15:55:09,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {3988#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {3988#true} is VALID [2020-07-08 15:55:09,693 INFO L263 TraceCheckUtils]: 8: Hoare triple {3988#true} call #t~ret3 := fibonacci(~x~0); {3988#true} is VALID [2020-07-08 15:55:09,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,696 INFO L263 TraceCheckUtils]: 12: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,698 INFO L263 TraceCheckUtils]: 16: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,700 INFO L280 TraceCheckUtils]: 19: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,700 INFO L263 TraceCheckUtils]: 20: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,700 INFO L280 TraceCheckUtils]: 21: Hoare triple {3988#true} ~n := #in~n; {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,701 INFO L280 TraceCheckUtils]: 22: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4070#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 15:55:09,702 INFO L280 TraceCheckUtils]: 23: Hoare triple {4070#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4179#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-08 15:55:09,702 INFO L280 TraceCheckUtils]: 24: Hoare triple {4179#(<= |fibonacci_#in~n| 1)} #res := 1; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,703 INFO L280 TraceCheckUtils]: 25: Hoare triple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,705 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4180#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,705 INFO L280 TraceCheckUtils]: 27: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,706 INFO L263 TraceCheckUtils]: 28: Hoare triple {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,706 INFO L280 TraceCheckUtils]: 29: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,706 INFO L280 TraceCheckUtils]: 30: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,707 INFO L280 TraceCheckUtils]: 31: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,707 INFO L280 TraceCheckUtils]: 32: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,709 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4173#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,709 INFO L280 TraceCheckUtils]: 34: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,710 INFO L280 TraceCheckUtils]: 35: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,711 INFO L280 TraceCheckUtils]: 36: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,712 INFO L280 TraceCheckUtils]: 37: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,712 INFO L280 TraceCheckUtils]: 38: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,713 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,714 INFO L280 TraceCheckUtils]: 40: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,715 INFO L263 TraceCheckUtils]: 41: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,715 INFO L280 TraceCheckUtils]: 42: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,715 INFO L280 TraceCheckUtils]: 43: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,715 INFO L280 TraceCheckUtils]: 44: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,716 INFO L280 TraceCheckUtils]: 45: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,716 INFO L280 TraceCheckUtils]: 46: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,718 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,719 INFO L280 TraceCheckUtils]: 48: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,719 INFO L280 TraceCheckUtils]: 49: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,720 INFO L280 TraceCheckUtils]: 50: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,721 INFO L280 TraceCheckUtils]: 51: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,721 INFO L280 TraceCheckUtils]: 52: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,722 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4070#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,723 INFO L280 TraceCheckUtils]: 54: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 15:55:09,723 INFO L263 TraceCheckUtils]: 55: Hoare triple {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,724 INFO L280 TraceCheckUtils]: 56: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,724 INFO L280 TraceCheckUtils]: 57: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,724 INFO L280 TraceCheckUtils]: 58: Hoare triple {3988#true} assume !(1 == ~n); {3988#true} is VALID [2020-07-08 15:55:09,724 INFO L263 TraceCheckUtils]: 59: Hoare triple {3988#true} call #t~ret0 := fibonacci(~n - 1); {3988#true} is VALID [2020-07-08 15:55:09,724 INFO L280 TraceCheckUtils]: 60: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,725 INFO L280 TraceCheckUtils]: 61: Hoare triple {3988#true} assume !(~n < 1); {3988#true} is VALID [2020-07-08 15:55:09,725 INFO L280 TraceCheckUtils]: 62: Hoare triple {3988#true} assume 1 == ~n; {3988#true} is VALID [2020-07-08 15:55:09,726 INFO L280 TraceCheckUtils]: 63: Hoare triple {3988#true} #res := 1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,726 INFO L280 TraceCheckUtils]: 64: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,727 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {3988#true} #45#return; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,728 INFO L280 TraceCheckUtils]: 66: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4189#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 15:55:09,728 INFO L263 TraceCheckUtils]: 67: Hoare triple {4189#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {3988#true} is VALID [2020-07-08 15:55:09,728 INFO L280 TraceCheckUtils]: 68: Hoare triple {3988#true} ~n := #in~n; {3988#true} is VALID [2020-07-08 15:55:09,728 INFO L280 TraceCheckUtils]: 69: Hoare triple {3988#true} assume ~n < 1; {3988#true} is VALID [2020-07-08 15:55:09,729 INFO L280 TraceCheckUtils]: 70: Hoare triple {3988#true} #res := 0; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,730 INFO L280 TraceCheckUtils]: 71: Hoare triple {4181#(<= 0 |fibonacci_#res|)} assume true; {4181#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,731 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {4181#(<= 0 |fibonacci_#res|)} {4189#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,732 INFO L280 TraceCheckUtils]: 73: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-08 15:55:09,733 INFO L280 TraceCheckUtils]: 74: Hoare triple {4195#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,734 INFO L280 TraceCheckUtils]: 75: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,734 INFO L280 TraceCheckUtils]: 76: Hoare triple {4182#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,735 INFO L280 TraceCheckUtils]: 77: Hoare triple {4182#(<= 1 |fibonacci_#res|)} assume true; {4182#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 15:55:09,737 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {4182#(<= 1 |fibonacci_#res|)} {4112#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #47#return; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,737 INFO L280 TraceCheckUtils]: 79: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 15:55:09,738 INFO L280 TraceCheckUtils]: 80: Hoare triple {4136#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,739 INFO L280 TraceCheckUtils]: 81: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,740 INFO L280 TraceCheckUtils]: 82: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,740 INFO L280 TraceCheckUtils]: 83: Hoare triple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 15:55:09,741 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {4137#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {3988#true} #53#return; {4068#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:09,742 INFO L280 TraceCheckUtils]: 85: Hoare triple {4068#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4068#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 15:55:09,743 INFO L280 TraceCheckUtils]: 86: Hoare triple {4068#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {4069#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:09,743 INFO L280 TraceCheckUtils]: 87: Hoare triple {4069#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {4069#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 15:55:09,744 INFO L280 TraceCheckUtils]: 88: Hoare triple {4069#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {3989#false} is VALID [2020-07-08 15:55:09,744 INFO L280 TraceCheckUtils]: 89: Hoare triple {3989#false} assume !false; {3989#false} is VALID [2020-07-08 15:55:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-08 15:55:09,753 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:55:09,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1663347570] [2020-07-08 15:55:09,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:55:09,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 15:55:09,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323857446] [2020-07-08 15:55:09,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-07-08 15:55:09,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:55:09,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 15:55:09,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:09,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 15:55:09,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:55:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 15:55:09,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-07-08 15:55:09,816 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 15 states. [2020-07-08 15:55:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:10,772 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-07-08 15:55:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 15:55:10,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-07-08 15:55:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:55:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 15:55:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-08 15:55:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 15:55:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-08 15:55:10,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2020-07-08 15:55:10,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:10,826 INFO L225 Difference]: With dead ends: 68 [2020-07-08 15:55:10,827 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 15:55:10,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2020-07-08 15:55:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 15:55:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 15:55:10,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:55:10,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 15:55:10,828 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 15:55:10,829 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 15:55:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:10,829 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 15:55:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 15:55:10,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:10,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:10,829 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 15:55:10,830 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 15:55:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:55:10,830 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 15:55:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 15:55:10,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:10,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:55:10,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:55:10,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:55:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 15:55:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 15:55:10,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2020-07-08 15:55:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:55:10,831 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 15:55:10,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 15:55:10,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 15:55:10,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:55:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 15:55:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:55:10,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 15:55:10,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 15:55:11,903 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 14 [2020-07-08 15:55:12,149 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-07-08 15:55:12,474 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2020-07-08 15:55:12,634 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2020-07-08 15:55:12,798 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-07-08 15:55:13,081 INFO L264 CegarLoopResult]: At program point fibonacciFINAL(lines 14 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) .cse0) (and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|) .cse0))) [2020-07-08 15:55:13,082 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-08 15:55:13,082 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-08 15:55:13,082 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) (<= 1 |fibonacci_#t~ret0|) .cse0) (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-08 15:55:13,082 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= |fibonacci_#in~n| 1) (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) (<= 1 |fibonacci_#t~ret0|) .cse0) (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point fibonacciEXIT(lines 14 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) .cse0) (and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|) .cse0))) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1) (and (< 1 fibonacci_~n) .cse0 (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) .cse1))) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= |fibonacci_#in~n| 0) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-08 15:55:13,083 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1) (and (< 1 fibonacci_~n) .cse0 (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) .cse1))) [2020-07-08 15:55:13,084 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-07-08 15:55:13,084 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))) (.cse2 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (< 1 fibonacci_~n) .cse0 (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) .cse1 .cse2) (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) .cse0 .cse1 (<= 3 fibonacci_~n) .cse2))) [2020-07-08 15:55:13,084 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1) (and (< 1 fibonacci_~n) (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) .cse0 .cse1))) [2020-07-08 15:55:13,084 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,084 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,084 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,084 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,084 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-07-08 15:55:13,085 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-07-08 15:55:13,085 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-07-08 15:55:13,085 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-08 15:55:13,085 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-07-08 15:55:13,086 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-07-08 15:55:13,086 INFO L264 CegarLoopResult]: At program point L30-3(line 30) the Hoare annotation is: (and (<= main_~x~0 (+ |main_#t~ret3| 1)) (<= main_~x~0 (+ main_~result~0 1))) [2020-07-08 15:55:13,086 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-08 15:55:13,086 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-08 15:55:13,086 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-07-08 15:55:13,086 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-07-08 15:55:13,086 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-08 15:55:13,103 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 15:55:13,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 03:55:13 BoogieIcfgContainer [2020-07-08 15:55:13,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 15:55:13,118 INFO L168 Benchmark]: Toolchain (without parser) took 16721.31 ms. Allocated memory was 145.2 MB in the beginning and 379.6 MB in the end (delta: 234.4 MB). Free memory was 103.6 MB in the beginning and 202.8 MB in the end (delta: -99.2 MB). Peak memory consumption was 135.1 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,118 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.75 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,120 INFO L168 Benchmark]: Boogie Preprocessor took 29.83 ms. Allocated memory is still 145.2 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,120 INFO L168 Benchmark]: RCFGBuilder took 440.22 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 163.2 MB in the end (delta: -71.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,121 INFO L168 Benchmark]: TraceAbstraction took 16027.04 ms. Allocated memory was 202.4 MB in the beginning and 379.6 MB in the end (delta: 177.2 MB). Free memory was 162.6 MB in the beginning and 202.8 MB in the end (delta: -40.2 MB). Peak memory consumption was 137.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:55:13,124 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.75 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.83 ms. Allocated memory is still 145.2 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 440.22 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 163.2 MB in the end (delta: -71.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16027.04 ms. Allocated memory was 202.4 MB in the beginning and 379.6 MB in the end (delta: 177.2 MB). Free memory was 162.6 MB in the beginning and 202.8 MB in the end (delta: -40.2 MB). Peak memory consumption was 137.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: ((1 <= \result && \old(n) <= \result + 1) && n == \old(n)) || ((\old(n) <= 0 && 0 <= \result) && n == \old(n)) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.6s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 265 SDtfs, 441 SDslu, 985 SDs, 0 SdLazy, 945 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 371 PreInvPairs, 632 NumberOfFragments, 332 HoareAnnotationTreeSize, 371 FomulaSimplifications, 12119 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 35 FomulaSimplificationsInter, 2957 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...