/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:57,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:57,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:57,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:57,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:57,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:57,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:57,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:57,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:57,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:57,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:57,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:57,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:57,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:57,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:57,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:57,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:57,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:57,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:57,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:57,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:57,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:57,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:57,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:57,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:57,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:57,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:57,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:57,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:57,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:57,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:57,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:57,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:57,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:57,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:57,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:57,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:57,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:57,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:57,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:57,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:57,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:57,818 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:57,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:57,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:57,820 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:57,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:57,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:57,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:57,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:57,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:57,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:57,821 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:57,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:57,821 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:57,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:57,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:57,822 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:57,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:57,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:57,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:57,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:57,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:57,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:57,824 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:33:58,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:58,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:58,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:58,140 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:58,141 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:58,142 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-11 00:33:58,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a0b7e32/fab378cf91ac4fbe8b50b07ec277a173/FLAGbe17055cf [2020-07-11 00:33:58,717 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:58,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-11 00:33:58,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a0b7e32/fab378cf91ac4fbe8b50b07ec277a173/FLAGbe17055cf [2020-07-11 00:33:59,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a0b7e32/fab378cf91ac4fbe8b50b07ec277a173 [2020-07-11 00:33:59,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:59,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:59,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:59,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:59,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:59,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713668be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59, skipping insertion in model container [2020-07-11 00:33:59,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:59,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:59,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:59,443 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:59,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:59,475 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:59,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59 WrapperNode [2020-07-11 00:33:59,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:59,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:59,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:59,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:59,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (1/1) ... [2020-07-11 00:33:59,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:59,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:59,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:59,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:59,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (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-11 00:33:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-11 00:33:59,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:59,916 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:59,916 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:59,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:59 BoogieIcfgContainer [2020-07-11 00:33:59,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:59,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:59,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:59,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:59,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:59" (1/3) ... [2020-07-11 00:33:59,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1c6a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:59, skipping insertion in model container [2020-07-11 00:33:59,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:59" (2/3) ... [2020-07-11 00:33:59,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1c6a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:59, skipping insertion in model container [2020-07-11 00:33:59,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:59" (3/3) ... [2020-07-11 00:33:59,931 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-11 00:33:59,945 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:59,954 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:59,972 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:34:00,002 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:34:00,002 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:34:00,002 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:34:00,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:34:00,003 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:34:00,003 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:34:00,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:34:00,004 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:34:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-11 00:34:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:34:00,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:00,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:00,035 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-11 00:34:00,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:00,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180976493] [2020-07-11 00:34:00,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-11 00:34:00,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-11 00:34:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,371 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-11 00:34:00,372 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-11 00:34:00,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-11 00:34:00,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-11 00:34:00,373 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-11 00:34:00,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-11 00:34:00,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-11 00:34:00,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-11 00:34:00,375 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-11 00:34:00,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:00,382 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-11 00:34:00,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-11 00:34:00,385 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-11 00:34:00,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-11 00:34:00,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-11 00:34:00,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-11 00:34:00,390 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-11 00:34:00,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180976493] [2020-07-11 00:34:00,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:00,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:34:00,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794996172] [2020-07-11 00:34:00,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:34:00,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:00,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:34:00,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:00,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:34:00,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:34:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:34:00,463 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-11 00:34:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:00,803 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-11 00:34:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:34:00,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:34:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-11 00:34:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-11 00:34:00,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-11 00:34:00,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:00,926 INFO L225 Difference]: With dead ends: 48 [2020-07-11 00:34:00,926 INFO L226 Difference]: Without dead ends: 30 [2020-07-11 00:34:00,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-11 00:34:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-11 00:34:01,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:01,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-11 00:34:01,042 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-11 00:34:01,043 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-11 00:34:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,050 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-11 00:34:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-11 00:34:01,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,052 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-11 00:34:01,052 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-11 00:34:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,058 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-11 00:34:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-11 00:34:01,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:01,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-11 00:34:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-11 00:34:01,066 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-11 00:34:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:01,067 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-11 00:34:01,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:34:01,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-11 00:34:01,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-11 00:34:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 00:34:01,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:01,124 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-11 00:34:01,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:34:01,125 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-11 00:34:01,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:01,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549654518] [2020-07-11 00:34:01,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-11 00:34:01,197 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-11 00:34:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,256 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-11 00:34:01,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-11 00:34:01,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-11 00:34:01,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-11 00:34:01,258 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-11 00:34:01,259 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-11 00:34:01,259 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-11 00:34:01,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-11 00:34:01,259 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-11 00:34:01,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:01,266 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-11 00:34:01,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-11 00:34:01,268 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-11 00:34:01,269 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-11 00:34:01,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-11 00:34:01,275 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-11 00:34:01,276 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-11 00:34:01,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [549654518] [2020-07-11 00:34:01,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:01,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:34:01,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742270720] [2020-07-11 00:34:01,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 00:34:01,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:01,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:34:01,309 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-11 00:34:01,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:34:01,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:34:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:34:01,310 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-11 00:34:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,528 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-11 00:34:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:34:01,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 00:34:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:34:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 00:34:01,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-11 00:34:01,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,588 INFO L225 Difference]: With dead ends: 38 [2020-07-11 00:34:01,588 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:34:01,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:34:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-11 00:34:01,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:01,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-11 00:34:01,625 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-11 00:34:01,625 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-11 00:34:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,630 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-11 00:34:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-11 00:34:01,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,631 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-11 00:34:01,632 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-11 00:34:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,635 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-11 00:34:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-11 00:34:01,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:01,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-11 00:34:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-11 00:34:01,640 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-11 00:34:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:01,641 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-11 00:34:01,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:34:01,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-11 00:34:01,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-11 00:34:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 00:34:01,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:01,689 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:01,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:34:01,689 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:01,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-11 00:34:01,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:01,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131228958] [2020-07-11 00:34:01,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-11 00:34:01,734 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-11 00:34:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,845 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-11 00:34:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-11 00:34:01,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-11 00:34:01,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-11 00:34:01,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-11 00:34:01,859 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-11 00:34:01,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-11 00:34:01,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-11 00:34:01,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-11 00:34:01,865 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-11 00:34:01,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,868 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,868 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,869 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,871 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-11 00:34:01,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-11 00:34:01,872 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-11 00:34:01,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-11 00:34:01,873 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-11 00:34:01,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-11 00:34:01,873 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-11 00:34:01,874 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-11 00:34:01,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-11 00:34:01,875 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-11 00:34:01,876 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-11 00:34:01,880 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-11 00:34:01,881 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-11 00:34:01,882 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-11 00:34:01,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-11 00:34:01,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-11 00:34:01,886 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-11 00:34:01,886 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-11 00:34:01,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-11 00:34:01,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-11 00:34:01,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-11 00:34:01,892 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-11 00:34:01,893 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-11 00:34:01,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-11 00:34:01,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-11 00:34:01,897 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-11 00:34:01,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,901 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,902 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,903 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-11 00:34:01,904 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-11 00:34:01,904 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-11 00:34:01,904 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-11 00:34:01,905 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-11 00:34:01,905 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-11 00:34:01,909 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-11 00:34:01,909 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-11 00:34:01,909 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-11 00:34:01,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-11 00:34:01,910 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-11 00:34:01,912 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-11 00:34:01,912 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-11 00:34:01,912 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-11 00:34:01,913 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-11 00:34:01,913 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-11 00:34:01,914 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-11 00:34:01,914 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-11 00:34:01,915 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-11 00:34:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 00:34:01,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131228958] [2020-07-11 00:34:01,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:01,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:34:01,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916146556] [2020-07-11 00:34:01,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-11 00:34:01,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:01,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:34:01,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:34:01,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:34:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:01,980 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-11 00:34:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:02,279 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-11 00:34:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:34:02,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-11 00:34:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-11 00:34:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-11 00:34:02,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-11 00:34:02,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:02,361 INFO L225 Difference]: With dead ends: 54 [2020-07-11 00:34:02,361 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 00:34:02,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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-11 00:34:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 00:34:02,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 00:34:02,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:02,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 00:34:02,405 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:34:02,405 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:34:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:02,408 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-11 00:34:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-11 00:34:02,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:02,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:02,409 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 00:34:02,409 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 00:34:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:02,412 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-11 00:34:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-11 00:34:02,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:02,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:02,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:02,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 00:34:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-11 00:34:02,416 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-11 00:34:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:02,416 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-11 00:34:02,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:34:02,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2020-07-11 00:34:02,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-11 00:34:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 00:34:02,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:02,465 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:02,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:34:02,466 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:02,466 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-11 00:34:02,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:02,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1312383971] [2020-07-11 00:34:02,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 00:34:02,508 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-11 00:34:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,572 INFO L280 TraceCheckUtils]: 3: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,575 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-11 00:34:02,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-11 00:34:02,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-11 00:34:02,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 00:34:02,584 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-11 00:34:02,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,587 INFO L280 TraceCheckUtils]: 5: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,591 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,592 INFO L280 TraceCheckUtils]: 10: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,592 INFO L263 TraceCheckUtils]: 11: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-11 00:34:02,592 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-11 00:34:02,593 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-11 00:34:02,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-11 00:34:02,593 INFO L280 TraceCheckUtils]: 15: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 00:34:02,594 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,595 INFO L280 TraceCheckUtils]: 17: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,597 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,598 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,599 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-11 00:34:02,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2020-07-11 00:34:02,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 00:34:02,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-11 00:34:02,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {771#true} call #t~ret4 := main(); {771#true} is VALID [2020-07-11 00:34:02,601 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {771#true} is VALID [2020-07-11 00:34:02,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {771#true} ~x~0 := #t~nondet2; {771#true} is VALID [2020-07-11 00:34:02,602 INFO L280 TraceCheckUtils]: 6: Hoare triple {771#true} havoc #t~nondet2; {771#true} is VALID [2020-07-11 00:34:02,602 INFO L263 TraceCheckUtils]: 7: Hoare triple {771#true} call #t~ret3 := fibonacci(~x~0); {771#true} is VALID [2020-07-11 00:34:02,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,604 INFO L263 TraceCheckUtils]: 11: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-11 00:34:02,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,607 INFO L280 TraceCheckUtils]: 15: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,609 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,609 INFO L263 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-11 00:34:02,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-11 00:34:02,610 INFO L280 TraceCheckUtils]: 21: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-11 00:34:02,610 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-11 00:34:02,610 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 00:34:02,611 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,612 INFO L280 TraceCheckUtils]: 25: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,614 INFO L280 TraceCheckUtils]: 27: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,614 INFO L280 TraceCheckUtils]: 28: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,615 INFO L280 TraceCheckUtils]: 29: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:02,616 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-11 00:34:02,617 INFO L280 TraceCheckUtils]: 31: Hoare triple {798#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {798#(<= main_~x~0 2)} is VALID [2020-07-11 00:34:02,617 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= main_~x~0 2)} ~result~0 := #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-11 00:34:02,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {798#(<= main_~x~0 2)} havoc #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-11 00:34:02,618 INFO L280 TraceCheckUtils]: 34: Hoare triple {798#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {772#false} is VALID [2020-07-11 00:34:02,619 INFO L280 TraceCheckUtils]: 35: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-11 00:34:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:34:02,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1312383971] [2020-07-11 00:34:02,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:02,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:34:02,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534121710] [2020-07-11 00:34:02,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-11 00:34:02,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:02,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:34:02,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:02,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:34:02,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:34:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:02,658 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-07-11 00:34:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,052 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-11 00:34:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:03,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-11 00:34:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-11 00:34:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-11 00:34:03,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-11 00:34:03,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:03,165 INFO L225 Difference]: With dead ends: 58 [2020-07-11 00:34:03,166 INFO L226 Difference]: Without dead ends: 52 [2020-07-11 00:34:03,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-11 00:34:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-11 00:34:03,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:03,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-11 00:34:03,249 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-11 00:34:03,249 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-11 00:34:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,254 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-11 00:34:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-11 00:34:03,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:03,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:03,256 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-11 00:34:03,256 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-11 00:34:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,260 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-11 00:34:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-11 00:34:03,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:03,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:03,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:03,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-11 00:34:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-11 00:34:03,273 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-11 00:34:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:03,273 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-11 00:34:03,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:34:03,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2020-07-11 00:34:03,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-11 00:34:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 00:34:03,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:03,375 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:03,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:34:03,376 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-11 00:34:03,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:03,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345641004] [2020-07-11 00:34:03,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-11 00:34:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-11 00:34:03,515 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-11 00:34:03,515 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,517 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-11 00:34:03,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-11 00:34:03,523 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,524 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,526 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-11 00:34:03,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,527 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-11 00:34:03,527 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-11 00:34:03,528 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,529 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,529 INFO L263 TraceCheckUtils]: 11: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-11 00:34:03,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-11 00:34:03,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-11 00:34:03,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,531 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,532 INFO L280 TraceCheckUtils]: 17: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,532 INFO L280 TraceCheckUtils]: 18: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,533 INFO L280 TraceCheckUtils]: 19: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,533 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,534 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,535 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,578 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-11 00:34:03,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-11 00:34:03,580 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-11 00:34:03,580 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,582 INFO L263 TraceCheckUtils]: 7: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-11 00:34:03,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-11 00:34:03,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-11 00:34:03,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,585 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,585 INFO L280 TraceCheckUtils]: 14: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,585 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-11 00:34:03,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,586 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-11 00:34:03,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-11 00:34:03,587 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,589 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,591 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,593 INFO L280 TraceCheckUtils]: 24: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,594 INFO L280 TraceCheckUtils]: 25: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,595 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:03,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:03,595 INFO L263 TraceCheckUtils]: 28: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-11 00:34:03,596 INFO L280 TraceCheckUtils]: 29: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,596 INFO L280 TraceCheckUtils]: 30: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,597 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,597 INFO L280 TraceCheckUtils]: 32: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,599 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-11 00:34:03,599 INFO L280 TraceCheckUtils]: 34: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-11 00:34:03,599 INFO L280 TraceCheckUtils]: 35: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-11 00:34:03,599 INFO L280 TraceCheckUtils]: 36: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-11 00:34:03,600 INFO L280 TraceCheckUtils]: 37: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-11 00:34:03,600 INFO L280 TraceCheckUtils]: 38: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-11 00:34:03,600 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-11 00:34:03,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-11 00:34:03,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-11 00:34:03,602 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret4 := main(); {1145#true} is VALID [2020-07-11 00:34:03,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1145#true} is VALID [2020-07-11 00:34:03,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} ~x~0 := #t~nondet2; {1145#true} is VALID [2020-07-11 00:34:03,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} havoc #t~nondet2; {1145#true} is VALID [2020-07-11 00:34:03,603 INFO L263 TraceCheckUtils]: 7: Hoare triple {1145#true} call #t~ret3 := fibonacci(~x~0); {1145#true} is VALID [2020-07-11 00:34:03,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-11 00:34:03,604 INFO L263 TraceCheckUtils]: 11: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-11 00:34:03,606 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,610 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-11 00:34:03,610 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-11 00:34:03,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-11 00:34:03,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-11 00:34:03,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,612 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,614 INFO L263 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-11 00:34:03,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-11 00:34:03,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-11 00:34:03,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-11 00:34:03,615 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-11 00:34:03,616 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,619 INFO L280 TraceCheckUtils]: 29: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,620 INFO L280 TraceCheckUtils]: 30: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,620 INFO L280 TraceCheckUtils]: 31: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,622 INFO L280 TraceCheckUtils]: 32: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,622 INFO L280 TraceCheckUtils]: 33: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,623 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:03,624 INFO L280 TraceCheckUtils]: 35: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:03,624 INFO L263 TraceCheckUtils]: 36: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-11 00:34:03,624 INFO L280 TraceCheckUtils]: 37: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,625 INFO L280 TraceCheckUtils]: 38: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,625 INFO L280 TraceCheckUtils]: 39: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,629 INFO L280 TraceCheckUtils]: 40: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:03,632 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-11 00:34:03,633 INFO L280 TraceCheckUtils]: 42: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-11 00:34:03,633 INFO L280 TraceCheckUtils]: 43: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-11 00:34:03,633 INFO L280 TraceCheckUtils]: 44: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-11 00:34:03,634 INFO L280 TraceCheckUtils]: 45: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-11 00:34:03,634 INFO L280 TraceCheckUtils]: 46: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-11 00:34:03,634 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-11 00:34:03,634 INFO L280 TraceCheckUtils]: 48: Hoare triple {1146#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1146#false} is VALID [2020-07-11 00:34:03,634 INFO L280 TraceCheckUtils]: 49: Hoare triple {1146#false} ~result~0 := #t~ret3; {1146#false} is VALID [2020-07-11 00:34:03,635 INFO L280 TraceCheckUtils]: 50: Hoare triple {1146#false} havoc #t~ret3; {1146#false} is VALID [2020-07-11 00:34:03,635 INFO L280 TraceCheckUtils]: 51: Hoare triple {1146#false} assume !(5 != ~x~0 || 3 == ~result~0); {1146#false} is VALID [2020-07-11 00:34:03,635 INFO L280 TraceCheckUtils]: 52: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-11 00:34:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-11 00:34:03,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345641004] [2020-07-11 00:34:03,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:03,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:34:03,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362932603] [2020-07-11 00:34:03,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-11 00:34:03,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:03,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:03,708 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-11 00:34:03,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:03,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:03,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:03,709 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-07-11 00:34:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,207 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-11 00:34:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:04,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-11 00:34:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-11 00:34:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-11 00:34:04,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-11 00:34:04,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:04,334 INFO L225 Difference]: With dead ends: 110 [2020-07-11 00:34:04,334 INFO L226 Difference]: Without dead ends: 66 [2020-07-11 00:34:04,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-11 00:34:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-11 00:34:04,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:04,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 54 states. [2020-07-11 00:34:04,430 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 54 states. [2020-07-11 00:34:04,430 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 54 states. [2020-07-11 00:34:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,435 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-11 00:34:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-11 00:34:04,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:04,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:04,436 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 66 states. [2020-07-11 00:34:04,437 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 66 states. [2020-07-11 00:34:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,442 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-11 00:34:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-11 00:34:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:04,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:04,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:04,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-11 00:34:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-11 00:34:04,447 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-11 00:34:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:04,448 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-11 00:34:04,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:04,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2020-07-11 00:34:04,548 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-11 00:34:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-11 00:34:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 00:34:04,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:04,551 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:04,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:34:04,551 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-11 00:34:04,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:04,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183889713] [2020-07-11 00:34:04,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,600 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-11 00:34:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,710 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,718 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-11 00:34:04,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-11 00:34:04,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,719 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,721 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-11 00:34:04,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,722 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,724 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,725 INFO L263 TraceCheckUtils]: 11: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-11 00:34:04,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-11 00:34:04,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-11 00:34:04,725 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,726 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,731 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,732 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:04,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-11 00:34:04,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-11 00:34:04,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-11 00:34:04,744 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,745 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,746 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-11 00:34:04,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,747 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,748 INFO L263 TraceCheckUtils]: 7: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-11 00:34:04,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,756 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,758 INFO L263 TraceCheckUtils]: 15: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-11 00:34:04,758 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-11 00:34:04,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-11 00:34:04,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,760 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,760 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,764 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,765 INFO L280 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,766 INFO L280 TraceCheckUtils]: 24: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,766 INFO L280 TraceCheckUtils]: 25: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,767 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,768 INFO L280 TraceCheckUtils]: 27: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,768 INFO L263 TraceCheckUtils]: 28: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-11 00:34:04,768 INFO L280 TraceCheckUtils]: 29: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,768 INFO L280 TraceCheckUtils]: 30: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-11 00:34:04,769 INFO L280 TraceCheckUtils]: 31: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-11 00:34:04,769 INFO L280 TraceCheckUtils]: 32: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-11 00:34:04,769 INFO L280 TraceCheckUtils]: 33: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,771 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,772 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,774 INFO L280 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,775 INFO L280 TraceCheckUtils]: 37: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,775 INFO L280 TraceCheckUtils]: 38: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,776 INFO L280 TraceCheckUtils]: 39: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,777 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-11 00:34:04,779 INFO L263 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2020-07-11 00:34:04,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-11 00:34:04,780 INFO L263 TraceCheckUtils]: 3: Hoare triple {1703#true} call #t~ret4 := main(); {1703#true} is VALID [2020-07-11 00:34:04,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1703#true} is VALID [2020-07-11 00:34:04,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {1703#true} ~x~0 := #t~nondet2; {1703#true} is VALID [2020-07-11 00:34:04,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {1703#true} havoc #t~nondet2; {1703#true} is VALID [2020-07-11 00:34:04,781 INFO L263 TraceCheckUtils]: 7: Hoare triple {1703#true} call #t~ret3 := fibonacci(~x~0); {1703#true} is VALID [2020-07-11 00:34:04,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,786 INFO L263 TraceCheckUtils]: 11: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-11 00:34:04,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,789 INFO L280 TraceCheckUtils]: 13: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,790 INFO L280 TraceCheckUtils]: 14: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,790 INFO L263 TraceCheckUtils]: 15: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-11 00:34:04,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,791 INFO L280 TraceCheckUtils]: 17: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:04,792 INFO L280 TraceCheckUtils]: 18: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,792 INFO L280 TraceCheckUtils]: 19: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,793 INFO L280 TraceCheckUtils]: 20: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:04,794 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,795 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,795 INFO L263 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-11 00:34:04,796 INFO L280 TraceCheckUtils]: 24: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,796 INFO L280 TraceCheckUtils]: 25: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-11 00:34:04,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-11 00:34:04,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,797 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,798 INFO L280 TraceCheckUtils]: 30: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,799 INFO L280 TraceCheckUtils]: 31: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,800 INFO L280 TraceCheckUtils]: 32: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,800 INFO L280 TraceCheckUtils]: 33: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:04,802 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,803 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,803 INFO L263 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-11 00:34:04,803 INFO L280 TraceCheckUtils]: 37: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-11 00:34:04,803 INFO L280 TraceCheckUtils]: 38: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-11 00:34:04,803 INFO L280 TraceCheckUtils]: 39: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-11 00:34:04,804 INFO L280 TraceCheckUtils]: 40: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-11 00:34:04,804 INFO L280 TraceCheckUtils]: 41: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-11 00:34:04,805 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,806 INFO L280 TraceCheckUtils]: 43: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,806 INFO L280 TraceCheckUtils]: 44: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,807 INFO L280 TraceCheckUtils]: 45: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,808 INFO L280 TraceCheckUtils]: 46: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,808 INFO L280 TraceCheckUtils]: 47: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:04,809 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-11 00:34:04,810 INFO L280 TraceCheckUtils]: 49: Hoare triple {1748#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1748#(<= main_~x~0 3)} is VALID [2020-07-11 00:34:04,810 INFO L280 TraceCheckUtils]: 50: Hoare triple {1748#(<= main_~x~0 3)} ~result~0 := #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-11 00:34:04,811 INFO L280 TraceCheckUtils]: 51: Hoare triple {1748#(<= main_~x~0 3)} havoc #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-11 00:34:04,812 INFO L280 TraceCheckUtils]: 52: Hoare triple {1748#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {1704#false} is VALID [2020-07-11 00:34:04,812 INFO L280 TraceCheckUtils]: 53: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2020-07-11 00:34:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-11 00:34:04,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183889713] [2020-07-11 00:34:04,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:04,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:34:04,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527181193] [2020-07-11 00:34:04,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-11 00:34:04,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:04,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:04,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:04,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:04,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:04,879 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-07-11 00:34:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:05,425 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-11 00:34:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:34:05,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-11 00:34:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-11 00:34:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-11 00:34:05,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-11 00:34:05,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:05,534 INFO L225 Difference]: With dead ends: 88 [2020-07-11 00:34:05,534 INFO L226 Difference]: Without dead ends: 82 [2020-07-11 00:34:05,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-11 00:34:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-11 00:34:05,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:05,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 76 states. [2020-07-11 00:34:05,691 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 76 states. [2020-07-11 00:34:05,692 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 76 states. [2020-07-11 00:34:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:05,699 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-11 00:34:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-11 00:34:05,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:05,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:05,701 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 82 states. [2020-07-11 00:34:05,701 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 82 states. [2020-07-11 00:34:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:05,709 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-11 00:34:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-11 00:34:05,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:05,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:05,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:05,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:34:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-11 00:34:05,716 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-11 00:34:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:05,717 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-11 00:34:05,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:05,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 102 transitions. [2020-07-11 00:34:05,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-11 00:34:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-11 00:34:05,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:05,871 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:05,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:34:05,871 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:05,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-11 00:34:05,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:05,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12272892] [2020-07-11 00:34:05,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:05,959 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-11 00:34:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,089 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,091 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,092 INFO L280 TraceCheckUtils]: 3: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,109 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,117 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,118 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,122 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,124 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,125 INFO L280 TraceCheckUtils]: 7: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,125 INFO L280 TraceCheckUtils]: 8: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,127 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,128 INFO L280 TraceCheckUtils]: 10: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,128 INFO L263 TraceCheckUtils]: 11: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,129 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,129 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,129 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,130 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,131 INFO L280 TraceCheckUtils]: 17: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,131 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,132 INFO L280 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,133 INFO L280 TraceCheckUtils]: 20: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,133 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,135 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,143 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,145 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,148 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,149 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,151 INFO L280 TraceCheckUtils]: 12: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,152 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,153 INFO L263 TraceCheckUtils]: 15: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,153 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,153 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,153 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,153 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,154 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,155 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,155 INFO L280 TraceCheckUtils]: 22: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,156 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,157 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,158 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,159 INFO L280 TraceCheckUtils]: 27: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,159 INFO L263 TraceCheckUtils]: 28: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,160 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,160 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,160 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,161 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,161 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,162 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,162 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,163 INFO L280 TraceCheckUtils]: 36: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,164 INFO L280 TraceCheckUtils]: 37: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,164 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,165 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,166 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,262 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,269 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,271 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,271 INFO L263 TraceCheckUtils]: 3: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,273 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,274 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,274 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,275 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,277 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,277 INFO L280 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,278 INFO L280 TraceCheckUtils]: 20: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,278 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,279 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,285 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,287 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,295 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,301 INFO L263 TraceCheckUtils]: 7: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,302 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,302 INFO L280 TraceCheckUtils]: 11: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,306 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,317 INFO L263 TraceCheckUtils]: 15: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,317 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,317 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,318 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,319 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,320 INFO L280 TraceCheckUtils]: 22: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,321 INFO L280 TraceCheckUtils]: 24: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,321 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,322 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,323 INFO L280 TraceCheckUtils]: 27: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,323 INFO L263 TraceCheckUtils]: 28: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,323 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,323 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,324 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,324 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,324 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,325 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,325 INFO L280 TraceCheckUtils]: 35: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,326 INFO L280 TraceCheckUtils]: 36: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,326 INFO L280 TraceCheckUtils]: 37: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,327 INFO L280 TraceCheckUtils]: 38: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,327 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,329 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:06,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,343 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,345 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,346 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,348 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,349 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,349 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,350 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,351 INFO L263 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,351 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,351 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,351 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,368 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,369 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,370 INFO L280 TraceCheckUtils]: 26: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,370 INFO L280 TraceCheckUtils]: 27: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,371 INFO L280 TraceCheckUtils]: 28: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,371 INFO L280 TraceCheckUtils]: 29: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,378 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,379 INFO L280 TraceCheckUtils]: 31: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,379 INFO L263 TraceCheckUtils]: 32: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,379 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,380 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,380 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,380 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,380 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,381 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,381 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,382 INFO L280 TraceCheckUtils]: 40: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,382 INFO L280 TraceCheckUtils]: 41: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,383 INFO L280 TraceCheckUtils]: 42: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,383 INFO L280 TraceCheckUtils]: 43: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,384 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,385 INFO L280 TraceCheckUtils]: 45: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,385 INFO L263 TraceCheckUtils]: 46: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,385 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,385 INFO L280 TraceCheckUtils]: 48: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,386 INFO L280 TraceCheckUtils]: 49: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,386 INFO L280 TraceCheckUtils]: 50: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,386 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,387 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,387 INFO L280 TraceCheckUtils]: 53: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,388 INFO L280 TraceCheckUtils]: 54: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,389 INFO L280 TraceCheckUtils]: 55: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,389 INFO L280 TraceCheckUtils]: 56: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,390 INFO L280 TraceCheckUtils]: 57: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,391 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-11 00:34:06,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-11 00:34:06,395 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,398 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,399 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,399 INFO L263 TraceCheckUtils]: 11: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,401 INFO L280 TraceCheckUtils]: 15: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,403 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,403 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,403 INFO L263 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,404 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,404 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,404 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,404 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,405 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,406 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,406 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,406 INFO L280 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,407 INFO L280 TraceCheckUtils]: 28: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,407 INFO L280 TraceCheckUtils]: 29: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,408 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,408 INFO L280 TraceCheckUtils]: 31: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,408 INFO L263 TraceCheckUtils]: 32: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,409 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,409 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,409 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,409 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,410 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,410 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,411 INFO L280 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,411 INFO L280 TraceCheckUtils]: 41: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,412 INFO L280 TraceCheckUtils]: 42: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,412 INFO L280 TraceCheckUtils]: 43: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,413 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:06,413 INFO L280 TraceCheckUtils]: 45: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:06,413 INFO L263 TraceCheckUtils]: 46: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,413 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,414 INFO L280 TraceCheckUtils]: 48: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,414 INFO L280 TraceCheckUtils]: 49: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,414 INFO L263 TraceCheckUtils]: 50: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,415 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,415 INFO L280 TraceCheckUtils]: 52: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,415 INFO L280 TraceCheckUtils]: 53: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,416 INFO L263 TraceCheckUtils]: 54: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,416 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,416 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,417 INFO L280 TraceCheckUtils]: 57: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,417 INFO L263 TraceCheckUtils]: 58: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,417 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,417 INFO L280 TraceCheckUtils]: 60: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,417 INFO L280 TraceCheckUtils]: 61: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,417 INFO L280 TraceCheckUtils]: 62: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,418 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,420 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,422 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,422 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,422 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,422 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,422 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,423 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,423 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,424 INFO L280 TraceCheckUtils]: 72: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,424 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,424 INFO L280 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,425 INFO L280 TraceCheckUtils]: 75: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,425 INFO L280 TraceCheckUtils]: 76: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,426 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,427 INFO L280 TraceCheckUtils]: 78: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,427 INFO L263 TraceCheckUtils]: 79: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,427 INFO L280 TraceCheckUtils]: 80: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,428 INFO L280 TraceCheckUtils]: 81: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,428 INFO L280 TraceCheckUtils]: 82: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,428 INFO L280 TraceCheckUtils]: 83: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,428 INFO L280 TraceCheckUtils]: 84: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,429 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,429 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,430 INFO L280 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,430 INFO L280 TraceCheckUtils]: 88: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,431 INFO L280 TraceCheckUtils]: 89: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,431 INFO L280 TraceCheckUtils]: 90: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,432 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,432 INFO L280 TraceCheckUtils]: 92: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,432 INFO L263 TraceCheckUtils]: 93: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,432 INFO L280 TraceCheckUtils]: 94: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,432 INFO L280 TraceCheckUtils]: 95: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,433 INFO L280 TraceCheckUtils]: 96: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,433 INFO L280 TraceCheckUtils]: 97: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,433 INFO L280 TraceCheckUtils]: 98: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,433 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,434 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,434 INFO L280 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,435 INFO L280 TraceCheckUtils]: 102: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,435 INFO L280 TraceCheckUtils]: 103: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,435 INFO L280 TraceCheckUtils]: 104: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,436 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-11 00:34:06,436 INFO L280 TraceCheckUtils]: 106: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-11 00:34:06,436 INFO L280 TraceCheckUtils]: 107: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-11 00:34:06,436 INFO L280 TraceCheckUtils]: 108: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-11 00:34:06,436 INFO L280 TraceCheckUtils]: 109: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-11 00:34:06,437 INFO L280 TraceCheckUtils]: 110: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-11 00:34:06,437 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-11 00:34:06,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {2296#true} call ULTIMATE.init(); {2296#true} is VALID [2020-07-11 00:34:06,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,444 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-11 00:34:06,444 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret4 := main(); {2296#true} is VALID [2020-07-11 00:34:06,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2296#true} is VALID [2020-07-11 00:34:06,444 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} ~x~0 := #t~nondet2; {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} havoc #t~nondet2; {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L263 TraceCheckUtils]: 7: Hoare triple {2296#true} call #t~ret3 := fibonacci(~x~0); {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-11 00:34:06,445 INFO L263 TraceCheckUtils]: 11: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,446 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,446 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,447 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,447 INFO L263 TraceCheckUtils]: 15: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,448 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,448 INFO L280 TraceCheckUtils]: 17: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,449 INFO L280 TraceCheckUtils]: 18: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,449 INFO L263 TraceCheckUtils]: 19: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,450 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,450 INFO L280 TraceCheckUtils]: 21: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,451 INFO L280 TraceCheckUtils]: 22: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,452 INFO L280 TraceCheckUtils]: 24: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:06,452 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,453 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,453 INFO L263 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,453 INFO L280 TraceCheckUtils]: 28: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,453 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,453 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,453 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,454 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,454 INFO L280 TraceCheckUtils]: 33: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,461 INFO L280 TraceCheckUtils]: 34: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,462 INFO L280 TraceCheckUtils]: 35: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,463 INFO L280 TraceCheckUtils]: 36: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,463 INFO L280 TraceCheckUtils]: 37: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:06,464 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,465 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,465 INFO L263 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,465 INFO L280 TraceCheckUtils]: 41: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,465 INFO L280 TraceCheckUtils]: 42: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,466 INFO L280 TraceCheckUtils]: 43: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,466 INFO L280 TraceCheckUtils]: 44: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,466 INFO L280 TraceCheckUtils]: 45: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,467 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,467 INFO L280 TraceCheckUtils]: 47: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,468 INFO L280 TraceCheckUtils]: 48: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,468 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,469 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,469 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:06,470 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:06,470 INFO L280 TraceCheckUtils]: 53: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:06,471 INFO L263 TraceCheckUtils]: 54: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,471 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,472 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,472 INFO L280 TraceCheckUtils]: 57: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,472 INFO L263 TraceCheckUtils]: 58: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,473 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,473 INFO L280 TraceCheckUtils]: 60: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,474 INFO L280 TraceCheckUtils]: 61: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,474 INFO L263 TraceCheckUtils]: 62: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,474 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,475 INFO L280 TraceCheckUtils]: 64: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,475 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,476 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-11 00:34:06,476 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,476 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,476 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,476 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,476 INFO L280 TraceCheckUtils]: 71: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,477 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,478 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,478 INFO L263 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,478 INFO L280 TraceCheckUtils]: 75: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,478 INFO L280 TraceCheckUtils]: 76: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-11 00:34:06,478 INFO L280 TraceCheckUtils]: 77: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-11 00:34:06,479 INFO L280 TraceCheckUtils]: 78: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,479 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,480 INFO L280 TraceCheckUtils]: 80: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,480 INFO L280 TraceCheckUtils]: 81: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,481 INFO L280 TraceCheckUtils]: 82: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,481 INFO L280 TraceCheckUtils]: 83: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,482 INFO L280 TraceCheckUtils]: 84: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,483 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,483 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,483 INFO L263 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,484 INFO L280 TraceCheckUtils]: 88: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,484 INFO L280 TraceCheckUtils]: 89: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,484 INFO L280 TraceCheckUtils]: 90: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,484 INFO L280 TraceCheckUtils]: 91: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,484 INFO L280 TraceCheckUtils]: 92: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,485 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,486 INFO L280 TraceCheckUtils]: 94: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,486 INFO L280 TraceCheckUtils]: 95: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,486 INFO L280 TraceCheckUtils]: 96: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,487 INFO L280 TraceCheckUtils]: 97: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,487 INFO L280 TraceCheckUtils]: 98: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,489 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,489 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,489 INFO L263 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-11 00:34:06,490 INFO L280 TraceCheckUtils]: 102: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-11 00:34:06,490 INFO L280 TraceCheckUtils]: 103: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-11 00:34:06,490 INFO L280 TraceCheckUtils]: 104: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-11 00:34:06,490 INFO L280 TraceCheckUtils]: 105: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-11 00:34:06,490 INFO L280 TraceCheckUtils]: 106: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-11 00:34:06,491 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,492 INFO L280 TraceCheckUtils]: 108: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,492 INFO L280 TraceCheckUtils]: 109: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,492 INFO L280 TraceCheckUtils]: 110: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,493 INFO L280 TraceCheckUtils]: 111: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,493 INFO L280 TraceCheckUtils]: 112: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:06,494 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-11 00:34:06,495 INFO L280 TraceCheckUtils]: 114: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-11 00:34:06,495 INFO L280 TraceCheckUtils]: 115: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-11 00:34:06,495 INFO L280 TraceCheckUtils]: 116: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-11 00:34:06,495 INFO L280 TraceCheckUtils]: 117: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-11 00:34:06,495 INFO L280 TraceCheckUtils]: 118: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L280 TraceCheckUtils]: 120: Hoare triple {2297#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L280 TraceCheckUtils]: 121: Hoare triple {2297#false} ~result~0 := #t~ret3; {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L280 TraceCheckUtils]: 122: Hoare triple {2297#false} havoc #t~ret3; {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L280 TraceCheckUtils]: 123: Hoare triple {2297#false} assume !(5 != ~x~0 || 3 == ~result~0); {2297#false} is VALID [2020-07-11 00:34:06,496 INFO L280 TraceCheckUtils]: 124: Hoare triple {2297#false} assume !false; {2297#false} is VALID [2020-07-11 00:34:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-07-11 00:34:06,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12272892] [2020-07-11 00:34:06,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:06,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:34:06,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333004156] [2020-07-11 00:34:06,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-11 00:34:06,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:06,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:34:06,602 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-11 00:34:06,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:34:06,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:34:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:06,603 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-07-11 00:34:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:07,453 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-07-11 00:34:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 00:34:07,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-11 00:34:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-11 00:34:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-11 00:34:07,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2020-07-11 00:34:07,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:07,609 INFO L225 Difference]: With dead ends: 139 [2020-07-11 00:34:07,609 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 00:34:07,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-07-11 00:34:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 00:34:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-07-11 00:34:07,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:07,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 61 states. [2020-07-11 00:34:07,724 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 61 states. [2020-07-11 00:34:07,725 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 61 states. [2020-07-11 00:34:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:07,729 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-11 00:34:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-11 00:34:07,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:07,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:07,730 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 70 states. [2020-07-11 00:34:07,730 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 70 states. [2020-07-11 00:34:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:07,735 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-11 00:34:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-11 00:34:07,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:07,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:07,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:07,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-11 00:34:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-07-11 00:34:07,740 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-07-11 00:34:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:07,741 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-07-11 00:34:07,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:34:07,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2020-07-11 00:34:07,840 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-11 00:34:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-07-11 00:34:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-11 00:34:07,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:07,841 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:07,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:34:07,842 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-11 00:34:07,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:07,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898402439] [2020-07-11 00:34:07,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:07,880 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-11 00:34:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,993 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,995 INFO L280 TraceCheckUtils]: 3: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,996 INFO L280 TraceCheckUtils]: 4: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,998 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:08,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,007 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,010 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,013 INFO L280 TraceCheckUtils]: 8: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,015 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,015 INFO L263 TraceCheckUtils]: 11: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,016 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,017 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,018 INFO L280 TraceCheckUtils]: 17: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,019 INFO L280 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,020 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,022 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:08,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,034 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,036 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,037 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,038 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,040 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,043 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,044 INFO L263 TraceCheckUtils]: 15: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,045 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,045 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,047 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,047 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,048 INFO L280 TraceCheckUtils]: 22: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,049 INFO L280 TraceCheckUtils]: 23: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,050 INFO L280 TraceCheckUtils]: 24: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,050 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,052 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,053 INFO L280 TraceCheckUtils]: 27: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,053 INFO L263 TraceCheckUtils]: 28: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,053 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,053 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,054 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,054 INFO L280 TraceCheckUtils]: 32: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,054 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,055 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,056 INFO L280 TraceCheckUtils]: 35: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,056 INFO L280 TraceCheckUtils]: 36: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,057 INFO L280 TraceCheckUtils]: 37: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,057 INFO L280 TraceCheckUtils]: 38: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,058 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,059 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:08,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,083 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,083 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,083 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-11 00:34:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:08,088 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,089 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-11 00:34:08,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-11 00:34:08,091 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,091 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,091 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,092 INFO L280 TraceCheckUtils]: 7: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,092 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,092 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-11 00:34:08,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,093 INFO L263 TraceCheckUtils]: 11: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,093 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,093 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,094 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,094 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-11 00:34:08,094 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,094 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,095 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,095 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-11 00:34:08,095 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,096 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,100 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,103 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,108 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,118 INFO L263 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,118 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,118 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,119 INFO L280 TraceCheckUtils]: 22: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,119 INFO L280 TraceCheckUtils]: 23: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,121 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,125 INFO L280 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,126 INFO L280 TraceCheckUtils]: 28: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,126 INFO L280 TraceCheckUtils]: 29: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,128 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,128 INFO L280 TraceCheckUtils]: 31: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,128 INFO L263 TraceCheckUtils]: 32: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,128 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,129 INFO L280 TraceCheckUtils]: 34: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,129 INFO L280 TraceCheckUtils]: 35: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,129 INFO L280 TraceCheckUtils]: 36: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,129 INFO L280 TraceCheckUtils]: 37: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,130 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,130 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,131 INFO L280 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,131 INFO L280 TraceCheckUtils]: 41: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,132 INFO L280 TraceCheckUtils]: 42: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,132 INFO L280 TraceCheckUtils]: 43: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,133 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,134 INFO L280 TraceCheckUtils]: 45: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,134 INFO L263 TraceCheckUtils]: 46: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,134 INFO L280 TraceCheckUtils]: 47: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,134 INFO L280 TraceCheckUtils]: 48: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,135 INFO L280 TraceCheckUtils]: 49: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-11 00:34:08,135 INFO L263 TraceCheckUtils]: 50: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,135 INFO L280 TraceCheckUtils]: 51: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,135 INFO L280 TraceCheckUtils]: 52: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,135 INFO L280 TraceCheckUtils]: 53: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L280 TraceCheckUtils]: 54: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,136 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,137 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,137 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,137 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,137 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-11 00:34:08,137 INFO L280 TraceCheckUtils]: 64: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,138 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,138 INFO L280 TraceCheckUtils]: 66: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,138 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-11 00:34:08,138 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,140 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,140 INFO L280 TraceCheckUtils]: 70: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,141 INFO L280 TraceCheckUtils]: 71: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,141 INFO L280 TraceCheckUtils]: 72: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,142 INFO L280 TraceCheckUtils]: 73: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,142 INFO L280 TraceCheckUtils]: 74: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,143 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-11 00:34:08,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2020-07-11 00:34:08,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,148 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-11 00:34:08,148 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret4 := main(); {3215#true} is VALID [2020-07-11 00:34:08,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} ~x~0 := #t~nondet2; {3215#true} is VALID [2020-07-11 00:34:08,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} havoc #t~nondet2; {3215#true} is VALID [2020-07-11 00:34:08,149 INFO L263 TraceCheckUtils]: 7: Hoare triple {3215#true} call #t~ret3 := fibonacci(~x~0); {3215#true} is VALID [2020-07-11 00:34:08,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,152 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,153 INFO L263 TraceCheckUtils]: 15: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,154 INFO L280 TraceCheckUtils]: 17: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,155 INFO L263 TraceCheckUtils]: 19: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,155 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:08,156 INFO L280 TraceCheckUtils]: 22: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,157 INFO L280 TraceCheckUtils]: 23: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,158 INFO L280 TraceCheckUtils]: 24: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:08,159 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,159 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,160 INFO L263 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,160 INFO L280 TraceCheckUtils]: 28: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,160 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,160 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,160 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,161 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,161 INFO L280 TraceCheckUtils]: 33: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,162 INFO L280 TraceCheckUtils]: 34: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,162 INFO L280 TraceCheckUtils]: 35: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,163 INFO L280 TraceCheckUtils]: 36: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,164 INFO L280 TraceCheckUtils]: 37: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:08,165 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,166 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,166 INFO L263 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,166 INFO L280 TraceCheckUtils]: 41: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,167 INFO L280 TraceCheckUtils]: 42: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,167 INFO L280 TraceCheckUtils]: 43: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,167 INFO L280 TraceCheckUtils]: 44: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,167 INFO L280 TraceCheckUtils]: 45: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,168 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,168 INFO L280 TraceCheckUtils]: 47: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,169 INFO L280 TraceCheckUtils]: 48: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,169 INFO L280 TraceCheckUtils]: 49: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,170 INFO L280 TraceCheckUtils]: 50: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,170 INFO L280 TraceCheckUtils]: 51: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:08,171 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,172 INFO L280 TraceCheckUtils]: 53: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,172 INFO L263 TraceCheckUtils]: 54: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,172 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,172 INFO L280 TraceCheckUtils]: 56: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,172 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-11 00:34:08,173 INFO L280 TraceCheckUtils]: 63: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L263 TraceCheckUtils]: 66: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-11 00:34:08,174 INFO L280 TraceCheckUtils]: 69: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-11 00:34:08,175 INFO L280 TraceCheckUtils]: 70: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,175 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-11 00:34:08,175 INFO L280 TraceCheckUtils]: 72: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-11 00:34:08,175 INFO L280 TraceCheckUtils]: 73: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,175 INFO L280 TraceCheckUtils]: 74: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-11 00:34:08,176 INFO L280 TraceCheckUtils]: 75: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-11 00:34:08,176 INFO L280 TraceCheckUtils]: 76: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-11 00:34:08,178 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,179 INFO L280 TraceCheckUtils]: 78: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,179 INFO L280 TraceCheckUtils]: 79: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,180 INFO L280 TraceCheckUtils]: 80: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,180 INFO L280 TraceCheckUtils]: 81: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,181 INFO L280 TraceCheckUtils]: 82: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-11 00:34:08,181 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-11 00:34:08,182 INFO L280 TraceCheckUtils]: 84: Hoare triple {3295#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3295#(<= main_~x~0 4)} is VALID [2020-07-11 00:34:08,182 INFO L280 TraceCheckUtils]: 85: Hoare triple {3295#(<= main_~x~0 4)} ~result~0 := #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-11 00:34:08,183 INFO L280 TraceCheckUtils]: 86: Hoare triple {3295#(<= main_~x~0 4)} havoc #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-11 00:34:08,183 INFO L280 TraceCheckUtils]: 87: Hoare triple {3295#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {3216#false} is VALID [2020-07-11 00:34:08,184 INFO L280 TraceCheckUtils]: 88: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2020-07-11 00:34:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-07-11 00:34:08,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898402439] [2020-07-11 00:34:08,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:08,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:34:08,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886585818] [2020-07-11 00:34:08,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-11 00:34:08,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:08,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:34:08,251 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-11 00:34:08,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:34:08,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:34:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:08,252 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-07-11 00:34:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,730 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-07-11 00:34:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:34:08,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-11 00:34:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-11 00:34:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-11 00:34:08,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-11 00:34:08,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:08,816 INFO L225 Difference]: With dead ends: 73 [2020-07-11 00:34:08,816 INFO L226 Difference]: Without dead ends: 67 [2020-07-11 00:34:08,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:34:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-11 00:34:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-11 00:34:08,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:08,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-11 00:34:08,954 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-11 00:34:08,954 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-11 00:34:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,958 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-11 00:34:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-11 00:34:08,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:08,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:08,959 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-11 00:34:08,960 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-11 00:34:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,964 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-11 00:34:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-11 00:34:08,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:08,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:08,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:08,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-11 00:34:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-07-11 00:34:08,968 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-07-11 00:34:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:08,969 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-07-11 00:34:08,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:34:08,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2020-07-11 00:34:09,088 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-11 00:34:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-11 00:34:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-11 00:34:09,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:09,094 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:09,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:34:09,094 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-11 00:34:09,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:09,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251000793] [2020-07-11 00:34:09,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,177 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-11 00:34:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,338 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,343 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,344 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,345 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,346 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,346 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,347 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,347 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,347 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,347 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,348 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,348 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,348 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,353 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,354 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,355 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,356 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,357 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,358 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,358 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,358 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,358 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,359 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,360 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,360 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,360 INFO L263 TraceCheckUtils]: 28: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,360 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,360 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,361 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,361 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,362 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,362 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,362 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,362 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,367 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,367 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,368 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,368 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,380 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,380 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,380 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,393 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,394 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,397 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,399 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,399 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,399 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,399 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,400 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,400 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,406 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,406 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,407 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,408 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,411 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,413 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,413 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,413 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,415 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,416 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,416 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,416 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,416 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,417 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,417 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,419 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,420 INFO L263 TraceCheckUtils]: 32: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,420 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,423 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,423 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,423 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,423 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,423 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,424 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,424 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,424 INFO L280 TraceCheckUtils]: 42: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,426 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,427 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,427 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,427 INFO L263 TraceCheckUtils]: 46: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,427 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,427 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,428 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,428 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,428 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,428 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,428 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,429 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,429 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,429 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,431 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,431 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,432 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,432 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,432 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,432 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,433 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,434 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,434 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,434 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,434 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,434 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,435 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,436 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,566 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,567 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,574 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,576 INFO L263 TraceCheckUtils]: 3: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,577 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,577 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,578 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,579 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,579 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,580 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,580 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,580 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,581 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,582 INFO L280 TraceCheckUtils]: 17: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,583 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,583 INFO L280 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,584 INFO L280 TraceCheckUtils]: 20: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,586 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,592 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,593 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,597 INFO L263 TraceCheckUtils]: 7: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,599 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,600 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,600 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,601 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,601 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,601 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,602 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,603 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,603 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,604 INFO L280 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,604 INFO L280 TraceCheckUtils]: 24: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,605 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,606 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,607 INFO L280 TraceCheckUtils]: 27: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,607 INFO L263 TraceCheckUtils]: 28: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,607 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,607 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,607 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,608 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,608 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,609 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,609 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,610 INFO L280 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,611 INFO L280 TraceCheckUtils]: 37: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,611 INFO L280 TraceCheckUtils]: 38: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,612 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,613 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,627 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,631 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,632 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,634 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,634 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,635 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,635 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,635 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,635 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,636 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,636 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,636 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,636 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,637 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,640 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,642 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,642 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,645 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,645 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,646 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,647 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,648 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,648 INFO L263 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,648 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,648 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,648 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,649 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,650 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,651 INFO L280 TraceCheckUtils]: 26: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,651 INFO L280 TraceCheckUtils]: 27: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,652 INFO L280 TraceCheckUtils]: 28: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,654 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,654 INFO L280 TraceCheckUtils]: 31: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,655 INFO L263 TraceCheckUtils]: 32: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,655 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,655 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,655 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,656 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,657 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,657 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,658 INFO L280 TraceCheckUtils]: 40: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,658 INFO L280 TraceCheckUtils]: 41: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,659 INFO L280 TraceCheckUtils]: 42: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,660 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,661 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,662 INFO L280 TraceCheckUtils]: 45: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,662 INFO L263 TraceCheckUtils]: 46: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,662 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,662 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,662 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,663 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,663 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,663 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,663 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,663 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,664 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,664 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,664 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,664 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,664 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,665 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,665 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,665 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,665 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,665 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,666 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,666 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,666 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,666 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,667 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,668 INFO L280 TraceCheckUtils]: 70: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,668 INFO L280 TraceCheckUtils]: 71: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,669 INFO L280 TraceCheckUtils]: 72: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,669 INFO L280 TraceCheckUtils]: 73: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,670 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,671 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:09,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,698 INFO L280 TraceCheckUtils]: 4: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,699 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-11 00:34:09,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,700 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,702 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,703 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,703 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,704 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,704 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,705 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,706 INFO L280 TraceCheckUtils]: 13: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,706 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,706 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,707 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,707 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,707 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,707 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,708 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,709 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,709 INFO L263 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,710 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,710 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,710 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,710 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,711 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,712 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,712 INFO L280 TraceCheckUtils]: 30: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,713 INFO L280 TraceCheckUtils]: 31: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,714 INFO L280 TraceCheckUtils]: 32: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,714 INFO L280 TraceCheckUtils]: 33: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,716 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,716 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,717 INFO L263 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,717 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,717 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,717 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,718 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,718 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,719 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,720 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,720 INFO L280 TraceCheckUtils]: 44: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,721 INFO L280 TraceCheckUtils]: 45: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,721 INFO L280 TraceCheckUtils]: 46: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,722 INFO L280 TraceCheckUtils]: 47: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,723 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,724 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,724 INFO L263 TraceCheckUtils]: 50: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,724 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,725 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,725 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,725 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,725 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,725 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,726 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,727 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,727 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,727 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,727 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,727 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,728 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,728 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,728 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,728 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,728 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,729 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,730 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,731 INFO L280 TraceCheckUtils]: 75: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,731 INFO L280 TraceCheckUtils]: 76: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,732 INFO L280 TraceCheckUtils]: 77: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,732 INFO L280 TraceCheckUtils]: 78: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,733 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,734 INFO L280 TraceCheckUtils]: 80: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,734 INFO L263 TraceCheckUtils]: 81: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,735 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,735 INFO L280 TraceCheckUtils]: 83: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,736 INFO L280 TraceCheckUtils]: 84: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,736 INFO L280 TraceCheckUtils]: 85: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,737 INFO L280 TraceCheckUtils]: 86: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,738 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-11 00:34:09,738 INFO L280 TraceCheckUtils]: 88: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-11 00:34:09,738 INFO L280 TraceCheckUtils]: 89: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,739 INFO L280 TraceCheckUtils]: 90: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,739 INFO L280 TraceCheckUtils]: 91: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-11 00:34:09,739 INFO L280 TraceCheckUtils]: 92: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-11 00:34:09,739 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,749 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,750 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,751 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,752 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L263 TraceCheckUtils]: 36: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,753 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,754 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,754 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,754 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,754 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,754 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L280 TraceCheckUtils]: 44: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,755 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,756 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,757 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,757 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,757 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,757 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,757 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,758 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,759 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,760 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,760 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,760 INFO L280 TraceCheckUtils]: 75: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,760 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,760 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,761 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,761 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,762 INFO L280 TraceCheckUtils]: 80: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,762 INFO L263 TraceCheckUtils]: 81: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,762 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,763 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,763 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,763 INFO L263 TraceCheckUtils]: 85: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,763 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,764 INFO L280 TraceCheckUtils]: 87: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,764 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,765 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,765 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,766 INFO L280 TraceCheckUtils]: 91: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,766 INFO L280 TraceCheckUtils]: 92: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,767 INFO L263 TraceCheckUtils]: 93: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,767 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,768 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,769 INFO L280 TraceCheckUtils]: 96: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,769 INFO L263 TraceCheckUtils]: 97: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,769 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,769 INFO L280 TraceCheckUtils]: 99: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,769 INFO L280 TraceCheckUtils]: 100: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,770 INFO L280 TraceCheckUtils]: 101: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,770 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,771 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,771 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,772 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,772 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,772 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,772 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,772 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,773 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,774 INFO L280 TraceCheckUtils]: 111: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,774 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,775 INFO L280 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,775 INFO L280 TraceCheckUtils]: 114: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,776 INFO L280 TraceCheckUtils]: 115: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,777 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,777 INFO L280 TraceCheckUtils]: 117: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,778 INFO L263 TraceCheckUtils]: 118: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,778 INFO L280 TraceCheckUtils]: 119: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,778 INFO L280 TraceCheckUtils]: 120: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,778 INFO L280 TraceCheckUtils]: 121: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,778 INFO L280 TraceCheckUtils]: 122: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,779 INFO L280 TraceCheckUtils]: 123: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,779 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,780 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,781 INFO L280 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,781 INFO L280 TraceCheckUtils]: 127: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,782 INFO L280 TraceCheckUtils]: 128: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,782 INFO L280 TraceCheckUtils]: 129: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,783 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,784 INFO L280 TraceCheckUtils]: 131: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,784 INFO L263 TraceCheckUtils]: 132: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,784 INFO L280 TraceCheckUtils]: 133: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,785 INFO L280 TraceCheckUtils]: 134: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,785 INFO L280 TraceCheckUtils]: 135: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,785 INFO L263 TraceCheckUtils]: 136: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,785 INFO L280 TraceCheckUtils]: 137: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,785 INFO L280 TraceCheckUtils]: 138: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L280 TraceCheckUtils]: 139: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L280 TraceCheckUtils]: 140: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,786 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,787 INFO L280 TraceCheckUtils]: 150: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,788 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,788 INFO L280 TraceCheckUtils]: 152: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,788 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,788 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,789 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,790 INFO L280 TraceCheckUtils]: 156: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,791 INFO L280 TraceCheckUtils]: 157: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,791 INFO L280 TraceCheckUtils]: 158: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,792 INFO L280 TraceCheckUtils]: 159: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,793 INFO L280 TraceCheckUtils]: 160: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,794 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,795 INFO L280 TraceCheckUtils]: 162: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,795 INFO L263 TraceCheckUtils]: 163: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,796 INFO L280 TraceCheckUtils]: 164: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,796 INFO L280 TraceCheckUtils]: 165: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,797 INFO L280 TraceCheckUtils]: 166: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,798 INFO L280 TraceCheckUtils]: 167: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,798 INFO L280 TraceCheckUtils]: 168: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,800 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-11 00:34:09,800 INFO L280 TraceCheckUtils]: 170: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-11 00:34:09,800 INFO L280 TraceCheckUtils]: 171: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,800 INFO L280 TraceCheckUtils]: 172: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,800 INFO L280 TraceCheckUtils]: 173: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-11 00:34:09,801 INFO L280 TraceCheckUtils]: 174: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-11 00:34:09,801 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,801 INFO L280 TraceCheckUtils]: 176: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,802 INFO L280 TraceCheckUtils]: 177: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,802 INFO L280 TraceCheckUtils]: 178: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,803 INFO L280 TraceCheckUtils]: 179: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,803 INFO L280 TraceCheckUtils]: 180: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,804 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-11 00:34:09,826 INFO L263 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2020-07-11 00:34:09,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,827 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-11 00:34:09,827 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret4 := main(); {3840#true} is VALID [2020-07-11 00:34:09,827 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} ~x~0 := #t~nondet2; {3840#true} is VALID [2020-07-11 00:34:09,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} havoc #t~nondet2; {3840#true} is VALID [2020-07-11 00:34:09,828 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret3 := fibonacci(~x~0); {3840#true} is VALID [2020-07-11 00:34:09,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,829 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,830 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,830 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,830 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,830 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,831 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,831 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,831 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,831 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,831 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,832 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,833 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,833 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,833 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,833 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,833 INFO L263 TraceCheckUtils]: 31: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,834 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,834 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,834 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,834 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,834 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,835 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,835 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,835 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,835 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,835 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,836 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,836 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,836 INFO L263 TraceCheckUtils]: 44: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,836 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,836 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,837 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,837 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,837 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,837 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,837 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,838 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,839 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,840 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,840 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,840 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,840 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,840 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L263 TraceCheckUtils]: 70: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,841 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,842 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,842 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,842 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,842 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L280 TraceCheckUtils]: 79: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L280 TraceCheckUtils]: 80: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,843 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,844 INFO L280 TraceCheckUtils]: 85: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,844 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,845 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,845 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,845 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,846 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,846 INFO L280 TraceCheckUtils]: 91: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,846 INFO L280 TraceCheckUtils]: 92: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,846 INFO L263 TraceCheckUtils]: 93: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,847 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,847 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,848 INFO L280 TraceCheckUtils]: 96: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,848 INFO L263 TraceCheckUtils]: 97: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,848 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,849 INFO L280 TraceCheckUtils]: 99: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,849 INFO L280 TraceCheckUtils]: 100: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,849 INFO L263 TraceCheckUtils]: 101: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,850 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,851 INFO L280 TraceCheckUtils]: 103: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,851 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,851 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,851 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,852 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,852 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,852 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,852 INFO L280 TraceCheckUtils]: 110: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,853 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,853 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,854 INFO L263 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,854 INFO L280 TraceCheckUtils]: 114: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,854 INFO L280 TraceCheckUtils]: 115: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,854 INFO L280 TraceCheckUtils]: 116: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,854 INFO L280 TraceCheckUtils]: 117: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,855 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,856 INFO L280 TraceCheckUtils]: 119: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,856 INFO L280 TraceCheckUtils]: 120: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,857 INFO L280 TraceCheckUtils]: 121: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,857 INFO L280 TraceCheckUtils]: 122: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,858 INFO L280 TraceCheckUtils]: 123: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,859 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,860 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,860 INFO L263 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,860 INFO L280 TraceCheckUtils]: 127: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,860 INFO L280 TraceCheckUtils]: 128: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,861 INFO L280 TraceCheckUtils]: 129: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,861 INFO L280 TraceCheckUtils]: 130: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,861 INFO L280 TraceCheckUtils]: 131: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,862 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,863 INFO L280 TraceCheckUtils]: 133: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,863 INFO L280 TraceCheckUtils]: 134: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,864 INFO L280 TraceCheckUtils]: 135: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,864 INFO L280 TraceCheckUtils]: 136: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,865 INFO L280 TraceCheckUtils]: 137: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,866 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,867 INFO L280 TraceCheckUtils]: 139: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,867 INFO L263 TraceCheckUtils]: 140: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,867 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,867 INFO L280 TraceCheckUtils]: 142: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,867 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-11 00:34:09,868 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-11 00:34:09,868 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,868 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-11 00:34:09,868 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-11 00:34:09,868 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L280 TraceCheckUtils]: 149: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L275 TraceCheckUtils]: 150: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L263 TraceCheckUtils]: 152: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-11 00:34:09,869 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-11 00:34:09,870 INFO L280 TraceCheckUtils]: 155: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-11 00:34:09,870 INFO L280 TraceCheckUtils]: 156: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,870 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-11 00:34:09,870 INFO L280 TraceCheckUtils]: 158: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-11 00:34:09,870 INFO L280 TraceCheckUtils]: 159: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,871 INFO L280 TraceCheckUtils]: 160: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-11 00:34:09,871 INFO L280 TraceCheckUtils]: 161: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-11 00:34:09,871 INFO L280 TraceCheckUtils]: 162: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-11 00:34:09,872 INFO L275 TraceCheckUtils]: 163: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,873 INFO L280 TraceCheckUtils]: 164: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,873 INFO L280 TraceCheckUtils]: 165: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,874 INFO L280 TraceCheckUtils]: 166: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,874 INFO L280 TraceCheckUtils]: 167: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,875 INFO L280 TraceCheckUtils]: 168: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,876 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,877 INFO L280 TraceCheckUtils]: 170: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-11 00:34:09,877 INFO L263 TraceCheckUtils]: 171: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-11 00:34:09,877 INFO L280 TraceCheckUtils]: 172: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,878 INFO L280 TraceCheckUtils]: 173: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,878 INFO L280 TraceCheckUtils]: 174: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,879 INFO L280 TraceCheckUtils]: 175: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,880 INFO L280 TraceCheckUtils]: 176: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:09,881 INFO L275 TraceCheckUtils]: 177: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-11 00:34:09,881 INFO L280 TraceCheckUtils]: 178: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-11 00:34:09,881 INFO L280 TraceCheckUtils]: 179: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,881 INFO L280 TraceCheckUtils]: 180: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-11 00:34:09,882 INFO L280 TraceCheckUtils]: 181: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-11 00:34:09,882 INFO L280 TraceCheckUtils]: 182: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-11 00:34:09,882 INFO L275 TraceCheckUtils]: 183: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,883 INFO L280 TraceCheckUtils]: 184: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,883 INFO L280 TraceCheckUtils]: 185: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,884 INFO L280 TraceCheckUtils]: 186: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,884 INFO L280 TraceCheckUtils]: 187: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,885 INFO L280 TraceCheckUtils]: 188: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:09,886 INFO L275 TraceCheckUtils]: 189: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-11 00:34:09,887 INFO L280 TraceCheckUtils]: 190: Hoare triple {4026#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4026#(<= 6 main_~x~0)} is VALID [2020-07-11 00:34:09,887 INFO L280 TraceCheckUtils]: 191: Hoare triple {4026#(<= 6 main_~x~0)} ~result~0 := #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-11 00:34:09,888 INFO L280 TraceCheckUtils]: 192: Hoare triple {4026#(<= 6 main_~x~0)} havoc #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-11 00:34:09,888 INFO L280 TraceCheckUtils]: 193: Hoare triple {4026#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {3841#false} is VALID [2020-07-11 00:34:09,889 INFO L280 TraceCheckUtils]: 194: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2020-07-11 00:34:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 465 proven. 132 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2020-07-11 00:34:09,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251000793] [2020-07-11 00:34:09,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:09,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:34:09,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700379195] [2020-07-11 00:34:09,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-11 00:34:09,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:09,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:34:10,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:10,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:34:10,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:34:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:10,058 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2020-07-11 00:34:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:10,928 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2020-07-11 00:34:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 00:34:10,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-11 00:34:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-11 00:34:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-11 00:34:10,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2020-07-11 00:34:11,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:11,059 INFO L225 Difference]: With dead ends: 143 [2020-07-11 00:34:11,059 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 00:34:11,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-11 00:34:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 00:34:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-11 00:34:11,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:11,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-11 00:34:11,213 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:34:11,213 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:34:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:11,218 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-11 00:34:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-11 00:34:11,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:11,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:11,219 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:34:11,219 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:34:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:11,233 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-11 00:34:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-11 00:34:11,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:11,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:11,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:11,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:34:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-07-11 00:34:11,237 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 195 [2020-07-11 00:34:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:11,237 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-07-11 00:34:11,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:34:11,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 77 transitions. [2020-07-11 00:34:11,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-11 00:34:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-11 00:34:11,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:11,351 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:11,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 00:34:11,351 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-07-11 00:34:11,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:11,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985063511] [2020-07-11 00:34:11,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:34:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:34:11,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 00:34:11,411 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:103) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement$AtomicTraceElementBuilder.build(AtomicTraceElement.java:308) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createATESequence(IcfgProgramExecution.java:227) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-11 00:34:11,416 INFO L168 Benchmark]: Toolchain (without parser) took 12276.97 ms. Allocated memory was 137.9 MB in the beginning and 381.7 MB in the end (delta: 243.8 MB). Free memory was 99.9 MB in the beginning and 318.9 MB in the end (delta: -219.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,417 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.81 ms. Allocated memory is still 137.9 MB. Free memory was 99.7 MB in the beginning and 89.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,418 INFO L168 Benchmark]: Boogie Preprocessor took 123.28 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 89.7 MB in the beginning and 179.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,419 INFO L168 Benchmark]: RCFGBuilder took 322.10 ms. Allocated memory is still 200.3 MB. Free memory was 179.1 MB in the beginning and 161.2 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,419 INFO L168 Benchmark]: TraceAbstraction took 11490.07 ms. Allocated memory was 200.3 MB in the beginning and 381.7 MB in the end (delta: 181.4 MB). Free memory was 160.5 MB in the beginning and 318.9 MB in the end (delta: -158.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,422 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 137.9 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.81 ms. Allocated memory is still 137.9 MB. Free memory was 99.7 MB in the beginning and 89.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.28 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 89.7 MB in the beginning and 179.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.10 ms. Allocated memory is still 200.3 MB. Free memory was 179.1 MB in the beginning and 161.2 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11490.07 ms. Allocated memory was 200.3 MB in the beginning and 381.7 MB in the end (delta: 181.4 MB). Free memory was 160.5 MB in the beginning and 318.9 MB in the end (delta: -158.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;: de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...