/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:40:10,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:40:10,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:40:10,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:40:10,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:40:10,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:40:10,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:40:10,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:40:10,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:40:10,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:40:10,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:40:10,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:40:10,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:40:10,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:40:10,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:40:10,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:40:10,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:40:10,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:40:10,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:40:10,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:40:10,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:40:10,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:40:10,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:40:10,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:40:10,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:40:10,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:40:10,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:40:10,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:40:10,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:40:10,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:40:10,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:40:10,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:40:10,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:40:10,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:40:10,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:40:10,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:40:10,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:40:10,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:40:10,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:40:10,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:40:10,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:40:10,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:40:10,618 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:40:10,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:40:10,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:40:10,622 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:40:10,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:40:10,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:40:10,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:40:10,623 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:40:10,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:40:10,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:40:10,624 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:40:10,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:40:10,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:40:10,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:40:10,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:40:10,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:40:10,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:40:10,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-18 04:40:10,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:40:10,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:40:10,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:40:10,907 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:40:10,908 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:40:10,908 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-18 04:40:10,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbf0dd1f/ff3d996bd3d644aeba51703b4d9a16e9/FLAG1eb6d212a [2020-07-18 04:40:11,456 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:40:11,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-18 04:40:11,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbf0dd1f/ff3d996bd3d644aeba51703b4d9a16e9/FLAG1eb6d212a [2020-07-18 04:40:11,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cbf0dd1f/ff3d996bd3d644aeba51703b4d9a16e9 [2020-07-18 04:40:11,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:40:11,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:40:11,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:40:11,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:40:11,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:40:11,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:11" (1/1) ... [2020-07-18 04:40:11,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3cceb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:11, skipping insertion in model container [2020-07-18 04:40:11,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:11" (1/1) ... [2020-07-18 04:40:11,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:40:11,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:40:12,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:40:12,037 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:40:12,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:40:12,068 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:40:12,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12 WrapperNode [2020-07-18 04:40:12,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:40:12,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:40:12,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:40:12,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:40:12,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (1/1) ... [2020-07-18 04:40:12,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:40:12,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:40:12,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:40:12,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:40:12,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (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-18 04:40:12,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:40:12,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:40:12,236 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-18 04:40:12,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:40:12,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:40:12,469 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:40:12,470 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:40:12,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:12 BoogieIcfgContainer [2020-07-18 04:40:12,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:40:12,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:40:12,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:40:12,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:40:12,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:40:11" (1/3) ... [2020-07-18 04:40:12,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e966641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:12, skipping insertion in model container [2020-07-18 04:40:12,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:12" (2/3) ... [2020-07-18 04:40:12,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e966641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:12, skipping insertion in model container [2020-07-18 04:40:12,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:12" (3/3) ... [2020-07-18 04:40:12,483 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-18 04:40:12,493 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:40:12,503 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:40:12,520 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:40:12,546 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:40:12,546 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:40:12,546 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:40:12,546 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:40:12,547 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:40:12,547 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:40:12,547 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:40:12,547 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:40:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-18 04:40:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:40:12,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:12,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:12,579 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-18 04:40:12,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:12,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1725086069] [2020-07-18 04:40:12,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-18 04:40:12,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-18 04:40:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:12,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,868 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-18 04:40:12,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-18 04:40:12,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-18 04:40:12,869 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-18 04:40:12,870 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-18 04:40:12,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-18 04:40:12,871 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-18 04:40:12,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-18 04:40:12,871 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-18 04:40:12,872 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:12,874 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,877 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:12,882 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-18 04:40:12,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-18 04:40:12,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-18 04:40:12,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-18 04:40:12,888 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-18 04:40:12,888 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-18 04:40:12,891 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-18 04:40:12,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1725086069] [2020-07-18 04:40:12,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:40:12,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:40:12,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909844539] [2020-07-18 04:40:12,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:40:12,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:12,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:40:12,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:40:12,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:40:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:40:12,963 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-18 04:40:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:13,284 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-18 04:40:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:40:13,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:40:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-18 04:40:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-18 04:40:13,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-18 04:40:13,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:13,428 INFO L225 Difference]: With dead ends: 48 [2020-07-18 04:40:13,429 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 04:40:13,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:40:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 04:40:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-18 04:40:13,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:13,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-18 04:40:13,526 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:40:13,526 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:40:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:13,533 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-18 04:40:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 04:40:13,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:13,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:13,535 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:40:13,535 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:40:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:13,540 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-18 04:40:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 04:40:13,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:13,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:13,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:13,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 04:40:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-18 04:40:13,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-18 04:40:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:13,550 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-18 04:40:13,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:40:13,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-18 04:40:13,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 04:40:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 04:40:13,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:13,595 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-18 04:40:13,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:40:13,595 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-18 04:40:13,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:13,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918546506] [2020-07-18 04:40:13,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:13,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-18 04:40:13,633 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-18 04:40:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:13,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:13,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:13,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,672 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,674 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-18 04:40:13,674 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-18 04:40:13,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-18 04:40:13,675 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-18 04:40:13,675 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-18 04:40:13,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-18 04:40:13,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-18 04:40:13,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-18 04:40:13,676 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-18 04:40:13,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:13,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:13,679 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,680 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:13,682 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-18 04:40:13,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-18 04:40:13,683 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-18 04:40:13,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-18 04:40:13,685 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-18 04:40:13,685 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-18 04:40:13,687 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-18 04:40:13,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918546506] [2020-07-18 04:40:13,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:40:13,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:40:13,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952404794] [2020-07-18 04:40:13,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 04:40:13,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:13,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:40:13,712 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-18 04:40:13,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:40:13,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:40:13,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:40:13,713 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-18 04:40:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:13,898 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-18 04:40:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:40:13,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-18 04:40:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:40:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 04:40:13,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 04:40:13,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:13,958 INFO L225 Difference]: With dead ends: 38 [2020-07-18 04:40:13,958 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 04:40:13,959 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:40:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 04:40:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-18 04:40:13,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:13,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-18 04:40:13,992 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-18 04:40:13,993 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-18 04:40:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:13,997 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-18 04:40:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-18 04:40:13,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:13,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:13,999 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-18 04:40:13,999 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-18 04:40:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,003 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-18 04:40:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-18 04:40:14,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:14,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:14,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 04:40:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-18 04:40:14,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-18 04:40:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:14,008 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-18 04:40:14,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:40:14,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-18 04:40:14,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-18 04:40:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 04:40:14,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:14,080 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:14,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:40:14,080 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-18 04:40:14,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:14,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2019139305] [2020-07-18 04:40:14,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 04:40:14,144 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-18 04:40:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,216 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 04:40:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 04:40:14,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 04:40:14,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 04:40:14,227 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 04:40:14,227 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 04:40:14,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 04:40:14,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-18 04:40:14,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-18 04:40:14,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-18 04:40:14,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,238 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 04:40:14,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-18 04:40:14,239 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-18 04:40:14,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 04:40:14,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 04:40:14,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 04:40:14,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 04:40:14,241 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 04:40:14,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-18 04:40:14,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-18 04:40:14,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-18 04:40:14,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-18 04:40:14,243 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-18 04:40:14,243 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-18 04:40:14,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-18 04:40:14,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 04:40:14,245 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-18 04:40:14,245 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-18 04:40:14,246 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-18 04:40:14,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-18 04:40:14,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-18 04:40:14,247 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-18 04:40:14,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 04:40:14,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-18 04:40:14,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-18 04:40:14,250 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-18 04:40:14,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,255 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:14,257 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-18 04:40:14,257 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-18 04:40:14,257 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-18 04:40:14,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-18 04:40:14,258 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-18 04:40:14,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-18 04:40:14,259 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-18 04:40:14,259 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-18 04:40:14,259 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-18 04:40:14,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-18 04:40:14,260 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-18 04:40:14,260 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-18 04:40:14,261 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-18 04:40:14,261 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-18 04:40:14,261 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-18 04:40:14,262 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-18 04:40:14,262 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-18 04:40:14,262 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-18 04:40:14,263 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-18 04:40:14,266 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-18 04:40:14,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2019139305] [2020-07-18 04:40:14,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:14,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:40:14,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057327612] [2020-07-18 04:40:14,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 04:40:14,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:14,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:40:14,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:40:14,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:40:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:40:14,309 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-18 04:40:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,600 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-18 04:40:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:40:14,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 04:40:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:40:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-18 04:40:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:40:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-18 04:40:14,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-18 04:40:14,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,680 INFO L225 Difference]: With dead ends: 54 [2020-07-18 04:40:14,680 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 04:40:14,681 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-18 04:40:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 04:40:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-18 04:40:14,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:14,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-18 04:40:14,736 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 04:40:14,736 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 04:40:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,745 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 04:40:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 04:40:14,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:14,748 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 04:40:14,748 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 04:40:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,754 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 04:40:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 04:40:14,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:14,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:14,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 04:40:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-18 04:40:14,762 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-18 04:40:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:14,763 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-18 04:40:14,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:40:14,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2020-07-18 04:40:14,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 04:40:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 04:40:14,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:14,812 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:14,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:40:14,812 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-18 04:40:14,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:14,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243559811] [2020-07-18 04:40:14,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-18 04:40:14,889 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-18 04:40:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,964 INFO L280 TraceCheckUtils]: 3: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,967 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:14,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-18 04:40:14,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-18 04:40:14,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-18 04:40:14,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-18 04:40:14,975 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,977 INFO L263 TraceCheckUtils]: 3: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-18 04:40:14,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,982 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,983 INFO L263 TraceCheckUtils]: 11: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-18 04:40:14,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-18 04:40:14,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-18 04:40:14,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-18 04:40:14,984 INFO L280 TraceCheckUtils]: 15: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-18 04:40:14,985 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,985 INFO L280 TraceCheckUtils]: 17: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,986 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,986 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,987 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,989 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-18 04:40:14,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2020-07-18 04:40:14,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-18 04:40:14,990 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-18 04:40:14,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {771#true} call #t~ret4 := main(); {771#true} is VALID [2020-07-18 04:40:14,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {771#true} is VALID [2020-07-18 04:40:14,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {771#true} ~x~0 := #t~nondet2; {771#true} is VALID [2020-07-18 04:40:14,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {771#true} havoc #t~nondet2; {771#true} is VALID [2020-07-18 04:40:14,991 INFO L263 TraceCheckUtils]: 7: Hoare triple {771#true} call #t~ret3 := fibonacci(~x~0); {771#true} is VALID [2020-07-18 04:40:14,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,993 INFO L280 TraceCheckUtils]: 10: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,993 INFO L263 TraceCheckUtils]: 11: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-18 04:40:14,994 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,994 INFO L280 TraceCheckUtils]: 13: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:14,995 INFO L280 TraceCheckUtils]: 14: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:14,997 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:14,998 INFO L263 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-18 04:40:14,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-18 04:40:14,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-18 04:40:14,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-18 04:40:14,999 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-18 04:40:15,000 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,001 INFO L280 TraceCheckUtils]: 25: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,005 INFO L280 TraceCheckUtils]: 28: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,006 INFO L280 TraceCheckUtils]: 29: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:15,007 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-18 04:40:15,008 INFO L280 TraceCheckUtils]: 31: Hoare triple {798#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {798#(<= main_~x~0 2)} is VALID [2020-07-18 04:40:15,008 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= main_~x~0 2)} ~result~0 := #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-18 04:40:15,009 INFO L280 TraceCheckUtils]: 33: Hoare triple {798#(<= main_~x~0 2)} havoc #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-18 04:40:15,010 INFO L280 TraceCheckUtils]: 34: Hoare triple {798#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {772#false} is VALID [2020-07-18 04:40:15,010 INFO L280 TraceCheckUtils]: 35: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-18 04:40:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-18 04:40:15,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243559811] [2020-07-18 04:40:15,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:15,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:40:15,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573772171] [2020-07-18 04:40:15,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-18 04:40:15,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:15,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:40:15,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:15,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:40:15,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:40:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:40:15,050 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-07-18 04:40:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:15,414 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-18 04:40:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:40:15,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-18 04:40:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:40:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-18 04:40:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:40:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-18 04:40:15,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-18 04:40:15,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:15,498 INFO L225 Difference]: With dead ends: 58 [2020-07-18 04:40:15,498 INFO L226 Difference]: Without dead ends: 52 [2020-07-18 04:40:15,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:40:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-18 04:40:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-18 04:40:15,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:15,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-18 04:40:15,577 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-18 04:40:15,577 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-18 04:40:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:15,582 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-18 04:40:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-18 04:40:15,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:15,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:15,583 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-18 04:40:15,583 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-18 04:40:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:15,589 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-18 04:40:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-18 04:40:15,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:15,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:15,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:15,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 04:40:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-18 04:40:15,595 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-18 04:40:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:15,596 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-18 04:40:15,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:40:15,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2020-07-18 04:40:15,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-18 04:40:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 04:40:15,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:15,689 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:15,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:40:15,689 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-18 04:40:15,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:15,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910604493] [2020-07-18 04:40:15,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,726 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-18 04:40:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-18 04:40:15,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-18 04:40:15,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,823 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-18 04:40:15,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-18 04:40:15,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,829 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-18 04:40:15,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-18 04:40:15,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-18 04:40:15,833 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-18 04:40:15,833 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,834 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,835 INFO L263 TraceCheckUtils]: 11: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-18 04:40:15,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-18 04:40:15,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-18 04:40:15,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,837 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,838 INFO L280 TraceCheckUtils]: 18: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,838 INFO L280 TraceCheckUtils]: 19: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,839 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,839 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,840 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-18 04:40:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:15,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,861 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-18 04:40:15,862 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-18 04:40:15,862 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-18 04:40:15,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,864 INFO L280 TraceCheckUtils]: 5: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-18 04:40:15,864 INFO L280 TraceCheckUtils]: 6: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,865 INFO L263 TraceCheckUtils]: 7: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-18 04:40:15,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,865 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,865 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-18 04:40:15,865 INFO L280 TraceCheckUtils]: 11: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-18 04:40:15,866 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,867 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,867 INFO L280 TraceCheckUtils]: 14: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,867 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-18 04:40:15,868 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,868 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-18 04:40:15,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-18 04:40:15,868 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,870 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,876 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,876 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,877 INFO L280 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,877 INFO L280 TraceCheckUtils]: 24: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,878 INFO L280 TraceCheckUtils]: 25: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,879 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-18 04:40:15,880 INFO L280 TraceCheckUtils]: 27: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-18 04:40:15,880 INFO L263 TraceCheckUtils]: 28: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-18 04:40:15,881 INFO L280 TraceCheckUtils]: 29: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,881 INFO L280 TraceCheckUtils]: 30: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,882 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,883 INFO L280 TraceCheckUtils]: 32: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,884 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-18 04:40:15,884 INFO L280 TraceCheckUtils]: 34: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-18 04:40:15,884 INFO L280 TraceCheckUtils]: 35: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-18 04:40:15,884 INFO L280 TraceCheckUtils]: 36: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-18 04:40:15,884 INFO L280 TraceCheckUtils]: 37: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-18 04:40:15,884 INFO L280 TraceCheckUtils]: 38: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-18 04:40:15,885 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-18 04:40:15,886 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret4 := main(); {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} ~x~0 := #t~nondet2; {1145#true} is VALID [2020-07-18 04:40:15,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} havoc #t~nondet2; {1145#true} is VALID [2020-07-18 04:40:15,888 INFO L263 TraceCheckUtils]: 7: Hoare triple {1145#true} call #t~ret3 := fibonacci(~x~0); {1145#true} is VALID [2020-07-18 04:40:15,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-18 04:40:15,888 INFO L263 TraceCheckUtils]: 11: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-18 04:40:15,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,892 INFO L280 TraceCheckUtils]: 13: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-18 04:40:15,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,893 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-18 04:40:15,893 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,893 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-18 04:40:15,893 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-18 04:40:15,893 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-18 04:40:15,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,894 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,895 INFO L263 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-18 04:40:15,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-18 04:40:15,895 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-18 04:40:15,895 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-18 04:40:15,895 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-18 04:40:15,896 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,896 INFO L280 TraceCheckUtils]: 29: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,897 INFO L280 TraceCheckUtils]: 30: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,897 INFO L280 TraceCheckUtils]: 31: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,898 INFO L280 TraceCheckUtils]: 32: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,899 INFO L280 TraceCheckUtils]: 33: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,900 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-18 04:40:15,901 INFO L280 TraceCheckUtils]: 35: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-18 04:40:15,901 INFO L263 TraceCheckUtils]: 36: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-18 04:40:15,902 INFO L280 TraceCheckUtils]: 37: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:15,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,903 INFO L280 TraceCheckUtils]: 39: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,908 INFO L280 TraceCheckUtils]: 40: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-18 04:40:15,912 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-18 04:40:15,912 INFO L280 TraceCheckUtils]: 42: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-18 04:40:15,912 INFO L280 TraceCheckUtils]: 43: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-18 04:40:15,913 INFO L280 TraceCheckUtils]: 44: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-18 04:40:15,913 INFO L280 TraceCheckUtils]: 45: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-18 04:40:15,913 INFO L280 TraceCheckUtils]: 46: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-18 04:40:15,913 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-18 04:40:15,914 INFO L280 TraceCheckUtils]: 48: Hoare triple {1146#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1146#false} is VALID [2020-07-18 04:40:15,914 INFO L280 TraceCheckUtils]: 49: Hoare triple {1146#false} ~result~0 := #t~ret3; {1146#false} is VALID [2020-07-18 04:40:15,914 INFO L280 TraceCheckUtils]: 50: Hoare triple {1146#false} havoc #t~ret3; {1146#false} is VALID [2020-07-18 04:40:15,914 INFO L280 TraceCheckUtils]: 51: Hoare triple {1146#false} assume !(5 != ~x~0 || 3 == ~result~0); {1146#false} is VALID [2020-07-18 04:40:15,914 INFO L280 TraceCheckUtils]: 52: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-18 04:40:15,917 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-18 04:40:15,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910604493] [2020-07-18 04:40:15,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:15,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:40:15,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376734326] [2020-07-18 04:40:15,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-18 04:40:15,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:15,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:40:15,989 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-18 04:40:15,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:40:15,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:40:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:15,990 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-07-18 04:40:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:16,409 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-18 04:40:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:40:16,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-18 04:40:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-18 04:40:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-18 04:40:16,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-18 04:40:16,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:16,492 INFO L225 Difference]: With dead ends: 110 [2020-07-18 04:40:16,492 INFO L226 Difference]: Without dead ends: 66 [2020-07-18 04:40:16,494 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-18 04:40:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-18 04:40:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-18 04:40:16,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:16,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 54 states. [2020-07-18 04:40:16,567 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 54 states. [2020-07-18 04:40:16,567 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 54 states. [2020-07-18 04:40:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:16,578 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-18 04:40:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-18 04:40:16,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:16,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:16,579 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 66 states. [2020-07-18 04:40:16,579 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 66 states. [2020-07-18 04:40:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:16,588 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-18 04:40:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-18 04:40:16,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:16,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:16,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:16,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 04:40:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-18 04:40:16,596 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-18 04:40:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:16,597 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-18 04:40:16,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:40:16,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2020-07-18 04:40:16,700 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-18 04:40:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-18 04:40:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 04:40:16,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:16,702 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:16,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:40:16,702 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-18 04:40:16,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:16,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396546709] [2020-07-18 04:40:16,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,771 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-18 04:40:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,876 INFO L280 TraceCheckUtils]: 3: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,876 INFO L280 TraceCheckUtils]: 4: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,878 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-18 04:40:16,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-18 04:40:16,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,885 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,889 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-18 04:40:16,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,895 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,896 INFO L263 TraceCheckUtils]: 11: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-18 04:40:16,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-18 04:40:16,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-18 04:40:16,897 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,898 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,900 INFO L280 TraceCheckUtils]: 19: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,900 INFO L280 TraceCheckUtils]: 20: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,901 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,902 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:16,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-18 04:40:16,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-18 04:40:16,910 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-18 04:40:16,910 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,911 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,913 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-18 04:40:16,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,916 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,916 INFO L263 TraceCheckUtils]: 7: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-18 04:40:16,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,917 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,919 INFO L280 TraceCheckUtils]: 11: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,919 INFO L280 TraceCheckUtils]: 12: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,921 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,922 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,922 INFO L263 TraceCheckUtils]: 15: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-18 04:40:16,922 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,923 INFO L280 TraceCheckUtils]: 17: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-18 04:40:16,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-18 04:40:16,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,924 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,925 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,926 INFO L280 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,929 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,930 INFO L280 TraceCheckUtils]: 27: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,930 INFO L263 TraceCheckUtils]: 28: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-18 04:40:16,930 INFO L280 TraceCheckUtils]: 29: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,930 INFO L280 TraceCheckUtils]: 30: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-18 04:40:16,931 INFO L280 TraceCheckUtils]: 31: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-18 04:40:16,931 INFO L280 TraceCheckUtils]: 32: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-18 04:40:16,931 INFO L280 TraceCheckUtils]: 33: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,933 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,933 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,934 INFO L280 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,935 INFO L280 TraceCheckUtils]: 37: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,936 INFO L280 TraceCheckUtils]: 38: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,936 INFO L280 TraceCheckUtils]: 39: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,938 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-18 04:40:16,941 INFO L263 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2020-07-18 04:40:16,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,941 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-18 04:40:16,942 INFO L263 TraceCheckUtils]: 3: Hoare triple {1703#true} call #t~ret4 := main(); {1703#true} is VALID [2020-07-18 04:40:16,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1703#true} is VALID [2020-07-18 04:40:16,942 INFO L280 TraceCheckUtils]: 5: Hoare triple {1703#true} ~x~0 := #t~nondet2; {1703#true} is VALID [2020-07-18 04:40:16,942 INFO L280 TraceCheckUtils]: 6: Hoare triple {1703#true} havoc #t~nondet2; {1703#true} is VALID [2020-07-18 04:40:16,943 INFO L263 TraceCheckUtils]: 7: Hoare triple {1703#true} call #t~ret3 := fibonacci(~x~0); {1703#true} is VALID [2020-07-18 04:40:16,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,944 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,945 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,945 INFO L263 TraceCheckUtils]: 11: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-18 04:40:16,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,947 INFO L280 TraceCheckUtils]: 14: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,948 INFO L263 TraceCheckUtils]: 15: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-18 04:40:16,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,949 INFO L280 TraceCheckUtils]: 17: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:16,950 INFO L280 TraceCheckUtils]: 18: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,951 INFO L280 TraceCheckUtils]: 19: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,951 INFO L280 TraceCheckUtils]: 20: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:16,953 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,954 INFO L263 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-18 04:40:16,954 INFO L280 TraceCheckUtils]: 24: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,955 INFO L280 TraceCheckUtils]: 25: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-18 04:40:16,955 INFO L280 TraceCheckUtils]: 26: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-18 04:40:16,955 INFO L280 TraceCheckUtils]: 27: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,956 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,957 INFO L280 TraceCheckUtils]: 29: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,958 INFO L280 TraceCheckUtils]: 31: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,959 INFO L280 TraceCheckUtils]: 32: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,960 INFO L280 TraceCheckUtils]: 33: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:16,961 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,961 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,962 INFO L263 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-18 04:40:16,962 INFO L280 TraceCheckUtils]: 37: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-18 04:40:16,962 INFO L280 TraceCheckUtils]: 38: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-18 04:40:16,962 INFO L280 TraceCheckUtils]: 39: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-18 04:40:16,962 INFO L280 TraceCheckUtils]: 40: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-18 04:40:16,963 INFO L280 TraceCheckUtils]: 41: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-18 04:40:16,963 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,964 INFO L280 TraceCheckUtils]: 43: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,965 INFO L280 TraceCheckUtils]: 44: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,965 INFO L280 TraceCheckUtils]: 45: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,966 INFO L280 TraceCheckUtils]: 46: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,966 INFO L280 TraceCheckUtils]: 47: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:16,967 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-18 04:40:16,968 INFO L280 TraceCheckUtils]: 49: Hoare triple {1748#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1748#(<= main_~x~0 3)} is VALID [2020-07-18 04:40:16,969 INFO L280 TraceCheckUtils]: 50: Hoare triple {1748#(<= main_~x~0 3)} ~result~0 := #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-18 04:40:16,969 INFO L280 TraceCheckUtils]: 51: Hoare triple {1748#(<= main_~x~0 3)} havoc #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-18 04:40:16,970 INFO L280 TraceCheckUtils]: 52: Hoare triple {1748#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {1704#false} is VALID [2020-07-18 04:40:16,970 INFO L280 TraceCheckUtils]: 53: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2020-07-18 04:40:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-18 04:40:16,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396546709] [2020-07-18 04:40:16,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:16,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:40:16,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142505238] [2020-07-18 04:40:16,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-18 04:40:16,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:16,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:40:17,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:17,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:40:17,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:17,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:40:17,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:17,036 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-07-18 04:40:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:17,522 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-18 04:40:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:40:17,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-18 04:40:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-18 04:40:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-18 04:40:17,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-18 04:40:17,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:17,603 INFO L225 Difference]: With dead ends: 88 [2020-07-18 04:40:17,603 INFO L226 Difference]: Without dead ends: 82 [2020-07-18 04:40:17,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:40:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-18 04:40:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-18 04:40:17,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:17,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 76 states. [2020-07-18 04:40:17,739 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 76 states. [2020-07-18 04:40:17,739 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 76 states. [2020-07-18 04:40:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:17,748 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-18 04:40:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-18 04:40:17,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:17,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:17,750 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 82 states. [2020-07-18 04:40:17,750 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 82 states. [2020-07-18 04:40:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:17,761 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-18 04:40:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-18 04:40:17,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:17,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:17,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:17,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 04:40:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-18 04:40:17,773 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-18 04:40:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:17,773 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-18 04:40:17,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:40:17,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 102 transitions. [2020-07-18 04:40:17,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-18 04:40:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-18 04:40:17,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:17,902 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:17,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:40:17,902 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-18 04:40:17,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:17,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253307070] [2020-07-18 04:40:17,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:17,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:17,976 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-18 04:40:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,204 INFO L280 TraceCheckUtils]: 4: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,206 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,214 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,218 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,223 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,223 INFO L263 TraceCheckUtils]: 11: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,224 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,225 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,226 INFO L280 TraceCheckUtils]: 17: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,226 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,227 INFO L280 TraceCheckUtils]: 20: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,228 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,230 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,243 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,245 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,246 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,266 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,272 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,272 INFO L280 TraceCheckUtils]: 14: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,273 INFO L263 TraceCheckUtils]: 15: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,273 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,273 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,274 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,277 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,278 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,278 INFO L280 TraceCheckUtils]: 22: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,279 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,280 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,281 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,282 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,283 INFO L280 TraceCheckUtils]: 27: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,283 INFO L263 TraceCheckUtils]: 28: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,284 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,284 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,284 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,285 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,285 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,286 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,287 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,288 INFO L280 TraceCheckUtils]: 36: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,288 INFO L280 TraceCheckUtils]: 37: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,289 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,290 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,291 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-18 04:40:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,443 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,444 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,451 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,453 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,455 INFO L263 TraceCheckUtils]: 3: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,455 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,458 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,458 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,459 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,460 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,460 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,461 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,462 INFO L280 TraceCheckUtils]: 17: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,463 INFO L280 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,464 INFO L280 TraceCheckUtils]: 20: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,467 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,484 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,486 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,489 INFO L263 TraceCheckUtils]: 7: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,492 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,493 INFO L263 TraceCheckUtils]: 15: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,494 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,495 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,496 INFO L280 TraceCheckUtils]: 23: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,497 INFO L280 TraceCheckUtils]: 24: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,497 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,498 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,499 INFO L280 TraceCheckUtils]: 27: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,499 INFO L263 TraceCheckUtils]: 28: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,499 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,500 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,500 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,500 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,500 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,501 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,502 INFO L280 TraceCheckUtils]: 35: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,502 INFO L280 TraceCheckUtils]: 36: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,503 INFO L280 TraceCheckUtils]: 37: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,503 INFO L280 TraceCheckUtils]: 38: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,504 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,505 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:18,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,525 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,526 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,528 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,529 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,529 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,530 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,530 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,531 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,531 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,532 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,532 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,532 INFO L263 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,533 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,533 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,533 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,536 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,550 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,551 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,552 INFO L280 TraceCheckUtils]: 26: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,552 INFO L280 TraceCheckUtils]: 27: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,552 INFO L280 TraceCheckUtils]: 28: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,553 INFO L280 TraceCheckUtils]: 29: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,554 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,555 INFO L280 TraceCheckUtils]: 31: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,555 INFO L263 TraceCheckUtils]: 32: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,555 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,555 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,556 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,556 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,556 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,563 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,564 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,564 INFO L280 TraceCheckUtils]: 40: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,565 INFO L280 TraceCheckUtils]: 41: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,566 INFO L280 TraceCheckUtils]: 42: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,566 INFO L280 TraceCheckUtils]: 43: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,567 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,568 INFO L280 TraceCheckUtils]: 45: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,568 INFO L263 TraceCheckUtils]: 46: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,568 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,569 INFO L280 TraceCheckUtils]: 48: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,569 INFO L280 TraceCheckUtils]: 49: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,569 INFO L280 TraceCheckUtils]: 50: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,569 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,570 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,570 INFO L280 TraceCheckUtils]: 53: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,571 INFO L280 TraceCheckUtils]: 54: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,571 INFO L280 TraceCheckUtils]: 55: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,572 INFO L280 TraceCheckUtils]: 56: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,572 INFO L280 TraceCheckUtils]: 57: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,573 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-18 04:40:18,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-18 04:40:18,578 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,580 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,581 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,581 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,582 INFO L263 TraceCheckUtils]: 11: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,585 INFO L280 TraceCheckUtils]: 16: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,586 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,587 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,587 INFO L263 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,588 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,588 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,589 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,589 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,590 INFO L280 TraceCheckUtils]: 28: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,591 INFO L280 TraceCheckUtils]: 29: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,592 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,592 INFO L280 TraceCheckUtils]: 31: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,592 INFO L263 TraceCheckUtils]: 32: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,593 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,593 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,593 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,593 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,593 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,595 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,595 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,596 INFO L280 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,596 INFO L280 TraceCheckUtils]: 41: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,597 INFO L280 TraceCheckUtils]: 42: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,597 INFO L280 TraceCheckUtils]: 43: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,598 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-18 04:40:18,599 INFO L280 TraceCheckUtils]: 45: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-18 04:40:18,599 INFO L263 TraceCheckUtils]: 46: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,599 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,600 INFO L280 TraceCheckUtils]: 48: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,600 INFO L280 TraceCheckUtils]: 49: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,601 INFO L263 TraceCheckUtils]: 50: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,601 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,602 INFO L280 TraceCheckUtils]: 52: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,602 INFO L280 TraceCheckUtils]: 53: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,602 INFO L263 TraceCheckUtils]: 54: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,603 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,604 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,604 INFO L280 TraceCheckUtils]: 57: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,604 INFO L263 TraceCheckUtils]: 58: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,604 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,605 INFO L280 TraceCheckUtils]: 60: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,605 INFO L280 TraceCheckUtils]: 61: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,605 INFO L280 TraceCheckUtils]: 62: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,605 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,606 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,607 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,607 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,607 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,607 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,607 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,608 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,608 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,609 INFO L280 TraceCheckUtils]: 72: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,609 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,610 INFO L280 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,610 INFO L280 TraceCheckUtils]: 75: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,611 INFO L280 TraceCheckUtils]: 76: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,612 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,612 INFO L280 TraceCheckUtils]: 78: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,613 INFO L263 TraceCheckUtils]: 79: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,613 INFO L280 TraceCheckUtils]: 80: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,613 INFO L280 TraceCheckUtils]: 81: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,613 INFO L280 TraceCheckUtils]: 82: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,613 INFO L280 TraceCheckUtils]: 83: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,614 INFO L280 TraceCheckUtils]: 84: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,615 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,615 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,616 INFO L280 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,616 INFO L280 TraceCheckUtils]: 88: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,617 INFO L280 TraceCheckUtils]: 89: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,617 INFO L280 TraceCheckUtils]: 90: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,618 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,619 INFO L280 TraceCheckUtils]: 92: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,620 INFO L263 TraceCheckUtils]: 93: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,620 INFO L280 TraceCheckUtils]: 94: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,620 INFO L280 TraceCheckUtils]: 95: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,620 INFO L280 TraceCheckUtils]: 96: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,620 INFO L280 TraceCheckUtils]: 97: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,621 INFO L280 TraceCheckUtils]: 98: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,621 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,622 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,622 INFO L280 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,623 INFO L280 TraceCheckUtils]: 102: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,623 INFO L280 TraceCheckUtils]: 103: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,624 INFO L280 TraceCheckUtils]: 104: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,625 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-18 04:40:18,625 INFO L280 TraceCheckUtils]: 106: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-18 04:40:18,625 INFO L280 TraceCheckUtils]: 107: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-18 04:40:18,625 INFO L280 TraceCheckUtils]: 108: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-18 04:40:18,625 INFO L280 TraceCheckUtils]: 109: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-18 04:40:18,626 INFO L280 TraceCheckUtils]: 110: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-18 04:40:18,626 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-18 04:40:18,644 INFO L263 TraceCheckUtils]: 0: Hoare triple {2296#true} call ULTIMATE.init(); {2296#true} is VALID [2020-07-18 04:40:18,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,644 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-18 04:40:18,645 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret4 := main(); {2296#true} is VALID [2020-07-18 04:40:18,645 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2296#true} is VALID [2020-07-18 04:40:18,645 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} ~x~0 := #t~nondet2; {2296#true} is VALID [2020-07-18 04:40:18,645 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} havoc #t~nondet2; {2296#true} is VALID [2020-07-18 04:40:18,645 INFO L263 TraceCheckUtils]: 7: Hoare triple {2296#true} call #t~ret3 := fibonacci(~x~0); {2296#true} is VALID [2020-07-18 04:40:18,646 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,646 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-18 04:40:18,646 INFO L263 TraceCheckUtils]: 11: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,650 INFO L263 TraceCheckUtils]: 15: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,651 INFO L280 TraceCheckUtils]: 17: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,652 INFO L263 TraceCheckUtils]: 19: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,653 INFO L280 TraceCheckUtils]: 21: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,654 INFO L280 TraceCheckUtils]: 22: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,654 INFO L280 TraceCheckUtils]: 23: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:18,656 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,656 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,656 INFO L263 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,657 INFO L280 TraceCheckUtils]: 28: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,657 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,658 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,658 INFO L280 TraceCheckUtils]: 33: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,659 INFO L280 TraceCheckUtils]: 34: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,659 INFO L280 TraceCheckUtils]: 35: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,660 INFO L280 TraceCheckUtils]: 36: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,660 INFO L280 TraceCheckUtils]: 37: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:18,661 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,662 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,662 INFO L263 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,662 INFO L280 TraceCheckUtils]: 41: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,662 INFO L280 TraceCheckUtils]: 42: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,663 INFO L280 TraceCheckUtils]: 43: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,663 INFO L280 TraceCheckUtils]: 44: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,663 INFO L280 TraceCheckUtils]: 45: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,664 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,664 INFO L280 TraceCheckUtils]: 47: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,665 INFO L280 TraceCheckUtils]: 48: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,665 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,666 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,666 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:18,667 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-18 04:40:18,668 INFO L280 TraceCheckUtils]: 53: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-18 04:40:18,668 INFO L263 TraceCheckUtils]: 54: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,668 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,669 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,669 INFO L280 TraceCheckUtils]: 57: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,669 INFO L263 TraceCheckUtils]: 58: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,670 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,670 INFO L280 TraceCheckUtils]: 60: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,671 INFO L280 TraceCheckUtils]: 61: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,671 INFO L263 TraceCheckUtils]: 62: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,671 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,672 INFO L280 TraceCheckUtils]: 64: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,672 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,673 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-18 04:40:18,673 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,673 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,673 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,673 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,673 INFO L280 TraceCheckUtils]: 71: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,674 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,675 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,675 INFO L263 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,675 INFO L280 TraceCheckUtils]: 75: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,675 INFO L280 TraceCheckUtils]: 76: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-18 04:40:18,675 INFO L280 TraceCheckUtils]: 77: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-18 04:40:18,676 INFO L280 TraceCheckUtils]: 78: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,676 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,677 INFO L280 TraceCheckUtils]: 80: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,677 INFO L280 TraceCheckUtils]: 81: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,678 INFO L280 TraceCheckUtils]: 82: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,678 INFO L280 TraceCheckUtils]: 83: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,679 INFO L280 TraceCheckUtils]: 84: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,680 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,680 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,680 INFO L263 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,681 INFO L280 TraceCheckUtils]: 88: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,681 INFO L280 TraceCheckUtils]: 89: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,681 INFO L280 TraceCheckUtils]: 90: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,681 INFO L280 TraceCheckUtils]: 91: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,681 INFO L280 TraceCheckUtils]: 92: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,683 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,683 INFO L280 TraceCheckUtils]: 94: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,684 INFO L280 TraceCheckUtils]: 95: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,684 INFO L280 TraceCheckUtils]: 96: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,685 INFO L280 TraceCheckUtils]: 97: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,685 INFO L280 TraceCheckUtils]: 98: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,686 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,687 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,687 INFO L263 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-18 04:40:18,687 INFO L280 TraceCheckUtils]: 102: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-18 04:40:18,687 INFO L280 TraceCheckUtils]: 103: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-18 04:40:18,688 INFO L280 TraceCheckUtils]: 104: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-18 04:40:18,688 INFO L280 TraceCheckUtils]: 105: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-18 04:40:18,688 INFO L280 TraceCheckUtils]: 106: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-18 04:40:18,689 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,689 INFO L280 TraceCheckUtils]: 108: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,690 INFO L280 TraceCheckUtils]: 109: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,690 INFO L280 TraceCheckUtils]: 110: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,691 INFO L280 TraceCheckUtils]: 111: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,691 INFO L280 TraceCheckUtils]: 112: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:18,692 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-18 04:40:18,692 INFO L280 TraceCheckUtils]: 114: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-18 04:40:18,692 INFO L280 TraceCheckUtils]: 115: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-18 04:40:18,692 INFO L280 TraceCheckUtils]: 116: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-18 04:40:18,693 INFO L280 TraceCheckUtils]: 117: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-18 04:40:18,693 INFO L280 TraceCheckUtils]: 118: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-18 04:40:18,693 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-18 04:40:18,693 INFO L280 TraceCheckUtils]: 120: Hoare triple {2297#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2297#false} is VALID [2020-07-18 04:40:18,693 INFO L280 TraceCheckUtils]: 121: Hoare triple {2297#false} ~result~0 := #t~ret3; {2297#false} is VALID [2020-07-18 04:40:18,694 INFO L280 TraceCheckUtils]: 122: Hoare triple {2297#false} havoc #t~ret3; {2297#false} is VALID [2020-07-18 04:40:18,694 INFO L280 TraceCheckUtils]: 123: Hoare triple {2297#false} assume !(5 != ~x~0 || 3 == ~result~0); {2297#false} is VALID [2020-07-18 04:40:18,694 INFO L280 TraceCheckUtils]: 124: Hoare triple {2297#false} assume !false; {2297#false} is VALID [2020-07-18 04:40:18,710 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-18 04:40:18,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253307070] [2020-07-18 04:40:18,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:18,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 04:40:18,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778799438] [2020-07-18 04:40:18,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-18 04:40:18,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:18,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 04:40:18,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:18,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 04:40:18,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:18,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 04:40:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:40:18,811 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-07-18 04:40:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:19,626 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-07-18 04:40:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 04:40:19,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-18 04:40:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:40:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-18 04:40:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:40:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-18 04:40:19,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2020-07-18 04:40:19,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:19,779 INFO L225 Difference]: With dead ends: 139 [2020-07-18 04:40:19,779 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 04:40:19,781 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-18 04:40:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 04:40:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-07-18 04:40:19,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:19,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 61 states. [2020-07-18 04:40:19,889 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 61 states. [2020-07-18 04:40:19,889 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 61 states. [2020-07-18 04:40:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:19,894 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-18 04:40:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-18 04:40:19,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:19,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:19,895 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 70 states. [2020-07-18 04:40:19,895 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 70 states. [2020-07-18 04:40:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:19,898 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-18 04:40:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-18 04:40:19,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:19,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:19,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:19,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-18 04:40:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-07-18 04:40:19,903 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-07-18 04:40:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:19,903 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-07-18 04:40:19,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 04:40:19,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2020-07-18 04:40:20,000 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-18 04:40:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-07-18 04:40:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-18 04:40:20,002 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:20,003 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:20,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 04:40:20,003 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-18 04:40:20,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:20,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270264089] [2020-07-18 04:40:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,044 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-18 04:40:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,162 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,168 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,169 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,171 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,171 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,172 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,174 INFO L280 TraceCheckUtils]: 8: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,175 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,176 INFO L263 TraceCheckUtils]: 11: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,176 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,176 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,176 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,177 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,178 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,178 INFO L280 TraceCheckUtils]: 17: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,179 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,179 INFO L280 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,179 INFO L280 TraceCheckUtils]: 20: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,180 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,181 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,190 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,193 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,195 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,195 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,197 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,228 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,229 INFO L263 TraceCheckUtils]: 15: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,229 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,229 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,229 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,230 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,230 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,231 INFO L280 TraceCheckUtils]: 22: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,232 INFO L280 TraceCheckUtils]: 23: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,232 INFO L280 TraceCheckUtils]: 24: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,233 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,234 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,235 INFO L280 TraceCheckUtils]: 27: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,235 INFO L263 TraceCheckUtils]: 28: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,235 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,235 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,236 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,236 INFO L280 TraceCheckUtils]: 32: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,236 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,237 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,237 INFO L280 TraceCheckUtils]: 35: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,238 INFO L280 TraceCheckUtils]: 36: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,238 INFO L280 TraceCheckUtils]: 37: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,239 INFO L280 TraceCheckUtils]: 38: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,239 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,240 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,262 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,262 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-18 04:40:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:20,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,267 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-18 04:40:20,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-18 04:40:20,268 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,269 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L263 TraceCheckUtils]: 11: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,270 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,271 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-18 04:40:20,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,271 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,272 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,272 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-18 04:40:20,272 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,273 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,275 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,277 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,279 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,281 INFO L280 TraceCheckUtils]: 15: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,282 INFO L280 TraceCheckUtils]: 16: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,283 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,284 INFO L263 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,285 INFO L280 TraceCheckUtils]: 22: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,285 INFO L280 TraceCheckUtils]: 23: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,286 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,286 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,287 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,287 INFO L280 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,288 INFO L280 TraceCheckUtils]: 28: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,288 INFO L280 TraceCheckUtils]: 29: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,290 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,291 INFO L280 TraceCheckUtils]: 31: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,291 INFO L263 TraceCheckUtils]: 32: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,291 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,292 INFO L280 TraceCheckUtils]: 35: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,292 INFO L280 TraceCheckUtils]: 36: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,292 INFO L280 TraceCheckUtils]: 37: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,293 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,294 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,295 INFO L280 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,295 INFO L280 TraceCheckUtils]: 41: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,296 INFO L280 TraceCheckUtils]: 42: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,296 INFO L280 TraceCheckUtils]: 43: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,298 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,298 INFO L280 TraceCheckUtils]: 45: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,299 INFO L263 TraceCheckUtils]: 46: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,299 INFO L280 TraceCheckUtils]: 47: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,299 INFO L280 TraceCheckUtils]: 48: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,299 INFO L280 TraceCheckUtils]: 49: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-18 04:40:20,300 INFO L263 TraceCheckUtils]: 50: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,300 INFO L280 TraceCheckUtils]: 51: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,300 INFO L280 TraceCheckUtils]: 52: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,300 INFO L280 TraceCheckUtils]: 53: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,300 INFO L280 TraceCheckUtils]: 54: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,301 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,301 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-18 04:40:20,301 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,301 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,302 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,302 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,302 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,302 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,302 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-18 04:40:20,303 INFO L280 TraceCheckUtils]: 64: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,303 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,303 INFO L280 TraceCheckUtils]: 66: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,303 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-18 04:40:20,303 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,304 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,305 INFO L280 TraceCheckUtils]: 70: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,305 INFO L280 TraceCheckUtils]: 71: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,306 INFO L280 TraceCheckUtils]: 72: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,306 INFO L280 TraceCheckUtils]: 73: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,307 INFO L280 TraceCheckUtils]: 74: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,307 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-18 04:40:20,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2020-07-18 04:40:20,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,313 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-18 04:40:20,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret4 := main(); {3215#true} is VALID [2020-07-18 04:40:20,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} ~x~0 := #t~nondet2; {3215#true} is VALID [2020-07-18 04:40:20,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} havoc #t~nondet2; {3215#true} is VALID [2020-07-18 04:40:20,314 INFO L263 TraceCheckUtils]: 7: Hoare triple {3215#true} call #t~ret3 := fibonacci(~x~0); {3215#true} is VALID [2020-07-18 04:40:20,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,316 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,317 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,318 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,318 INFO L263 TraceCheckUtils]: 15: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,321 INFO L263 TraceCheckUtils]: 19: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,321 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:20,323 INFO L280 TraceCheckUtils]: 22: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,323 INFO L280 TraceCheckUtils]: 23: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,323 INFO L280 TraceCheckUtils]: 24: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:20,325 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,325 INFO L263 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,325 INFO L280 TraceCheckUtils]: 28: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,326 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,326 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,326 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,327 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,327 INFO L280 TraceCheckUtils]: 33: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,328 INFO L280 TraceCheckUtils]: 34: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,328 INFO L280 TraceCheckUtils]: 35: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,329 INFO L280 TraceCheckUtils]: 36: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,329 INFO L280 TraceCheckUtils]: 37: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-18 04:40:20,331 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,331 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,332 INFO L263 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,332 INFO L280 TraceCheckUtils]: 41: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,332 INFO L280 TraceCheckUtils]: 42: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,332 INFO L280 TraceCheckUtils]: 43: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,332 INFO L280 TraceCheckUtils]: 44: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,333 INFO L280 TraceCheckUtils]: 45: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,333 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,334 INFO L280 TraceCheckUtils]: 47: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,334 INFO L280 TraceCheckUtils]: 48: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,335 INFO L280 TraceCheckUtils]: 49: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,335 INFO L280 TraceCheckUtils]: 50: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,336 INFO L280 TraceCheckUtils]: 51: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-18 04:40:20,337 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,337 INFO L280 TraceCheckUtils]: 53: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,338 INFO L263 TraceCheckUtils]: 54: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,338 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,338 INFO L280 TraceCheckUtils]: 56: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,338 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-18 04:40:20,338 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L280 TraceCheckUtils]: 63: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,339 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L263 TraceCheckUtils]: 66: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L280 TraceCheckUtils]: 69: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-18 04:40:20,340 INFO L280 TraceCheckUtils]: 70: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,341 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-18 04:40:20,341 INFO L280 TraceCheckUtils]: 72: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-18 04:40:20,341 INFO L280 TraceCheckUtils]: 73: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,341 INFO L280 TraceCheckUtils]: 74: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-18 04:40:20,341 INFO L280 TraceCheckUtils]: 75: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-18 04:40:20,345 INFO L280 TraceCheckUtils]: 76: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-18 04:40:20,347 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,347 INFO L280 TraceCheckUtils]: 78: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,348 INFO L280 TraceCheckUtils]: 79: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,348 INFO L280 TraceCheckUtils]: 80: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,349 INFO L280 TraceCheckUtils]: 81: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,349 INFO L280 TraceCheckUtils]: 82: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-18 04:40:20,350 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-18 04:40:20,351 INFO L280 TraceCheckUtils]: 84: Hoare triple {3295#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3295#(<= main_~x~0 4)} is VALID [2020-07-18 04:40:20,351 INFO L280 TraceCheckUtils]: 85: Hoare triple {3295#(<= main_~x~0 4)} ~result~0 := #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-18 04:40:20,352 INFO L280 TraceCheckUtils]: 86: Hoare triple {3295#(<= main_~x~0 4)} havoc #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-18 04:40:20,352 INFO L280 TraceCheckUtils]: 87: Hoare triple {3295#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {3216#false} is VALID [2020-07-18 04:40:20,353 INFO L280 TraceCheckUtils]: 88: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2020-07-18 04:40:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-07-18 04:40:20,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270264089] [2020-07-18 04:40:20,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:20,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:40:20,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431574207] [2020-07-18 04:40:20,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-18 04:40:20,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:20,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:40:20,423 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-18 04:40:20,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:40:20,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:40:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:40:20,424 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-07-18 04:40:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:20,847 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-07-18 04:40:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 04:40:20,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-18 04:40:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:40:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-18 04:40:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:40:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-18 04:40:20,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-18 04:40:20,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:20,939 INFO L225 Difference]: With dead ends: 73 [2020-07-18 04:40:20,939 INFO L226 Difference]: Without dead ends: 67 [2020-07-18 04:40:20,940 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-18 04:40:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-18 04:40:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-18 04:40:21,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:21,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-18 04:40:21,076 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-18 04:40:21,076 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-18 04:40:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:21,083 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-18 04:40:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-18 04:40:21,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:21,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:21,084 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-18 04:40:21,084 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-18 04:40:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:21,089 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-18 04:40:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-18 04:40:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:21,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:21,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-18 04:40:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-07-18 04:40:21,093 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-07-18 04:40:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:21,094 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-07-18 04:40:21,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:40:21,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2020-07-18 04:40:21,210 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-18 04:40:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-18 04:40:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-18 04:40:21,213 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:21,215 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:21,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 04:40:21,215 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-18 04:40:21,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:21,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991929948] [2020-07-18 04:40:21,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,330 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-18 04:40:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,449 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,453 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,453 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,455 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,455 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,456 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,457 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,457 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,458 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,458 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,462 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,462 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,464 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,465 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,465 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,465 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,466 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,466 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,466 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,467 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,467 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,467 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,468 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,468 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,468 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,469 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,469 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,469 INFO L263 TraceCheckUtils]: 28: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,470 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,470 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,470 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,470 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,470 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,471 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,471 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,471 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,471 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,471 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,472 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,481 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,485 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,486 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,487 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,487 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,488 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,488 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,488 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,488 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,489 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,489 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,489 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,489 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,489 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,490 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,490 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,491 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,492 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,493 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,493 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,494 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,494 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,494 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,495 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,495 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,495 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,495 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,496 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,496 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,496 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,496 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,496 INFO L263 TraceCheckUtils]: 32: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,497 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,498 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,498 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,498 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,498 INFO L280 TraceCheckUtils]: 42: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L263 TraceCheckUtils]: 46: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,499 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,500 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,500 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,500 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,500 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,500 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,501 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,501 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,501 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,501 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,501 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,502 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,502 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,502 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,502 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,502 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,503 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,504 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,504 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,504 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,504 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,504 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,505 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,618 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,622 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,623 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,625 INFO L263 TraceCheckUtils]: 3: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,627 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,628 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,630 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,634 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,640 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,642 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,644 INFO L263 TraceCheckUtils]: 7: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,646 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,646 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,646 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,647 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,647 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,648 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,649 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,651 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,652 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,653 INFO L280 TraceCheckUtils]: 27: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,653 INFO L263 TraceCheckUtils]: 28: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,653 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,654 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,654 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,655 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,656 INFO L280 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,656 INFO L280 TraceCheckUtils]: 37: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,657 INFO L280 TraceCheckUtils]: 38: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,657 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,658 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,671 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,675 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,677 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,677 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,678 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,678 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,678 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,679 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,679 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,679 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,680 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,681 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,683 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,685 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,687 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,687 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,688 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,688 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,689 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,689 INFO L263 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,690 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,690 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,691 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,692 INFO L280 TraceCheckUtils]: 26: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,693 INFO L280 TraceCheckUtils]: 27: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,693 INFO L280 TraceCheckUtils]: 28: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,694 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,695 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,695 INFO L280 TraceCheckUtils]: 31: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,696 INFO L263 TraceCheckUtils]: 32: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,696 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,696 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,696 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,697 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,697 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,698 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,698 INFO L280 TraceCheckUtils]: 40: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,699 INFO L280 TraceCheckUtils]: 41: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,699 INFO L280 TraceCheckUtils]: 42: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,700 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,701 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,702 INFO L280 TraceCheckUtils]: 45: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,702 INFO L263 TraceCheckUtils]: 46: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,702 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,702 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,703 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,703 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,703 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,703 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,703 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,704 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,705 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,705 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,705 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,705 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,706 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,706 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,706 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,707 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,707 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,708 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,709 INFO L280 TraceCheckUtils]: 70: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,709 INFO L280 TraceCheckUtils]: 71: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,710 INFO L280 TraceCheckUtils]: 72: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,711 INFO L280 TraceCheckUtils]: 73: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,711 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,713 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:21,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,744 INFO L280 TraceCheckUtils]: 3: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,745 INFO L280 TraceCheckUtils]: 4: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,746 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-18 04:40:21,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,749 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,751 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,751 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,753 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,753 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,753 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,753 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,754 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,754 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,755 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,756 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,756 INFO L263 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,756 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,757 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,757 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,757 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,758 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,759 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,760 INFO L280 TraceCheckUtils]: 30: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,760 INFO L280 TraceCheckUtils]: 31: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,761 INFO L280 TraceCheckUtils]: 32: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,761 INFO L280 TraceCheckUtils]: 33: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,763 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,763 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,764 INFO L263 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,764 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,764 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,764 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,765 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,765 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,766 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,767 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,767 INFO L280 TraceCheckUtils]: 44: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,768 INFO L280 TraceCheckUtils]: 45: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,768 INFO L280 TraceCheckUtils]: 46: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,769 INFO L280 TraceCheckUtils]: 47: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,770 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,771 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,771 INFO L263 TraceCheckUtils]: 50: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,771 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,771 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,772 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,772 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,772 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,772 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,773 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,773 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,773 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,773 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,774 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,774 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,774 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,775 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,775 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,775 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,775 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,776 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,776 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,776 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,776 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,777 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,778 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,778 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,779 INFO L280 TraceCheckUtils]: 75: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,780 INFO L280 TraceCheckUtils]: 76: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,780 INFO L280 TraceCheckUtils]: 77: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,781 INFO L280 TraceCheckUtils]: 78: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,782 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,783 INFO L280 TraceCheckUtils]: 80: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,783 INFO L263 TraceCheckUtils]: 81: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,784 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,784 INFO L280 TraceCheckUtils]: 83: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,785 INFO L280 TraceCheckUtils]: 84: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,786 INFO L280 TraceCheckUtils]: 85: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,786 INFO L280 TraceCheckUtils]: 86: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,787 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-18 04:40:21,788 INFO L280 TraceCheckUtils]: 88: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-18 04:40:21,788 INFO L280 TraceCheckUtils]: 89: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,788 INFO L280 TraceCheckUtils]: 90: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,789 INFO L280 TraceCheckUtils]: 91: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-18 04:40:21,789 INFO L280 TraceCheckUtils]: 92: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-18 04:40:21,789 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,802 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,803 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,803 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,804 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,804 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,804 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,805 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,805 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,805 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,806 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,806 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,807 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,807 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,807 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,808 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,808 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,808 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,809 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,809 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,809 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,809 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,810 INFO L263 TraceCheckUtils]: 36: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,810 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,810 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,810 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,811 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,811 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,811 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,811 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,811 INFO L280 TraceCheckUtils]: 44: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,812 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,813 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,813 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,813 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,813 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,813 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,814 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,815 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,815 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,815 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,815 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,815 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,816 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,816 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,816 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,816 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,816 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L280 TraceCheckUtils]: 75: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,817 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,818 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,818 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,819 INFO L280 TraceCheckUtils]: 80: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,819 INFO L263 TraceCheckUtils]: 81: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,819 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,820 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,820 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,820 INFO L263 TraceCheckUtils]: 85: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,820 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,821 INFO L280 TraceCheckUtils]: 87: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,821 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,822 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,822 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,823 INFO L280 TraceCheckUtils]: 91: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,823 INFO L280 TraceCheckUtils]: 92: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,823 INFO L263 TraceCheckUtils]: 93: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,824 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,824 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,825 INFO L280 TraceCheckUtils]: 96: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,825 INFO L263 TraceCheckUtils]: 97: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,825 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,826 INFO L280 TraceCheckUtils]: 99: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,826 INFO L280 TraceCheckUtils]: 100: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,826 INFO L280 TraceCheckUtils]: 101: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,826 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,827 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,827 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,828 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,828 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,828 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,828 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,828 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,829 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,830 INFO L280 TraceCheckUtils]: 111: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,830 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,831 INFO L280 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,831 INFO L280 TraceCheckUtils]: 114: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,832 INFO L280 TraceCheckUtils]: 115: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,833 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,833 INFO L280 TraceCheckUtils]: 117: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,833 INFO L263 TraceCheckUtils]: 118: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,834 INFO L280 TraceCheckUtils]: 119: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,834 INFO L280 TraceCheckUtils]: 120: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,834 INFO L280 TraceCheckUtils]: 121: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,834 INFO L280 TraceCheckUtils]: 122: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,834 INFO L280 TraceCheckUtils]: 123: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,835 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,836 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,836 INFO L280 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,837 INFO L280 TraceCheckUtils]: 127: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,837 INFO L280 TraceCheckUtils]: 128: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,838 INFO L280 TraceCheckUtils]: 129: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,839 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,839 INFO L280 TraceCheckUtils]: 131: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,840 INFO L263 TraceCheckUtils]: 132: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,840 INFO L280 TraceCheckUtils]: 133: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,840 INFO L280 TraceCheckUtils]: 134: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,840 INFO L280 TraceCheckUtils]: 135: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,840 INFO L263 TraceCheckUtils]: 136: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,840 INFO L280 TraceCheckUtils]: 137: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,841 INFO L280 TraceCheckUtils]: 138: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,841 INFO L280 TraceCheckUtils]: 139: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,841 INFO L280 TraceCheckUtils]: 140: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,841 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,841 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,842 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L280 TraceCheckUtils]: 150: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L280 TraceCheckUtils]: 152: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,843 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,844 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,845 INFO L280 TraceCheckUtils]: 156: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,845 INFO L280 TraceCheckUtils]: 157: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,846 INFO L280 TraceCheckUtils]: 158: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,846 INFO L280 TraceCheckUtils]: 159: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,847 INFO L280 TraceCheckUtils]: 160: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,848 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,848 INFO L280 TraceCheckUtils]: 162: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,849 INFO L263 TraceCheckUtils]: 163: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,849 INFO L280 TraceCheckUtils]: 164: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,850 INFO L280 TraceCheckUtils]: 165: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,850 INFO L280 TraceCheckUtils]: 166: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,851 INFO L280 TraceCheckUtils]: 167: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,851 INFO L280 TraceCheckUtils]: 168: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,852 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L280 TraceCheckUtils]: 170: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L280 TraceCheckUtils]: 171: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L280 TraceCheckUtils]: 172: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L280 TraceCheckUtils]: 173: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L280 TraceCheckUtils]: 174: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-18 04:40:21,853 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,854 INFO L280 TraceCheckUtils]: 176: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,854 INFO L280 TraceCheckUtils]: 177: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,855 INFO L280 TraceCheckUtils]: 178: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,855 INFO L280 TraceCheckUtils]: 179: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,856 INFO L280 TraceCheckUtils]: 180: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,857 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-18 04:40:21,877 INFO L263 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2020-07-18 04:40:21,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,877 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-18 04:40:21,877 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret4 := main(); {3840#true} is VALID [2020-07-18 04:40:21,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} ~x~0 := #t~nondet2; {3840#true} is VALID [2020-07-18 04:40:21,878 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} havoc #t~nondet2; {3840#true} is VALID [2020-07-18 04:40:21,878 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret3 := fibonacci(~x~0); {3840#true} is VALID [2020-07-18 04:40:21,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,879 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,880 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,880 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,880 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,880 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,881 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,881 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,881 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,881 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,881 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,882 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,883 INFO L263 TraceCheckUtils]: 31: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,884 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,884 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,884 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,884 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,884 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,885 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L263 TraceCheckUtils]: 44: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,886 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,887 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,888 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,888 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,888 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,888 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,888 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,889 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L263 TraceCheckUtils]: 70: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,890 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,891 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,892 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,892 INFO L280 TraceCheckUtils]: 79: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,892 INFO L280 TraceCheckUtils]: 80: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,892 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,892 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,893 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,893 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,893 INFO L280 TraceCheckUtils]: 85: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,893 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,894 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,895 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,895 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,895 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,895 INFO L280 TraceCheckUtils]: 91: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,895 INFO L280 TraceCheckUtils]: 92: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,896 INFO L263 TraceCheckUtils]: 93: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,896 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,896 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,897 INFO L280 TraceCheckUtils]: 96: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,897 INFO L263 TraceCheckUtils]: 97: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,897 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,898 INFO L280 TraceCheckUtils]: 99: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,898 INFO L280 TraceCheckUtils]: 100: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,898 INFO L263 TraceCheckUtils]: 101: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,898 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,899 INFO L280 TraceCheckUtils]: 103: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,899 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,899 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,900 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,900 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,900 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,900 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,900 INFO L280 TraceCheckUtils]: 110: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,904 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,907 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,907 INFO L263 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,908 INFO L280 TraceCheckUtils]: 114: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,908 INFO L280 TraceCheckUtils]: 115: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,908 INFO L280 TraceCheckUtils]: 116: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,908 INFO L280 TraceCheckUtils]: 117: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,910 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,910 INFO L280 TraceCheckUtils]: 119: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,911 INFO L280 TraceCheckUtils]: 120: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,911 INFO L280 TraceCheckUtils]: 121: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,912 INFO L280 TraceCheckUtils]: 122: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,912 INFO L280 TraceCheckUtils]: 123: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,913 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,914 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,914 INFO L263 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,914 INFO L280 TraceCheckUtils]: 127: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,914 INFO L280 TraceCheckUtils]: 128: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,915 INFO L280 TraceCheckUtils]: 129: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,915 INFO L280 TraceCheckUtils]: 130: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,915 INFO L280 TraceCheckUtils]: 131: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,916 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,917 INFO L280 TraceCheckUtils]: 133: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,917 INFO L280 TraceCheckUtils]: 134: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,918 INFO L280 TraceCheckUtils]: 135: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,918 INFO L280 TraceCheckUtils]: 136: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,919 INFO L280 TraceCheckUtils]: 137: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,920 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,920 INFO L280 TraceCheckUtils]: 139: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,921 INFO L263 TraceCheckUtils]: 140: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,921 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,921 INFO L280 TraceCheckUtils]: 142: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,921 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-18 04:40:21,921 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L280 TraceCheckUtils]: 149: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,922 INFO L275 TraceCheckUtils]: 150: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-18 04:40:21,932 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,932 INFO L263 TraceCheckUtils]: 152: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,932 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-18 04:40:21,932 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-18 04:40:21,932 INFO L280 TraceCheckUtils]: 155: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L280 TraceCheckUtils]: 156: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L280 TraceCheckUtils]: 158: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L280 TraceCheckUtils]: 159: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L280 TraceCheckUtils]: 160: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-18 04:40:21,933 INFO L280 TraceCheckUtils]: 161: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-18 04:40:21,934 INFO L280 TraceCheckUtils]: 162: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-18 04:40:21,935 INFO L275 TraceCheckUtils]: 163: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,935 INFO L280 TraceCheckUtils]: 164: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,936 INFO L280 TraceCheckUtils]: 165: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,936 INFO L280 TraceCheckUtils]: 166: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,937 INFO L280 TraceCheckUtils]: 167: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,937 INFO L280 TraceCheckUtils]: 168: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,938 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,939 INFO L280 TraceCheckUtils]: 170: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-18 04:40:21,939 INFO L263 TraceCheckUtils]: 171: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-18 04:40:21,940 INFO L280 TraceCheckUtils]: 172: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,940 INFO L280 TraceCheckUtils]: 173: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,941 INFO L280 TraceCheckUtils]: 174: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,941 INFO L280 TraceCheckUtils]: 175: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,942 INFO L280 TraceCheckUtils]: 176: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-18 04:40:21,942 INFO L275 TraceCheckUtils]: 177: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-18 04:40:21,943 INFO L280 TraceCheckUtils]: 178: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-18 04:40:21,943 INFO L280 TraceCheckUtils]: 179: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,943 INFO L280 TraceCheckUtils]: 180: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-18 04:40:21,943 INFO L280 TraceCheckUtils]: 181: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-18 04:40:21,943 INFO L280 TraceCheckUtils]: 182: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-18 04:40:21,944 INFO L275 TraceCheckUtils]: 183: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,944 INFO L280 TraceCheckUtils]: 184: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,945 INFO L280 TraceCheckUtils]: 185: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,945 INFO L280 TraceCheckUtils]: 186: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,946 INFO L280 TraceCheckUtils]: 187: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,946 INFO L280 TraceCheckUtils]: 188: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-18 04:40:21,947 INFO L275 TraceCheckUtils]: 189: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-18 04:40:21,947 INFO L280 TraceCheckUtils]: 190: Hoare triple {4026#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4026#(<= 6 main_~x~0)} is VALID [2020-07-18 04:40:21,948 INFO L280 TraceCheckUtils]: 191: Hoare triple {4026#(<= 6 main_~x~0)} ~result~0 := #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-18 04:40:21,948 INFO L280 TraceCheckUtils]: 192: Hoare triple {4026#(<= 6 main_~x~0)} havoc #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-18 04:40:21,949 INFO L280 TraceCheckUtils]: 193: Hoare triple {4026#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {3841#false} is VALID [2020-07-18 04:40:21,949 INFO L280 TraceCheckUtils]: 194: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2020-07-18 04:40:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 465 proven. 132 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2020-07-18 04:40:21,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991929948] [2020-07-18 04:40:21,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:21,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 04:40:21,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355917615] [2020-07-18 04:40:21,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-18 04:40:22,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:22,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 04:40:22,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:22,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 04:40:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 04:40:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:40:22,105 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2020-07-18 04:40:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:22,963 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2020-07-18 04:40:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 04:40:22,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-18 04:40:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:40:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-18 04:40:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 04:40:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-18 04:40:22,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2020-07-18 04:40:23,112 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-18 04:40:23,115 INFO L225 Difference]: With dead ends: 143 [2020-07-18 04:40:23,116 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 04:40:23,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-18 04:40:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 04:40:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-18 04:40:23,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:23,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-18 04:40:23,264 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 04:40:23,265 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 04:40:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:23,268 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-18 04:40:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-18 04:40:23,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:23,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:23,270 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 04:40:23,270 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 04:40:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:23,272 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-18 04:40:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-18 04:40:23,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:23,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:23,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:23,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 04:40:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-07-18 04:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 195 [2020-07-18 04:40:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:23,276 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-07-18 04:40:23,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 04:40:23,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 77 transitions. [2020-07-18 04:40:23,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-18 04:40:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-18 04:40:23,384 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:23,384 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:23,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 04:40:23,384 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-07-18 04:40:23,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:23,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536662276] [2020-07-18 04:40:23,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:40:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:40:23,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 04:40:23,442 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:103) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement$AtomicTraceElementBuilder.build(AtomicTraceElement.java:308) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createATESequence(IcfgProgramExecution.java:227) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 04:40:23,448 INFO L168 Benchmark]: Toolchain (without parser) took 11608.08 ms. Allocated memory was 136.3 MB in the beginning and 380.1 MB in the end (delta: 243.8 MB). Free memory was 102.1 MB in the beginning and 296.1 MB in the end (delta: -194.1 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,449 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 136.3 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.95 ms. Allocated memory is still 136.3 MB. Free memory was 101.6 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,450 INFO L168 Benchmark]: Boogie Preprocessor took 107.67 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 91.7 MB in the beginning and 178.9 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,450 INFO L168 Benchmark]: RCFGBuilder took 296.50 ms. Allocated memory is still 199.8 MB. Free memory was 178.9 MB in the beginning and 161.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,451 INFO L168 Benchmark]: TraceAbstraction took 10970.13 ms. Allocated memory was 199.8 MB in the beginning and 380.1 MB in the end (delta: 180.4 MB). Free memory was 160.5 MB in the beginning and 296.1 MB in the end (delta: -135.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:23,453 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.95 ms. Allocated memory is still 136.3 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.95 ms. Allocated memory is still 136.3 MB. Free memory was 101.6 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.67 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 91.7 MB in the beginning and 178.9 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 296.50 ms. Allocated memory is still 199.8 MB. Free memory was 178.9 MB in the beginning and 161.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10970.13 ms. Allocated memory was 199.8 MB in the beginning and 380.1 MB in the end (delta: 180.4 MB). Free memory was 160.5 MB in the beginning and 296.1 MB in the end (delta: -135.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;: de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...