/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/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:53,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:53,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:53,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:53,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:53,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:53,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:53,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:53,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:53,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:53,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:53,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:53,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:53,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:53,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:53,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:53,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:53,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:53,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:53,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:53,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:53,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:53,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:53,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:53,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:53,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:53,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:53,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:53,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:53,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:53,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:53,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:53,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:53,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:53,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:53,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:53,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:53,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:53,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:53,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:53,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:53,601 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:53,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:53,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:53,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:53,619 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:53,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:53,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:53,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:53,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:53,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:53,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:53,621 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:53,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:53,622 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:53,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:53,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:53,625 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:53,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:53,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:53,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:53,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:53,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:53,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:53,626 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:53,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:53,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:53,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:53,945 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:53,946 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:53,946 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-11 00:33:54,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034eaf533/fbb6c26949374e47baf4855bcf7ae039/FLAG6cd228e44 [2020-07-11 00:33:54,499 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:54,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-11 00:33:54,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034eaf533/fbb6c26949374e47baf4855bcf7ae039/FLAG6cd228e44 [2020-07-11 00:33:54,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/034eaf533/fbb6c26949374e47baf4855bcf7ae039 [2020-07-11 00:33:54,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:54,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:54,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:54,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:54,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:54,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:54" (1/1) ... [2020-07-11 00:33:54,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e11b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:54, skipping insertion in model container [2020-07-11 00:33:54,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:54" (1/1) ... [2020-07-11 00:33:54,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:54,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:55,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:55,170 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:55,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:55,201 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:55,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:55 WrapperNode [2020-07-11 00:33:55,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:55,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:55,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:55,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:55,212 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:55" (1/1) ... [2020-07-11 00:33:55,213 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:55" (1/1) ... [2020-07-11 00:33:55,217 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:55" (1/1) ... [2020-07-11 00:33:55,217 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:55" (1/1) ... [2020-07-11 00:33:55,221 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:55" (1/1) ... [2020-07-11 00:33:55,223 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:55" (1/1) ... [2020-07-11 00:33:55,224 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:55" (1/1) ... [2020-07-11 00:33:55,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:55,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:55,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:55,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:55,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:55" (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:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-11 00:33:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:33:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-11 00:33:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:55,650 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:55,650 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:33:55,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:55 BoogieIcfgContainer [2020-07-11 00:33:55,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:55,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:55,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:55,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:55,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:54" (1/3) ... [2020-07-11 00:33:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:55, skipping insertion in model container [2020-07-11 00:33:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:55" (2/3) ... [2020-07-11 00:33:55,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:55, skipping insertion in model container [2020-07-11 00:33:55,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:55" (3/3) ... [2020-07-11 00:33:55,662 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-07-11 00:33:55,674 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:55,682 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:55,697 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:55,722 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:55,722 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:55,722 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:55,722 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:55,722 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:55,722 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:55,723 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:55,723 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-11 00:33:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 00:33:55,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:55,753 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:33:55,754 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-07-11 00:33:55,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:55,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224513203] [2020-07-11 00:33:55,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:55,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-11 00:33:55,999 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-11 00:33:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:56,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~n := #in~n; {49#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:56,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {50#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:56,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#(<= |fibonacci_#in~n| 0)} #res := 0; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:56,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:56,089 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} {38#true} #53#return; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:56,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2020-07-11 00:33:56,090 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-11 00:33:56,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #49#return; {38#true} is VALID [2020-07-11 00:33:56,091 INFO L263 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret4 := main(); {38#true} is VALID [2020-07-11 00:33:56,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {38#true} is VALID [2020-07-11 00:33:56,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} ~x~0 := #t~nondet2; {38#true} is VALID [2020-07-11 00:33:56,092 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} havoc #t~nondet2; {38#true} is VALID [2020-07-11 00:33:56,093 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {38#true} is VALID [2020-07-11 00:33:56,093 INFO L263 TraceCheckUtils]: 8: Hoare triple {38#true} call #t~ret3 := fibonacci(~x~0); {38#true} is VALID [2020-07-11 00:33:56,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} ~n := #in~n; {49#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:56,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {49#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {50#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:56,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#(<= |fibonacci_#in~n| 0)} #res := 0; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:56,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:56,103 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {51#(<= |fibonacci_#in~n| |fibonacci_#res|)} {38#true} #53#return; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:56,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {47#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:56,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#(<= main_~x~0 |main_#t~ret3|)} ~result~0 := #t~ret3; {48#(<= main_~x~0 main_~result~0)} is VALID [2020-07-11 00:33:56,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#(<= main_~x~0 main_~result~0)} havoc #t~ret3; {48#(<= main_~x~0 main_~result~0)} is VALID [2020-07-11 00:33:56,112 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {39#false} is VALID [2020-07-11 00:33:56,112 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-11 00:33:56,115 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:33:56,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224513203] [2020-07-11 00:33:56,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:56,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:33:56,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696760260] [2020-07-11 00:33:56,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-11 00:33:56,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:56,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:33:56,179 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:33:56,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:33:56,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:33:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:56,193 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 7 states. [2020-07-11 00:33:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:56,763 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-11 00:33:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:33:56,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-11 00:33:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-11 00:33:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-11 00:33:56,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-11 00:33:56,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:56,876 INFO L225 Difference]: With dead ends: 50 [2020-07-11 00:33:56,877 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 00:33:56,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:33:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 00:33:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-11 00:33:56,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:56,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-11 00:33:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-11 00:33:56,966 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-11 00:33:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:56,982 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-11 00:33:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-11 00:33:56,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:56,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:56,984 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-11 00:33:56,984 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-11 00:33:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:56,990 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-11 00:33:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-11 00:33:56,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:56,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:56,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:56,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-11 00:33:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-11 00:33:56,998 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-07-11 00:33:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:56,999 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-11 00:33:56,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:33:56,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-11 00:33:57,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-11 00:33:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 00:33:57,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:57,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:57,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:57,046 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-07-11 00:33:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:57,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544926338] [2020-07-11 00:33:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-11 00:33:57,101 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {284#true} {284#true} #49#return; {284#true} is VALID [2020-07-11 00:33:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#true} ~n := #in~n; {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {297#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:33:57,157 INFO L280 TraceCheckUtils]: 3: Hoare triple {297#(<= |fibonacci_#in~n| 1)} #res := 1; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:57,158 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:57,159 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} {284#true} #53#return; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:57,160 INFO L263 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2020-07-11 00:33:57,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-11 00:33:57,161 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #49#return; {284#true} is VALID [2020-07-11 00:33:57,161 INFO L263 TraceCheckUtils]: 3: Hoare triple {284#true} call #t~ret4 := main(); {284#true} is VALID [2020-07-11 00:33:57,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {284#true} is VALID [2020-07-11 00:33:57,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {284#true} ~x~0 := #t~nondet2; {284#true} is VALID [2020-07-11 00:33:57,162 INFO L280 TraceCheckUtils]: 6: Hoare triple {284#true} havoc #t~nondet2; {284#true} is VALID [2020-07-11 00:33:57,162 INFO L280 TraceCheckUtils]: 7: Hoare triple {284#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {284#true} is VALID [2020-07-11 00:33:57,162 INFO L263 TraceCheckUtils]: 8: Hoare triple {284#true} call #t~ret3 := fibonacci(~x~0); {284#true} is VALID [2020-07-11 00:33:57,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {284#true} ~n := #in~n; {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,164 INFO L280 TraceCheckUtils]: 10: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {297#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:33:57,166 INFO L280 TraceCheckUtils]: 12: Hoare triple {297#(<= |fibonacci_#in~n| 1)} #res := 1; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:57,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:57,168 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {298#(<= |fibonacci_#in~n| |fibonacci_#res|)} {284#true} #53#return; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:57,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {294#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {294#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-11 00:33:57,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {294#(<= main_~x~0 |main_#t~ret3|)} ~result~0 := #t~ret3; {295#(<= main_~x~0 main_~result~0)} is VALID [2020-07-11 00:33:57,171 INFO L280 TraceCheckUtils]: 17: Hoare triple {295#(<= main_~x~0 main_~result~0)} havoc #t~ret3; {295#(<= main_~x~0 main_~result~0)} is VALID [2020-07-11 00:33:57,172 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {285#false} is VALID [2020-07-11 00:33:57,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2020-07-11 00:33:57,174 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:33:57,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544926338] [2020-07-11 00:33:57,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:57,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:33:57,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160439258] [2020-07-11 00:33:57,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-11 00:33:57,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:57,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:33:57,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:57,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:33:57,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:33:57,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:33:57,203 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2020-07-11 00:33:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:57,624 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-11 00:33:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:33:57,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-11 00:33:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-11 00:33:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:33:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-11 00:33:57,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-11 00:33:57,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:57,707 INFO L225 Difference]: With dead ends: 39 [2020-07-11 00:33:57,707 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 00:33:57,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:33:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 00:33:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-11 00:33:57,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:57,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2020-07-11 00:33:57,745 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2020-07-11 00:33:57,746 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2020-07-11 00:33:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:57,750 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-11 00:33:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-11 00:33:57,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:57,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:57,752 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2020-07-11 00:33:57,752 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2020-07-11 00:33:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:57,756 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-11 00:33:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-11 00:33:57,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:57,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:57,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:57,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-11 00:33:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-11 00:33:57,761 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-07-11 00:33:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:57,761 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-11 00:33:57,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:33:57,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-11 00:33:57,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-11 00:33:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 00:33:57,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:57,812 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:57,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:57,813 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-07-11 00:33:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:57,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026860018] [2020-07-11 00:33:57,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-11 00:33:57,871 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {513#true} {513#true} #49#return; {513#true} is VALID [2020-07-11 00:33:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,968 INFO L280 TraceCheckUtils]: 3: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,969 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-11 00:33:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:57,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-11 00:33:57,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-11 00:33:57,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-11 00:33:57,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-11 00:33:57,982 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-11 00:33:57,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-11 00:33:57,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume !(~n < 1); {539#(< 0 fibonacci_~n)} is VALID [2020-07-11 00:33:57,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {539#(< 0 fibonacci_~n)} assume !(1 == ~n); {540#(< 1 fibonacci_~n)} is VALID [2020-07-11 00:33:57,986 INFO L263 TraceCheckUtils]: 3: Hoare triple {540#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {513#true} is VALID [2020-07-11 00:33:57,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:57,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:57,990 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-11 00:33:57,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#false} is VALID [2020-07-11 00:33:57,991 INFO L263 TraceCheckUtils]: 10: Hoare triple {514#false} call #t~ret1 := fibonacci(~n - 2); {513#true} is VALID [2020-07-11 00:33:57,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-11 00:33:57,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-11 00:33:57,992 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-11 00:33:57,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-11 00:33:57,992 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-11 00:33:57,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {514#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {514#false} is VALID [2020-07-11 00:33:57,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {514#false} #res := #t~ret0 + #t~ret1; {514#false} is VALID [2020-07-11 00:33:57,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {514#false} havoc #t~ret1; {514#false} is VALID [2020-07-11 00:33:57,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {514#false} havoc #t~ret0; {514#false} is VALID [2020-07-11 00:33:57,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {514#false} assume true; {514#false} is VALID [2020-07-11 00:33:57,994 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {514#false} {513#true} #53#return; {514#false} is VALID [2020-07-11 00:33:57,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2020-07-11 00:33:57,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-11 00:33:57,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {513#true} {513#true} #49#return; {513#true} is VALID [2020-07-11 00:33:57,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {513#true} call #t~ret4 := main(); {513#true} is VALID [2020-07-11 00:33:57,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {513#true} is VALID [2020-07-11 00:33:57,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {513#true} ~x~0 := #t~nondet2; {513#true} is VALID [2020-07-11 00:33:58,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {513#true} havoc #t~nondet2; {513#true} is VALID [2020-07-11 00:33:58,006 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {513#true} is VALID [2020-07-11 00:33:58,006 INFO L263 TraceCheckUtils]: 8: Hoare triple {513#true} call #t~ret3 := fibonacci(~x~0); {513#true} is VALID [2020-07-11 00:33:58,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-11 00:33:58,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#true} assume !(~n < 1); {539#(< 0 fibonacci_~n)} is VALID [2020-07-11 00:33:58,010 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(< 0 fibonacci_~n)} assume !(1 == ~n); {540#(< 1 fibonacci_~n)} is VALID [2020-07-11 00:33:58,011 INFO L263 TraceCheckUtils]: 12: Hoare triple {540#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {513#true} is VALID [2020-07-11 00:33:58,011 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#true} ~n := #in~n; {551#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,012 INFO L280 TraceCheckUtils]: 14: Hoare triple {551#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:58,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {552#(<= |fibonacci_#in~n| 0)} #res := 0; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:58,017 INFO L280 TraceCheckUtils]: 16: Hoare triple {552#(<= |fibonacci_#in~n| 0)} assume true; {552#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:33:58,019 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {552#(<= |fibonacci_#in~n| 0)} {540#(< 1 fibonacci_~n)} #45#return; {514#false} is VALID [2020-07-11 00:33:58,019 INFO L280 TraceCheckUtils]: 18: Hoare triple {514#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#false} is VALID [2020-07-11 00:33:58,019 INFO L263 TraceCheckUtils]: 19: Hoare triple {514#false} call #t~ret1 := fibonacci(~n - 2); {513#true} is VALID [2020-07-11 00:33:58,020 INFO L280 TraceCheckUtils]: 20: Hoare triple {513#true} ~n := #in~n; {513#true} is VALID [2020-07-11 00:33:58,020 INFO L280 TraceCheckUtils]: 21: Hoare triple {513#true} assume ~n < 1; {513#true} is VALID [2020-07-11 00:33:58,020 INFO L280 TraceCheckUtils]: 22: Hoare triple {513#true} #res := 0; {513#true} is VALID [2020-07-11 00:33:58,020 INFO L280 TraceCheckUtils]: 23: Hoare triple {513#true} assume true; {513#true} is VALID [2020-07-11 00:33:58,020 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {513#true} {514#false} #47#return; {514#false} is VALID [2020-07-11 00:33:58,021 INFO L280 TraceCheckUtils]: 25: Hoare triple {514#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {514#false} is VALID [2020-07-11 00:33:58,021 INFO L280 TraceCheckUtils]: 26: Hoare triple {514#false} #res := #t~ret0 + #t~ret1; {514#false} is VALID [2020-07-11 00:33:58,021 INFO L280 TraceCheckUtils]: 27: Hoare triple {514#false} havoc #t~ret1; {514#false} is VALID [2020-07-11 00:33:58,021 INFO L280 TraceCheckUtils]: 28: Hoare triple {514#false} havoc #t~ret0; {514#false} is VALID [2020-07-11 00:33:58,021 INFO L280 TraceCheckUtils]: 29: Hoare triple {514#false} assume true; {514#false} is VALID [2020-07-11 00:33:58,022 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {514#false} {513#true} #53#return; {514#false} is VALID [2020-07-11 00:33:58,022 INFO L280 TraceCheckUtils]: 31: Hoare triple {514#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {514#false} is VALID [2020-07-11 00:33:58,022 INFO L280 TraceCheckUtils]: 32: Hoare triple {514#false} ~result~0 := #t~ret3; {514#false} is VALID [2020-07-11 00:33:58,023 INFO L280 TraceCheckUtils]: 33: Hoare triple {514#false} havoc #t~ret3; {514#false} is VALID [2020-07-11 00:33:58,023 INFO L280 TraceCheckUtils]: 34: Hoare triple {514#false} assume !(~result~0 >= ~x~0 - 1); {514#false} is VALID [2020-07-11 00:33:58,023 INFO L280 TraceCheckUtils]: 35: Hoare triple {514#false} assume !false; {514#false} is VALID [2020-07-11 00:33:58,025 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:33:58,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026860018] [2020-07-11 00:33:58,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:58,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:33:58,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631205729] [2020-07-11 00:33:58,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-11 00:33:58,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:58,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:58,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:58,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:58,072 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-07-11 00:33:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,343 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-07-11 00:33:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:58,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-11 00:33:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-11 00:33:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-11 00:33:58,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-11 00:33:58,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:58,461 INFO L225 Difference]: With dead ends: 55 [2020-07-11 00:33:58,461 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 00:33:58,462 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:33:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 00:33:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-11 00:33:58,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:58,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-11 00:33:58,524 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:33:58,524 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:33:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,527 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-11 00:33:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-11 00:33:58,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:58,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:58,529 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-11 00:33:58,529 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-11 00:33:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:58,532 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-11 00:33:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-11 00:33:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:58,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:58,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:58,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 00:33:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-11 00:33:58,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-07-11 00:33:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:58,537 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-11 00:33:58,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:58,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-11 00:33:58,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-11 00:33:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 00:33:58,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:58,587 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:58,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:58,588 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-07-11 00:33:58,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:58,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618427250] [2020-07-11 00:33:58,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-11 00:33:58,669 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {805#true} {805#true} #49#return; {805#true} is VALID [2020-07-11 00:33:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:33:58,794 INFO L280 TraceCheckUtils]: 3: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,796 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:58,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-11 00:33:58,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-11 00:33:58,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,835 INFO L280 TraceCheckUtils]: 3: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,837 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,846 INFO L263 TraceCheckUtils]: 3: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {805#true} is VALID [2020-07-11 00:33:58,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:33:58,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,854 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,856 INFO L263 TraceCheckUtils]: 11: Hoare triple {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {805#true} is VALID [2020-07-11 00:33:58,857 INFO L280 TraceCheckUtils]: 12: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-11 00:33:58,857 INFO L280 TraceCheckUtils]: 13: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-11 00:33:58,859 INFO L280 TraceCheckUtils]: 14: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,859 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,861 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,861 INFO L280 TraceCheckUtils]: 17: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,862 INFO L280 TraceCheckUtils]: 18: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,864 INFO L280 TraceCheckUtils]: 19: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,864 INFO L280 TraceCheckUtils]: 20: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,865 INFO L280 TraceCheckUtils]: 21: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,866 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {805#true} #53#return; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:33:58,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2020-07-11 00:33:58,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-11 00:33:58,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {805#true} {805#true} #49#return; {805#true} is VALID [2020-07-11 00:33:58,869 INFO L263 TraceCheckUtils]: 3: Hoare triple {805#true} call #t~ret4 := main(); {805#true} is VALID [2020-07-11 00:33:58,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {805#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {805#true} is VALID [2020-07-11 00:33:58,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} ~x~0 := #t~nondet2; {805#true} is VALID [2020-07-11 00:33:58,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {805#true} havoc #t~nondet2; {805#true} is VALID [2020-07-11 00:33:58,871 INFO L280 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {805#true} is VALID [2020-07-11 00:33:58,871 INFO L263 TraceCheckUtils]: 8: Hoare triple {805#true} call #t~ret3 := fibonacci(~x~0); {805#true} is VALID [2020-07-11 00:33:58,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,874 INFO L280 TraceCheckUtils]: 11: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,874 INFO L263 TraceCheckUtils]: 12: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {805#true} is VALID [2020-07-11 00:33:58,875 INFO L280 TraceCheckUtils]: 13: Hoare triple {805#true} ~n := #in~n; {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {834#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:33:58,876 INFO L280 TraceCheckUtils]: 15: Hoare triple {834#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {849#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:33:58,877 INFO L280 TraceCheckUtils]: 16: Hoare triple {849#(<= |fibonacci_#in~n| 1)} #res := 1; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,878 INFO L280 TraceCheckUtils]: 17: Hoare triple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,879 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {850#(<= |fibonacci_#in~n| |fibonacci_#res|)} {834#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,880 INFO L280 TraceCheckUtils]: 19: Hoare triple {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,880 INFO L263 TraceCheckUtils]: 20: Hoare triple {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {805#true} is VALID [2020-07-11 00:33:58,880 INFO L280 TraceCheckUtils]: 21: Hoare triple {805#true} ~n := #in~n; {805#true} is VALID [2020-07-11 00:33:58,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {805#true} assume ~n < 1; {805#true} is VALID [2020-07-11 00:33:58,881 INFO L280 TraceCheckUtils]: 23: Hoare triple {805#true} #res := 0; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {851#(<= 0 |fibonacci_#res|)} assume true; {851#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:33:58,884 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {851#(<= 0 |fibonacci_#res|)} {841#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,885 INFO L280 TraceCheckUtils]: 26: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:33:58,886 INFO L280 TraceCheckUtils]: 27: Hoare triple {847#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:33:58,890 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {848#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {805#true} #53#return; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:33:58,890 INFO L280 TraceCheckUtils]: 32: Hoare triple {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:33:58,891 INFO L280 TraceCheckUtils]: 33: Hoare triple {832#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {833#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:33:58,892 INFO L280 TraceCheckUtils]: 34: Hoare triple {833#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {833#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:33:58,893 INFO L280 TraceCheckUtils]: 35: Hoare triple {833#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {806#false} is VALID [2020-07-11 00:33:58,893 INFO L280 TraceCheckUtils]: 36: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-11 00:33:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-11 00:33:58,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618427250] [2020-07-11 00:33:58,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:33:58,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 00:33:58,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105120590] [2020-07-11 00:33:58,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-11 00:33:58,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:58,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:33:58,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:33:58,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:33:58,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:33:58,946 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 11 states. [2020-07-11 00:33:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:59,771 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-07-11 00:33:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 00:33:59,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-11 00:33:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:33:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-11 00:33:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:33:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2020-07-11 00:33:59,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2020-07-11 00:33:59,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:59,857 INFO L225 Difference]: With dead ends: 51 [2020-07-11 00:33:59,858 INFO L226 Difference]: Without dead ends: 45 [2020-07-11 00:33:59,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:33:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-11 00:33:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-11 00:33:59,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:59,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-11 00:33:59,918 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-11 00:33:59,919 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-11 00:33:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:59,924 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-11 00:33:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-11 00:33:59,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:59,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:59,925 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-11 00:33:59,925 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-11 00:33:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:59,929 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-11 00:33:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-11 00:33:59,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:59,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:59,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:59,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 00:33:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-07-11 00:33:59,933 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2020-07-11 00:33:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:59,933 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-11 00:33:59,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:33:59,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2020-07-11 00:34:00,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-07-11 00:34:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 00:34:00,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:00,006 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:00,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:34:00,006 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1985616609, now seen corresponding path program 1 times [2020-07-11 00:34:00,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:00,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324850286] [2020-07-11 00:34:00,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,080 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1147#true} {1147#true} #49#return; {1147#true} is VALID [2020-07-11 00:34:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,163 INFO L280 TraceCheckUtils]: 2: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,163 INFO L280 TraceCheckUtils]: 3: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} #res := 1; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,164 INFO L280 TraceCheckUtils]: 4: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} assume true; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,165 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1225#(<= |fibonacci_#in~n| 1)} {1147#true} #45#return; {1199#(<= fibonacci_~n 2)} is VALID [2020-07-11 00:34:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,206 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,208 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #45#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:00,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,215 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,216 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #47#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,219 INFO L263 TraceCheckUtils]: 3: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1147#true} is VALID [2020-07-11 00:34:00,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,222 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #45#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,223 INFO L263 TraceCheckUtils]: 11: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1147#true} is VALID [2020-07-11 00:34:00,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,223 INFO L280 TraceCheckUtils]: 13: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,224 INFO L280 TraceCheckUtils]: 14: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,224 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,226 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #47#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,226 INFO L280 TraceCheckUtils]: 18: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,228 INFO L280 TraceCheckUtils]: 21: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume true; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,230 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1226#(<= 1 |fibonacci_#in~n|)} {1199#(<= fibonacci_~n 2)} #47#return; {1148#false} is VALID [2020-07-11 00:34:00,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,232 INFO L280 TraceCheckUtils]: 2: Hoare triple {1147#true} assume !(1 == ~n); {1147#true} is VALID [2020-07-11 00:34:00,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {1147#true} call #t~ret0 := fibonacci(~n - 1); {1147#true} is VALID [2020-07-11 00:34:00,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,234 INFO L280 TraceCheckUtils]: 6: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} #res := 1; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} assume true; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,237 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1225#(<= |fibonacci_#in~n| 1)} {1147#true} #45#return; {1199#(<= fibonacci_~n 2)} is VALID [2020-07-11 00:34:00,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {1199#(<= fibonacci_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1199#(<= fibonacci_~n 2)} is VALID [2020-07-11 00:34:00,239 INFO L263 TraceCheckUtils]: 11: Hoare triple {1199#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {1147#true} is VALID [2020-07-11 00:34:00,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,241 INFO L263 TraceCheckUtils]: 15: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1147#true} is VALID [2020-07-11 00:34:00,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,242 INFO L280 TraceCheckUtils]: 17: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,243 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #45#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,244 INFO L280 TraceCheckUtils]: 22: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,245 INFO L263 TraceCheckUtils]: 23: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1147#true} is VALID [2020-07-11 00:34:00,245 INFO L280 TraceCheckUtils]: 24: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,245 INFO L280 TraceCheckUtils]: 25: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,246 INFO L280 TraceCheckUtils]: 26: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,246 INFO L280 TraceCheckUtils]: 28: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,247 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #47#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,249 INFO L280 TraceCheckUtils]: 31: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,250 INFO L280 TraceCheckUtils]: 32: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,250 INFO L280 TraceCheckUtils]: 33: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,251 INFO L280 TraceCheckUtils]: 34: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume true; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,253 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1226#(<= 1 |fibonacci_#in~n|)} {1199#(<= fibonacci_~n 2)} #47#return; {1148#false} is VALID [2020-07-11 00:34:00,253 INFO L280 TraceCheckUtils]: 36: Hoare triple {1148#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1148#false} is VALID [2020-07-11 00:34:00,254 INFO L280 TraceCheckUtils]: 37: Hoare triple {1148#false} #res := #t~ret0 + #t~ret1; {1148#false} is VALID [2020-07-11 00:34:00,254 INFO L280 TraceCheckUtils]: 38: Hoare triple {1148#false} havoc #t~ret1; {1148#false} is VALID [2020-07-11 00:34:00,254 INFO L280 TraceCheckUtils]: 39: Hoare triple {1148#false} havoc #t~ret0; {1148#false} is VALID [2020-07-11 00:34:00,254 INFO L280 TraceCheckUtils]: 40: Hoare triple {1148#false} assume true; {1148#false} is VALID [2020-07-11 00:34:00,255 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1148#false} {1147#true} #53#return; {1148#false} is VALID [2020-07-11 00:34:00,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2020-07-11 00:34:00,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1147#true} {1147#true} #49#return; {1147#true} is VALID [2020-07-11 00:34:00,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {1147#true} call #t~ret4 := main(); {1147#true} is VALID [2020-07-11 00:34:00,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {1147#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1147#true} is VALID [2020-07-11 00:34:00,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {1147#true} ~x~0 := #t~nondet2; {1147#true} is VALID [2020-07-11 00:34:00,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {1147#true} havoc #t~nondet2; {1147#true} is VALID [2020-07-11 00:34:00,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {1147#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1147#true} is VALID [2020-07-11 00:34:00,259 INFO L263 TraceCheckUtils]: 8: Hoare triple {1147#true} call #t~ret3 := fibonacci(~x~0); {1147#true} is VALID [2020-07-11 00:34:00,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {1147#true} assume !(1 == ~n); {1147#true} is VALID [2020-07-11 00:34:00,260 INFO L263 TraceCheckUtils]: 12: Hoare triple {1147#true} call #t~ret0 := fibonacci(~n - 1); {1147#true} is VALID [2020-07-11 00:34:00,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} #res := 1; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {1225#(<= |fibonacci_#in~n| 1)} assume true; {1225#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:00,265 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1225#(<= |fibonacci_#in~n| 1)} {1147#true} #45#return; {1199#(<= fibonacci_~n 2)} is VALID [2020-07-11 00:34:00,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {1199#(<= fibonacci_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1199#(<= fibonacci_~n 2)} is VALID [2020-07-11 00:34:00,266 INFO L263 TraceCheckUtils]: 20: Hoare triple {1199#(<= fibonacci_~n 2)} call #t~ret1 := fibonacci(~n - 2); {1147#true} is VALID [2020-07-11 00:34:00,266 INFO L280 TraceCheckUtils]: 21: Hoare triple {1147#true} ~n := #in~n; {1224#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {1224#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,268 INFO L280 TraceCheckUtils]: 23: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,268 INFO L263 TraceCheckUtils]: 24: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1147#true} is VALID [2020-07-11 00:34:00,268 INFO L280 TraceCheckUtils]: 25: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,268 INFO L280 TraceCheckUtils]: 26: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,269 INFO L280 TraceCheckUtils]: 27: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,269 INFO L280 TraceCheckUtils]: 28: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,269 INFO L280 TraceCheckUtils]: 29: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,270 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #45#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,271 INFO L280 TraceCheckUtils]: 31: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,271 INFO L263 TraceCheckUtils]: 32: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1147#true} is VALID [2020-07-11 00:34:00,271 INFO L280 TraceCheckUtils]: 33: Hoare triple {1147#true} ~n := #in~n; {1147#true} is VALID [2020-07-11 00:34:00,271 INFO L280 TraceCheckUtils]: 34: Hoare triple {1147#true} assume !(~n < 1); {1147#true} is VALID [2020-07-11 00:34:00,272 INFO L280 TraceCheckUtils]: 35: Hoare triple {1147#true} assume 1 == ~n; {1147#true} is VALID [2020-07-11 00:34:00,272 INFO L280 TraceCheckUtils]: 36: Hoare triple {1147#true} #res := 1; {1147#true} is VALID [2020-07-11 00:34:00,272 INFO L280 TraceCheckUtils]: 37: Hoare triple {1147#true} assume true; {1147#true} is VALID [2020-07-11 00:34:00,273 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1147#true} {1226#(<= 1 |fibonacci_#in~n|)} #47#return; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,274 INFO L280 TraceCheckUtils]: 39: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,274 INFO L280 TraceCheckUtils]: 40: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,275 INFO L280 TraceCheckUtils]: 41: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,276 INFO L280 TraceCheckUtils]: 42: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,276 INFO L280 TraceCheckUtils]: 43: Hoare triple {1226#(<= 1 |fibonacci_#in~n|)} assume true; {1226#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:00,278 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1226#(<= 1 |fibonacci_#in~n|)} {1199#(<= fibonacci_~n 2)} #47#return; {1148#false} is VALID [2020-07-11 00:34:00,278 INFO L280 TraceCheckUtils]: 45: Hoare triple {1148#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1148#false} is VALID [2020-07-11 00:34:00,278 INFO L280 TraceCheckUtils]: 46: Hoare triple {1148#false} #res := #t~ret0 + #t~ret1; {1148#false} is VALID [2020-07-11 00:34:00,278 INFO L280 TraceCheckUtils]: 47: Hoare triple {1148#false} havoc #t~ret1; {1148#false} is VALID [2020-07-11 00:34:00,279 INFO L280 TraceCheckUtils]: 48: Hoare triple {1148#false} havoc #t~ret0; {1148#false} is VALID [2020-07-11 00:34:00,279 INFO L280 TraceCheckUtils]: 49: Hoare triple {1148#false} assume true; {1148#false} is VALID [2020-07-11 00:34:00,279 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1148#false} {1147#true} #53#return; {1148#false} is VALID [2020-07-11 00:34:00,279 INFO L280 TraceCheckUtils]: 51: Hoare triple {1148#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1148#false} is VALID [2020-07-11 00:34:00,280 INFO L280 TraceCheckUtils]: 52: Hoare triple {1148#false} ~result~0 := #t~ret3; {1148#false} is VALID [2020-07-11 00:34:00,280 INFO L280 TraceCheckUtils]: 53: Hoare triple {1148#false} havoc #t~ret3; {1148#false} is VALID [2020-07-11 00:34:00,280 INFO L280 TraceCheckUtils]: 54: Hoare triple {1148#false} assume !(~result~0 >= ~x~0 - 1); {1148#false} is VALID [2020-07-11 00:34:00,280 INFO L280 TraceCheckUtils]: 55: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2020-07-11 00:34:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-11 00:34:00,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324850286] [2020-07-11 00:34:00,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:00,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:34:00,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155840720] [2020-07-11 00:34:00,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-07-11 00:34:00,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:00,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:34:00,336 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:00,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:34:00,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:00,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:34:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:00,337 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 6 states. [2020-07-11 00:34:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:00,759 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2020-07-11 00:34:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:34:00,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-07-11 00:34:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-11 00:34:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:34:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-11 00:34:00,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-11 00:34:00,873 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:00,876 INFO L225 Difference]: With dead ends: 76 [2020-07-11 00:34:00,876 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 00:34:00,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 00:34:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-11 00:34:00,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:00,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:00,963 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:00,963 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:00,967 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-11 00:34:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-11 00:34:00,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:00,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:00,968 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:00,968 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:00,971 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-07-11 00:34:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-11 00:34:00,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:00,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:00,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:00,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 00:34:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-11 00:34:00,975 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 56 [2020-07-11 00:34:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:00,976 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-11 00:34:00,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:34:00,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2020-07-11 00:34:01,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-11 00:34:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 00:34:01,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:01,035 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:01,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:34:01,035 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-07-11 00:34:01,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:01,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395779782] [2020-07-11 00:34:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,065 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1576#true} {1576#true} #49#return; {1576#true} is VALID [2020-07-11 00:34:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {1576#true} assume 1 == ~n; {1576#true} is VALID [2020-07-11 00:34:01,144 INFO L280 TraceCheckUtils]: 3: Hoare triple {1576#true} #res := 1; {1576#true} is VALID [2020-07-11 00:34:01,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,146 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #45#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {1576#true} assume ~n < 1; {1576#true} is VALID [2020-07-11 00:34:01,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {1576#true} #res := 0; {1576#true} is VALID [2020-07-11 00:34:01,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,152 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #47#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:01,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,156 INFO L263 TraceCheckUtils]: 3: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1576#true} is VALID [2020-07-11 00:34:01,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {1576#true} assume 1 == ~n; {1576#true} is VALID [2020-07-11 00:34:01,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {1576#true} #res := 1; {1576#true} is VALID [2020-07-11 00:34:01,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,158 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #45#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,159 INFO L263 TraceCheckUtils]: 11: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1576#true} is VALID [2020-07-11 00:34:01,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {1576#true} assume ~n < 1; {1576#true} is VALID [2020-07-11 00:34:01,160 INFO L280 TraceCheckUtils]: 14: Hoare triple {1576#true} #res := 0; {1576#true} is VALID [2020-07-11 00:34:01,160 INFO L280 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,161 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #47#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,162 INFO L280 TraceCheckUtils]: 17: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,162 INFO L280 TraceCheckUtils]: 18: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,163 INFO L280 TraceCheckUtils]: 19: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,164 INFO L280 TraceCheckUtils]: 21: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume true; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,166 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1651#(<= 2 |fibonacci_#in~n|)} {1576#true} #45#return; {1643#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} #res := 0; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} assume true; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,194 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1663#(<= |fibonacci_#in~n| 0)} {1643#(<= 3 fibonacci_~n)} #47#return; {1577#false} is VALID [2020-07-11 00:34:01,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {1576#true} assume !(1 == ~n); {1576#true} is VALID [2020-07-11 00:34:01,195 INFO L263 TraceCheckUtils]: 3: Hoare triple {1576#true} call #t~ret0 := fibonacci(~n - 1); {1576#true} is VALID [2020-07-11 00:34:01,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:01,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,197 INFO L263 TraceCheckUtils]: 7: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1576#true} is VALID [2020-07-11 00:34:01,198 INFO L280 TraceCheckUtils]: 8: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,198 INFO L280 TraceCheckUtils]: 10: Hoare triple {1576#true} assume 1 == ~n; {1576#true} is VALID [2020-07-11 00:34:01,198 INFO L280 TraceCheckUtils]: 11: Hoare triple {1576#true} #res := 1; {1576#true} is VALID [2020-07-11 00:34:01,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,200 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #45#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,200 INFO L263 TraceCheckUtils]: 15: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1576#true} is VALID [2020-07-11 00:34:01,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {1576#true} assume ~n < 1; {1576#true} is VALID [2020-07-11 00:34:01,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {1576#true} #res := 0; {1576#true} is VALID [2020-07-11 00:34:01,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,202 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #47#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,204 INFO L280 TraceCheckUtils]: 22: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,204 INFO L280 TraceCheckUtils]: 23: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,205 INFO L280 TraceCheckUtils]: 24: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,205 INFO L280 TraceCheckUtils]: 25: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume true; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,207 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1651#(<= 2 |fibonacci_#in~n|)} {1576#true} #45#return; {1643#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:01,207 INFO L280 TraceCheckUtils]: 27: Hoare triple {1643#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1643#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:01,208 INFO L263 TraceCheckUtils]: 28: Hoare triple {1643#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1576#true} is VALID [2020-07-11 00:34:01,208 INFO L280 TraceCheckUtils]: 29: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,209 INFO L280 TraceCheckUtils]: 30: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,210 INFO L280 TraceCheckUtils]: 31: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} #res := 0; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,210 INFO L280 TraceCheckUtils]: 32: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} assume true; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,211 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1663#(<= |fibonacci_#in~n| 0)} {1643#(<= 3 fibonacci_~n)} #47#return; {1577#false} is VALID [2020-07-11 00:34:01,212 INFO L280 TraceCheckUtils]: 34: Hoare triple {1577#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1577#false} is VALID [2020-07-11 00:34:01,212 INFO L280 TraceCheckUtils]: 35: Hoare triple {1577#false} #res := #t~ret0 + #t~ret1; {1577#false} is VALID [2020-07-11 00:34:01,212 INFO L280 TraceCheckUtils]: 36: Hoare triple {1577#false} havoc #t~ret1; {1577#false} is VALID [2020-07-11 00:34:01,212 INFO L280 TraceCheckUtils]: 37: Hoare triple {1577#false} havoc #t~ret0; {1577#false} is VALID [2020-07-11 00:34:01,213 INFO L280 TraceCheckUtils]: 38: Hoare triple {1577#false} assume true; {1577#false} is VALID [2020-07-11 00:34:01,213 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1577#false} {1576#true} #53#return; {1577#false} is VALID [2020-07-11 00:34:01,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2020-07-11 00:34:01,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,215 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1576#true} {1576#true} #49#return; {1576#true} is VALID [2020-07-11 00:34:01,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {1576#true} call #t~ret4 := main(); {1576#true} is VALID [2020-07-11 00:34:01,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {1576#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L280 TraceCheckUtils]: 5: Hoare triple {1576#true} ~x~0 := #t~nondet2; {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L280 TraceCheckUtils]: 6: Hoare triple {1576#true} havoc #t~nondet2; {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {1576#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L263 TraceCheckUtils]: 8: Hoare triple {1576#true} call #t~ret3 := fibonacci(~x~0); {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L280 TraceCheckUtils]: 9: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,216 INFO L280 TraceCheckUtils]: 10: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {1576#true} assume !(1 == ~n); {1576#true} is VALID [2020-07-11 00:34:01,217 INFO L263 TraceCheckUtils]: 12: Hoare triple {1576#true} call #t~ret0 := fibonacci(~n - 1); {1576#true} is VALID [2020-07-11 00:34:01,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:01,219 INFO L280 TraceCheckUtils]: 15: Hoare triple {1650#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,220 INFO L263 TraceCheckUtils]: 16: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1576#true} is VALID [2020-07-11 00:34:01,220 INFO L280 TraceCheckUtils]: 17: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,220 INFO L280 TraceCheckUtils]: 18: Hoare triple {1576#true} assume !(~n < 1); {1576#true} is VALID [2020-07-11 00:34:01,220 INFO L280 TraceCheckUtils]: 19: Hoare triple {1576#true} assume 1 == ~n; {1576#true} is VALID [2020-07-11 00:34:01,220 INFO L280 TraceCheckUtils]: 20: Hoare triple {1576#true} #res := 1; {1576#true} is VALID [2020-07-11 00:34:01,221 INFO L280 TraceCheckUtils]: 21: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,222 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #45#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,222 INFO L280 TraceCheckUtils]: 23: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,223 INFO L263 TraceCheckUtils]: 24: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1576#true} is VALID [2020-07-11 00:34:01,223 INFO L280 TraceCheckUtils]: 25: Hoare triple {1576#true} ~n := #in~n; {1576#true} is VALID [2020-07-11 00:34:01,223 INFO L280 TraceCheckUtils]: 26: Hoare triple {1576#true} assume ~n < 1; {1576#true} is VALID [2020-07-11 00:34:01,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {1576#true} #res := 0; {1576#true} is VALID [2020-07-11 00:34:01,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {1576#true} assume true; {1576#true} is VALID [2020-07-11 00:34:01,224 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1576#true} {1651#(<= 2 |fibonacci_#in~n|)} #47#return; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,225 INFO L280 TraceCheckUtils]: 30: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,225 INFO L280 TraceCheckUtils]: 31: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,226 INFO L280 TraceCheckUtils]: 32: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,227 INFO L280 TraceCheckUtils]: 33: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,227 INFO L280 TraceCheckUtils]: 34: Hoare triple {1651#(<= 2 |fibonacci_#in~n|)} assume true; {1651#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,228 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1651#(<= 2 |fibonacci_#in~n|)} {1576#true} #45#return; {1643#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:01,229 INFO L280 TraceCheckUtils]: 36: Hoare triple {1643#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1643#(<= 3 fibonacci_~n)} is VALID [2020-07-11 00:34:01,229 INFO L263 TraceCheckUtils]: 37: Hoare triple {1643#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1576#true} is VALID [2020-07-11 00:34:01,230 INFO L280 TraceCheckUtils]: 38: Hoare triple {1576#true} ~n := #in~n; {1649#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:01,231 INFO L280 TraceCheckUtils]: 39: Hoare triple {1649#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,231 INFO L280 TraceCheckUtils]: 40: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} #res := 0; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,232 INFO L280 TraceCheckUtils]: 41: Hoare triple {1663#(<= |fibonacci_#in~n| 0)} assume true; {1663#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-11 00:34:01,233 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1663#(<= |fibonacci_#in~n| 0)} {1643#(<= 3 fibonacci_~n)} #47#return; {1577#false} is VALID [2020-07-11 00:34:01,233 INFO L280 TraceCheckUtils]: 43: Hoare triple {1577#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1577#false} is VALID [2020-07-11 00:34:01,234 INFO L280 TraceCheckUtils]: 44: Hoare triple {1577#false} #res := #t~ret0 + #t~ret1; {1577#false} is VALID [2020-07-11 00:34:01,234 INFO L280 TraceCheckUtils]: 45: Hoare triple {1577#false} havoc #t~ret1; {1577#false} is VALID [2020-07-11 00:34:01,234 INFO L280 TraceCheckUtils]: 46: Hoare triple {1577#false} havoc #t~ret0; {1577#false} is VALID [2020-07-11 00:34:01,234 INFO L280 TraceCheckUtils]: 47: Hoare triple {1577#false} assume true; {1577#false} is VALID [2020-07-11 00:34:01,234 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1577#false} {1576#true} #53#return; {1577#false} is VALID [2020-07-11 00:34:01,235 INFO L280 TraceCheckUtils]: 49: Hoare triple {1577#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1577#false} is VALID [2020-07-11 00:34:01,235 INFO L280 TraceCheckUtils]: 50: Hoare triple {1577#false} ~result~0 := #t~ret3; {1577#false} is VALID [2020-07-11 00:34:01,235 INFO L280 TraceCheckUtils]: 51: Hoare triple {1577#false} havoc #t~ret3; {1577#false} is VALID [2020-07-11 00:34:01,235 INFO L280 TraceCheckUtils]: 52: Hoare triple {1577#false} assume !(~result~0 >= ~x~0 - 1); {1577#false} is VALID [2020-07-11 00:34:01,235 INFO L280 TraceCheckUtils]: 53: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2020-07-11 00:34:01,238 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:01,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395779782] [2020-07-11 00:34:01,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:01,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:34:01,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984100604] [2020-07-11 00:34:01,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-11 00:34:01,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:01,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:01,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:01,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:01,292 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2020-07-11 00:34:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,655 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2020-07-11 00:34:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 00:34:01,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-11 00:34:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-11 00:34:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2020-07-11 00:34:01,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2020-07-11 00:34:01,752 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:01,755 INFO L225 Difference]: With dead ends: 77 [2020-07-11 00:34:01,755 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 00:34:01,758 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:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 00:34:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-11 00:34:01,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:01,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:01,841 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:01,841 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,845 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-11 00:34:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-11 00:34:01,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,845 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:01,846 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 00:34:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:01,848 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-11 00:34:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-11 00:34:01,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:01,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:01,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:01,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 00:34:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-07-11 00:34:01,852 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 54 [2020-07-11 00:34:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:01,852 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-07-11 00:34:01,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:01,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2020-07-11 00:34:01,926 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:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-11 00:34:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 00:34:01,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:01,928 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:01,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:34:01,929 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-07-11 00:34:01,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:01,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076008687] [2020-07-11 00:34:01,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:01,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} assume true; {2000#true} is VALID [2020-07-11 00:34:01,983 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2000#true} {2000#true} #49#return; {2000#true} is VALID [2020-07-11 00:34:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2092#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {2092#(<= |fibonacci_#in~n| 1)} #res := 1; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,112 INFO L280 TraceCheckUtils]: 4: Hoare triple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,113 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {2000#true} assume ~n < 1; {2000#true} is VALID [2020-07-11 00:34:02,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {2000#true} #res := 0; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {2094#(<= 0 |fibonacci_#res|)} assume true; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,135 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2094#(<= 0 |fibonacci_#res|)} {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,137 INFO L263 TraceCheckUtils]: 3: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2000#true} is VALID [2020-07-11 00:34:02,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2092#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {2092#(<= |fibonacci_#in~n| 1)} #res := 1; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,141 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,142 INFO L263 TraceCheckUtils]: 11: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {2000#true} is VALID [2020-07-11 00:34:02,142 INFO L280 TraceCheckUtils]: 12: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {2000#true} assume ~n < 1; {2000#true} is VALID [2020-07-11 00:34:02,144 INFO L280 TraceCheckUtils]: 14: Hoare triple {2000#true} #res := 0; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,145 INFO L280 TraceCheckUtils]: 15: Hoare triple {2094#(<= 0 |fibonacci_#res|)} assume true; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,146 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2094#(<= 0 |fibonacci_#res|)} {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,147 INFO L280 TraceCheckUtils]: 17: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,147 INFO L280 TraceCheckUtils]: 18: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,148 INFO L280 TraceCheckUtils]: 19: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,150 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:02,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {2000#true} assume !(~n < 1); {2000#true} is VALID [2020-07-11 00:34:02,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {2000#true} assume 1 == ~n; {2000#true} is VALID [2020-07-11 00:34:02,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {2000#true} #res := 1; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {2095#(<= 1 |fibonacci_#res|)} assume true; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,193 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2095#(<= 1 |fibonacci_#res|)} {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,195 INFO L263 TraceCheckUtils]: 3: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2000#true} is VALID [2020-07-11 00:34:02,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,196 INFO L263 TraceCheckUtils]: 7: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2000#true} is VALID [2020-07-11 00:34:02,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,197 INFO L280 TraceCheckUtils]: 9: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,197 INFO L280 TraceCheckUtils]: 10: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2092#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,198 INFO L280 TraceCheckUtils]: 11: Hoare triple {2092#(<= |fibonacci_#in~n| 1)} #res := 1; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,202 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,204 INFO L263 TraceCheckUtils]: 15: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {2000#true} is VALID [2020-07-11 00:34:02,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,204 INFO L280 TraceCheckUtils]: 17: Hoare triple {2000#true} assume ~n < 1; {2000#true} is VALID [2020-07-11 00:34:02,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {2000#true} #res := 0; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {2094#(<= 0 |fibonacci_#res|)} assume true; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,211 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2094#(<= 0 |fibonacci_#res|)} {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,213 INFO L280 TraceCheckUtils]: 22: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,214 INFO L280 TraceCheckUtils]: 23: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,218 INFO L280 TraceCheckUtils]: 25: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,219 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:02,220 INFO L280 TraceCheckUtils]: 27: Hoare triple {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:02,220 INFO L263 TraceCheckUtils]: 28: Hoare triple {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {2000#true} is VALID [2020-07-11 00:34:02,220 INFO L280 TraceCheckUtils]: 29: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,221 INFO L280 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(~n < 1); {2000#true} is VALID [2020-07-11 00:34:02,221 INFO L280 TraceCheckUtils]: 31: Hoare triple {2000#true} assume 1 == ~n; {2000#true} is VALID [2020-07-11 00:34:02,221 INFO L280 TraceCheckUtils]: 32: Hoare triple {2000#true} #res := 1; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,222 INFO L280 TraceCheckUtils]: 33: Hoare triple {2095#(<= 1 |fibonacci_#res|)} assume true; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,223 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2095#(<= 1 |fibonacci_#res|)} {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,224 INFO L280 TraceCheckUtils]: 35: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,224 INFO L280 TraceCheckUtils]: 36: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,225 INFO L280 TraceCheckUtils]: 37: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,225 INFO L280 TraceCheckUtils]: 38: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,226 INFO L280 TraceCheckUtils]: 39: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,226 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2000#true} #53#return; {2045#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:02,228 INFO L263 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2020-07-11 00:34:02,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {2000#true} assume true; {2000#true} is VALID [2020-07-11 00:34:02,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2000#true} {2000#true} #49#return; {2000#true} is VALID [2020-07-11 00:34:02,230 INFO L263 TraceCheckUtils]: 3: Hoare triple {2000#true} call #t~ret4 := main(); {2000#true} is VALID [2020-07-11 00:34:02,230 INFO L280 TraceCheckUtils]: 4: Hoare triple {2000#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2000#true} is VALID [2020-07-11 00:34:02,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {2000#true} ~x~0 := #t~nondet2; {2000#true} is VALID [2020-07-11 00:34:02,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {2000#true} havoc #t~nondet2; {2000#true} is VALID [2020-07-11 00:34:02,230 INFO L280 TraceCheckUtils]: 7: Hoare triple {2000#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {2000#true} is VALID [2020-07-11 00:34:02,231 INFO L263 TraceCheckUtils]: 8: Hoare triple {2000#true} call #t~ret3 := fibonacci(~x~0); {2000#true} is VALID [2020-07-11 00:34:02,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,235 INFO L263 TraceCheckUtils]: 12: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2000#true} is VALID [2020-07-11 00:34:02,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,237 INFO L263 TraceCheckUtils]: 16: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2000#true} is VALID [2020-07-11 00:34:02,238 INFO L280 TraceCheckUtils]: 17: Hoare triple {2000#true} ~n := #in~n; {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,238 INFO L280 TraceCheckUtils]: 18: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2047#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:02,239 INFO L280 TraceCheckUtils]: 19: Hoare triple {2047#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2092#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:02,240 INFO L280 TraceCheckUtils]: 20: Hoare triple {2092#(<= |fibonacci_#in~n| 1)} #res := 1; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,240 INFO L280 TraceCheckUtils]: 21: Hoare triple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,242 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2093#(<= |fibonacci_#in~n| |fibonacci_#res|)} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,244 INFO L280 TraceCheckUtils]: 23: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,245 INFO L263 TraceCheckUtils]: 24: Hoare triple {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {2000#true} is VALID [2020-07-11 00:34:02,245 INFO L280 TraceCheckUtils]: 25: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,245 INFO L280 TraceCheckUtils]: 26: Hoare triple {2000#true} assume ~n < 1; {2000#true} is VALID [2020-07-11 00:34:02,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {2000#true} #res := 0; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,246 INFO L280 TraceCheckUtils]: 28: Hoare triple {2094#(<= 0 |fibonacci_#res|)} assume true; {2094#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,248 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2094#(<= 0 |fibonacci_#res|)} {2086#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,249 INFO L280 TraceCheckUtils]: 31: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,250 INFO L280 TraceCheckUtils]: 32: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,250 INFO L280 TraceCheckUtils]: 33: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,251 INFO L280 TraceCheckUtils]: 34: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,252 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2047#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:02,252 INFO L280 TraceCheckUtils]: 36: Hoare triple {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:02,252 INFO L263 TraceCheckUtils]: 37: Hoare triple {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {2000#true} is VALID [2020-07-11 00:34:02,253 INFO L280 TraceCheckUtils]: 38: Hoare triple {2000#true} ~n := #in~n; {2000#true} is VALID [2020-07-11 00:34:02,253 INFO L280 TraceCheckUtils]: 39: Hoare triple {2000#true} assume !(~n < 1); {2000#true} is VALID [2020-07-11 00:34:02,253 INFO L280 TraceCheckUtils]: 40: Hoare triple {2000#true} assume 1 == ~n; {2000#true} is VALID [2020-07-11 00:34:02,253 INFO L280 TraceCheckUtils]: 41: Hoare triple {2000#true} #res := 1; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,254 INFO L280 TraceCheckUtils]: 42: Hoare triple {2095#(<= 1 |fibonacci_#res|)} assume true; {2095#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:02,255 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2095#(<= 1 |fibonacci_#res|)} {2071#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,255 INFO L280 TraceCheckUtils]: 44: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:02,256 INFO L280 TraceCheckUtils]: 45: Hoare triple {2078#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,256 INFO L280 TraceCheckUtils]: 46: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,256 INFO L280 TraceCheckUtils]: 47: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,257 INFO L280 TraceCheckUtils]: 48: Hoare triple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:02,258 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2079#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {2000#true} #53#return; {2045#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:02,258 INFO L280 TraceCheckUtils]: 50: Hoare triple {2045#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2045#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:02,259 INFO L280 TraceCheckUtils]: 51: Hoare triple {2045#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {2046#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:34:02,259 INFO L280 TraceCheckUtils]: 52: Hoare triple {2046#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {2046#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:34:02,259 INFO L280 TraceCheckUtils]: 53: Hoare triple {2046#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {2001#false} is VALID [2020-07-11 00:34:02,260 INFO L280 TraceCheckUtils]: 54: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2020-07-11 00:34:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-11 00:34:02,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076008687] [2020-07-11 00:34:02,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:02,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 00:34:02,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85498784] [2020-07-11 00:34:02,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-11 00:34:02,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:02,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 00:34:02,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:02,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 00:34:02,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 00:34:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:34:02,315 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2020-07-11 00:34:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,280 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-11 00:34:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:34:03,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-11 00:34:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:34:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2020-07-11 00:34:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:34:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2020-07-11 00:34:03,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2020-07-11 00:34:03,366 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:03,369 INFO L225 Difference]: With dead ends: 61 [2020-07-11 00:34:03,369 INFO L226 Difference]: Without dead ends: 55 [2020-07-11 00:34:03,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-07-11 00:34:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-11 00:34:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-07-11 00:34:03,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:03,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 45 states. [2020-07-11 00:34:03,463 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 45 states. [2020-07-11 00:34:03,463 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 45 states. [2020-07-11 00:34:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,467 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-11 00:34:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-11 00:34:03,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:03,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 55 states. [2020-07-11 00:34:03,468 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 55 states. [2020-07-11 00:34:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:03,472 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-07-11 00:34:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2020-07-11 00:34:03,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:03,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:03,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:03,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 00:34:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-07-11 00:34:03,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 55 [2020-07-11 00:34:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:03,476 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-07-11 00:34:03,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 00:34:03,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 53 transitions. [2020-07-11 00:34:03,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-07-11 00:34:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-11 00:34:03,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:03,554 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:03,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:34:03,554 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash -778718797, now seen corresponding path program 4 times [2020-07-11 00:34:03,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:03,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406287419] [2020-07-11 00:34:03,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,593 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2446#true} {2446#true} #49#return; {2446#true} is VALID [2020-07-11 00:34:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} #res := 1; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} assume true; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,706 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2604#(<= |fibonacci_#in~n| 1)} {2591#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,714 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2446#true} {2598#(<= |fibonacci_#in~n| 2)} #47#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,718 INFO L263 TraceCheckUtils]: 3: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} #res := 1; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} assume true; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,722 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2604#(<= |fibonacci_#in~n| 1)} {2591#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,723 INFO L263 TraceCheckUtils]: 11: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,723 INFO L280 TraceCheckUtils]: 12: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,725 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2446#true} {2598#(<= |fibonacci_#in~n| 2)} #47#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,726 INFO L280 TraceCheckUtils]: 17: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,726 INFO L280 TraceCheckUtils]: 18: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,729 INFO L280 TraceCheckUtils]: 20: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,729 INFO L280 TraceCheckUtils]: 21: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume true; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,730 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2598#(<= |fibonacci_#in~n| 2)} {2446#true} #45#return; {2549#(<= fibonacci_~n 3)} is VALID [2020-07-11 00:34:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,823 INFO L280 TraceCheckUtils]: 3: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,823 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,824 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2446#true} {2446#true} #45#return; {2446#true} is VALID [2020-07-11 00:34:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,828 INFO L280 TraceCheckUtils]: 3: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,829 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2446#true} {2446#true} #47#return; {2446#true} is VALID [2020-07-11 00:34:03,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,830 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,831 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2446#true} {2446#true} #45#return; {2446#true} is VALID [2020-07-11 00:34:03,831 INFO L280 TraceCheckUtils]: 10: Hoare triple {2446#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,831 INFO L263 TraceCheckUtils]: 11: Hoare triple {2446#true} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,831 INFO L280 TraceCheckUtils]: 12: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,832 INFO L280 TraceCheckUtils]: 14: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,832 INFO L280 TraceCheckUtils]: 15: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,832 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2446#true} {2446#true} #47#return; {2446#true} is VALID [2020-07-11 00:34:03,833 INFO L280 TraceCheckUtils]: 17: Hoare triple {2446#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {2446#true} #res := #t~ret0 + #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,833 INFO L280 TraceCheckUtils]: 19: Hoare triple {2446#true} havoc #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,833 INFO L280 TraceCheckUtils]: 20: Hoare triple {2446#true} havoc #t~ret0; {2446#true} is VALID [2020-07-11 00:34:03,833 INFO L280 TraceCheckUtils]: 21: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,835 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #45#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:03,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,847 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #47#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,854 INFO L263 TraceCheckUtils]: 3: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,854 INFO L263 TraceCheckUtils]: 7: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,856 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2446#true} {2446#true} #45#return; {2446#true} is VALID [2020-07-11 00:34:03,856 INFO L280 TraceCheckUtils]: 14: Hoare triple {2446#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,856 INFO L263 TraceCheckUtils]: 15: Hoare triple {2446#true} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,856 INFO L280 TraceCheckUtils]: 17: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,857 INFO L280 TraceCheckUtils]: 18: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,857 INFO L280 TraceCheckUtils]: 19: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,857 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2446#true} {2446#true} #47#return; {2446#true} is VALID [2020-07-11 00:34:03,857 INFO L280 TraceCheckUtils]: 21: Hoare triple {2446#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {2446#true} #res := #t~ret0 + #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,858 INFO L280 TraceCheckUtils]: 23: Hoare triple {2446#true} havoc #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,858 INFO L280 TraceCheckUtils]: 24: Hoare triple {2446#true} havoc #t~ret0; {2446#true} is VALID [2020-07-11 00:34:03,858 INFO L280 TraceCheckUtils]: 25: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,859 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #45#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,860 INFO L280 TraceCheckUtils]: 27: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,860 INFO L263 TraceCheckUtils]: 28: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,860 INFO L280 TraceCheckUtils]: 29: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,860 INFO L280 TraceCheckUtils]: 30: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,861 INFO L280 TraceCheckUtils]: 31: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,861 INFO L280 TraceCheckUtils]: 32: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,861 INFO L280 TraceCheckUtils]: 33: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,862 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #47#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,863 INFO L280 TraceCheckUtils]: 35: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,863 INFO L280 TraceCheckUtils]: 36: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,864 INFO L280 TraceCheckUtils]: 37: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,864 INFO L280 TraceCheckUtils]: 38: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,865 INFO L280 TraceCheckUtils]: 39: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume true; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,866 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2606#(<= 2 |fibonacci_#in~n|)} {2549#(<= fibonacci_~n 3)} #47#return; {2447#false} is VALID [2020-07-11 00:34:03,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,868 INFO L263 TraceCheckUtils]: 3: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,871 INFO L263 TraceCheckUtils]: 7: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,873 INFO L280 TraceCheckUtils]: 10: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} #res := 1; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,874 INFO L280 TraceCheckUtils]: 12: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} assume true; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,875 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2604#(<= |fibonacci_#in~n| 1)} {2591#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,876 INFO L263 TraceCheckUtils]: 15: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,876 INFO L280 TraceCheckUtils]: 16: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,877 INFO L280 TraceCheckUtils]: 17: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,877 INFO L280 TraceCheckUtils]: 18: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,877 INFO L280 TraceCheckUtils]: 19: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,878 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2446#true} {2598#(<= |fibonacci_#in~n| 2)} #47#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,879 INFO L280 TraceCheckUtils]: 21: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,879 INFO L280 TraceCheckUtils]: 22: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,880 INFO L280 TraceCheckUtils]: 23: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,880 INFO L280 TraceCheckUtils]: 24: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,881 INFO L280 TraceCheckUtils]: 25: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume true; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,882 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2598#(<= |fibonacci_#in~n| 2)} {2446#true} #45#return; {2549#(<= fibonacci_~n 3)} is VALID [2020-07-11 00:34:03,883 INFO L280 TraceCheckUtils]: 27: Hoare triple {2549#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2549#(<= fibonacci_~n 3)} is VALID [2020-07-11 00:34:03,883 INFO L263 TraceCheckUtils]: 28: Hoare triple {2549#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,884 INFO L280 TraceCheckUtils]: 29: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,885 INFO L280 TraceCheckUtils]: 30: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,886 INFO L280 TraceCheckUtils]: 31: Hoare triple {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,886 INFO L263 TraceCheckUtils]: 32: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,886 INFO L280 TraceCheckUtils]: 33: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,886 INFO L280 TraceCheckUtils]: 34: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,886 INFO L280 TraceCheckUtils]: 35: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,887 INFO L263 TraceCheckUtils]: 36: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,887 INFO L280 TraceCheckUtils]: 37: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,887 INFO L280 TraceCheckUtils]: 38: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,887 INFO L280 TraceCheckUtils]: 39: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,887 INFO L280 TraceCheckUtils]: 40: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L280 TraceCheckUtils]: 41: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2446#true} {2446#true} #45#return; {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L280 TraceCheckUtils]: 43: Hoare triple {2446#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L263 TraceCheckUtils]: 44: Hoare triple {2446#true} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L280 TraceCheckUtils]: 45: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,888 INFO L280 TraceCheckUtils]: 46: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,889 INFO L280 TraceCheckUtils]: 47: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,889 INFO L280 TraceCheckUtils]: 48: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,889 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {2446#true} {2446#true} #47#return; {2446#true} is VALID [2020-07-11 00:34:03,889 INFO L280 TraceCheckUtils]: 50: Hoare triple {2446#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,889 INFO L280 TraceCheckUtils]: 51: Hoare triple {2446#true} #res := #t~ret0 + #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,890 INFO L280 TraceCheckUtils]: 52: Hoare triple {2446#true} havoc #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,890 INFO L280 TraceCheckUtils]: 53: Hoare triple {2446#true} havoc #t~ret0; {2446#true} is VALID [2020-07-11 00:34:03,890 INFO L280 TraceCheckUtils]: 54: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,892 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #45#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,892 INFO L280 TraceCheckUtils]: 56: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,893 INFO L263 TraceCheckUtils]: 57: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,893 INFO L280 TraceCheckUtils]: 58: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,893 INFO L280 TraceCheckUtils]: 59: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,893 INFO L280 TraceCheckUtils]: 60: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,893 INFO L280 TraceCheckUtils]: 61: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,894 INFO L280 TraceCheckUtils]: 62: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,895 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #47#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,895 INFO L280 TraceCheckUtils]: 64: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,896 INFO L280 TraceCheckUtils]: 65: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,896 INFO L280 TraceCheckUtils]: 66: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,897 INFO L280 TraceCheckUtils]: 67: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,897 INFO L280 TraceCheckUtils]: 68: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume true; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,898 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {2606#(<= 2 |fibonacci_#in~n|)} {2549#(<= fibonacci_~n 3)} #47#return; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L280 TraceCheckUtils]: 70: Hoare triple {2447#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L280 TraceCheckUtils]: 71: Hoare triple {2447#false} #res := #t~ret0 + #t~ret1; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L280 TraceCheckUtils]: 72: Hoare triple {2447#false} havoc #t~ret1; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L280 TraceCheckUtils]: 73: Hoare triple {2447#false} havoc #t~ret0; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L280 TraceCheckUtils]: 74: Hoare triple {2447#false} assume true; {2447#false} is VALID [2020-07-11 00:34:03,899 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {2447#false} {2446#true} #53#return; {2447#false} is VALID [2020-07-11 00:34:03,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2020-07-11 00:34:03,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2446#true} {2446#true} #49#return; {2446#true} is VALID [2020-07-11 00:34:03,904 INFO L263 TraceCheckUtils]: 3: Hoare triple {2446#true} call #t~ret4 := main(); {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {2446#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {2446#true} ~x~0 := #t~nondet2; {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {2446#true} havoc #t~nondet2; {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {2446#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L263 TraceCheckUtils]: 8: Hoare triple {2446#true} call #t~ret3 := fibonacci(~x~0); {2446#true} is VALID [2020-07-11 00:34:03,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,906 INFO L263 TraceCheckUtils]: 12: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,909 INFO L263 TraceCheckUtils]: 16: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,910 INFO L280 TraceCheckUtils]: 18: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,910 INFO L280 TraceCheckUtils]: 19: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} #res := 1; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {2604#(<= |fibonacci_#in~n| 1)} assume true; {2604#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:03,912 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2604#(<= |fibonacci_#in~n| 1)} {2591#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,913 INFO L280 TraceCheckUtils]: 23: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,913 INFO L263 TraceCheckUtils]: 24: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,913 INFO L280 TraceCheckUtils]: 25: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,913 INFO L280 TraceCheckUtils]: 26: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,914 INFO L280 TraceCheckUtils]: 27: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,914 INFO L280 TraceCheckUtils]: 28: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,915 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2446#true} {2598#(<= |fibonacci_#in~n| 2)} #47#return; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,919 INFO L280 TraceCheckUtils]: 30: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,922 INFO L280 TraceCheckUtils]: 31: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,922 INFO L280 TraceCheckUtils]: 32: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,923 INFO L280 TraceCheckUtils]: 33: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {2598#(<= |fibonacci_#in~n| 2)} assume true; {2598#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:03,925 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2598#(<= |fibonacci_#in~n| 2)} {2446#true} #45#return; {2549#(<= fibonacci_~n 3)} is VALID [2020-07-11 00:34:03,925 INFO L280 TraceCheckUtils]: 36: Hoare triple {2549#(<= fibonacci_~n 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2549#(<= fibonacci_~n 3)} is VALID [2020-07-11 00:34:03,925 INFO L263 TraceCheckUtils]: 37: Hoare triple {2549#(<= fibonacci_~n 3)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,926 INFO L280 TraceCheckUtils]: 38: Hoare triple {2446#true} ~n := #in~n; {2591#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,927 INFO L280 TraceCheckUtils]: 39: Hoare triple {2591#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-11 00:34:03,927 INFO L280 TraceCheckUtils]: 40: Hoare triple {2605#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,927 INFO L263 TraceCheckUtils]: 41: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,928 INFO L280 TraceCheckUtils]: 42: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,928 INFO L280 TraceCheckUtils]: 43: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,928 INFO L280 TraceCheckUtils]: 44: Hoare triple {2446#true} assume !(1 == ~n); {2446#true} is VALID [2020-07-11 00:34:03,928 INFO L263 TraceCheckUtils]: 45: Hoare triple {2446#true} call #t~ret0 := fibonacci(~n - 1); {2446#true} is VALID [2020-07-11 00:34:03,928 INFO L280 TraceCheckUtils]: 46: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L280 TraceCheckUtils]: 47: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L280 TraceCheckUtils]: 48: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L280 TraceCheckUtils]: 49: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L280 TraceCheckUtils]: 50: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2446#true} {2446#true} #45#return; {2446#true} is VALID [2020-07-11 00:34:03,929 INFO L280 TraceCheckUtils]: 52: Hoare triple {2446#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,930 INFO L263 TraceCheckUtils]: 53: Hoare triple {2446#true} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,930 INFO L280 TraceCheckUtils]: 54: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,930 INFO L280 TraceCheckUtils]: 55: Hoare triple {2446#true} assume ~n < 1; {2446#true} is VALID [2020-07-11 00:34:03,930 INFO L280 TraceCheckUtils]: 56: Hoare triple {2446#true} #res := 0; {2446#true} is VALID [2020-07-11 00:34:03,930 INFO L280 TraceCheckUtils]: 57: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2446#true} {2446#true} #47#return; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L280 TraceCheckUtils]: 59: Hoare triple {2446#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L280 TraceCheckUtils]: 60: Hoare triple {2446#true} #res := #t~ret0 + #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L280 TraceCheckUtils]: 61: Hoare triple {2446#true} havoc #t~ret1; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L280 TraceCheckUtils]: 62: Hoare triple {2446#true} havoc #t~ret0; {2446#true} is VALID [2020-07-11 00:34:03,931 INFO L280 TraceCheckUtils]: 63: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,932 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #45#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,933 INFO L280 TraceCheckUtils]: 65: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,933 INFO L263 TraceCheckUtils]: 66: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2446#true} is VALID [2020-07-11 00:34:03,934 INFO L280 TraceCheckUtils]: 67: Hoare triple {2446#true} ~n := #in~n; {2446#true} is VALID [2020-07-11 00:34:03,934 INFO L280 TraceCheckUtils]: 68: Hoare triple {2446#true} assume !(~n < 1); {2446#true} is VALID [2020-07-11 00:34:03,934 INFO L280 TraceCheckUtils]: 69: Hoare triple {2446#true} assume 1 == ~n; {2446#true} is VALID [2020-07-11 00:34:03,934 INFO L280 TraceCheckUtils]: 70: Hoare triple {2446#true} #res := 1; {2446#true} is VALID [2020-07-11 00:34:03,934 INFO L280 TraceCheckUtils]: 71: Hoare triple {2446#true} assume true; {2446#true} is VALID [2020-07-11 00:34:03,935 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2446#true} {2606#(<= 2 |fibonacci_#in~n|)} #47#return; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,936 INFO L280 TraceCheckUtils]: 73: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,937 INFO L280 TraceCheckUtils]: 74: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,937 INFO L280 TraceCheckUtils]: 75: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,938 INFO L280 TraceCheckUtils]: 76: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,938 INFO L280 TraceCheckUtils]: 77: Hoare triple {2606#(<= 2 |fibonacci_#in~n|)} assume true; {2606#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:03,939 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {2606#(<= 2 |fibonacci_#in~n|)} {2549#(<= fibonacci_~n 3)} #47#return; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L280 TraceCheckUtils]: 79: Hoare triple {2447#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L280 TraceCheckUtils]: 80: Hoare triple {2447#false} #res := #t~ret0 + #t~ret1; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L280 TraceCheckUtils]: 81: Hoare triple {2447#false} havoc #t~ret1; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L280 TraceCheckUtils]: 82: Hoare triple {2447#false} havoc #t~ret0; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L280 TraceCheckUtils]: 83: Hoare triple {2447#false} assume true; {2447#false} is VALID [2020-07-11 00:34:03,940 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {2447#false} {2446#true} #53#return; {2447#false} is VALID [2020-07-11 00:34:03,941 INFO L280 TraceCheckUtils]: 85: Hoare triple {2447#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2447#false} is VALID [2020-07-11 00:34:03,941 INFO L280 TraceCheckUtils]: 86: Hoare triple {2447#false} ~result~0 := #t~ret3; {2447#false} is VALID [2020-07-11 00:34:03,941 INFO L280 TraceCheckUtils]: 87: Hoare triple {2447#false} havoc #t~ret3; {2447#false} is VALID [2020-07-11 00:34:03,941 INFO L280 TraceCheckUtils]: 88: Hoare triple {2447#false} assume !(~result~0 >= ~x~0 - 1); {2447#false} is VALID [2020-07-11 00:34:03,941 INFO L280 TraceCheckUtils]: 89: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2020-07-11 00:34:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-11 00:34:03,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406287419] [2020-07-11 00:34:03,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 00:34:03,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301907512] [2020-07-11 00:34:03,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-11 00:34:03,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:03,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 00:34:04,053 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,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 00:34:04,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 00:34:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 00:34:04,054 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 8 states. [2020-07-11 00:34:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,614 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-07-11 00:34:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 00:34:04,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-11 00:34:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-11 00:34:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 00:34:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2020-07-11 00:34:04,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2020-07-11 00:34:04,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:04,726 INFO L225 Difference]: With dead ends: 98 [2020-07-11 00:34:04,726 INFO L226 Difference]: Without dead ends: 62 [2020-07-11 00:34:04,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:34:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-11 00:34:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-07-11 00:34:04,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:04,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 56 states. [2020-07-11 00:34:04,861 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 56 states. [2020-07-11 00:34:04,862 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 56 states. [2020-07-11 00:34:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,865 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2020-07-11 00:34:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2020-07-11 00:34:04,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:04,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:04,867 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 62 states. [2020-07-11 00:34:04,867 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 62 states. [2020-07-11 00:34:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:04,871 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2020-07-11 00:34:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2020-07-11 00:34:04,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:04,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:04,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:04,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-11 00:34:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2020-07-11 00:34:04,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 90 [2020-07-11 00:34:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:04,876 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2020-07-11 00:34:04,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 00:34:04,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 68 transitions. [2020-07-11 00:34:04,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-07-11 00:34:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-11 00:34:04,977 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:04,977 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:04,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:34:04,978 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 5 times [2020-07-11 00:34:04,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:04,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1830217441] [2020-07-11 00:34:04,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,030 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3091#true} {3091#true} #49#return; {3091#true} is VALID [2020-07-11 00:34:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} #res := 1; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} assume true; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,147 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3351#(<= |fibonacci_#in~n| 1)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,153 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,154 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3091#true} {3345#(<= |fibonacci_#in~n| 2)} #47#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,156 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,158 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} #res := 1; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,160 INFO L280 TraceCheckUtils]: 8: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} assume true; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,161 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3351#(<= |fibonacci_#in~n| 1)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,163 INFO L263 TraceCheckUtils]: 11: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,163 INFO L280 TraceCheckUtils]: 12: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,164 INFO L280 TraceCheckUtils]: 14: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,165 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3091#true} {3345#(<= |fibonacci_#in~n| 2)} #47#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,166 INFO L280 TraceCheckUtils]: 17: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,167 INFO L280 TraceCheckUtils]: 18: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,167 INFO L280 TraceCheckUtils]: 19: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,168 INFO L280 TraceCheckUtils]: 20: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume true; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,170 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3345#(<= |fibonacci_#in~n| 2)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,179 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3091#true} {3332#(<= |fibonacci_#in~n| 3)} #47#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,199 INFO L263 TraceCheckUtils]: 7: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} #res := 1; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} assume true; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,206 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3351#(<= |fibonacci_#in~n| 1)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,207 INFO L263 TraceCheckUtils]: 15: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,207 INFO L280 TraceCheckUtils]: 16: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,207 INFO L280 TraceCheckUtils]: 18: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,208 INFO L280 TraceCheckUtils]: 19: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,208 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3091#true} {3345#(<= |fibonacci_#in~n| 2)} #47#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,209 INFO L280 TraceCheckUtils]: 21: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,210 INFO L280 TraceCheckUtils]: 22: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,211 INFO L280 TraceCheckUtils]: 24: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,211 INFO L280 TraceCheckUtils]: 25: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume true; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,212 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3345#(<= |fibonacci_#in~n| 2)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,213 INFO L263 TraceCheckUtils]: 28: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,213 INFO L280 TraceCheckUtils]: 29: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,213 INFO L280 TraceCheckUtils]: 30: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,213 INFO L280 TraceCheckUtils]: 31: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,213 INFO L280 TraceCheckUtils]: 32: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,214 INFO L280 TraceCheckUtils]: 33: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,214 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3091#true} {3332#(<= |fibonacci_#in~n| 3)} #47#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,215 INFO L280 TraceCheckUtils]: 35: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,215 INFO L280 TraceCheckUtils]: 36: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,216 INFO L280 TraceCheckUtils]: 37: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,216 INFO L280 TraceCheckUtils]: 38: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,217 INFO L280 TraceCheckUtils]: 39: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume true; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,218 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3332#(<= |fibonacci_#in~n| 3)} {3091#true} #45#return; {3248#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,341 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,348 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,351 INFO L263 TraceCheckUtils]: 3: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,353 INFO L280 TraceCheckUtils]: 8: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,354 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,355 INFO L263 TraceCheckUtils]: 11: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,358 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,359 INFO L280 TraceCheckUtils]: 17: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,361 INFO L280 TraceCheckUtils]: 19: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,362 INFO L280 TraceCheckUtils]: 20: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,362 INFO L280 TraceCheckUtils]: 21: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume true; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,363 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3430#(<= 1 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,371 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3091#true} {3423#(<= 2 |fibonacci_#in~n|)} #47#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,373 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,376 INFO L263 TraceCheckUtils]: 7: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,379 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,380 INFO L263 TraceCheckUtils]: 15: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,380 INFO L280 TraceCheckUtils]: 16: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,381 INFO L280 TraceCheckUtils]: 17: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,381 INFO L280 TraceCheckUtils]: 18: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,381 INFO L280 TraceCheckUtils]: 19: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,382 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,383 INFO L280 TraceCheckUtils]: 21: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,384 INFO L280 TraceCheckUtils]: 22: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,385 INFO L280 TraceCheckUtils]: 23: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,386 INFO L280 TraceCheckUtils]: 24: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,387 INFO L280 TraceCheckUtils]: 25: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume true; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,388 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3430#(<= 1 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,389 INFO L280 TraceCheckUtils]: 27: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,390 INFO L263 TraceCheckUtils]: 28: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,390 INFO L280 TraceCheckUtils]: 30: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,391 INFO L280 TraceCheckUtils]: 31: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,391 INFO L280 TraceCheckUtils]: 32: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,391 INFO L280 TraceCheckUtils]: 33: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,393 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3091#true} {3423#(<= 2 |fibonacci_#in~n|)} #47#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,393 INFO L280 TraceCheckUtils]: 35: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,394 INFO L280 TraceCheckUtils]: 37: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,395 INFO L280 TraceCheckUtils]: 38: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,396 INFO L280 TraceCheckUtils]: 39: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume true; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,397 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3423#(<= 2 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:05,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,405 INFO L280 TraceCheckUtils]: 3: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,407 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3091#true} {3393#(<= 3 |fibonacci_#in~n|)} #47#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,412 INFO L263 TraceCheckUtils]: 7: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,415 INFO L263 TraceCheckUtils]: 11: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,416 INFO L280 TraceCheckUtils]: 13: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,416 INFO L280 TraceCheckUtils]: 14: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,418 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,419 INFO L280 TraceCheckUtils]: 18: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,419 INFO L263 TraceCheckUtils]: 19: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,420 INFO L280 TraceCheckUtils]: 20: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,421 INFO L280 TraceCheckUtils]: 23: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,422 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,423 INFO L280 TraceCheckUtils]: 25: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,423 INFO L280 TraceCheckUtils]: 26: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,424 INFO L280 TraceCheckUtils]: 27: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,425 INFO L280 TraceCheckUtils]: 28: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,425 INFO L280 TraceCheckUtils]: 29: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume true; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,427 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3430#(<= 1 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,428 INFO L280 TraceCheckUtils]: 31: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,428 INFO L263 TraceCheckUtils]: 32: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,428 INFO L280 TraceCheckUtils]: 33: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,428 INFO L280 TraceCheckUtils]: 34: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,428 INFO L280 TraceCheckUtils]: 35: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,429 INFO L280 TraceCheckUtils]: 36: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,429 INFO L280 TraceCheckUtils]: 37: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,430 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3091#true} {3423#(<= 2 |fibonacci_#in~n|)} #47#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,431 INFO L280 TraceCheckUtils]: 39: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,431 INFO L280 TraceCheckUtils]: 40: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,432 INFO L280 TraceCheckUtils]: 41: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,432 INFO L280 TraceCheckUtils]: 42: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,433 INFO L280 TraceCheckUtils]: 43: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume true; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,435 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3423#(<= 2 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,436 INFO L280 TraceCheckUtils]: 45: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,436 INFO L263 TraceCheckUtils]: 46: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,436 INFO L280 TraceCheckUtils]: 47: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,437 INFO L280 TraceCheckUtils]: 48: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,437 INFO L280 TraceCheckUtils]: 49: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,437 INFO L280 TraceCheckUtils]: 50: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,437 INFO L280 TraceCheckUtils]: 51: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,438 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3091#true} {3393#(<= 3 |fibonacci_#in~n|)} #47#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,439 INFO L280 TraceCheckUtils]: 53: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,440 INFO L280 TraceCheckUtils]: 54: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,441 INFO L280 TraceCheckUtils]: 55: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,442 INFO L280 TraceCheckUtils]: 56: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,442 INFO L280 TraceCheckUtils]: 57: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume true; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,444 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {3393#(<= 3 |fibonacci_#in~n|)} {3248#(<= fibonacci_~n 4)} #47#return; {3092#false} is VALID [2020-07-11 00:34:05,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {3091#true} assume !(1 == ~n); {3091#true} is VALID [2020-07-11 00:34:05,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {3091#true} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,454 INFO L263 TraceCheckUtils]: 7: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,456 INFO L263 TraceCheckUtils]: 11: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,457 INFO L280 TraceCheckUtils]: 13: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,457 INFO L280 TraceCheckUtils]: 14: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} #res := 1; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,458 INFO L280 TraceCheckUtils]: 16: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} assume true; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,459 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3351#(<= |fibonacci_#in~n| 1)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,460 INFO L280 TraceCheckUtils]: 18: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,460 INFO L263 TraceCheckUtils]: 19: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,460 INFO L280 TraceCheckUtils]: 20: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,461 INFO L280 TraceCheckUtils]: 21: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,462 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3091#true} {3345#(<= |fibonacci_#in~n| 2)} #47#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,463 INFO L280 TraceCheckUtils]: 25: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,463 INFO L280 TraceCheckUtils]: 26: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,464 INFO L280 TraceCheckUtils]: 27: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,464 INFO L280 TraceCheckUtils]: 28: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume true; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,466 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3345#(<= |fibonacci_#in~n| 2)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,467 INFO L280 TraceCheckUtils]: 31: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,467 INFO L263 TraceCheckUtils]: 32: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,467 INFO L280 TraceCheckUtils]: 33: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,467 INFO L280 TraceCheckUtils]: 34: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,467 INFO L280 TraceCheckUtils]: 35: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,467 INFO L280 TraceCheckUtils]: 36: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,468 INFO L280 TraceCheckUtils]: 37: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,468 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3091#true} {3332#(<= |fibonacci_#in~n| 3)} #47#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,469 INFO L280 TraceCheckUtils]: 39: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,469 INFO L280 TraceCheckUtils]: 40: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,470 INFO L280 TraceCheckUtils]: 41: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,470 INFO L280 TraceCheckUtils]: 42: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,471 INFO L280 TraceCheckUtils]: 43: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume true; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,472 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3332#(<= |fibonacci_#in~n| 3)} {3091#true} #45#return; {3248#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:05,473 INFO L280 TraceCheckUtils]: 45: Hoare triple {3248#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3248#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:05,473 INFO L263 TraceCheckUtils]: 46: Hoare triple {3248#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,473 INFO L280 TraceCheckUtils]: 47: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,474 INFO L280 TraceCheckUtils]: 48: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,474 INFO L280 TraceCheckUtils]: 49: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,475 INFO L263 TraceCheckUtils]: 50: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,475 INFO L280 TraceCheckUtils]: 51: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,476 INFO L280 TraceCheckUtils]: 52: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,476 INFO L280 TraceCheckUtils]: 53: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,476 INFO L263 TraceCheckUtils]: 54: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,477 INFO L280 TraceCheckUtils]: 55: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,477 INFO L280 TraceCheckUtils]: 56: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,478 INFO L280 TraceCheckUtils]: 57: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,478 INFO L263 TraceCheckUtils]: 58: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,478 INFO L280 TraceCheckUtils]: 59: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,479 INFO L280 TraceCheckUtils]: 60: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,479 INFO L280 TraceCheckUtils]: 61: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,479 INFO L280 TraceCheckUtils]: 62: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,479 INFO L280 TraceCheckUtils]: 63: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,480 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,481 INFO L280 TraceCheckUtils]: 65: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,481 INFO L263 TraceCheckUtils]: 66: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,481 INFO L280 TraceCheckUtils]: 67: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,481 INFO L280 TraceCheckUtils]: 68: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,481 INFO L280 TraceCheckUtils]: 69: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,482 INFO L280 TraceCheckUtils]: 70: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,483 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,483 INFO L280 TraceCheckUtils]: 72: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,484 INFO L280 TraceCheckUtils]: 73: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,484 INFO L280 TraceCheckUtils]: 74: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,485 INFO L280 TraceCheckUtils]: 75: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,486 INFO L280 TraceCheckUtils]: 76: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume true; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,487 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3430#(<= 1 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,488 INFO L280 TraceCheckUtils]: 78: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,488 INFO L263 TraceCheckUtils]: 79: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,488 INFO L280 TraceCheckUtils]: 80: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,488 INFO L280 TraceCheckUtils]: 81: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,489 INFO L280 TraceCheckUtils]: 82: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,489 INFO L280 TraceCheckUtils]: 83: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,489 INFO L280 TraceCheckUtils]: 84: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,490 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {3091#true} {3423#(<= 2 |fibonacci_#in~n|)} #47#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,491 INFO L280 TraceCheckUtils]: 86: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,492 INFO L280 TraceCheckUtils]: 87: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,492 INFO L280 TraceCheckUtils]: 88: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,493 INFO L280 TraceCheckUtils]: 89: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,494 INFO L280 TraceCheckUtils]: 90: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume true; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,495 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {3423#(<= 2 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,496 INFO L280 TraceCheckUtils]: 92: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,496 INFO L263 TraceCheckUtils]: 93: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,496 INFO L280 TraceCheckUtils]: 94: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,497 INFO L280 TraceCheckUtils]: 95: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,497 INFO L280 TraceCheckUtils]: 96: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,497 INFO L280 TraceCheckUtils]: 97: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,498 INFO L280 TraceCheckUtils]: 98: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,499 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {3091#true} {3393#(<= 3 |fibonacci_#in~n|)} #47#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,499 INFO L280 TraceCheckUtils]: 100: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,500 INFO L280 TraceCheckUtils]: 101: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,501 INFO L280 TraceCheckUtils]: 102: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,502 INFO L280 TraceCheckUtils]: 103: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,502 INFO L280 TraceCheckUtils]: 104: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume true; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,504 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {3393#(<= 3 |fibonacci_#in~n|)} {3248#(<= fibonacci_~n 4)} #47#return; {3092#false} is VALID [2020-07-11 00:34:05,504 INFO L280 TraceCheckUtils]: 106: Hoare triple {3092#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3092#false} is VALID [2020-07-11 00:34:05,504 INFO L280 TraceCheckUtils]: 107: Hoare triple {3092#false} #res := #t~ret0 + #t~ret1; {3092#false} is VALID [2020-07-11 00:34:05,505 INFO L280 TraceCheckUtils]: 108: Hoare triple {3092#false} havoc #t~ret1; {3092#false} is VALID [2020-07-11 00:34:05,505 INFO L280 TraceCheckUtils]: 109: Hoare triple {3092#false} havoc #t~ret0; {3092#false} is VALID [2020-07-11 00:34:05,505 INFO L280 TraceCheckUtils]: 110: Hoare triple {3092#false} assume true; {3092#false} is VALID [2020-07-11 00:34:05,506 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3092#false} {3091#true} #53#return; {3092#false} is VALID [2020-07-11 00:34:05,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {3091#true} call ULTIMATE.init(); {3091#true} is VALID [2020-07-11 00:34:05,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,518 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3091#true} {3091#true} #49#return; {3091#true} is VALID [2020-07-11 00:34:05,518 INFO L263 TraceCheckUtils]: 3: Hoare triple {3091#true} call #t~ret4 := main(); {3091#true} is VALID [2020-07-11 00:34:05,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {3091#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L280 TraceCheckUtils]: 5: Hoare triple {3091#true} ~x~0 := #t~nondet2; {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {3091#true} havoc #t~nondet2; {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L280 TraceCheckUtils]: 7: Hoare triple {3091#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L263 TraceCheckUtils]: 8: Hoare triple {3091#true} call #t~ret3 := fibonacci(~x~0); {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {3091#true} assume !(1 == ~n); {3091#true} is VALID [2020-07-11 00:34:05,520 INFO L263 TraceCheckUtils]: 12: Hoare triple {3091#true} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,522 INFO L263 TraceCheckUtils]: 16: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,523 INFO L280 TraceCheckUtils]: 19: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,524 INFO L263 TraceCheckUtils]: 20: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,524 INFO L280 TraceCheckUtils]: 21: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,525 INFO L280 TraceCheckUtils]: 22: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,525 INFO L280 TraceCheckUtils]: 23: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,526 INFO L280 TraceCheckUtils]: 24: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} #res := 1; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,526 INFO L280 TraceCheckUtils]: 25: Hoare triple {3351#(<= |fibonacci_#in~n| 1)} assume true; {3351#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:05,528 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3351#(<= |fibonacci_#in~n| 1)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,529 INFO L280 TraceCheckUtils]: 27: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,529 INFO L263 TraceCheckUtils]: 28: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,529 INFO L280 TraceCheckUtils]: 29: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,529 INFO L280 TraceCheckUtils]: 30: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,530 INFO L280 TraceCheckUtils]: 31: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,530 INFO L280 TraceCheckUtils]: 32: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,531 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3091#true} {3345#(<= |fibonacci_#in~n| 2)} #47#return; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,532 INFO L280 TraceCheckUtils]: 34: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,532 INFO L280 TraceCheckUtils]: 35: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,533 INFO L280 TraceCheckUtils]: 36: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,534 INFO L280 TraceCheckUtils]: 37: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {3345#(<= |fibonacci_#in~n| 2)} assume true; {3345#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-11 00:34:05,536 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {3345#(<= |fibonacci_#in~n| 2)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,536 INFO L280 TraceCheckUtils]: 40: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,537 INFO L263 TraceCheckUtils]: 41: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,537 INFO L280 TraceCheckUtils]: 42: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,537 INFO L280 TraceCheckUtils]: 43: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,537 INFO L280 TraceCheckUtils]: 44: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,537 INFO L280 TraceCheckUtils]: 45: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,537 INFO L280 TraceCheckUtils]: 46: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,539 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {3091#true} {3332#(<= |fibonacci_#in~n| 3)} #47#return; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,539 INFO L280 TraceCheckUtils]: 48: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,540 INFO L280 TraceCheckUtils]: 49: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,540 INFO L280 TraceCheckUtils]: 50: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,541 INFO L280 TraceCheckUtils]: 51: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,542 INFO L280 TraceCheckUtils]: 52: Hoare triple {3332#(<= |fibonacci_#in~n| 3)} assume true; {3332#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-11 00:34:05,543 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3332#(<= |fibonacci_#in~n| 3)} {3091#true} #45#return; {3248#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:05,544 INFO L280 TraceCheckUtils]: 54: Hoare triple {3248#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3248#(<= fibonacci_~n 4)} is VALID [2020-07-11 00:34:05,544 INFO L263 TraceCheckUtils]: 55: Hoare triple {3248#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,544 INFO L280 TraceCheckUtils]: 56: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,545 INFO L280 TraceCheckUtils]: 57: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,546 INFO L280 TraceCheckUtils]: 58: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,546 INFO L263 TraceCheckUtils]: 59: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,547 INFO L280 TraceCheckUtils]: 60: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,547 INFO L280 TraceCheckUtils]: 61: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,548 INFO L280 TraceCheckUtils]: 62: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,548 INFO L263 TraceCheckUtils]: 63: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,548 INFO L280 TraceCheckUtils]: 64: Hoare triple {3091#true} ~n := #in~n; {3308#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,549 INFO L280 TraceCheckUtils]: 65: Hoare triple {3308#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,550 INFO L280 TraceCheckUtils]: 66: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,550 INFO L263 TraceCheckUtils]: 67: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3091#true} is VALID [2020-07-11 00:34:05,550 INFO L280 TraceCheckUtils]: 68: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,551 INFO L280 TraceCheckUtils]: 69: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,551 INFO L280 TraceCheckUtils]: 70: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,551 INFO L280 TraceCheckUtils]: 71: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,551 INFO L280 TraceCheckUtils]: 72: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,552 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #45#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,553 INFO L280 TraceCheckUtils]: 74: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,553 INFO L263 TraceCheckUtils]: 75: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,554 INFO L280 TraceCheckUtils]: 76: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,554 INFO L280 TraceCheckUtils]: 77: Hoare triple {3091#true} assume ~n < 1; {3091#true} is VALID [2020-07-11 00:34:05,554 INFO L280 TraceCheckUtils]: 78: Hoare triple {3091#true} #res := 0; {3091#true} is VALID [2020-07-11 00:34:05,554 INFO L280 TraceCheckUtils]: 79: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,556 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {3091#true} {3430#(<= 1 |fibonacci_#in~n|)} #47#return; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,556 INFO L280 TraceCheckUtils]: 81: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,557 INFO L280 TraceCheckUtils]: 82: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,558 INFO L280 TraceCheckUtils]: 83: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,558 INFO L280 TraceCheckUtils]: 84: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,559 INFO L280 TraceCheckUtils]: 85: Hoare triple {3430#(<= 1 |fibonacci_#in~n|)} assume true; {3430#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,561 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {3430#(<= 1 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,561 INFO L280 TraceCheckUtils]: 87: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,562 INFO L263 TraceCheckUtils]: 88: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,562 INFO L280 TraceCheckUtils]: 89: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,562 INFO L280 TraceCheckUtils]: 90: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,562 INFO L280 TraceCheckUtils]: 91: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,562 INFO L280 TraceCheckUtils]: 92: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,563 INFO L280 TraceCheckUtils]: 93: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,564 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {3091#true} {3423#(<= 2 |fibonacci_#in~n|)} #47#return; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,564 INFO L280 TraceCheckUtils]: 95: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,565 INFO L280 TraceCheckUtils]: 96: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,566 INFO L280 TraceCheckUtils]: 97: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,566 INFO L280 TraceCheckUtils]: 98: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,567 INFO L280 TraceCheckUtils]: 99: Hoare triple {3423#(<= 2 |fibonacci_#in~n|)} assume true; {3423#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,568 INFO L275 TraceCheckUtils]: 100: Hoare quadruple {3423#(<= 2 |fibonacci_#in~n|)} {3308#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,569 INFO L280 TraceCheckUtils]: 101: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,569 INFO L263 TraceCheckUtils]: 102: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3091#true} is VALID [2020-07-11 00:34:05,569 INFO L280 TraceCheckUtils]: 103: Hoare triple {3091#true} ~n := #in~n; {3091#true} is VALID [2020-07-11 00:34:05,570 INFO L280 TraceCheckUtils]: 104: Hoare triple {3091#true} assume !(~n < 1); {3091#true} is VALID [2020-07-11 00:34:05,570 INFO L280 TraceCheckUtils]: 105: Hoare triple {3091#true} assume 1 == ~n; {3091#true} is VALID [2020-07-11 00:34:05,570 INFO L280 TraceCheckUtils]: 106: Hoare triple {3091#true} #res := 1; {3091#true} is VALID [2020-07-11 00:34:05,570 INFO L280 TraceCheckUtils]: 107: Hoare triple {3091#true} assume true; {3091#true} is VALID [2020-07-11 00:34:05,571 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {3091#true} {3393#(<= 3 |fibonacci_#in~n|)} #47#return; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,572 INFO L280 TraceCheckUtils]: 109: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,572 INFO L280 TraceCheckUtils]: 110: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,573 INFO L280 TraceCheckUtils]: 111: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,574 INFO L280 TraceCheckUtils]: 112: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,574 INFO L280 TraceCheckUtils]: 113: Hoare triple {3393#(<= 3 |fibonacci_#in~n|)} assume true; {3393#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:05,575 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {3393#(<= 3 |fibonacci_#in~n|)} {3248#(<= fibonacci_~n 4)} #47#return; {3092#false} is VALID [2020-07-11 00:34:05,576 INFO L280 TraceCheckUtils]: 115: Hoare triple {3092#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3092#false} is VALID [2020-07-11 00:34:05,576 INFO L280 TraceCheckUtils]: 116: Hoare triple {3092#false} #res := #t~ret0 + #t~ret1; {3092#false} is VALID [2020-07-11 00:34:05,576 INFO L280 TraceCheckUtils]: 117: Hoare triple {3092#false} havoc #t~ret1; {3092#false} is VALID [2020-07-11 00:34:05,576 INFO L280 TraceCheckUtils]: 118: Hoare triple {3092#false} havoc #t~ret0; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L280 TraceCheckUtils]: 119: Hoare triple {3092#false} assume true; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L275 TraceCheckUtils]: 120: Hoare quadruple {3092#false} {3091#true} #53#return; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L280 TraceCheckUtils]: 121: Hoare triple {3092#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L280 TraceCheckUtils]: 122: Hoare triple {3092#false} ~result~0 := #t~ret3; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L280 TraceCheckUtils]: 123: Hoare triple {3092#false} havoc #t~ret3; {3092#false} is VALID [2020-07-11 00:34:05,577 INFO L280 TraceCheckUtils]: 124: Hoare triple {3092#false} assume !(~result~0 >= ~x~0 - 1); {3092#false} is VALID [2020-07-11 00:34:05,578 INFO L280 TraceCheckUtils]: 125: Hoare triple {3092#false} assume !false; {3092#false} is VALID [2020-07-11 00:34:05,593 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:05,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1830217441] [2020-07-11 00:34:05,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:05,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 00:34:05,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304526467] [2020-07-11 00:34:05,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-07-11 00:34:05,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:05,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:34:05,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:05,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:34:05,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:34:05,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:34:05,689 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 10 states. [2020-07-11 00:34:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:06,613 INFO L93 Difference]: Finished difference Result 126 states and 169 transitions. [2020-07-11 00:34:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 00:34:06,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-07-11 00:34:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-11 00:34:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:34:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2020-07-11 00:34:06,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2020-07-11 00:34:06,748 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:06,752 INFO L225 Difference]: With dead ends: 126 [2020-07-11 00:34:06,752 INFO L226 Difference]: Without dead ends: 79 [2020-07-11 00:34:06,753 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:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-11 00:34:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2020-07-11 00:34:06,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:06,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 70 states. [2020-07-11 00:34:06,939 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 70 states. [2020-07-11 00:34:06,940 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 70 states. [2020-07-11 00:34:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:06,944 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2020-07-11 00:34:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2020-07-11 00:34:06,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:06,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:06,946 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 79 states. [2020-07-11 00:34:06,946 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 79 states. [2020-07-11 00:34:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:06,951 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2020-07-11 00:34:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2020-07-11 00:34:06,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:06,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:06,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:06,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:34:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2020-07-11 00:34:06,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 126 [2020-07-11 00:34:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:06,956 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2020-07-11 00:34:06,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:34:06,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2020-07-11 00:34:07,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-07-11 00:34:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-11 00:34:07,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:07,117 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:07,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 00:34:07,117 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 6 times [2020-07-11 00:34:07,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:07,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29902480] [2020-07-11 00:34:07,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} assume true; {4020#true} is VALID [2020-07-11 00:34:07,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4020#true} {4020#true} #49#return; {4020#true} is VALID [2020-07-11 00:34:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4211#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,380 INFO L280 TraceCheckUtils]: 3: Hoare triple {4211#(<= |fibonacci_#in~n| 1)} #res := 1; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,381 INFO L280 TraceCheckUtils]: 4: Hoare triple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,382 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,402 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,405 INFO L263 TraceCheckUtils]: 3: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4211#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {4211#(<= |fibonacci_#in~n| 1)} #res := 1; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,409 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,411 INFO L263 TraceCheckUtils]: 11: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,411 INFO L280 TraceCheckUtils]: 12: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,411 INFO L280 TraceCheckUtils]: 13: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,412 INFO L280 TraceCheckUtils]: 15: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,414 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,414 INFO L280 TraceCheckUtils]: 17: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,418 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,445 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,447 INFO L263 TraceCheckUtils]: 3: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,449 INFO L263 TraceCheckUtils]: 7: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4211#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {4211#(<= |fibonacci_#in~n| 1)} #res := 1; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,453 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,454 INFO L280 TraceCheckUtils]: 14: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,455 INFO L263 TraceCheckUtils]: 15: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,455 INFO L280 TraceCheckUtils]: 16: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,459 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,460 INFO L280 TraceCheckUtils]: 21: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,462 INFO L280 TraceCheckUtils]: 24: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,462 INFO L280 TraceCheckUtils]: 25: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,464 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,464 INFO L280 TraceCheckUtils]: 27: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,465 INFO L263 TraceCheckUtils]: 28: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,465 INFO L280 TraceCheckUtils]: 30: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,465 INFO L280 TraceCheckUtils]: 31: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,466 INFO L280 TraceCheckUtils]: 32: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,467 INFO L280 TraceCheckUtils]: 33: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,468 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,469 INFO L280 TraceCheckUtils]: 35: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,470 INFO L280 TraceCheckUtils]: 36: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,470 INFO L280 TraceCheckUtils]: 37: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,471 INFO L280 TraceCheckUtils]: 38: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,471 INFO L280 TraceCheckUtils]: 39: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,472 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,556 INFO L280 TraceCheckUtils]: 4: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,557 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4020#true} #45#return; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:07,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,571 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4221#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {4020#true} assume !(1 == ~n); {4020#true} is VALID [2020-07-11 00:34:07,573 INFO L263 TraceCheckUtils]: 3: Hoare triple {4020#true} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,573 INFO L280 TraceCheckUtils]: 4: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,573 INFO L280 TraceCheckUtils]: 5: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,573 INFO L280 TraceCheckUtils]: 6: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,576 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4020#true} #45#return; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,580 INFO L263 TraceCheckUtils]: 11: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,580 INFO L280 TraceCheckUtils]: 12: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,582 INFO L280 TraceCheckUtils]: 15: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,583 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4221#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,589 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,595 INFO L280 TraceCheckUtils]: 6: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,595 INFO L263 TraceCheckUtils]: 7: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,596 INFO L280 TraceCheckUtils]: 9: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,597 INFO L263 TraceCheckUtils]: 11: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4211#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {4211#(<= |fibonacci_#in~n| 1)} #res := 1; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,602 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,602 INFO L280 TraceCheckUtils]: 18: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,603 INFO L263 TraceCheckUtils]: 19: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,603 INFO L280 TraceCheckUtils]: 20: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,603 INFO L280 TraceCheckUtils]: 21: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,605 INFO L280 TraceCheckUtils]: 22: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,605 INFO L280 TraceCheckUtils]: 23: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,607 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,608 INFO L280 TraceCheckUtils]: 25: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,609 INFO L280 TraceCheckUtils]: 26: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,610 INFO L280 TraceCheckUtils]: 27: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,610 INFO L280 TraceCheckUtils]: 28: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,611 INFO L280 TraceCheckUtils]: 29: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,613 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,614 INFO L280 TraceCheckUtils]: 31: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,614 INFO L263 TraceCheckUtils]: 32: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,614 INFO L280 TraceCheckUtils]: 33: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,614 INFO L280 TraceCheckUtils]: 34: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,615 INFO L280 TraceCheckUtils]: 35: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,616 INFO L280 TraceCheckUtils]: 36: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,616 INFO L280 TraceCheckUtils]: 37: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,618 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,619 INFO L280 TraceCheckUtils]: 39: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,620 INFO L280 TraceCheckUtils]: 40: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,620 INFO L280 TraceCheckUtils]: 41: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,621 INFO L280 TraceCheckUtils]: 42: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,622 INFO L280 TraceCheckUtils]: 43: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,623 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,624 INFO L280 TraceCheckUtils]: 45: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,624 INFO L263 TraceCheckUtils]: 46: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,643 INFO L280 TraceCheckUtils]: 47: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,644 INFO L280 TraceCheckUtils]: 48: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,644 INFO L280 TraceCheckUtils]: 49: Hoare triple {4020#true} assume !(1 == ~n); {4020#true} is VALID [2020-07-11 00:34:07,644 INFO L263 TraceCheckUtils]: 50: Hoare triple {4020#true} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,644 INFO L280 TraceCheckUtils]: 51: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,645 INFO L280 TraceCheckUtils]: 52: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,645 INFO L280 TraceCheckUtils]: 53: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,648 INFO L280 TraceCheckUtils]: 54: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,649 INFO L280 TraceCheckUtils]: 55: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,651 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4020#true} #45#return; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,652 INFO L280 TraceCheckUtils]: 57: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,652 INFO L263 TraceCheckUtils]: 58: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,653 INFO L280 TraceCheckUtils]: 59: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,653 INFO L280 TraceCheckUtils]: 60: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,654 INFO L280 TraceCheckUtils]: 61: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,654 INFO L280 TraceCheckUtils]: 62: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,656 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4221#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,656 INFO L280 TraceCheckUtils]: 64: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,657 INFO L280 TraceCheckUtils]: 65: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,657 INFO L280 TraceCheckUtils]: 66: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,658 INFO L280 TraceCheckUtils]: 67: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,658 INFO L280 TraceCheckUtils]: 68: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,660 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,662 INFO L280 TraceCheckUtils]: 70: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,663 INFO L280 TraceCheckUtils]: 71: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,664 INFO L280 TraceCheckUtils]: 72: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,665 INFO L280 TraceCheckUtils]: 73: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,665 INFO L280 TraceCheckUtils]: 74: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,666 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4020#true} #53#return; {4100#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:07,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4020#true} is VALID [2020-07-11 00:34:07,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#true} assume true; {4020#true} is VALID [2020-07-11 00:34:07,673 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4020#true} {4020#true} #49#return; {4020#true} is VALID [2020-07-11 00:34:07,673 INFO L263 TraceCheckUtils]: 3: Hoare triple {4020#true} call #t~ret4 := main(); {4020#true} is VALID [2020-07-11 00:34:07,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {4020#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4020#true} is VALID [2020-07-11 00:34:07,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {4020#true} ~x~0 := #t~nondet2; {4020#true} is VALID [2020-07-11 00:34:07,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {4020#true} havoc #t~nondet2; {4020#true} is VALID [2020-07-11 00:34:07,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {4020#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {4020#true} is VALID [2020-07-11 00:34:07,674 INFO L263 TraceCheckUtils]: 8: Hoare triple {4020#true} call #t~ret3 := fibonacci(~x~0); {4020#true} is VALID [2020-07-11 00:34:07,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,677 INFO L263 TraceCheckUtils]: 12: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,677 INFO L280 TraceCheckUtils]: 13: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,678 INFO L280 TraceCheckUtils]: 14: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,678 INFO L263 TraceCheckUtils]: 16: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,680 INFO L263 TraceCheckUtils]: 20: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,680 INFO L280 TraceCheckUtils]: 21: Hoare triple {4020#true} ~n := #in~n; {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,681 INFO L280 TraceCheckUtils]: 22: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4102#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-11 00:34:07,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {4102#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4211#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-11 00:34:07,682 INFO L280 TraceCheckUtils]: 24: Hoare triple {4211#(<= |fibonacci_#in~n| 1)} #res := 1; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,682 INFO L280 TraceCheckUtils]: 25: Hoare triple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,683 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4212#(<= |fibonacci_#in~n| |fibonacci_#res|)} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,684 INFO L280 TraceCheckUtils]: 27: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,684 INFO L263 TraceCheckUtils]: 28: Hoare triple {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,684 INFO L280 TraceCheckUtils]: 29: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,684 INFO L280 TraceCheckUtils]: 30: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,685 INFO L280 TraceCheckUtils]: 31: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,685 INFO L280 TraceCheckUtils]: 32: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,686 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4205#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,687 INFO L280 TraceCheckUtils]: 34: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,688 INFO L280 TraceCheckUtils]: 35: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,688 INFO L280 TraceCheckUtils]: 36: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,689 INFO L280 TraceCheckUtils]: 37: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,689 INFO L280 TraceCheckUtils]: 38: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,690 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,691 INFO L280 TraceCheckUtils]: 40: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,691 INFO L263 TraceCheckUtils]: 41: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,691 INFO L280 TraceCheckUtils]: 42: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,691 INFO L280 TraceCheckUtils]: 43: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,691 INFO L280 TraceCheckUtils]: 44: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,692 INFO L280 TraceCheckUtils]: 45: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,692 INFO L280 TraceCheckUtils]: 46: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,693 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,694 INFO L280 TraceCheckUtils]: 48: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,695 INFO L280 TraceCheckUtils]: 49: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,695 INFO L280 TraceCheckUtils]: 50: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,696 INFO L280 TraceCheckUtils]: 51: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,696 INFO L280 TraceCheckUtils]: 52: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,697 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4102#(= fibonacci_~n |fibonacci_#in~n|)} #45#return; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,698 INFO L280 TraceCheckUtils]: 54: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-11 00:34:07,698 INFO L263 TraceCheckUtils]: 55: Hoare triple {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,698 INFO L280 TraceCheckUtils]: 56: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,698 INFO L280 TraceCheckUtils]: 57: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,698 INFO L280 TraceCheckUtils]: 58: Hoare triple {4020#true} assume !(1 == ~n); {4020#true} is VALID [2020-07-11 00:34:07,698 INFO L263 TraceCheckUtils]: 59: Hoare triple {4020#true} call #t~ret0 := fibonacci(~n - 1); {4020#true} is VALID [2020-07-11 00:34:07,699 INFO L280 TraceCheckUtils]: 60: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,699 INFO L280 TraceCheckUtils]: 61: Hoare triple {4020#true} assume !(~n < 1); {4020#true} is VALID [2020-07-11 00:34:07,699 INFO L280 TraceCheckUtils]: 62: Hoare triple {4020#true} assume 1 == ~n; {4020#true} is VALID [2020-07-11 00:34:07,700 INFO L280 TraceCheckUtils]: 63: Hoare triple {4020#true} #res := 1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,700 INFO L280 TraceCheckUtils]: 64: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,701 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4020#true} #45#return; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,702 INFO L280 TraceCheckUtils]: 66: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4221#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-11 00:34:07,702 INFO L263 TraceCheckUtils]: 67: Hoare triple {4221#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {4020#true} is VALID [2020-07-11 00:34:07,702 INFO L280 TraceCheckUtils]: 68: Hoare triple {4020#true} ~n := #in~n; {4020#true} is VALID [2020-07-11 00:34:07,702 INFO L280 TraceCheckUtils]: 69: Hoare triple {4020#true} assume ~n < 1; {4020#true} is VALID [2020-07-11 00:34:07,703 INFO L280 TraceCheckUtils]: 70: Hoare triple {4020#true} #res := 0; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,703 INFO L280 TraceCheckUtils]: 71: Hoare triple {4213#(<= 0 |fibonacci_#res|)} assume true; {4213#(<= 0 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,704 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {4213#(<= 0 |fibonacci_#res|)} {4221#(<= 1 |fibonacci_#t~ret0|)} #47#return; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,705 INFO L280 TraceCheckUtils]: 73: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} is VALID [2020-07-11 00:34:07,706 INFO L280 TraceCheckUtils]: 74: Hoare triple {4227#(<= 1 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))} #res := #t~ret0 + #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,706 INFO L280 TraceCheckUtils]: 75: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret1; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,707 INFO L280 TraceCheckUtils]: 76: Hoare triple {4214#(<= 1 |fibonacci_#res|)} havoc #t~ret0; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,707 INFO L280 TraceCheckUtils]: 77: Hoare triple {4214#(<= 1 |fibonacci_#res|)} assume true; {4214#(<= 1 |fibonacci_#res|)} is VALID [2020-07-11 00:34:07,709 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {4214#(<= 1 |fibonacci_#res|)} {4144#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #47#return; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,709 INFO L280 TraceCheckUtils]: 79: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-11 00:34:07,710 INFO L280 TraceCheckUtils]: 80: Hoare triple {4168#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} #res := #t~ret0 + #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,710 INFO L280 TraceCheckUtils]: 81: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret1; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,711 INFO L280 TraceCheckUtils]: 82: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} havoc #t~ret0; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,711 INFO L280 TraceCheckUtils]: 83: Hoare triple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-11 00:34:07,712 INFO L275 TraceCheckUtils]: 84: Hoare quadruple {4169#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {4020#true} #53#return; {4100#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:07,713 INFO L280 TraceCheckUtils]: 85: Hoare triple {4100#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4100#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-11 00:34:07,713 INFO L280 TraceCheckUtils]: 86: Hoare triple {4100#(<= main_~x~0 (+ |main_#t~ret3| 1))} ~result~0 := #t~ret3; {4101#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:34:07,714 INFO L280 TraceCheckUtils]: 87: Hoare triple {4101#(<= main_~x~0 (+ main_~result~0 1))} havoc #t~ret3; {4101#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-11 00:34:07,714 INFO L280 TraceCheckUtils]: 88: Hoare triple {4101#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {4021#false} is VALID [2020-07-11 00:34:07,714 INFO L280 TraceCheckUtils]: 89: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2020-07-11 00:34:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 8 proven. 109 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-07-11 00:34:07,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29902480] [2020-07-11 00:34:07,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:07,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:34:07,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621564941] [2020-07-11 00:34:07,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-07-11 00:34:07,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:07,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:34:07,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:07,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:34:07,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:34:07,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:34:07,784 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 15 states. [2020-07-11 00:34:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,774 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-07-11 00:34:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:34:08,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-07-11 00:34:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:34:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-11 00:34:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:34:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-11 00:34:08,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2020-07-11 00:34:08,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:08,835 INFO L225 Difference]: With dead ends: 70 [2020-07-11 00:34:08,836 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:34:08,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2020-07-11 00:34:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:34:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:34:08,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:08,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:08,838 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,838 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:08,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:08,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:08,838 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:08,839 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:08,839 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:08,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:08,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:08,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:08,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:34:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:34:08,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2020-07-11 00:34:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:08,840 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:34:08,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:34:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:34:08,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:08,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:08,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 00:34:08,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:34:10,119 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2020-07-11 00:34:10,615 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 16 [2020-07-11 00:34:10,756 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2020-07-11 00:34:10,877 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2020-07-11 00:34:11,192 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2020-07-11 00:34:11,260 INFO L264 CegarLoopResult]: At program point fibonacciFINAL(lines 14 22) the Hoare annotation is: (and (<= 0 |fibonacci_#res|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (or (< 1 fibonacci_~n) (<= |fibonacci_#in~n| |fibonacci_#res|)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,260 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-11 00:34:11,261 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 2 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,261 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#t~ret0|) (<= 2 |fibonacci_#in~n|) .cse0 (<= |fibonacci_#in~n| 2)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-11 00:34:11,261 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= |fibonacci_#in~n| 1) (<= 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,262 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#t~ret0|) (<= 2 |fibonacci_#in~n|) .cse0 (<= |fibonacci_#in~n| 2)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-11 00:34:11,262 INFO L264 CegarLoopResult]: At program point fibonacciEXIT(lines 14 22) the Hoare annotation is: (and (<= 0 |fibonacci_#res|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (or (< 1 fibonacci_~n) (<= |fibonacci_#in~n| |fibonacci_#res|)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,262 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,262 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1)))) (or (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0))) (not (<= |fibonacci_#in~n| 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,262 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= |fibonacci_#in~n| 0) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,263 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1)))) (or (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0))) (not (<= |fibonacci_#in~n| 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,263 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-07-11 00:34:11,263 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))) (.cse2 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse1 (<= 3 fibonacci_~n) .cse2) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) (< 1 fibonacci_~n) .cse0 .cse1 .cse2))) [2020-07-11 00:34:11,263 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 1 |fibonacci_#t~ret0|) (not (<= |fibonacci_#in~n| 1)) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-11 00:34:11,263 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,263 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,263 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,263 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,263 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-07-11 00:34:11,264 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 00:34:11,264 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-07-11 00:34:11,264 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-07-11 00:34:11,265 INFO L264 CegarLoopResult]: At program point L30-3(line 30) the Hoare annotation is: (and (<= main_~x~0 (+ |main_#t~ret3| 1)) (<= main_~x~0 (+ main_~result~0 1))) [2020-07-11 00:34:11,265 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-11 00:34:11,265 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-11 00:34:11,265 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-07-11 00:34:11,265 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-07-11 00:34:11,265 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-11 00:34:11,280 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:34:11,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:34:11 BoogieIcfgContainer [2020-07-11 00:34:11,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:34:11,298 INFO L168 Benchmark]: Toolchain (without parser) took 16348.84 ms. Allocated memory was 143.7 MB in the beginning and 402.7 MB in the end (delta: 259.0 MB). Free memory was 102.2 MB in the beginning and 273.8 MB in the end (delta: -171.7 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,298 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.04 ms. Allocated memory is still 143.7 MB. Free memory was 102.0 MB in the beginning and 91.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,305 INFO L168 Benchmark]: Boogie Preprocessor took 23.73 ms. Allocated memory is still 143.7 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,306 INFO L168 Benchmark]: RCFGBuilder took 427.96 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 90.4 MB in the beginning and 160.3 MB in the end (delta: -69.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,307 INFO L168 Benchmark]: TraceAbstraction took 15639.73 ms. Allocated memory was 199.8 MB in the beginning and 402.7 MB in the end (delta: 202.9 MB). Free memory was 160.3 MB in the beginning and 273.8 MB in the end (delta: -113.5 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:11,313 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.14 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 252.04 ms. Allocated memory is still 143.7 MB. Free memory was 102.0 MB in the beginning and 91.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.73 ms. Allocated memory is still 143.7 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.96 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 90.4 MB in the beginning and 160.3 MB in the end (delta: -69.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15639.73 ms. Allocated memory was 199.8 MB in the beginning and 402.7 MB in the end (delta: 202.9 MB). Free memory was 160.3 MB in the beginning and 273.8 MB in the end (delta: -113.5 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: ((0 <= \result && \old(n) <= \result + 1) && (1 < n || \old(n) <= \result)) && n == \old(n) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.1s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 265 SDtfs, 340 SDslu, 1023 SDs, 0 SdLazy, 990 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 371 PreInvPairs, 650 NumberOfFragments, 308 HoareAnnotationTreeSize, 371 FomulaSimplifications, 12317 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 3870 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 94359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 675/1096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...