/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-8fc6572 [2020-07-10 14:43:22,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:43:22,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:43:22,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:43:22,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:43:22,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:43:22,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:43:22,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:43:23,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:43:23,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:43:23,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:43:23,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:43:23,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:43:23,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:43:23,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:43:23,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:43:23,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:43:23,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:43:23,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:43:23,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:43:23,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:43:23,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:43:23,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:43:23,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:43:23,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:43:23,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:43:23,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:43:23,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:43:23,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:43:23,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:43:23,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:43:23,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:43:23,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:43:23,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:43:23,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:43:23,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:43:23,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:43:23,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:43:23,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:43:23,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:43:23,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:43:23,055 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-10 14:43:23,096 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:43:23,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:43:23,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:43:23,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:43:23,100 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:43:23,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:43:23,100 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:43:23,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:43:23,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:43:23,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:43:23,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:43:23,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:43:23,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:43:23,105 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:43:23,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:43:23,105 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:43:23,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:43:23,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:43:23,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:43:23,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:43:23,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:43:23,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:23,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:43:23,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:43:23,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:43:23,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:43:23,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:43:23,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:43:23,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:43:23,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:43:23,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:43:23,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:43:23,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:43:23,417 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:43:23,417 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:43:23,418 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-10 14:43:23,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5fd7519/bbe98ed766ac4f839b1b55d5268d387e/FLAGe6cefc588 [2020-07-10 14:43:23,991 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:43:23,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-07-10 14:43:23,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5fd7519/bbe98ed766ac4f839b1b55d5268d387e/FLAGe6cefc588 [2020-07-10 14:43:24,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5fd7519/bbe98ed766ac4f839b1b55d5268d387e [2020-07-10 14:43:24,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:43:24,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:43:24,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:24,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:43:24,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:43:24,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730371c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24, skipping insertion in model container [2020-07-10 14:43:24,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:43:24,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:43:24,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:24,619 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:43:24,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:24,658 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:43:24,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24 WrapperNode [2020-07-10 14:43:24,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:24,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:43:24,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:43:24,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:43:24,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (1/1) ... [2020-07-10 14:43:24,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:43:24,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:43:24,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:43:24,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:43:24,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (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-10 14:43:24,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:43:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:43:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-10 14:43:24,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:43:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:43:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:43:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-10 14:43:24,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:43:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:43:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:43:25,111 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:43:25,111 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:43:25,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:25 BoogieIcfgContainer [2020-07-10 14:43:25,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:43:25,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:43:25,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:43:25,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:43:25,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:43:24" (1/3) ... [2020-07-10 14:43:25,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da30818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:25, skipping insertion in model container [2020-07-10 14:43:25,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:24" (2/3) ... [2020-07-10 14:43:25,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da30818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:25, skipping insertion in model container [2020-07-10 14:43:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:25" (3/3) ... [2020-07-10 14:43:25,149 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-07-10 14:43:25,162 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:43:25,176 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:43:25,205 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:43:25,228 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:43:25,229 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:43:25,229 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:43:25,229 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:43:25,229 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:43:25,230 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:43:25,230 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:43:25,230 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:43:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-10 14:43:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:43:25,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:25,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:25,260 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2020-07-10 14:43:25,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:25,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748435967] [2020-07-10 14:43:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:25,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-10 14:43:25,533 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-10 14:43:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:25,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:25,595 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-10 14:43:25,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:25,599 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-10 14:43:25,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-10 14:43:25,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-10 14:43:25,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #38#return; {27#true} is VALID [2020-07-10 14:43:25,601 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2020-07-10 14:43:25,602 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-10 14:43:25,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {27#true} is VALID [2020-07-10 14:43:25,603 INFO L263 TraceCheckUtils]: 6: Hoare triple {27#true} call #t~ret3 := fibonacci(~x~0); {27#true} is VALID [2020-07-10 14:43:25,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} ~n := #in~n; {37#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:25,606 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-10 14:43:25,613 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {38#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:25,615 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-10 14:43:25,619 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-10 14:43:25,622 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-10 14:43:25,623 INFO L280 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-10 14:43:25,625 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-10 14:43:25,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748435967] [2020-07-10 14:43:25,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:25,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:43:25,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551535626] [2020-07-10 14:43:25,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 14:43:25,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:25,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:43:25,681 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-10 14:43:25,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:43:25,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:25,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:43:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:25,695 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2020-07-10 14:43:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:26,081 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 14:43:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:43:26,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 14:43:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-10 14:43:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:43:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-10 14:43:26,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-10 14:43:26,189 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-10 14:43:26,215 INFO L225 Difference]: With dead ends: 36 [2020-07-10 14:43:26,215 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 14:43:26,228 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-10 14:43:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 14:43:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 14:43:26,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:26,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 14:43:26,293 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 14:43:26,294 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 14:43:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:26,304 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-10 14:43:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-10 14:43:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:26,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:26,308 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 14:43:26,308 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 14:43:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:26,318 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-10 14:43:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-10 14:43:26,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:26,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:26,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:26,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 14:43:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-10 14:43:26,327 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2020-07-10 14:43:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:26,327 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-10 14:43:26,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:43:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-10 14:43:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:43:26,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:26,329 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-10 14:43:26,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:26,330 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2020-07-10 14:43:26,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:26,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752750464] [2020-07-10 14:43:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,379 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-10 14:43:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:26,475 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-10 14:43:26,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:26,477 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-10 14:43:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-10 14:43:26,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,485 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-10 14:43:26,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-10 14:43:26,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-10 14:43:26,488 INFO L263 TraceCheckUtils]: 3: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-10 14:43:26,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:26,490 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-10 14:43:26,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:26,492 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-10 14:43:26,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-10 14:43:26,493 INFO L263 TraceCheckUtils]: 9: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-10 14:43:26,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-10 14:43:26,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,494 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-10 14:43:26,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {162#false} is VALID [2020-07-10 14:43:26,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-10 14:43:26,495 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-10 14:43:26,497 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-10 14:43:26,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,498 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-10 14:43:26,498 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-10 14:43:26,498 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-10 14:43:26,499 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-10 14:43:26,499 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-10 14:43:26,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,500 INFO L280 TraceCheckUtils]: 8: Hoare triple {161#true} assume !(~n < 1); {182#(< 0 fibonacci_~n)} is VALID [2020-07-10 14:43:26,501 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(< 0 fibonacci_~n)} assume !(1 == ~n); {183#(< 1 fibonacci_~n)} is VALID [2020-07-10 14:43:26,502 INFO L263 TraceCheckUtils]: 10: Hoare triple {183#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-10 14:43:26,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {192#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:26,503 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-10 14:43:26,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {193#(<= |fibonacci_#in~n| 0)} assume true; {193#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:26,505 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {193#(<= |fibonacci_#in~n| 0)} {183#(< 1 fibonacci_~n)} #34#return; {162#false} is VALID [2020-07-10 14:43:26,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {162#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {162#false} is VALID [2020-07-10 14:43:26,506 INFO L263 TraceCheckUtils]: 16: Hoare triple {162#false} call #t~ret1 := fibonacci(~n - 2); {161#true} is VALID [2020-07-10 14:43:26,506 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {161#true} is VALID [2020-07-10 14:43:26,507 INFO L280 TraceCheckUtils]: 19: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,507 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {161#true} {162#false} #36#return; {162#false} is VALID [2020-07-10 14:43:26,508 INFO L280 TraceCheckUtils]: 21: Hoare triple {162#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {162#false} is VALID [2020-07-10 14:43:26,508 INFO L280 TraceCheckUtils]: 22: Hoare triple {162#false} assume true; {162#false} is VALID [2020-07-10 14:43:26,508 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {162#false} {161#true} #42#return; {162#false} is VALID [2020-07-10 14:43:26,509 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-10 14:43:26,509 INFO L280 TraceCheckUtils]: 25: Hoare triple {162#false} assume !(~result~0 >= ~x~0 - 1); {162#false} is VALID [2020-07-10 14:43:26,509 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-10 14:43:26,512 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-10 14:43:26,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752750464] [2020-07-10 14:43:26,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899751159] [2020-07-10 14:43:26,513 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-10 14:43:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 14:43:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:26,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:26,911 INFO L263 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {161#true} is VALID [2020-07-10 14:43:26,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2020-07-10 14:43:26,912 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #38#return; {161#true} is VALID [2020-07-10 14:43:26,912 INFO L263 TraceCheckUtils]: 3: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2020-07-10 14:43:26,912 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-10 14:43:26,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {161#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {161#true} is VALID [2020-07-10 14:43:26,913 INFO L263 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret3 := fibonacci(~x~0); {161#true} is VALID [2020-07-10 14:43:26,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:26,915 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-10 14:43:26,916 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-10 14:43:26,916 INFO L263 TraceCheckUtils]: 10: Hoare triple {218#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {161#true} is VALID [2020-07-10 14:43:26,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {161#true} ~n := #in~n; {218#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:26,919 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-10 14:43:26,920 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-10 14:43:26,922 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-10 14:43:26,923 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-10 14:43:26,924 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-10 14:43:26,924 INFO L280 TraceCheckUtils]: 17: Hoare triple {161#true} ~n := #in~n; {161#true} is VALID [2020-07-10 14:43:26,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {161#true} assume ~n < 1;#res := 0; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:26,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {254#(<= 0 |fibonacci_#res|)} assume true; {254#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:26,928 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-10 14:43:26,929 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~ret1;havoc #t~ret0; {265#(and (<= |fibonacci_#in~n| 1) (<= 0 |fibonacci_#res|))} is VALID [2020-07-10 14:43:26,930 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-10 14:43:26,932 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-10 14:43:26,933 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-10 14:43:26,934 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-10 14:43:26,934 INFO L280 TraceCheckUtils]: 26: Hoare triple {162#false} assume !false; {162#false} is VALID [2020-07-10 14:43:26,936 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-10 14:43:26,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:26,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2020-07-10 14:43:26,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459028502] [2020-07-10 14:43:26,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-10 14:43:26,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:26,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 14:43:26,997 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-10 14:43:26,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 14:43:26,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 14:43:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-10 14:43:26,999 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2020-07-10 14:43:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:27,591 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-10 14:43:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:43:27,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-07-10 14:43:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 14:43:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:27,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-10 14:43:27,671 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-10 14:43:27,673 INFO L225 Difference]: With dead ends: 39 [2020-07-10 14:43:27,673 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 14:43:27,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 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-10 14:43:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 14:43:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 14:43:27,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:27,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:27,685 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:27,685 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:27,689 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 14:43:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:43:27,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:27,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:27,690 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:27,690 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 14:43:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:27,694 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 14:43:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:43:27,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:27,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:27,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:27,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 14:43:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 14:43:27,698 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2020-07-10 14:43:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:27,699 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 14:43:27,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 14:43:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 14:43:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 14:43:27,701 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:27,701 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-10 14:43:27,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:43:27,916 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2020-07-10 14:43:27,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:27,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421424869] [2020-07-10 14:43:27,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:27,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 14:43:27,983 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-10 14:43:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:28,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:28,111 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-10 14:43:28,112 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-10 14:43:28,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,114 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:28,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-10 14:43:28,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,151 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:28,153 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-10 14:43:28,154 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-10 14:43:28,154 INFO L263 TraceCheckUtils]: 3: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-10 14:43:28,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:28,156 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-10 14:43:28,157 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-10 14:43:28,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,160 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,180 INFO L263 TraceCheckUtils]: 10: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-10 14:43:28,180 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-10 14:43:28,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,187 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,188 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~ret1;havoc #t~ret0; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:28,193 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-10 14:43:28,194 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-10 14:43:28,195 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-10 14:43:28,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 14:43:28,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-10 14:43:28,196 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-10 14:43:28,196 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-10 14:43:28,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-10 14:43:28,197 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-10 14:43:28,198 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:28,199 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-10 14:43:28,199 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-10 14:43:28,200 INFO L263 TraceCheckUtils]: 10: Hoare triple {446#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-10 14:43:28,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {446#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:28,201 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-10 14:43:28,202 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-10 14:43:28,202 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,204 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {459#(<= |fibonacci_#in~n| |fibonacci_#res|)} {446#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,205 INFO L280 TraceCheckUtils]: 16: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,205 INFO L263 TraceCheckUtils]: 17: Hoare triple {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {422#true} is VALID [2020-07-10 14:43:28,205 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-10 14:43:28,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,208 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {460#(<= 0 |fibonacci_#res|)} {452#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {457#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:28,210 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~ret1;havoc #t~ret0; {458#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:28,210 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-10 14:43:28,211 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-10 14:43:28,212 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-10 14:43:28,213 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-10 14:43:28,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-10 14:43:28,215 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-10 14:43:28,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421424869] [2020-07-10 14:43:28,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023679875] [2020-07-10 14:43:28,216 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-10 14:43:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:28,249 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-10 14:43:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:28,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:28,588 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-10 14:43:28,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 14:43:28,588 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2020-07-10 14:43:28,589 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret4 := main(); {422#true} is VALID [2020-07-10 14:43:28,589 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-10 14:43:28,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {422#true} is VALID [2020-07-10 14:43:28,589 INFO L263 TraceCheckUtils]: 6: Hoare triple {422#true} call #t~ret3 := fibonacci(~x~0); {422#true} is VALID [2020-07-10 14:43:28,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:28,590 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-10 14:43:28,591 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-10 14:43:28,591 INFO L263 TraceCheckUtils]: 10: Hoare triple {485#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {422#true} is VALID [2020-07-10 14:43:28,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~n := #in~n; {485#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:28,592 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-10 14:43:28,593 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-10 14:43:28,594 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-10 14:43:28,596 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-10 14:43:28,598 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-10 14:43:28,598 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-10 14:43:28,598 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~n := #in~n; {422#true} is VALID [2020-07-10 14:43:28,599 INFO L280 TraceCheckUtils]: 19: Hoare triple {422#true} assume ~n < 1;#res := 0; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,600 INFO L280 TraceCheckUtils]: 20: Hoare triple {460#(<= 0 |fibonacci_#res|)} assume true; {460#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:28,601 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-10 14:43:28,603 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~ret1;havoc #t~ret0; {534#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 2))} is VALID [2020-07-10 14:43:28,603 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-10 14:43:28,604 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-10 14:43:28,605 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-10 14:43:28,606 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-10 14:43:28,606 INFO L280 TraceCheckUtils]: 27: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-10 14:43:28,607 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-10 14:43:28,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:28,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-07-10 14:43:28,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657138457] [2020-07-10 14:43:28,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-10 14:43:28,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:28,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 14:43:28,680 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-10 14:43:28,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 14:43:28,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 14:43:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-07-10 14:43:28,681 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 17 states. [2020-07-10 14:43:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:29,342 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-10 14:43:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 14:43:29,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-10 14:43:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 14:43:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-10 14:43:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 14:43:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-10 14:43:29,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-10 14:43:29,411 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-10 14:43:29,415 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:43:29,415 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:43:29,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2020-07-10 14:43:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:43:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 14:43:29,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:29,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 14:43:29,433 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 14:43:29,433 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 14:43:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:29,442 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-10 14:43:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-10 14:43:29,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:29,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:29,443 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 14:43:29,443 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 14:43:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:29,449 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-10 14:43:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-10 14:43:29,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:29,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:29,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:29,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 14:43:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-07-10 14:43:29,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2020-07-10 14:43:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:29,458 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-07-10 14:43:29,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 14:43:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-07-10 14:43:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 14:43:29,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:29,465 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-10 14:43:29,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:29,674 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:29,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2020-07-10 14:43:29,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:29,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139969465] [2020-07-10 14:43:29,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,729 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-10 14:43:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-10 14:43:29,826 INFO L280 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,828 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-10 14:43:29,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,837 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,838 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-10 14:43:29,839 INFO L280 TraceCheckUtils]: 2: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,839 INFO L263 TraceCheckUtils]: 3: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:29,840 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-10 14:43:29,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,841 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,842 INFO L263 TraceCheckUtils]: 10: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:29,842 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-10 14:43:29,843 INFO L280 TraceCheckUtils]: 13: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,844 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,846 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,876 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-10 14:43:29,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-10 14:43:29,877 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:29,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,879 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-10 14:43:29,879 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,880 INFO L263 TraceCheckUtils]: 7: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:29,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,880 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-10 14:43:29,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,882 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,884 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:29,884 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-10 14:43:29,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,886 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,889 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,890 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,892 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:29,894 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-10 14:43:29,894 INFO L263 TraceCheckUtils]: 23: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:29,895 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,896 INFO L280 TraceCheckUtils]: 25: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,897 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,898 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-10 14:43:29,899 INFO L280 TraceCheckUtils]: 28: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {703#false} is VALID [2020-07-10 14:43:29,899 INFO L280 TraceCheckUtils]: 29: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 14:43:29,899 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-10 14:43:29,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-10 14:43:29,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,901 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-10 14:43:29,902 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-10 14:43:29,902 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-10 14:43:29,902 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-10 14:43:29,902 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-10 14:43:29,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-10 14:43:29,903 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:29,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,906 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-10 14:43:29,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {761#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,908 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:29,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,908 INFO L280 TraceCheckUtils]: 16: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:29,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {702#true} assume 1 == ~n;#res := 1; {702#true} is VALID [2020-07-10 14:43:29,909 INFO L280 TraceCheckUtils]: 18: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,910 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,911 INFO L263 TraceCheckUtils]: 21: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:29,911 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:29,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-10 14:43:29,912 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:29,913 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,914 INFO L280 TraceCheckUtils]: 26: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,914 INFO L280 TraceCheckUtils]: 27: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,916 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:29,917 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-10 14:43:29,917 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:29,917 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {760#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:29,918 INFO L280 TraceCheckUtils]: 32: Hoare triple {760#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,919 INFO L280 TraceCheckUtils]: 33: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:29,920 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-10 14:43:29,920 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {703#false} is VALID [2020-07-10 14:43:29,921 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 14:43:29,921 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-10 14:43:29,921 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-10 14:43:29,921 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-10 14:43:29,922 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-10 14:43:29,923 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-10 14:43:29,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139969465] [2020-07-10 14:43:29,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069158195] [2020-07-10 14:43:29,925 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:29,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:43:29,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:29,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:43:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:29,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:30,091 INFO L263 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2020-07-10 14:43:30,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:30,092 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #38#return; {702#true} is VALID [2020-07-10 14:43:30,092 INFO L263 TraceCheckUtils]: 3: Hoare triple {702#true} call #t~ret4 := main(); {702#true} is VALID [2020-07-10 14:43:30,092 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-10 14:43:30,093 INFO L280 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {702#true} is VALID [2020-07-10 14:43:30,093 INFO L263 TraceCheckUtils]: 6: Hoare triple {702#true} call #t~ret3 := fibonacci(~x~0); {702#true} is VALID [2020-07-10 14:43:30,093 INFO L280 TraceCheckUtils]: 7: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:30,093 INFO L280 TraceCheckUtils]: 8: Hoare triple {702#true} assume !(~n < 1); {702#true} is VALID [2020-07-10 14:43:30,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(1 == ~n); {702#true} is VALID [2020-07-10 14:43:30,094 INFO L263 TraceCheckUtils]: 10: Hoare triple {702#true} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:30,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {702#true} ~n := #in~n; {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,095 INFO L263 TraceCheckUtils]: 14: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {702#true} is VALID [2020-07-10 14:43:30,096 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#true} ~n := #in~n; {809#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,097 INFO L280 TraceCheckUtils]: 16: Hoare triple {809#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,098 INFO L280 TraceCheckUtils]: 17: Hoare triple {825#(<= 1 |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,098 INFO L280 TraceCheckUtils]: 18: Hoare triple {825#(<= 1 |fibonacci_#in~n|)} assume true; {825#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,099 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {825#(<= 1 |fibonacci_#in~n|)} {809#(<= fibonacci_~n |fibonacci_#in~n|)} #34#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,100 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,100 INFO L263 TraceCheckUtils]: 21: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:30,101 INFO L280 TraceCheckUtils]: 22: Hoare triple {702#true} ~n := #in~n; {702#true} is VALID [2020-07-10 14:43:30,101 INFO L280 TraceCheckUtils]: 23: Hoare triple {702#true} assume ~n < 1;#res := 0; {702#true} is VALID [2020-07-10 14:43:30,101 INFO L280 TraceCheckUtils]: 24: Hoare triple {702#true} assume true; {702#true} is VALID [2020-07-10 14:43:30,103 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {702#true} {762#(<= 2 |fibonacci_#in~n|)} #36#return; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,103 INFO L280 TraceCheckUtils]: 26: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,103 INFO L280 TraceCheckUtils]: 27: Hoare triple {762#(<= 2 |fibonacci_#in~n|)} assume true; {762#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:30,105 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {762#(<= 2 |fibonacci_#in~n|)} {702#true} #34#return; {755#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:30,105 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-10 14:43:30,106 INFO L263 TraceCheckUtils]: 30: Hoare triple {755#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {702#true} is VALID [2020-07-10 14:43:30,106 INFO L280 TraceCheckUtils]: 31: Hoare triple {702#true} ~n := #in~n; {871#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:30,108 INFO L280 TraceCheckUtils]: 32: Hoare triple {871#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:30,113 INFO L280 TraceCheckUtils]: 33: Hoare triple {772#(<= |fibonacci_#in~n| 0)} assume true; {772#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:30,123 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {772#(<= |fibonacci_#in~n| 0)} {755#(<= 3 fibonacci_~n)} #36#return; {703#false} is VALID [2020-07-10 14:43:30,123 INFO L280 TraceCheckUtils]: 35: Hoare triple {703#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {703#false} is VALID [2020-07-10 14:43:30,123 INFO L280 TraceCheckUtils]: 36: Hoare triple {703#false} assume true; {703#false} is VALID [2020-07-10 14:43:30,123 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {703#false} {702#true} #42#return; {703#false} is VALID [2020-07-10 14:43:30,124 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-10 14:43:30,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {703#false} assume !(~result~0 >= ~x~0 - 1); {703#false} is VALID [2020-07-10 14:43:30,124 INFO L280 TraceCheckUtils]: 40: Hoare triple {703#false} assume !false; {703#false} is VALID [2020-07-10 14:43:30,127 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-10 14:43:30,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:30,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2020-07-10 14:43:30,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955195537] [2020-07-10 14:43:30,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-07-10 14:43:30,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:30,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:43:30,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:30,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:43:30,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:43:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:43:30,182 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 10 states. [2020-07-10 14:43:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:30,584 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2020-07-10 14:43:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:43:30,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-07-10 14:43:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:43:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-10 14:43:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:43:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-10 14:43:30,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-10 14:43:30,669 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-10 14:43:30,672 INFO L225 Difference]: With dead ends: 56 [2020-07-10 14:43:30,673 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 14:43:30,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:43:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 14:43:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-10 14:43:30,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:30,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2020-07-10 14:43:30,687 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2020-07-10 14:43:30,687 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2020-07-10 14:43:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:30,691 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-10 14:43:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-10 14:43:30,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:30,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:30,692 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2020-07-10 14:43:30,693 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2020-07-10 14:43:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:30,696 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-10 14:43:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-10 14:43:30,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:30,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:30,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:30,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 14:43:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-10 14:43:30,700 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 41 [2020-07-10 14:43:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:30,700 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-10 14:43:30,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:43:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-10 14:43:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 14:43:30,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:30,702 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-10 14:43:30,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:30,916 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2020-07-10 14:43:30,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:30,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707341681] [2020-07-10 14:43:30,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-10 14:43:31,012 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-10 14:43:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,198 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,223 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,225 INFO L263 TraceCheckUtils]: 3: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,225 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,228 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,229 INFO L263 TraceCheckUtils]: 10: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,230 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,230 INFO L280 TraceCheckUtils]: 12: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,231 INFO L280 TraceCheckUtils]: 13: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,232 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,233 INFO L280 TraceCheckUtils]: 15: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,234 INFO L280 TraceCheckUtils]: 16: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,235 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-10 14:43:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-10 14:43:31,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,258 INFO L280 TraceCheckUtils]: 3: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,260 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,262 INFO L263 TraceCheckUtils]: 3: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,264 INFO L263 TraceCheckUtils]: 7: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,266 INFO L280 TraceCheckUtils]: 10: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,266 INFO L280 TraceCheckUtils]: 11: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,268 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,269 INFO L263 TraceCheckUtils]: 14: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,269 INFO L280 TraceCheckUtils]: 16: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,271 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,273 INFO L280 TraceCheckUtils]: 19: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,273 INFO L280 TraceCheckUtils]: 20: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,274 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-10 14:43:31,275 INFO L280 TraceCheckUtils]: 22: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-10 14:43:31,275 INFO L263 TraceCheckUtils]: 23: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,276 INFO L280 TraceCheckUtils]: 25: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-10 14:43:31,276 INFO L280 TraceCheckUtils]: 26: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,277 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,278 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,279 INFO L280 TraceCheckUtils]: 29: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,281 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1085#true} #42#return; {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-10 14:43:31,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2020-07-10 14:43:31,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-10 14:43:31,283 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-10 14:43:31,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret4 := main(); {1085#true} is VALID [2020-07-10 14:43:31,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1085#true} is VALID [2020-07-10 14:43:31,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {1085#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1085#true} is VALID [2020-07-10 14:43:31,284 INFO L263 TraceCheckUtils]: 6: Hoare triple {1085#true} call #t~ret3 := fibonacci(~x~0); {1085#true} is VALID [2020-07-10 14:43:31,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,285 INFO L263 TraceCheckUtils]: 10: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,287 INFO L263 TraceCheckUtils]: 14: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1123#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:31,289 INFO L280 TraceCheckUtils]: 17: Hoare triple {1123#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,290 INFO L280 TraceCheckUtils]: 18: Hoare triple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} assume true; {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,291 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1160#(<= |fibonacci_#in~n| |fibonacci_#res|)} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,291 INFO L280 TraceCheckUtils]: 20: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,292 INFO L263 TraceCheckUtils]: 21: Hoare triple {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,292 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,294 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1155#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,296 INFO L280 TraceCheckUtils]: 27: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,297 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1123#(= fibonacci_~n |fibonacci_#in~n|)} #34#return; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-10 14:43:31,298 INFO L280 TraceCheckUtils]: 29: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} is VALID [2020-07-10 14:43:31,298 INFO L263 TraceCheckUtils]: 30: Hoare triple {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,298 INFO L280 TraceCheckUtils]: 31: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,298 INFO L280 TraceCheckUtils]: 32: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-10 14:43:31,299 INFO L280 TraceCheckUtils]: 33: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,300 INFO L280 TraceCheckUtils]: 34: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,301 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1142#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2))} #36#return; {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} is VALID [2020-07-10 14:43:31,302 INFO L280 TraceCheckUtils]: 36: Hoare triple {1148#(<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,302 INFO L280 TraceCheckUtils]: 37: Hoare triple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} assume true; {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} is VALID [2020-07-10 14:43:31,303 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1149#(<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))} {1085#true} #42#return; {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} is VALID [2020-07-10 14:43:31,304 INFO L280 TraceCheckUtils]: 39: Hoare triple {1121#(<= main_~x~0 (+ |main_#t~ret3| 1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1122#(<= main_~x~0 (+ main_~result~0 1))} is VALID [2020-07-10 14:43:31,305 INFO L280 TraceCheckUtils]: 40: Hoare triple {1122#(<= main_~x~0 (+ main_~result~0 1))} assume !(~result~0 >= ~x~0 - 1); {1086#false} is VALID [2020-07-10 14:43:31,305 INFO L280 TraceCheckUtils]: 41: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2020-07-10 14:43:31,307 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-10 14:43:31,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707341681] [2020-07-10 14:43:31,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042551956] [2020-07-10 14:43:31,307 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) [2020-07-10 14:43:31,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 14:43:31,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:31,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 14:43:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:31,347 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:31,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2020-07-10 14:43:31,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2020-07-10 14:43:31,732 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #38#return; {1085#true} is VALID [2020-07-10 14:43:31,732 INFO L263 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret4 := main(); {1085#true} is VALID [2020-07-10 14:43:31,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {1085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1085#true} is VALID [2020-07-10 14:43:31,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {1085#true} assume !(~x~0 > 46 || -2147483648 == ~x~0); {1085#true} is VALID [2020-07-10 14:43:31,733 INFO L263 TraceCheckUtils]: 6: Hoare triple {1085#true} call #t~ret3 := fibonacci(~x~0); {1085#true} is VALID [2020-07-10 14:43:31,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {1085#true} ~n := #in~n; {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:31,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:31,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:31,740 INFO L263 TraceCheckUtils]: 10: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,740 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,740 INFO L280 TraceCheckUtils]: 12: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-10 14:43:31,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {1085#true} assume !(1 == ~n); {1085#true} is VALID [2020-07-10 14:43:31,740 INFO L263 TraceCheckUtils]: 14: Hoare triple {1085#true} call #t~ret0 := fibonacci(~n - 1); {1085#true} is VALID [2020-07-10 14:43:31,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {1085#true} assume !(~n < 1); {1085#true} is VALID [2020-07-10 14:43:31,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {1085#true} assume 1 == ~n;#res := 1; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,742 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1085#true} #34#return; {1224#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-10 14:43:31,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {1224#(<= 1 |fibonacci_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1224#(<= 1 |fibonacci_#t~ret0|)} is VALID [2020-07-10 14:43:31,743 INFO L263 TraceCheckUtils]: 21: Hoare triple {1224#(<= 1 |fibonacci_#t~ret0|)} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,744 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#true} ~n := #in~n; {1085#true} is VALID [2020-07-10 14:43:31,744 INFO L280 TraceCheckUtils]: 23: Hoare triple {1085#true} assume ~n < 1;#res := 0; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {1161#(<= 0 |fibonacci_#res|)} assume true; {1161#(<= 0 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,745 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1161#(<= 0 |fibonacci_#res|)} {1224#(<= 1 |fibonacci_#t~ret0|)} #36#return; {1243#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} is VALID [2020-07-10 14:43:31,746 INFO L280 TraceCheckUtils]: 26: Hoare triple {1243#(and (<= 0 |fibonacci_#t~ret1|) (<= 1 |fibonacci_#t~ret0|))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,747 INFO L280 TraceCheckUtils]: 27: Hoare triple {1162#(<= 1 |fibonacci_#res|)} assume true; {1162#(<= 1 |fibonacci_#res|)} is VALID [2020-07-10 14:43:31,748 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1162#(<= 1 |fibonacci_#res|)} {1187#(<= |fibonacci_#in~n| fibonacci_~n)} #34#return; {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-10 14:43:31,749 INFO L280 TraceCheckUtils]: 29: Hoare triple {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} is VALID [2020-07-10 14:43:31,749 INFO L263 TraceCheckUtils]: 30: Hoare triple {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} call #t~ret1 := fibonacci(~n - 2); {1085#true} is VALID [2020-07-10 14:43:31,750 INFO L280 TraceCheckUtils]: 31: Hoare triple {1085#true} ~n := #in~n; {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:31,750 INFO L280 TraceCheckUtils]: 32: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1187#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:31,751 INFO L280 TraceCheckUtils]: 33: Hoare triple {1187#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-10 14:43:31,752 INFO L280 TraceCheckUtils]: 34: Hoare triple {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} assume true; {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} is VALID [2020-07-10 14:43:31,753 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1269#(and (<= 1 |fibonacci_#res|) (<= |fibonacci_#in~n| 1))} {1253#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| fibonacci_~n))} #36#return; {1276#(and (<= 1 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 3) (<= 1 |fibonacci_#t~ret1|))} is VALID [2020-07-10 14:43:31,753 INFO L280 TraceCheckUtils]: 36: Hoare triple {1276#(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~ret1;havoc #t~ret0; {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-10 14:43:31,754 INFO L280 TraceCheckUtils]: 37: Hoare triple {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} assume true; {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} is VALID [2020-07-10 14:43:31,755 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1280#(and (<= 2 |fibonacci_#res|) (<= |fibonacci_#in~n| 3))} {1085#true} #42#return; {1287#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} is VALID [2020-07-10 14:43:31,755 INFO L280 TraceCheckUtils]: 39: Hoare triple {1287#(and (<= main_~x~0 3) (<= 2 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1291#(and (<= main_~x~0 3) (<= 2 main_~result~0))} is VALID [2020-07-10 14:43:31,756 INFO L280 TraceCheckUtils]: 40: Hoare triple {1291#(and (<= main_~x~0 3) (<= 2 main_~result~0))} assume !(~result~0 >= ~x~0 - 1); {1086#false} is VALID [2020-07-10 14:43:31,756 INFO L280 TraceCheckUtils]: 41: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2020-07-10 14:43:31,758 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-10 14:43:31,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:31,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2020-07-10 14:43:31,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490655274] [2020-07-10 14:43:31,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-10 14:43:31,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:31,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 14:43:31,830 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-10 14:43:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 14:43:31,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 14:43:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-07-10 14:43:31,831 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 21 states. [2020-07-10 14:43:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:32,930 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2020-07-10 14:43:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 14:43:32,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2020-07-10 14:43:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:43:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-10 14:43:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:43:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2020-07-10 14:43:32,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2020-07-10 14:43:33,012 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-10 14:43:33,012 INFO L225 Difference]: With dead ends: 45 [2020-07-10 14:43:33,013 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:43:33,014 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2020-07-10 14:43:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:43:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:43:33,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:33,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:33,015 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:33,015 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:33,015 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:33,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:33,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:33,016 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:33,016 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:43:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:33,017 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:43:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:33,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:33,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:33,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:33,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:43:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:43:33,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-10 14:43:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:33,018 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:43:33,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 14:43:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:43:33,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:33,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:33,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:43:33,391 INFO L268 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2020-07-10 14:43:33,391 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-10 14:43:33,391 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 2 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-10 14:43:33,391 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 1 |fibonacci_#t~ret0|) (<= 2 |fibonacci_#in~n|) .cse0 (<= |fibonacci_#in~n| 2)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0))) [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:43:33,392 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:43:33,392 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:43:33,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point L31(lines 31 35) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-10 14:43:33,393 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2020-07-10 14:43:33,393 INFO L268 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:43:33,397 WARN L170 areAnnotationChecker]: fibonacciFINAL has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: fibonacciEXIT has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-10 14:43:33,398 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 14:43:33,399 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 14:43:33,399 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 14:43:33,399 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 14:43:33,399 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:33,399 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 14:43:33,399 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-10 14:43:33,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:43:33 BoogieIcfgContainer [2020-07-10 14:43:33,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:43:33,404 INFO L168 Benchmark]: Toolchain (without parser) took 9074.12 ms. Allocated memory was 138.4 MB in the beginning and 297.3 MB in the end (delta: 158.9 MB). Free memory was 103.3 MB in the beginning and 209.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,404 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.03 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,406 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 138.4 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,406 INFO L168 Benchmark]: RCFGBuilder took 430.98 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.0 MB in the beginning and 165.3 MB in the end (delta: -73.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,407 INFO L168 Benchmark]: TraceAbstraction took 8272.18 ms. Allocated memory was 202.9 MB in the beginning and 297.3 MB in the end (delta: 94.4 MB). Free memory was 164.6 MB in the beginning and 209.0 MB in the end (delta: -44.4 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:33,410 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.03 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 138.4 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.98 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.0 MB in the beginning and 165.3 MB in the end (delta: -73.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8272.18 ms. Allocated memory was 202.9 MB in the beginning and 297.3 MB in the end (delta: 94.4 MB). Free memory was 164.6 MB in the beginning and 209.0 MB in the end (delta: -44.4 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.0s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 73 SDslu, 403 SDs, 0 SdLazy, 594 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 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, 113 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, 24318 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...