/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:00:42,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:00:42,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:00:42,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:00:42,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:00:42,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:00:42,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:00:42,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:00:42,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:00:42,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:00:42,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:00:42,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:00:42,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:00:42,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:00:42,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:00:42,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:00:42,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:00:42,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:00:42,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:00:42,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:00:42,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:00:42,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:00:42,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:00:42,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:00:42,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:00:42,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:00:42,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:00:42,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:00:42,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:00:42,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:00:42,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:00:42,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:00:42,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:00:42,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:00:42,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:00:42,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:00:42,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:00:42,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:00:42,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:00:42,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:00:42,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:00:42,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:00:42,877 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:00:42,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:00:42,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:00:42,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:00:42,879 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:00:42,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:00:42,879 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:00:42,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:00:42,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:00:42,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:00:42,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:00:42,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:00:42,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:00:42,881 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:00:42,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:00:42,881 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:00:42,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:00:42,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:00:42,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:00:42,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:00:42,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:00:42,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:00:42,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:00:42,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:00:42,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:00:42,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:00:42,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:00:42,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:00:42,884 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:00:42,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:00:43,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:00:43,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:00:43,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:00:43,183 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:00:43,184 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:00:43,185 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-08 12:00:43,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564d0614d/a80adf9341414c8585b599f6fe91e6dd/FLAG049e82377 [2020-07-08 12:00:43,733 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:00:43,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-08 12:00:43,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564d0614d/a80adf9341414c8585b599f6fe91e6dd/FLAG049e82377 [2020-07-08 12:00:44,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564d0614d/a80adf9341414c8585b599f6fe91e6dd [2020-07-08 12:00:44,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:00:44,174 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:00:44,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:00:44,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:00:44,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:00:44,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739b4f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44, skipping insertion in model container [2020-07-08 12:00:44,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:00:44,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:00:44,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:00:44,422 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:00:44,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:00:44,451 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:00:44,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44 WrapperNode [2020-07-08 12:00:44,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:00:44,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:00:44,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:00:44,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:00:44,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... [2020-07-08 12:00:44,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:00:44,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:00:44,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:00:44,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:00:44,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:00:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:00:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:00:44,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-08 12:00:44,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:00:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:00:44,920 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:00:44,921 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:00:44,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:00:44 BoogieIcfgContainer [2020-07-08 12:00:44,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:00:44,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:00:44,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:00:44,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:00:44,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:00:44" (1/3) ... [2020-07-08 12:00:44,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19695454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:00:44, skipping insertion in model container [2020-07-08 12:00:44,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:00:44" (2/3) ... [2020-07-08 12:00:44,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19695454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:00:44, skipping insertion in model container [2020-07-08 12:00:44,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:00:44" (3/3) ... [2020-07-08 12:00:44,938 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-07-08 12:00:44,956 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:00:44,972 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:00:45,009 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:00:45,037 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:00:45,038 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:00:45,038 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:00:45,038 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:00:45,038 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:00:45,039 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:00:45,039 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:00:45,039 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:00:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-08 12:00:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:00:45,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:00:45,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:00:45,066 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:00:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:00:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2020-07-08 12:00:45,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:00:45,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501413231] [2020-07-08 12:00:45,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:00:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:45,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 12:00:45,326 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-08 12:00:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:45,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:45,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:45,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:45,394 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} {27#true} #42#return; {35#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 12:00:45,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-08 12:00:45,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 12:00:45,395 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-08 12:00:45,396 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2020-07-08 12:00:45,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {27#true} is VALID [2020-07-08 12:00:45,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {27#true} is VALID [2020-07-08 12:00:45,397 INFO L263 TraceCheckUtils]: 6: Hoare triple {27#true} call #t~ret3 := fibonacci(~x~0); {27#true} is VALID [2020-07-08 12:00:45,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:45,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:45,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:45,403 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} {27#true} #42#return; {35#(<= main_~x~0 |main_#t~ret3|)} is VALID [2020-07-08 12:00:45,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#(<= main_~x~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {36#(<= main_~x~0 main_~result~0)} is VALID [2020-07-08 12:00:45,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(<= main_~x~0 main_~result~0)} assume !(~result~0 >= ~x~0 - 1); {28#false} is VALID [2020-07-08 12:00:45,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-08 12:00:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:00:45,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501413231] [2020-07-08 12:00:45,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:00:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:00:45,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284285029] [2020-07-08 12:00:45,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:00:45,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:00:45,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:00:45,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:45,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:00:45,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:00:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:00:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:00:45,484 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2020-07-08 12:00:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:45,844 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-08 12:00:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:00:45,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-08 12:00:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:00:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:00:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-08 12:00:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:00:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-08 12:00:45,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-08 12:00:45,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:45,951 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:00:45,952 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:00:45,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:00:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:00:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 12:00:46,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:00:46,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 12:00:46,010 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:00:46,010 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:00:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:46,016 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:00:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:00:46,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:46,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:46,018 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:00:46,018 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:00:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:46,023 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:00:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:00:46,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:46,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:46,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:00:46,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:00:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:00:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-08 12:00:46,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2020-07-08 12:00:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:00:46,031 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-08 12:00:46,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:00:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:00:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:00:46,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:00:46,033 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] [2020-07-08 12:00:46,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:00:46,034 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:00:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:00:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2020-07-08 12:00:46,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:00:46,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399006721] [2020-07-08 12:00:46,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:00:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,096 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-08 12:00:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:46,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-08 12:00:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-08 12:00:46,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,204 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-08 12:00:46,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-08 12:00:46,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-08 12:00:46,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-08 12:00:46,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:46,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,214 INFO L280 TraceCheckUtils]: 6: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,216 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-08 12:00:46,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-08 12:00:46,217 INFO L263 TraceCheckUtils]: 9: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-08 12:00:46,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-08 12:00:46,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,218 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-08 12:00:46,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {162#false} is VALID [2020-07-08 12:00:46,219 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-08 12:00:46,219 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-08 12:00:46,221 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-08 12:00:46,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-08 12:00:46,222 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-08 12:00:46,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2020-07-08 12:00:46,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-08 12:00:46,223 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-08 12:00:46,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-08 12:00:46,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-08 12:00:46,225 INFO L263 TraceCheckUtils]: 10: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-08 12:00:46,226 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:46,227 INFO L280 TraceCheckUtils]: 12: Hoare triple {192#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,228 INFO L280 TraceCheckUtils]: 13: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:46,229 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-08 12:00:46,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-08 12:00:46,230 INFO L263 TraceCheckUtils]: 16: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-08 12:00:46,230 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,231 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-08 12:00:46,231 INFO L280 TraceCheckUtils]: 19: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,231 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-08 12:00:46,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {162#false} is VALID [2020-07-08 12:00:46,232 INFO L280 TraceCheckUtils]: 22: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-08 12:00:46,232 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-08 12:00:46,232 INFO L280 TraceCheckUtils]: 24: Hoare triple {162#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {162#false} is VALID [2020-07-08 12:00:46,233 INFO L280 TraceCheckUtils]: 25: Hoare triple {162#false} assume !(~result~0 >= ~x~0 - 1); {162#false} is VALID [2020-07-08 12:00:46,233 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-08 12:00:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:00:46,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399006721] [2020-07-08 12:00:46,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193166409] [2020-07-08 12:00:46,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-08 12:00:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:46,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:00:46,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-08 12:00:46,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-08 12:00:46,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-08 12:00:46,616 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-08 12:00:46,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {161#true} is VALID [2020-07-08 12:00:46,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-08 12:00:46,617 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-08 12:00:46,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:46,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:46,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:46,620 INFO L263 TraceCheckUtils]: 10: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-08 12:00:46,621 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:46,622 INFO L280 TraceCheckUtils]: 12: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} is VALID [2020-07-08 12:00:46,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} assume true; {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} is VALID [2020-07-08 12:00:46,625 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {234#(and (<= |fibonacci_#in~n| 0) (<= 0 |fibonacci_#res|))} {218#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:46,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:46,626 INFO L263 TraceCheckUtils]: 16: Hoare triple {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-08 12:00:46,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-08 12:00:46,630 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:46,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {254#(<= 0 |fibonacci_#res|)} assume true; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:46,633 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {254#(<= 0 |fibonacci_#res|)} {241#(and (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} #36#return; {261#(and (<= 0 |fibonacci_#t~ret1|) (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:46,635 INFO L280 TraceCheckUtils]: 21: Hoare triple {261#(and (<= 0 |fibonacci_#t~ret1|) (<= 0 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2020-07-08 12:00:46,636 INFO L280 TraceCheckUtils]: 22: Hoare triple {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} assume true; {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2020-07-08 12:00:46,637 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} {161#true} #42#return; {272#(and (<= 0 |main_#t~ret3|) (<= main_~x~0 1))} is VALID [2020-07-08 12:00:46,638 INFO L280 TraceCheckUtils]: 24: Hoare triple {272#(and (<= 0 |main_#t~ret3|) (<= main_~x~0 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {276#(and (<= 0 main_~result~0) (<= main_~x~0 1))} is VALID [2020-07-08 12:00:46,639 INFO L280 TraceCheckUtils]: 25: Hoare triple {276#(and (<= 0 main_~result~0) (<= main_~x~0 1))} assume !(~result~0 >= ~x~0 - 1); {162#false} is VALID [2020-07-08 12:00:46,639 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-08 12:00:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:00:46,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:00:46,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2020-07-08 12:00:46,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597134694] [2020-07-08 12:00:46,645 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-08 12:00:46,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:00:46,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:00:46,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:46,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:00:46,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:00:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:00:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:00:46,707 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2020-07-08 12:00:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:47,282 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-08 12:00:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:00:47,283 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-08 12:00:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:00:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:00:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 12:00:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:00:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 12:00:47,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-08 12:00:47,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:47,359 INFO L225 Difference]: With dead ends: 39 [2020-07-08 12:00:47,359 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:00:47,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-07-08 12:00:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:00:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 12:00:47,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:00:47,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 12:00:47,372 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:00:47,372 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:00:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:47,375 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:00:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:00:47,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:47,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:47,377 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:00:47,377 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:00:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:47,380 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-08 12:00:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:00:47,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:47,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:47,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:00:47,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:00:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:00:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-08 12:00:47,385 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2020-07-08 12:00:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:00:47,385 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-08 12:00:47,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:00:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:00:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:00:47,387 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:00:47,388 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] [2020-07-08 12:00:47,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:00:47,602 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:00:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:00:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2020-07-08 12:00:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:00:47,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125761942] [2020-07-08 12:00:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:00:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-08 12:00:47,706 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-08 12:00:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,819 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-08 12:00:47,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,847 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:47,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,849 INFO L263 TraceCheckUtils]: 3: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-08 12:00:47,850 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,852 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,854 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:47,855 INFO L280 TraceCheckUtils]: 9: Hoare triple {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:47,855 INFO L263 TraceCheckUtils]: 10: Hoare triple {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-08 12:00:47,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-08 12:00:47,856 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,857 INFO L280 TraceCheckUtils]: 13: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,858 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:47,859 INFO L280 TraceCheckUtils]: 15: Hoare triple {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:47,860 INFO L280 TraceCheckUtils]: 16: Hoare triple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:47,861 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {422#true} #42#return; {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 12:00:47,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-08 12:00:47,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-08 12:00:47,863 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-08 12:00:47,863 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-08 12:00:47,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {422#true} is VALID [2020-07-08 12:00:47,864 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-08 12:00:47,864 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-08 12:00:47,865 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,866 INFO L280 TraceCheckUtils]: 9: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,866 INFO L263 TraceCheckUtils]: 10: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-08 12:00:47,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,868 INFO L280 TraceCheckUtils]: 12: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:47,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,869 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,871 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:47,872 INFO L280 TraceCheckUtils]: 16: Hoare triple {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:47,872 INFO L263 TraceCheckUtils]: 17: Hoare triple {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-08 12:00:47,873 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-08 12:00:47,873 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:47,876 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:47,877 INFO L280 TraceCheckUtils]: 22: Hoare triple {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:47,878 INFO L280 TraceCheckUtils]: 23: Hoare triple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:47,879 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {422#true} #42#return; {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 12:00:47,880 INFO L280 TraceCheckUtils]: 25: Hoare triple {444#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {445#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 12:00:47,880 INFO L280 TraceCheckUtils]: 26: Hoare triple {445#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {423#false} is VALID [2020-07-08 12:00:47,880 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-08 12:00:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 12:00:47,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125761942] [2020-07-08 12:00:47,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347669722] [2020-07-08 12:00:47,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:00:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:47,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:00:48,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-08 12:00:48,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-08 12:00:48,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-08 12:00:48,217 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-08 12:00:48,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {422#true} is VALID [2020-07-08 12:00:48,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-08 12:00:48,218 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-08 12:00:48,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:48,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:48,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:48,220 INFO L263 TraceCheckUtils]: 10: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-08 12:00:48,221 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:48,222 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:48,222 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:48,223 INFO L280 TraceCheckUtils]: 14: Hoare triple {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:48,225 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {504#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {485#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-08 12:00:48,226 INFO L280 TraceCheckUtils]: 16: Hoare triple {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-08 12:00:48,226 INFO L263 TraceCheckUtils]: 17: Hoare triple {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-08 12:00:48,226 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-08 12:00:48,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:48,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:48,229 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {511#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} #36#return; {530#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-08 12:00:48,230 INFO L280 TraceCheckUtils]: 22: Hoare triple {530#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 2))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-08 12:00:48,231 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} assume true; {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-08 12:00:48,232 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} {422#true} #42#return; {541#(and (<= 1 |main_#t~ret3|) (<= main_~x~0 2))} is VALID [2020-07-08 12:00:48,233 INFO L280 TraceCheckUtils]: 25: Hoare triple {541#(and (<= 1 |main_#t~ret3|) (<= main_~x~0 2))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {545#(and (<= 1 main_~result~0) (<= main_~x~0 2))} is VALID [2020-07-08 12:00:48,234 INFO L280 TraceCheckUtils]: 26: Hoare triple {545#(and (<= 1 main_~result~0) (<= main_~x~0 2))} assume !(~result~0 >= ~x~0 - 1); {423#false} is VALID [2020-07-08 12:00:48,234 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-08 12:00:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 12:00:48,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:00:48,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-07-08 12:00:48,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240048117] [2020-07-08 12:00:48,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-08 12:00:48,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:00:48,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 12:00:48,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:48,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 12:00:48,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:00:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 12:00:48,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:00:48,294 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 17 states. [2020-07-08 12:00:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:48,999 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-08 12:00:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:00:48,999 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-08 12:00:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:00:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:00:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-08 12:00:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:00:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-08 12:00:49,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-08 12:00:49,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:49,063 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:00:49,063 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:00:49,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:00:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:00:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-08 12:00:49,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:00:49,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-08 12:00:49,076 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-08 12:00:49,076 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-08 12:00:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:49,080 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-08 12:00:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-08 12:00:49,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:49,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:49,082 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-08 12:00:49,082 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-08 12:00:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:49,085 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-08 12:00:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-08 12:00:49,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:49,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:49,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:00:49,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:00:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:00:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-08 12:00:49,091 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2020-07-08 12:00:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:00:49,091 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-08 12:00:49,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 12:00:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-08 12:00:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 12:00:49,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:00:49,094 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:00:49,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:49,308 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:00:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:00:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2020-07-08 12:00:49,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:00:49,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232473144] [2020-07-08 12:00:49,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:00:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,380 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-08 12:00:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-08 12:00:49,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,520 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-08 12:00:49,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,529 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,533 INFO L263 TraceCheckUtils]: 3: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-08 12:00:49,534 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,535 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,537 INFO L263 TraceCheckUtils]: 10: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,537 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-08 12:00:49,538 INFO L280 TraceCheckUtils]: 13: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,540 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,540 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,541 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume true; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,542 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {773#(<= |fibonacci_#in~n| 0)} assume true; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {773#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-08 12:00:49,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-08 12:00:49,568 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,571 INFO L263 TraceCheckUtils]: 7: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-08 12:00:49,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,574 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,575 INFO L280 TraceCheckUtils]: 13: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,575 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-08 12:00:49,576 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,578 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,579 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,580 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume true; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,581 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {772#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,582 INFO L280 TraceCheckUtils]: 22: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,583 INFO L263 TraceCheckUtils]: 23: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,583 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,584 INFO L280 TraceCheckUtils]: 25: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,585 INFO L280 TraceCheckUtils]: 26: Hoare triple {773#(<= |fibonacci_#in~n| 0)} assume true; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,586 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {773#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-08 12:00:49,587 INFO L280 TraceCheckUtils]: 28: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-08 12:00:49,587 INFO L280 TraceCheckUtils]: 29: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-08 12:00:49,587 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-08 12:00:49,589 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-08 12:00:49,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,589 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-08 12:00:49,590 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-08 12:00:49,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {702#true} is VALID [2020-07-08 12:00:49,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-08 12:00:49,590 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-08 12:00:49,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,591 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,591 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-08 12:00:49,591 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,592 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,593 INFO L280 TraceCheckUtils]: 12: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,594 INFO L280 TraceCheckUtils]: 13: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,595 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,595 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,596 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-08 12:00:49,596 INFO L280 TraceCheckUtils]: 18: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,597 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #34#return; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,598 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:49,599 INFO L263 TraceCheckUtils]: 21: Hoare triple {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,599 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,599 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-08 12:00:49,600 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,602 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {762#(and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,603 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume true; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,605 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {772#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,606 INFO L280 TraceCheckUtils]: 29: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,606 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,607 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,608 INFO L280 TraceCheckUtils]: 32: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,608 INFO L280 TraceCheckUtils]: 33: Hoare triple {773#(<= |fibonacci_#in~n| 0)} assume true; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,609 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {773#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-08 12:00:49,610 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-08 12:00:49,610 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-08 12:00:49,610 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-08 12:00:49,611 INFO L280 TraceCheckUtils]: 38: Hoare triple {703#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {703#false} is VALID [2020-07-08 12:00:49,611 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-08 12:00:49,611 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-08 12:00:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-08 12:00:49,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232473144] [2020-07-08 12:00:49,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36314899] [2020-07-08 12:00:49,616 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-08 12:00:49,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:00:49,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:49,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-08 12:00:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:49,661 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:00:49,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-08 12:00:49,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,794 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-08 12:00:49,794 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-08 12:00:49,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {702#true} is VALID [2020-07-08 12:00:49,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-08 12:00:49,795 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-08 12:00:49,795 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-08 12:00:49,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-08 12:00:49,795 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {810#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {810#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {810#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {810#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {810#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,798 INFO L263 TraceCheckUtils]: 14: Hoare triple {810#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-08 12:00:49,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {810#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,800 INFO L280 TraceCheckUtils]: 16: Hoare triple {810#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {826#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {826#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {826#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {826#(<= 1 |fibonacci_#in~n|)} assume true; {826#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,804 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {826#(<= 1 |fibonacci_#in~n|)} {810#(<= fibonacci_~n |fibonacci_#in~n|)} #34#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,805 INFO L263 TraceCheckUtils]: 21: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-08 12:00:49,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-08 12:00:49,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-08 12:00:49,807 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {772#(<= 2 |fibonacci_#in~n|)} #36#return; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,808 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,809 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#(<= 2 |fibonacci_#in~n|)} assume true; {772#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:49,810 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {772#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,814 INFO L280 TraceCheckUtils]: 29: Hoare triple {755#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-08 12:00:49,815 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-08 12:00:49,816 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {872#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:49,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {872#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,823 INFO L280 TraceCheckUtils]: 33: Hoare triple {773#(<= |fibonacci_#in~n| 0)} assume true; {773#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-08 12:00:49,824 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {773#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-08 12:00:49,825 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {703#false} is VALID [2020-07-08 12:00:49,825 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-08 12:00:49,825 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-08 12:00:49,825 INFO L280 TraceCheckUtils]: 38: Hoare triple {703#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {703#false} is VALID [2020-07-08 12:00:49,825 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-08 12:00:49,826 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-08 12:00:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-08 12:00:49,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:00:49,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-08 12:00:49,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535654503] [2020-07-08 12:00:49,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-08 12:00:49,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:00:49,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:00:49,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:49,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:00:49,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:00:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:00:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:00:49,896 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 11 states. [2020-07-08 12:00:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:50,292 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2020-07-08 12:00:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:00:50,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-08 12:00:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:00:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:00:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-08 12:00:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:00:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-08 12:00:50,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-08 12:00:50,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:50,385 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:00:50,388 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:00:50,389 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:00:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:00:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-08 12:00:50,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:00:50,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2020-07-08 12:00:50,411 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2020-07-08 12:00:50,411 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2020-07-08 12:00:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:50,414 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-08 12:00:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-08 12:00:50,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:50,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:50,416 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2020-07-08 12:00:50,416 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2020-07-08 12:00:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:50,419 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-08 12:00:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-08 12:00:50,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:50,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:50,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:00:50,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:00:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 12:00:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-08 12:00:50,423 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 41 [2020-07-08 12:00:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:00:50,424 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-08 12:00:50,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:00:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-08 12:00:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 12:00:50,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:00:50,426 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:00:50,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:50,639 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:00:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:00:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2020-07-08 12:00:50,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:00:50,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183087749] [2020-07-08 12:00:50,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:00:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} assume true; {1083#true} is VALID [2020-07-08 12:00:50,690 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1083#true} {1083#true} #38#return; {1083#true} is VALID [2020-07-08 12:00:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,881 INFO L280 TraceCheckUtils]: 3: Hoare triple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,883 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:50,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#true} assume ~n < 1;#res := 0; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#(<= 0 |fibonacci_#res|)} assume true; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1159#(<= 0 |fibonacci_#res|)} {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:50,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,909 INFO L263 TraceCheckUtils]: 3: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:50,910 INFO L280 TraceCheckUtils]: 4: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,911 INFO L280 TraceCheckUtils]: 6: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,913 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,914 INFO L263 TraceCheckUtils]: 10: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:50,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:50,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {1083#true} assume ~n < 1;#res := 0; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {1159#(<= 0 |fibonacci_#res|)} assume true; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,918 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1159#(<= 0 |fibonacci_#res|)} {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:50,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,920 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:50,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:50,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#true} assume !(~n < 1); {1083#true} is VALID [2020-07-08 12:00:50,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {1083#true} assume 1 == ~n;#res := 1; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {1160#(<= 1 |fibonacci_#res|)} assume true; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,956 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1160#(<= 1 |fibonacci_#res|)} {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:50,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,959 INFO L263 TraceCheckUtils]: 3: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:50,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,961 INFO L263 TraceCheckUtils]: 7: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:50,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,963 INFO L280 TraceCheckUtils]: 10: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,964 INFO L280 TraceCheckUtils]: 11: Hoare triple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,965 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,966 INFO L280 TraceCheckUtils]: 13: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,966 INFO L263 TraceCheckUtils]: 14: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:50,966 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:50,969 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#true} assume ~n < 1;#res := 0; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,974 INFO L280 TraceCheckUtils]: 17: Hoare triple {1159#(<= 0 |fibonacci_#res|)} assume true; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,985 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1159#(<= 0 |fibonacci_#res|)} {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:50,987 INFO L280 TraceCheckUtils]: 19: Hoare triple {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,987 INFO L280 TraceCheckUtils]: 20: Hoare triple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,988 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:50,989 INFO L263 TraceCheckUtils]: 23: Hoare triple {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:50,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:50,990 INFO L280 TraceCheckUtils]: 25: Hoare triple {1083#true} assume !(~n < 1); {1083#true} is VALID [2020-07-08 12:00:50,990 INFO L280 TraceCheckUtils]: 26: Hoare triple {1083#true} assume 1 == ~n;#res := 1; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,991 INFO L280 TraceCheckUtils]: 27: Hoare triple {1160#(<= 1 |fibonacci_#res|)} assume true; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:50,992 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1160#(<= 1 |fibonacci_#res|)} {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:50,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,994 INFO L280 TraceCheckUtils]: 30: Hoare triple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:50,995 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1083#true} #42#return; {1119#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 12:00:50,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2020-07-08 12:00:50,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#true} assume true; {1083#true} is VALID [2020-07-08 12:00:50,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1083#true} {1083#true} #38#return; {1083#true} is VALID [2020-07-08 12:00:50,997 INFO L263 TraceCheckUtils]: 3: Hoare triple {1083#true} call #t~ret4 := main(); {1083#true} is VALID [2020-07-08 12:00:50,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {1083#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1083#true} is VALID [2020-07-08 12:00:50,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {1083#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1083#true} is VALID [2020-07-08 12:00:50,997 INFO L263 TraceCheckUtils]: 6: Hoare triple {1083#true} call #t~ret3 := fibonacci(~x~0); {1083#true} is VALID [2020-07-08 12:00:50,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,999 INFO L263 TraceCheckUtils]: 10: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:50,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:50,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:51,000 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:51,001 INFO L263 TraceCheckUtils]: 14: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:51,001 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#true} ~n := #in~n; {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:51,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1121#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-08 12:00:51,002 INFO L280 TraceCheckUtils]: 17: Hoare triple {1121#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,004 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1158#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:51,005 INFO L280 TraceCheckUtils]: 20: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:51,005 INFO L263 TraceCheckUtils]: 21: Hoare triple {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:51,005 INFO L280 TraceCheckUtils]: 22: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:51,006 INFO L280 TraceCheckUtils]: 23: Hoare triple {1083#true} assume ~n < 1;#res := 0; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,007 INFO L280 TraceCheckUtils]: 24: Hoare triple {1159#(<= 0 |fibonacci_#res|)} assume true; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,008 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1159#(<= 0 |fibonacci_#res|)} {1153#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 1)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:51,009 INFO L280 TraceCheckUtils]: 26: Hoare triple {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:51,009 INFO L280 TraceCheckUtils]: 27: Hoare triple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:51,014 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1121#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:51,017 INFO L280 TraceCheckUtils]: 29: Hoare triple {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-08 12:00:51,017 INFO L263 TraceCheckUtils]: 30: Hoare triple {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:51,017 INFO L280 TraceCheckUtils]: 31: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:51,017 INFO L280 TraceCheckUtils]: 32: Hoare triple {1083#true} assume !(~n < 1); {1083#true} is VALID [2020-07-08 12:00:51,019 INFO L280 TraceCheckUtils]: 33: Hoare triple {1083#true} assume 1 == ~n;#res := 1; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,020 INFO L280 TraceCheckUtils]: 34: Hoare triple {1160#(<= 1 |fibonacci_#res|)} assume true; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,022 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1160#(<= 1 |fibonacci_#res|)} {1140#(and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (= fibonacci_~n |fibonacci_#in~n|))} #36#return; {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-08 12:00:51,023 INFO L280 TraceCheckUtils]: 36: Hoare triple {1146#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:51,024 INFO L280 TraceCheckUtils]: 37: Hoare triple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-08 12:00:51,025 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1147#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1083#true} #42#return; {1119#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-08 12:00:51,025 INFO L280 TraceCheckUtils]: 39: Hoare triple {1119#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1120#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-08 12:00:51,026 INFO L280 TraceCheckUtils]: 40: Hoare triple {1120#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {1084#false} is VALID [2020-07-08 12:00:51,026 INFO L280 TraceCheckUtils]: 41: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2020-07-08 12:00:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-08 12:00:51,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183087749] [2020-07-08 12:00:51,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221921889] [2020-07-08 12:00:51,029 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:51,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:00:51,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:00:51,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-08 12:00:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:00:51,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:00:51,415 INFO L263 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2020-07-08 12:00:51,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#true} assume true; {1083#true} is VALID [2020-07-08 12:00:51,415 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1083#true} {1083#true} #38#return; {1083#true} is VALID [2020-07-08 12:00:51,415 INFO L263 TraceCheckUtils]: 3: Hoare triple {1083#true} call #t~ret4 := main(); {1083#true} is VALID [2020-07-08 12:00:51,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {1083#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1083#true} is VALID [2020-07-08 12:00:51,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {1083#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1083#true} is VALID [2020-07-08 12:00:51,416 INFO L263 TraceCheckUtils]: 6: Hoare triple {1083#true} call #t~ret3 := fibonacci(~x~0); {1083#true} is VALID [2020-07-08 12:00:51,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {1083#true} ~n := #in~n; {1185#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:51,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {1185#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1185#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:51,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {1185#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1185#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:51,417 INFO L263 TraceCheckUtils]: 10: Hoare triple {1185#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:51,417 INFO L280 TraceCheckUtils]: 11: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:51,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {1083#true} assume !(~n < 1); {1083#true} is VALID [2020-07-08 12:00:51,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {1083#true} assume !(1 == ~n); {1083#true} is VALID [2020-07-08 12:00:51,418 INFO L263 TraceCheckUtils]: 14: Hoare triple {1083#true} call #t~ret0 := fibonacci(~n - 1); {1083#true} is VALID [2020-07-08 12:00:51,418 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:51,418 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#true} assume !(~n < 1); {1083#true} is VALID [2020-07-08 12:00:51,418 INFO L280 TraceCheckUtils]: 17: Hoare triple {1083#true} assume 1 == ~n;#res := 1; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,419 INFO L280 TraceCheckUtils]: 18: Hoare triple {1160#(<= 1 |fibonacci_#res|)} assume true; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,419 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1160#(<= 1 |fibonacci_#res|)} {1083#true} #34#return; {1222#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 12:00:51,420 INFO L280 TraceCheckUtils]: 20: Hoare triple {1222#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1222#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-08 12:00:51,420 INFO L263 TraceCheckUtils]: 21: Hoare triple {1222#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:51,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {1083#true} ~n := #in~n; {1083#true} is VALID [2020-07-08 12:00:51,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {1083#true} assume ~n < 1;#res := 0; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {1159#(<= 0 |fibonacci_#res|)} assume true; {1159#(<= 0 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,422 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1159#(<= 0 |fibonacci_#res|)} {1222#(<= 1 |fibonacci_#t~ret0|)} #36#return; {1241#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} is VALID [2020-07-08 12:00:51,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {1241#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {1160#(<= 1 |fibonacci_#res|)} assume true; {1160#(<= 1 |fibonacci_#res|)} is VALID [2020-07-08 12:00:51,428 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1160#(<= 1 |fibonacci_#res|)} {1185#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {1251#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-08 12:00:51,429 INFO L280 TraceCheckUtils]: 29: Hoare triple {1251#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1251#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-08 12:00:51,430 INFO L263 TraceCheckUtils]: 30: Hoare triple {1251#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} call #t~ret1 := fibonacci(~n - 2); {1083#true} is VALID [2020-07-08 12:00:51,432 INFO L280 TraceCheckUtils]: 31: Hoare triple {1083#true} ~n := #in~n; {1185#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:51,432 INFO L280 TraceCheckUtils]: 32: Hoare triple {1185#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1185#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-08 12:00:51,433 INFO L280 TraceCheckUtils]: 33: Hoare triple {1185#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {1267#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:51,433 INFO L280 TraceCheckUtils]: 34: Hoare triple {1267#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {1267#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-08 12:00:51,435 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1267#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {1251#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} #36#return; {1274#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 3) (<= 1 |fibonacci_#t~ret1|))} is VALID [2020-07-08 12:00:51,436 INFO L280 TraceCheckUtils]: 36: Hoare triple {1274#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 3) (<= 1 |fibonacci_#t~ret1|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1278#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-08 12:00:51,436 INFO L280 TraceCheckUtils]: 37: Hoare triple {1278#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} assume true; {1278#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-08 12:00:51,437 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1278#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} {1083#true} #42#return; {1285#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} is VALID [2020-07-08 12:00:51,438 INFO L280 TraceCheckUtils]: 39: Hoare triple {1285#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1289#(and (<= main_~x~0 3) (<= 2 main_~result~0))} is VALID [2020-07-08 12:00:51,439 INFO L280 TraceCheckUtils]: 40: Hoare triple {1289#(and (<= main_~x~0 3) (<= 2 main_~result~0))} assume !(~result~0 >= ~x~0 - 1); {1084#false} is VALID [2020-07-08 12:00:51,439 INFO L280 TraceCheckUtils]: 41: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2020-07-08 12:00:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-08 12:00:51,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:00:51,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2020-07-08 12:00:51,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378820002] [2020-07-08 12:00:51,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-08 12:00:51,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:00:51,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:00:51,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:51,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:00:51,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:00:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:00:51,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:00:51,517 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 21 states. [2020-07-08 12:00:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:52,600 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2020-07-08 12:00:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 12:00:52,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-08 12:00:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:00:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:00:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-08 12:00:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:00:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-08 12:00:52,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2020-07-08 12:00:52,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:00:52,695 INFO L225 Difference]: With dead ends: 45 [2020-07-08 12:00:52,695 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:00:52,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2020-07-08 12:00:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:00:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:00:52,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:00:52,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:00:52,697 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:00:52,697 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:00:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:52,710 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:00:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:00:52,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:52,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:52,711 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:00:52,711 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:00:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:00:52,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:00:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:00:52,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:52,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:00:52,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:00:52,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:00:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:00:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:00:52,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-08 12:00:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:00:52,714 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:00:52,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:00:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:00:52,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:00:52,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:00:52,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:00:53,095 INFO L268 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2020-07-08 12:00:53,096 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-08 12:00:53,096 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-08 12:00:53,096 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-08 12:00:53,096 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (< 1 fibonacci_~n) (<= 1 |fibonacci_#t~ret0|) .cse0 (<= |fibonacci_#in~n| 2)) (and (<= fibonacci_~n (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-08 12:00:53,096 INFO L268 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2020-07-08 12:00:53,096 INFO L268 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2020-07-08 12:00:53,096 INFO L268 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:00:53,097 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L268 CegarLoopResult]: For program point L31(lines 31 35) no Hoare annotation was computed. [2020-07-08 12:00:53,097 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-08 12:00:53,097 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-08 12:00:53,098 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-08 12:00:53,098 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-08 12:00:53,098 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2020-07-08 12:00:53,098 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2020-07-08 12:00:53,098 INFO L268 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-07-08 12:00:53,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:00:53,102 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:00:53,102 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:00:53,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:00:53,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: fibonacciFINAL has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-08 12:00:53,103 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:00:53,104 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:00:53,104 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:00:53,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:00:53 BoogieIcfgContainer [2020-07-08 12:00:53,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:00:53,109 INFO L168 Benchmark]: Toolchain (without parser) took 8935.18 ms. Allocated memory was 144.2 MB in the beginning and 306.2 MB in the end (delta: 162.0 MB). Free memory was 101.0 MB in the beginning and 252.5 MB in the end (delta: -151.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,110 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.42 ms. Allocated memory is still 144.2 MB. Free memory was 100.8 MB in the beginning and 90.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,111 INFO L168 Benchmark]: Boogie Preprocessor took 113.85 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 90.7 MB in the beginning and 180.8 MB in the end (delta: -90.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,112 INFO L168 Benchmark]: RCFGBuilder took 360.89 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 163.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,113 INFO L168 Benchmark]: TraceAbstraction took 8178.31 ms. Allocated memory was 201.9 MB in the beginning and 306.2 MB in the end (delta: 104.3 MB). Free memory was 162.9 MB in the beginning and 252.5 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:00:53,116 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.59 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.42 ms. Allocated memory is still 144.2 MB. Free memory was 100.8 MB in the beginning and 90.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.85 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 90.7 MB in the beginning and 180.8 MB in the end (delta: -90.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.89 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 163.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8178.31 ms. Allocated memory was 201.9 MB in the beginning and 306.2 MB in the end (delta: 104.3 MB). Free memory was 162.9 MB in the beginning and 252.5 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 67 SDslu, 422 SDs, 0 SdLazy, 608 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 35 PreInvPairs, 50 NumberOfFragments, 39 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 101 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 290 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 25670 SizeOfPredicates, 16 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 164/244 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...