/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-simple/fibo_2calls_4-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:20:11,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:20:11,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:20:11,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:20:11,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:20:11,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:20:11,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:20:11,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:20:11,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:20:11,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:20:11,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:20:11,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:20:11,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:20:11,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:20:11,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:20:11,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:20:11,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:20:11,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:20:11,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:20:11,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:20:11,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:20:11,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:20:11,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:20:11,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:20:11,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:20:11,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:20:11,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:20:11,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:20:11,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:20:11,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:20:11,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:20:11,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:20:11,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:20:11,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:20:11,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:20:11,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:20:11,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:20:11,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:20:11,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:20:11,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:20:11,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:20:11,833 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-17 22:20:11,855 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:20:11,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:20:11,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:20:11,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:20:11,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:20:11,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:20:11,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:20:11,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:20:11,861 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:20:11,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:20:11,862 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:20:11,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:20:11,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:20:11,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:20:11,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:20:11,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:20:11,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:20:11,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:20:11,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:20:11,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:20:11,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:20:11,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:20:11,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:20:11,865 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:20:11,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:20:12,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:20:12,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:20:12,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:20:12,203 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:20:12,203 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:20:12,204 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-07-17 22:20:12,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cb221c8/b7c374ab0a724201a3485c18f23c1693/FLAGe746081db [2020-07-17 22:20:12,704 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:20:12,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-2.c [2020-07-17 22:20:12,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cb221c8/b7c374ab0a724201a3485c18f23c1693/FLAGe746081db [2020-07-17 22:20:13,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cb221c8/b7c374ab0a724201a3485c18f23c1693 [2020-07-17 22:20:13,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:20:13,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:20:13,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:20:13,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:20:13,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:20:13,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ff13ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13, skipping insertion in model container [2020-07-17 22:20:13,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:20:13,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:20:13,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:20:13,407 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:20:13,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:20:13,440 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:20:13,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13 WrapperNode [2020-07-17 22:20:13,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:20:13,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:20:13,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:20:13,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:20:13,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (1/1) ... [2020-07-17 22:20:13,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:20:13,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:20:13,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:20:13,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:20:13,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (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-17 22:20:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:20:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:20:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 22:20:13,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 22:20:13,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:20:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:20:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:20:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 22:20:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 22:20:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:20:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:20:13,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:20:13,961 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:20:13,961 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:20:13,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:20:13 BoogieIcfgContainer [2020-07-17 22:20:13,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:20:13,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:20:13,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:20:13,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:20:13,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:20:13" (1/3) ... [2020-07-17 22:20:13,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0c0d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:20:13, skipping insertion in model container [2020-07-17 22:20:13,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:20:13" (2/3) ... [2020-07-17 22:20:13,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0c0d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:20:13, skipping insertion in model container [2020-07-17 22:20:13,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:20:13" (3/3) ... [2020-07-17 22:20:13,972 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-2.c [2020-07-17 22:20:13,982 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:20:13,990 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:20:14,004 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:20:14,027 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:20:14,027 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:20:14,027 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:20:14,028 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:20:14,028 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:20:14,028 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:20:14,028 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:20:14,028 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:20:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 22:20:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:20:14,054 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:14,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:14,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-17 22:20:14,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:14,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125142320] [2020-07-17 22:20:14,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:20:14,245 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:20:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:14,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:14,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:14,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 4 main_~x~0)} #51#return; {37#false} is VALID [2020-07-17 22:20:14,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-17 22:20:14,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:20:14,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:20:14,315 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-17 22:20:14,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 4; {40#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:14,316 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID [2020-07-17 22:20:14,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:14,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:14,319 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:14,321 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 4 main_~x~0)} #51#return; {37#false} is VALID [2020-07-17 22:20:14,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID [2020-07-17 22:20:14,322 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 3 == ~result~0; {37#false} is VALID [2020-07-17 22:20:14,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-17 22:20:14,324 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-17 22:20:14,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125142320] [2020-07-17 22:20:14,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:20:14,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:20:14,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502816346] [2020-07-17 22:20:14,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:20:14,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:14,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:20:14,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:20:14,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:20:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:20:14,399 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-17 22:20:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:14,699 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:20:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:20:14,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:20:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:20:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:20:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:20:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:20:14,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-17 22:20:14,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:14,834 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:20:14,835 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:20:14,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:20:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:20:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:20:14,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:14,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:20:14,887 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:20:14,887 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:20:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:14,894 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:20:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:20:14,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:14,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:14,896 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:20:14,896 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:20:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:14,903 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:20:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:20:14,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:14,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:14,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:14,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:20:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:20:14,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-17 22:20:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:14,911 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:20:14,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:20:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:20:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:20:14,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:14,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:14,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:20:14,913 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-17 22:20:14,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:14,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417602424] [2020-07-17 22:20:14,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:20:14,955 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:20:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:14,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:14,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:14,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:14,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:14,994 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 4 main_~x~0)} #51#return; {208#false} is VALID [2020-07-17 22:20:14,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-17 22:20:14,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:20:14,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:20:14,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-17 22:20:15,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 4; {211#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:15,001 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID [2020-07-17 22:20:15,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:15,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:15,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,012 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 4 main_~x~0)} #51#return; {208#false} is VALID [2020-07-17 22:20:15,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID [2020-07-17 22:20:15,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 3 == ~result~0; {208#false} is VALID [2020-07-17 22:20:15,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-17 22:20:15,015 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-17 22:20:15,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417602424] [2020-07-17 22:20:15,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:20:15,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:20:15,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036917499] [2020-07-17 22:20:15,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:20:15,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:15,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:20:15,034 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-17 22:20:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:20:15,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:20:15,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:20:15,036 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-17 22:20:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:15,203 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-17 22:20:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:20:15,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:20:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:20:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:20:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:20:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:20:15,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-17 22:20:15,271 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-17 22:20:15,276 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:20:15,277 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:20:15,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:20:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:20:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-17 22:20:15,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:15,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-17 22:20:15,299 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-17 22:20:15,299 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-17 22:20:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:15,310 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:20:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:20:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:15,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:15,312 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-17 22:20:15,312 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-17 22:20:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:15,323 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:20:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:20:15,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:15,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:15,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:15,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:20:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:20:15,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-17 22:20:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:15,330 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:20:15,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:20:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:20:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:20:15,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:15,332 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:15,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:20:15,333 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-17 22:20:15,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:15,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479368736] [2020-07-17 22:20:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,383 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:20:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:15,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,470 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:20:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:20:15,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:20:15,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:20:15,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:20:15,481 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:20:15,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:15,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,484 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:20:15,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:20:15,485 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:20:15,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:20:15,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,486 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:20:15,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-17 22:20:15,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:20:15,487 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:20:15,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:20:15,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,489 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:20:15,489 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:20:15,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 4; {379#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:15,490 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-17 22:20:15,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:20:15,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:20:15,493 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:20:15,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:15,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,495 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,497 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:20:15,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:20:15,497 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:20:15,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:20:15,498 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,499 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:20:15,499 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-17 22:20:15,499 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:20:15,500 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:20:15,500 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-17 22:20:15,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 3 == ~result~0; {376#false} is VALID [2020-07-17 22:20:15,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:20:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:20:15,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479368736] [2020-07-17 22:20:15,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357646381] [2020-07-17 22:20:15,503 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-17 22:20:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:20:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:15,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:15,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:20:15,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,739 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:20:15,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:20:15,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 4; {379#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:15,740 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-17 22:20:15,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:15,742 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:15,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:15,743 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:20:15,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:15,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:15,748 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,749 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:20:15,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:20:15,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:20:15,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:20:15,751 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,754 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,755 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:15,756 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 4 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:20:15,757 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-17 22:20:15,757 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 3 == ~result~0; {376#false} is VALID [2020-07-17 22:20:15,757 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:20:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:20:15,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:15,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:20:15,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077467346] [2020-07-17 22:20:15,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:20:15,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:15,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:20:15,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:20:15,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:20:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:20:15,817 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-17 22:20:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:16,383 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-17 22:20:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:20:16,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:20:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:20:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:20:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:20:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:20:16,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-17 22:20:16,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:16,546 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:20:16,546 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:20:16,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:20:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:20:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 22:20:16,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:16,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-17 22:20:16,576 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-17 22:20:16,576 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-17 22:20:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:16,580 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:20:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:20:16,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:16,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:16,582 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-17 22:20:16,582 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-17 22:20:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:16,587 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:20:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:20:16,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:16,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:16,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:16,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:20:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-17 22:20:16,595 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-17 22:20:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:16,597 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-17 22:20:16,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:20:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-17 22:20:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:20:16,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:16,599 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:16,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:20:16,817 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:16,818 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-17 22:20:16,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:16,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435737541] [2020-07-17 22:20:16,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:16,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:16,881 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:20:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:16,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:16,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:16,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:16,974 INFO L280 TraceCheckUtils]: 3: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:16,975 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:16,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:20:16,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-17 22:20:16,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:16,989 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:16,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:16,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:16,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:16,994 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:20:16,995 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:16,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:16,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:16,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:16,998 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:16,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:16,999 INFO L263 TraceCheckUtils]: 10: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:20:16,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:20:16,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-17 22:20:16,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:17,000 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,003 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-17 22:20:17,003 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-17 22:20:17,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:17,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:20:17,004 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-17 22:20:17,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 4; {689#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:17,006 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-17 22:20:17,006 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:17,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:17,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {708#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:17,007 INFO L263 TraceCheckUtils]: 9: Hoare triple {708#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:20:17,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:17,008 INFO L280 TraceCheckUtils]: 11: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {719#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:17,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {719#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:17,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:17,015 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {708#(= fibo1_~n |fibo1_#in~n|)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,015 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:20:17,016 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:20:17,016 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-17 22:20:17,016 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:17,017 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,018 INFO L280 TraceCheckUtils]: 21: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,019 INFO L280 TraceCheckUtils]: 22: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,020 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-17 22:20:17,020 INFO L280 TraceCheckUtils]: 24: Hoare triple {686#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {686#false} is VALID [2020-07-17 22:20:17,020 INFO L280 TraceCheckUtils]: 25: Hoare triple {686#false} assume 3 == ~result~0; {686#false} is VALID [2020-07-17 22:20:17,020 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-17 22:20:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:20:17,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435737541] [2020-07-17 22:20:17,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379292859] [2020-07-17 22:20:17,022 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:17,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:20:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:17,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:17,174 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-17 22:20:17,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:17,175 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:20:17,175 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-17 22:20:17,176 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 4; {689#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:17,176 INFO L263 TraceCheckUtils]: 5: Hoare triple {689#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-17 22:20:17,177 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:17,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:17,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {742#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:17,178 INFO L263 TraceCheckUtils]: 9: Hoare triple {742#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:20:17,179 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {755#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:17,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {755#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {755#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:17,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {755#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:17,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {720#(<= |fibo2_#in~n| 1)} assume true; {720#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:17,181 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {720#(<= |fibo2_#in~n| 1)} {742#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,182 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:20:17,183 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:20:17,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {685#true} is VALID [2020-07-17 22:20:17,183 INFO L280 TraceCheckUtils]: 19: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:20:17,189 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {685#true} {714#(<= |fibo1_#in~n| 2)} #59#return; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {714#(<= |fibo1_#in~n| 2)} assume true; {714#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:17,192 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {714#(<= |fibo1_#in~n| 2)} {689#(<= 4 main_~x~0)} #51#return; {686#false} is VALID [2020-07-17 22:20:17,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {686#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {686#false} is VALID [2020-07-17 22:20:17,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {686#false} assume 3 == ~result~0; {686#false} is VALID [2020-07-17 22:20:17,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-17 22:20:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:20:17,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:17,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 22:20:17,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912023104] [2020-07-17 22:20:17,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-17 22:20:17,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:17,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:20:17,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:17,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:20:17,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:20:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:20:17,238 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-17 22:20:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:17,840 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-17 22:20:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:20:17,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-17 22:20:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:20:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-17 22:20:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:20:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2020-07-17 22:20:17,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2020-07-17 22:20:17,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:17,938 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:20:17,938 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:20:17,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:20:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:20:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-17 22:20:17,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:17,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-17 22:20:17,970 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-17 22:20:17,971 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-17 22:20:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:17,976 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2020-07-17 22:20:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2020-07-17 22:20:17,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:17,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:17,978 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-17 22:20:17,978 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-17 22:20:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:17,983 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2020-07-17 22:20:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2020-07-17 22:20:17,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:17,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:17,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:17,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:20:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-17 22:20:17,988 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-17 22:20:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:17,989 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-17 22:20:17,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:20:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-17 22:20:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 22:20:17,990 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:17,991 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:18,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:18,204 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-17 22:20:18,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:18,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439918263] [2020-07-17 22:20:18,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,243 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-17 22:20:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:18,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,345 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-17 22:20:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,352 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-17 22:20:18,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-17 22:20:18,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-17 22:20:18,355 INFO L263 TraceCheckUtils]: 3: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:18,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,359 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-17 22:20:18,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-17 22:20:18,359 INFO L263 TraceCheckUtils]: 9: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,360 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-17 22:20:18,361 INFO L280 TraceCheckUtils]: 14: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-17 22:20:18,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-17 22:20:18,361 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-17 22:20:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,368 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-17 22:20:18,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume !(~n < 1); {1044#true} is VALID [2020-07-17 22:20:18,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#true} assume !(1 == ~n); {1044#true} is VALID [2020-07-17 22:20:18,369 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-17 22:20:18,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-17 22:20:18,371 INFO L263 TraceCheckUtils]: 7: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:18,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,375 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-17 22:20:18,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-17 22:20:18,376 INFO L263 TraceCheckUtils]: 13: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,376 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,376 INFO L280 TraceCheckUtils]: 15: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,376 INFO L280 TraceCheckUtils]: 16: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,377 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-17 22:20:18,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-17 22:20:18,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-17 22:20:18,377 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-17 22:20:18,378 INFO L280 TraceCheckUtils]: 21: Hoare triple {1045#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1045#false} is VALID [2020-07-17 22:20:18,378 INFO L263 TraceCheckUtils]: 22: Hoare triple {1045#false} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,378 INFO L280 TraceCheckUtils]: 23: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,378 INFO L280 TraceCheckUtils]: 24: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,379 INFO L280 TraceCheckUtils]: 25: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,379 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-17 22:20:18,379 INFO L280 TraceCheckUtils]: 27: Hoare triple {1045#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1045#false} is VALID [2020-07-17 22:20:18,379 INFO L280 TraceCheckUtils]: 28: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-17 22:20:18,380 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1045#false} {1044#true} #51#return; {1045#false} is VALID [2020-07-17 22:20:18,381 INFO L263 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2020-07-17 22:20:18,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,382 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-17 22:20:18,382 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret5 := main(); {1044#true} is VALID [2020-07-17 22:20:18,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~x~0 := 4; {1044#true} is VALID [2020-07-17 22:20:18,383 INFO L263 TraceCheckUtils]: 5: Hoare triple {1044#true} call #t~ret4 := fibo1(~x~0); {1044#true} is VALID [2020-07-17 22:20:18,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {1044#true} assume !(~n < 1); {1044#true} is VALID [2020-07-17 22:20:18,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {1044#true} assume !(1 == ~n); {1044#true} is VALID [2020-07-17 22:20:18,383 INFO L263 TraceCheckUtils]: 9: Hoare triple {1044#true} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {1044#true} assume !(~n < 1); {1099#(< 0 fibo2_~n)} is VALID [2020-07-17 22:20:18,387 INFO L280 TraceCheckUtils]: 12: Hoare triple {1099#(< 0 fibo2_~n)} assume !(1 == ~n); {1100#(< 1 fibo2_~n)} is VALID [2020-07-17 22:20:18,387 INFO L263 TraceCheckUtils]: 13: Hoare triple {1100#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,389 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1109#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:18,389 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,391 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1100#(< 1 fibo2_~n)} #53#return; {1045#false} is VALID [2020-07-17 22:20:18,391 INFO L280 TraceCheckUtils]: 18: Hoare triple {1045#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1045#false} is VALID [2020-07-17 22:20:18,392 INFO L263 TraceCheckUtils]: 19: Hoare triple {1045#false} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,392 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,392 INFO L280 TraceCheckUtils]: 21: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,392 INFO L280 TraceCheckUtils]: 22: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,393 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1044#true} {1045#false} #55#return; {1045#false} is VALID [2020-07-17 22:20:18,393 INFO L280 TraceCheckUtils]: 24: Hoare triple {1045#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1045#false} is VALID [2020-07-17 22:20:18,393 INFO L280 TraceCheckUtils]: 25: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-17 22:20:18,393 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1045#false} {1044#true} #57#return; {1045#false} is VALID [2020-07-17 22:20:18,394 INFO L280 TraceCheckUtils]: 27: Hoare triple {1045#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1045#false} is VALID [2020-07-17 22:20:18,394 INFO L263 TraceCheckUtils]: 28: Hoare triple {1045#false} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,394 INFO L280 TraceCheckUtils]: 29: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,394 INFO L280 TraceCheckUtils]: 30: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,395 INFO L280 TraceCheckUtils]: 31: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,395 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1044#true} {1045#false} #59#return; {1045#false} is VALID [2020-07-17 22:20:18,395 INFO L280 TraceCheckUtils]: 33: Hoare triple {1045#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1045#false} is VALID [2020-07-17 22:20:18,395 INFO L280 TraceCheckUtils]: 34: Hoare triple {1045#false} assume true; {1045#false} is VALID [2020-07-17 22:20:18,396 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1045#false} {1044#true} #51#return; {1045#false} is VALID [2020-07-17 22:20:18,396 INFO L280 TraceCheckUtils]: 36: Hoare triple {1045#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1045#false} is VALID [2020-07-17 22:20:18,396 INFO L280 TraceCheckUtils]: 37: Hoare triple {1045#false} assume 3 == ~result~0; {1045#false} is VALID [2020-07-17 22:20:18,396 INFO L280 TraceCheckUtils]: 38: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2020-07-17 22:20:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:20:18,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439918263] [2020-07-17 22:20:18,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83545421] [2020-07-17 22:20:18,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:20:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:18,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:20:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:18,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:18,585 INFO L263 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2020-07-17 22:20:18,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,586 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1044#true} {1044#true} #47#return; {1044#true} is VALID [2020-07-17 22:20:18,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {1044#true} call #t~ret5 := main(); {1044#true} is VALID [2020-07-17 22:20:18,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {1044#true} ~x~0 := 4; {1126#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:18,587 INFO L263 TraceCheckUtils]: 5: Hoare triple {1126#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1044#true} is VALID [2020-07-17 22:20:18,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {1044#true} ~n := #in~n; {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:18,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:18,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:18,590 INFO L263 TraceCheckUtils]: 9: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#true} ~n := #in~n; {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:18,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:18,592 INFO L280 TraceCheckUtils]: 12: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1146#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:18,592 INFO L263 TraceCheckUtils]: 13: Hoare triple {1146#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1044#true} is VALID [2020-07-17 22:20:18,593 INFO L280 TraceCheckUtils]: 14: Hoare triple {1044#true} ~n := #in~n; {1133#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:18,594 INFO L280 TraceCheckUtils]: 15: Hoare triple {1133#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,594 INFO L280 TraceCheckUtils]: 16: Hoare triple {1110#(<= |fibo1_#in~n| 0)} assume true; {1110#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:18,596 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1110#(<= |fibo1_#in~n| 0)} {1146#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:18,597 INFO L280 TraceCheckUtils]: 18: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:18,597 INFO L263 TraceCheckUtils]: 19: Hoare triple {1168#(<= |fibo2_#in~n| 1)} call #t~ret3 := fibo1(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,597 INFO L280 TraceCheckUtils]: 20: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,597 INFO L280 TraceCheckUtils]: 21: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,598 INFO L280 TraceCheckUtils]: 22: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,599 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1044#true} {1168#(<= |fibo2_#in~n| 1)} #55#return; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:18,599 INFO L280 TraceCheckUtils]: 24: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:18,600 INFO L280 TraceCheckUtils]: 25: Hoare triple {1168#(<= |fibo2_#in~n| 1)} assume true; {1168#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:18,601 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1168#(<= |fibo2_#in~n| 1)} {1133#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:18,602 INFO L280 TraceCheckUtils]: 27: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:18,602 INFO L263 TraceCheckUtils]: 28: Hoare triple {1196#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {1044#true} is VALID [2020-07-17 22:20:18,602 INFO L280 TraceCheckUtils]: 29: Hoare triple {1044#true} ~n := #in~n; {1044#true} is VALID [2020-07-17 22:20:18,603 INFO L280 TraceCheckUtils]: 30: Hoare triple {1044#true} assume ~n < 1;#res := 0; {1044#true} is VALID [2020-07-17 22:20:18,603 INFO L280 TraceCheckUtils]: 31: Hoare triple {1044#true} assume true; {1044#true} is VALID [2020-07-17 22:20:18,604 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1044#true} {1196#(<= |fibo1_#in~n| 2)} #59#return; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:18,604 INFO L280 TraceCheckUtils]: 33: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:18,605 INFO L280 TraceCheckUtils]: 34: Hoare triple {1196#(<= |fibo1_#in~n| 2)} assume true; {1196#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:18,606 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1196#(<= |fibo1_#in~n| 2)} {1126#(<= 4 main_~x~0)} #51#return; {1045#false} is VALID [2020-07-17 22:20:18,606 INFO L280 TraceCheckUtils]: 36: Hoare triple {1045#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1045#false} is VALID [2020-07-17 22:20:18,607 INFO L280 TraceCheckUtils]: 37: Hoare triple {1045#false} assume 3 == ~result~0; {1045#false} is VALID [2020-07-17 22:20:18,607 INFO L280 TraceCheckUtils]: 38: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2020-07-17 22:20:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:20:18,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:18,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-17 22:20:18,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448208714] [2020-07-17 22:20:18,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-17 22:20:18,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:18,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:20:18,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:18,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:20:18,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:20:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:20:18,699 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-17 22:20:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:19,692 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-17 22:20:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:20:19,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-17 22:20:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:20:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2020-07-17 22:20:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:20:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2020-07-17 22:20:19,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 102 transitions. [2020-07-17 22:20:19,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:19,854 INFO L225 Difference]: With dead ends: 108 [2020-07-17 22:20:19,854 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 22:20:19,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:20:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 22:20:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-17 22:20:19,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:19,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2020-07-17 22:20:19,908 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-17 22:20:19,908 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-17 22:20:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:19,918 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2020-07-17 22:20:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-17 22:20:19,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:19,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:19,921 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2020-07-17 22:20:19,921 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2020-07-17 22:20:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:19,930 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2020-07-17 22:20:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-17 22:20:19,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:19,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:19,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:19,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 22:20:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-17 22:20:19,940 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-17 22:20:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:19,940 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-17 22:20:19,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:20:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-17 22:20:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:20:19,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:19,945 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:20,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:20,161 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-17 22:20:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:20,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032836215] [2020-07-17 22:20:20,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,206 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-17 22:20:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-17 22:20:20,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,379 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,392 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-17 22:20:20,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,394 INFO L263 TraceCheckUtils]: 3: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,395 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-17 22:20:20,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,397 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,398 INFO L263 TraceCheckUtils]: 10: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,398 INFO L280 TraceCheckUtils]: 11: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,398 INFO L280 TraceCheckUtils]: 12: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,400 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,400 INFO L280 TraceCheckUtils]: 15: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,401 INFO L280 TraceCheckUtils]: 16: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,402 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-17 22:20:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,427 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-17 22:20:20,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {1610#true} assume !(1 == ~n); {1610#true} is VALID [2020-07-17 22:20:20,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,430 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-17 22:20:20,432 INFO L280 TraceCheckUtils]: 6: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,432 INFO L263 TraceCheckUtils]: 7: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,433 INFO L280 TraceCheckUtils]: 8: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,433 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-17 22:20:20,433 INFO L280 TraceCheckUtils]: 11: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,435 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,436 INFO L280 TraceCheckUtils]: 13: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,437 INFO L263 TraceCheckUtils]: 14: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,437 INFO L280 TraceCheckUtils]: 15: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,437 INFO L280 TraceCheckUtils]: 16: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,437 INFO L280 TraceCheckUtils]: 17: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,438 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,439 INFO L280 TraceCheckUtils]: 19: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,439 INFO L280 TraceCheckUtils]: 20: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,440 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-17 22:20:20,441 INFO L280 TraceCheckUtils]: 22: Hoare triple {1664#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-17 22:20:20,442 INFO L263 TraceCheckUtils]: 23: Hoare triple {1664#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,443 INFO L280 TraceCheckUtils]: 24: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,445 INFO L280 TraceCheckUtils]: 25: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,447 INFO L280 TraceCheckUtils]: 26: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,448 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-17 22:20:20,448 INFO L280 TraceCheckUtils]: 28: Hoare triple {1611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1611#false} is VALID [2020-07-17 22:20:20,449 INFO L280 TraceCheckUtils]: 29: Hoare triple {1611#false} assume true; {1611#false} is VALID [2020-07-17 22:20:20,449 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1611#false} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-17 22:20:20,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2020-07-17 22:20:20,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,451 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-17 22:20:20,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret5 := main(); {1610#true} is VALID [2020-07-17 22:20:20,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~x~0 := 4; {1614#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:20,452 INFO L263 TraceCheckUtils]: 5: Hoare triple {1614#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1610#true} is VALID [2020-07-17 22:20:20,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,452 INFO L280 TraceCheckUtils]: 7: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {1610#true} assume !(1 == ~n); {1610#true} is VALID [2020-07-17 22:20:20,453 INFO L263 TraceCheckUtils]: 9: Hoare triple {1610#true} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-17 22:20:20,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {1670#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,457 INFO L263 TraceCheckUtils]: 13: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,457 INFO L280 TraceCheckUtils]: 14: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,457 INFO L280 TraceCheckUtils]: 15: Hoare triple {1610#true} assume !(~n < 1); {1610#true} is VALID [2020-07-17 22:20:20,458 INFO L280 TraceCheckUtils]: 16: Hoare triple {1610#true} assume 1 == ~n;#res := 1; {1610#true} is VALID [2020-07-17 22:20:20,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,459 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #53#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,460 INFO L280 TraceCheckUtils]: 19: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,461 INFO L263 TraceCheckUtils]: 20: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,461 INFO L280 TraceCheckUtils]: 21: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,462 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1610#true} {1671#(<= 2 |fibo2_#in~n|)} #55#return; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,463 INFO L280 TraceCheckUtils]: 25: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,465 INFO L280 TraceCheckUtils]: 26: Hoare triple {1671#(<= 2 |fibo2_#in~n|)} assume true; {1671#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,467 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1671#(<= 2 |fibo2_#in~n|)} {1610#true} #57#return; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-17 22:20:20,467 INFO L280 TraceCheckUtils]: 28: Hoare triple {1664#(<= 3 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1664#(<= 3 fibo1_~n)} is VALID [2020-07-17 22:20:20,467 INFO L263 TraceCheckUtils]: 29: Hoare triple {1664#(<= 3 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,468 INFO L280 TraceCheckUtils]: 30: Hoare triple {1610#true} ~n := #in~n; {1669#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:20,469 INFO L280 TraceCheckUtils]: 31: Hoare triple {1669#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {1681#(<= |fibo2_#in~n| 0)} assume true; {1681#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:20:20,470 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1681#(<= |fibo2_#in~n| 0)} {1664#(<= 3 fibo1_~n)} #59#return; {1611#false} is VALID [2020-07-17 22:20:20,471 INFO L280 TraceCheckUtils]: 34: Hoare triple {1611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1611#false} is VALID [2020-07-17 22:20:20,471 INFO L280 TraceCheckUtils]: 35: Hoare triple {1611#false} assume true; {1611#false} is VALID [2020-07-17 22:20:20,471 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1611#false} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-17 22:20:20,471 INFO L280 TraceCheckUtils]: 37: Hoare triple {1611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1611#false} is VALID [2020-07-17 22:20:20,471 INFO L280 TraceCheckUtils]: 38: Hoare triple {1611#false} assume 3 == ~result~0; {1611#false} is VALID [2020-07-17 22:20:20,472 INFO L280 TraceCheckUtils]: 39: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2020-07-17 22:20:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 22:20:20,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032836215] [2020-07-17 22:20:20,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574668738] [2020-07-17 22:20:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:20:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:20,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:20,686 INFO L263 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2020-07-17 22:20:20,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,686 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1610#true} {1610#true} #47#return; {1610#true} is VALID [2020-07-17 22:20:20,687 INFO L263 TraceCheckUtils]: 3: Hoare triple {1610#true} call #t~ret5 := main(); {1610#true} is VALID [2020-07-17 22:20:20,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {1610#true} ~x~0 := 4; {1614#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:20,688 INFO L263 TraceCheckUtils]: 5: Hoare triple {1614#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {1610#true} is VALID [2020-07-17 22:20:20,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {1610#true} ~n := #in~n; {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:20,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:20,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:20,690 INFO L263 TraceCheckUtils]: 9: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {1610#true} ~n := #in~n; {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:20,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:20,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {1716#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:20,692 INFO L263 TraceCheckUtils]: 13: Hoare triple {1716#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1610#true} is VALID [2020-07-17 22:20:20,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {1610#true} ~n := #in~n; {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:20,693 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1703#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:20,694 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1735#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:20,694 INFO L280 TraceCheckUtils]: 17: Hoare triple {1735#(<= |fibo1_#in~n| 1)} assume true; {1735#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:20,696 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1735#(<= |fibo1_#in~n| 1)} {1716#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:20,696 INFO L280 TraceCheckUtils]: 19: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:20,696 INFO L263 TraceCheckUtils]: 20: Hoare triple {1742#(<= |fibo2_#in~n| 2)} call #t~ret3 := fibo1(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,697 INFO L280 TraceCheckUtils]: 21: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,697 INFO L280 TraceCheckUtils]: 22: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,697 INFO L280 TraceCheckUtils]: 23: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,698 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1610#true} {1742#(<= |fibo2_#in~n| 2)} #55#return; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:20,698 INFO L280 TraceCheckUtils]: 25: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:20,699 INFO L280 TraceCheckUtils]: 26: Hoare triple {1742#(<= |fibo2_#in~n| 2)} assume true; {1742#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:20,700 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1742#(<= |fibo2_#in~n| 2)} {1703#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:20,701 INFO L280 TraceCheckUtils]: 28: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:20,701 INFO L263 TraceCheckUtils]: 29: Hoare triple {1770#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {1610#true} is VALID [2020-07-17 22:20:20,701 INFO L280 TraceCheckUtils]: 30: Hoare triple {1610#true} ~n := #in~n; {1610#true} is VALID [2020-07-17 22:20:20,701 INFO L280 TraceCheckUtils]: 31: Hoare triple {1610#true} assume ~n < 1;#res := 0; {1610#true} is VALID [2020-07-17 22:20:20,702 INFO L280 TraceCheckUtils]: 32: Hoare triple {1610#true} assume true; {1610#true} is VALID [2020-07-17 22:20:20,703 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1610#true} {1770#(<= |fibo1_#in~n| 3)} #59#return; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:20,703 INFO L280 TraceCheckUtils]: 34: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:20,704 INFO L280 TraceCheckUtils]: 35: Hoare triple {1770#(<= |fibo1_#in~n| 3)} assume true; {1770#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:20,705 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1770#(<= |fibo1_#in~n| 3)} {1614#(<= 4 main_~x~0)} #51#return; {1611#false} is VALID [2020-07-17 22:20:20,705 INFO L280 TraceCheckUtils]: 37: Hoare triple {1611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1611#false} is VALID [2020-07-17 22:20:20,705 INFO L280 TraceCheckUtils]: 38: Hoare triple {1611#false} assume 3 == ~result~0; {1611#false} is VALID [2020-07-17 22:20:20,705 INFO L280 TraceCheckUtils]: 39: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2020-07-17 22:20:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:20:20,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:20,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-17 22:20:20,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29328987] [2020-07-17 22:20:20,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-17 22:20:20,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:20,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:20:20,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:20,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:20:20,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:20:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:20:20,784 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-17 22:20:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:22,426 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-17 22:20:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:20:22,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-17 22:20:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:20:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2020-07-17 22:20:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:20:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2020-07-17 22:20:22,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 133 transitions. [2020-07-17 22:20:22,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:22,616 INFO L225 Difference]: With dead ends: 180 [2020-07-17 22:20:22,616 INFO L226 Difference]: Without dead ends: 120 [2020-07-17 22:20:22,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:20:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-17 22:20:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-17 22:20:22,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:22,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 106 states. [2020-07-17 22:20:22,704 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 106 states. [2020-07-17 22:20:22,704 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 106 states. [2020-07-17 22:20:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:22,714 INFO L93 Difference]: Finished difference Result 120 states and 198 transitions. [2020-07-17 22:20:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 198 transitions. [2020-07-17 22:20:22,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:22,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:22,716 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 120 states. [2020-07-17 22:20:22,716 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 120 states. [2020-07-17 22:20:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:22,727 INFO L93 Difference]: Finished difference Result 120 states and 198 transitions. [2020-07-17 22:20:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 198 transitions. [2020-07-17 22:20:22,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:22,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:22,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:22,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 22:20:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-17 22:20:22,736 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-17 22:20:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:22,737 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-17 22:20:22,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:20:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-17 22:20:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 22:20:22,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:22,739 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:22,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:22,953 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-17 22:20:22,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:22,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902094869] [2020-07-17 22:20:22,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,016 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-17 22:20:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,204 INFO L280 TraceCheckUtils]: 3: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,205 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,210 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:23,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,217 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,218 INFO L263 TraceCheckUtils]: 10: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,219 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,222 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-17 22:20:23,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,245 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,245 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:23,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,247 INFO L263 TraceCheckUtils]: 7: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,247 INFO L280 TraceCheckUtils]: 9: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,247 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,248 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,249 INFO L263 TraceCheckUtils]: 14: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,249 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,251 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,251 INFO L280 TraceCheckUtils]: 19: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,252 INFO L280 TraceCheckUtils]: 20: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,253 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,254 INFO L280 TraceCheckUtils]: 22: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,254 INFO L263 TraceCheckUtils]: 23: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,255 INFO L280 TraceCheckUtils]: 24: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,255 INFO L280 TraceCheckUtils]: 25: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,256 INFO L280 TraceCheckUtils]: 26: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,257 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-17 22:20:23,257 INFO L280 TraceCheckUtils]: 28: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-17 22:20:23,257 INFO L280 TraceCheckUtils]: 29: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-17 22:20:23,257 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-17 22:20:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,274 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,274 INFO L280 TraceCheckUtils]: 3: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,274 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-17 22:20:23,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,275 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,276 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,276 INFO L263 TraceCheckUtils]: 7: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:23,280 INFO L280 TraceCheckUtils]: 10: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,280 INFO L263 TraceCheckUtils]: 11: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,280 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,281 INFO L280 TraceCheckUtils]: 13: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,281 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,282 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,283 INFO L263 TraceCheckUtils]: 18: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,284 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,285 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,286 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,287 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,288 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,289 INFO L280 TraceCheckUtils]: 26: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,289 INFO L263 TraceCheckUtils]: 27: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,307 INFO L280 TraceCheckUtils]: 29: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,308 INFO L280 TraceCheckUtils]: 30: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,309 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-17 22:20:23,309 INFO L280 TraceCheckUtils]: 32: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-17 22:20:23,309 INFO L280 TraceCheckUtils]: 33: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-17 22:20:23,310 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-17 22:20:23,310 INFO L280 TraceCheckUtils]: 35: Hoare triple {2440#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2440#false} is VALID [2020-07-17 22:20:23,310 INFO L263 TraceCheckUtils]: 36: Hoare triple {2440#false} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,310 INFO L280 TraceCheckUtils]: 37: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,310 INFO L280 TraceCheckUtils]: 38: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,311 INFO L280 TraceCheckUtils]: 39: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,311 INFO L280 TraceCheckUtils]: 40: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,311 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-17 22:20:23,311 INFO L280 TraceCheckUtils]: 42: Hoare triple {2440#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2440#false} is VALID [2020-07-17 22:20:23,311 INFO L280 TraceCheckUtils]: 43: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-17 22:20:23,312 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2440#false} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-17 22:20:23,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {2439#true} call ULTIMATE.init(); {2439#true} is VALID [2020-07-17 22:20:23,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-17 22:20:23,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret5 := main(); {2439#true} is VALID [2020-07-17 22:20:23,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~x~0 := 4; {2443#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:23,315 INFO L263 TraceCheckUtils]: 5: Hoare triple {2443#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2439#true} is VALID [2020-07-17 22:20:23,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,316 INFO L263 TraceCheckUtils]: 9: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,316 INFO L263 TraceCheckUtils]: 13: Hoare triple {2439#true} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:23,318 INFO L280 TraceCheckUtils]: 16: Hoare triple {2549#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,318 INFO L263 TraceCheckUtils]: 17: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,318 INFO L280 TraceCheckUtils]: 18: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,319 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,320 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #57#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,321 INFO L263 TraceCheckUtils]: 24: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,321 INFO L280 TraceCheckUtils]: 25: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,321 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,321 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,322 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2439#true} {2550#(<= 2 |fibo1_#in~n|)} #59#return; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,322 INFO L280 TraceCheckUtils]: 29: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,323 INFO L280 TraceCheckUtils]: 30: Hoare triple {2550#(<= 2 |fibo1_#in~n|)} assume true; {2550#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,323 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2550#(<= 2 |fibo1_#in~n|)} {2439#true} #53#return; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,324 INFO L280 TraceCheckUtils]: 32: Hoare triple {2543#(<= 3 fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2543#(<= 3 fibo2_~n)} is VALID [2020-07-17 22:20:23,324 INFO L263 TraceCheckUtils]: 33: Hoare triple {2543#(<= 3 fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,324 INFO L280 TraceCheckUtils]: 34: Hoare triple {2439#true} ~n := #in~n; {2548#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:23,325 INFO L280 TraceCheckUtils]: 35: Hoare triple {2548#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,325 INFO L280 TraceCheckUtils]: 36: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,326 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2543#(<= 3 fibo2_~n)} #55#return; {2440#false} is VALID [2020-07-17 22:20:23,326 INFO L280 TraceCheckUtils]: 38: Hoare triple {2440#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2440#false} is VALID [2020-07-17 22:20:23,326 INFO L280 TraceCheckUtils]: 39: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-17 22:20:23,327 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2440#false} {2439#true} #57#return; {2440#false} is VALID [2020-07-17 22:20:23,327 INFO L280 TraceCheckUtils]: 41: Hoare triple {2440#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2440#false} is VALID [2020-07-17 22:20:23,327 INFO L263 TraceCheckUtils]: 42: Hoare triple {2440#false} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,327 INFO L280 TraceCheckUtils]: 43: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,327 INFO L280 TraceCheckUtils]: 44: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,328 INFO L280 TraceCheckUtils]: 45: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,328 INFO L280 TraceCheckUtils]: 46: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,328 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2439#true} {2440#false} #59#return; {2440#false} is VALID [2020-07-17 22:20:23,328 INFO L280 TraceCheckUtils]: 48: Hoare triple {2440#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2440#false} is VALID [2020-07-17 22:20:23,328 INFO L280 TraceCheckUtils]: 49: Hoare triple {2440#false} assume true; {2440#false} is VALID [2020-07-17 22:20:23,329 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2440#false} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-17 22:20:23,329 INFO L280 TraceCheckUtils]: 51: Hoare triple {2440#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {2440#false} is VALID [2020-07-17 22:20:23,329 INFO L280 TraceCheckUtils]: 52: Hoare triple {2440#false} assume 3 == ~result~0; {2440#false} is VALID [2020-07-17 22:20:23,329 INFO L280 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2020-07-17 22:20:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-17 22:20:23,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902094869] [2020-07-17 22:20:23,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32120074] [2020-07-17 22:20:23,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:20:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:23,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:23,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {2439#true} call ULTIMATE.init(); {2439#true} is VALID [2020-07-17 22:20:23,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2439#true} {2439#true} #47#return; {2439#true} is VALID [2020-07-17 22:20:23,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {2439#true} call #t~ret5 := main(); {2439#true} is VALID [2020-07-17 22:20:23,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {2439#true} ~x~0 := 4; {2443#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:23,543 INFO L263 TraceCheckUtils]: 5: Hoare triple {2443#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {2439#true} is VALID [2020-07-17 22:20:23,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {2439#true} ~n := #in~n; {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:23,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:23,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:23,545 INFO L263 TraceCheckUtils]: 9: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {2439#true} ~n := #in~n; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:23,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:23,551 INFO L280 TraceCheckUtils]: 12: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:23,551 INFO L263 TraceCheckUtils]: 13: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,552 INFO L280 TraceCheckUtils]: 15: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {2439#true} assume !(1 == ~n); {2439#true} is VALID [2020-07-17 22:20:23,552 INFO L263 TraceCheckUtils]: 17: Hoare triple {2439#true} call #t~ret0 := fibo2(~n - 1); {2439#true} is VALID [2020-07-17 22:20:23,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,552 INFO L280 TraceCheckUtils]: 19: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,553 INFO L280 TraceCheckUtils]: 20: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,553 INFO L280 TraceCheckUtils]: 21: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,553 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2439#true} {2439#true} #57#return; {2439#true} is VALID [2020-07-17 22:20:23,553 INFO L280 TraceCheckUtils]: 23: Hoare triple {2439#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2439#true} is VALID [2020-07-17 22:20:23,554 INFO L263 TraceCheckUtils]: 24: Hoare triple {2439#true} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,554 INFO L280 TraceCheckUtils]: 25: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,554 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#true} assume ~n < 1;#res := 0; {2439#true} is VALID [2020-07-17 22:20:23,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,554 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2439#true} {2439#true} #59#return; {2439#true} is VALID [2020-07-17 22:20:23,555 INFO L280 TraceCheckUtils]: 29: Hoare triple {2439#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2439#true} is VALID [2020-07-17 22:20:23,555 INFO L280 TraceCheckUtils]: 30: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,556 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2439#true} {2595#(<= |fibo2_#in~n| fibo2_~n)} #53#return; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:23,557 INFO L280 TraceCheckUtils]: 32: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2595#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:23,557 INFO L263 TraceCheckUtils]: 33: Hoare triple {2595#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret3 := fibo1(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,557 INFO L280 TraceCheckUtils]: 34: Hoare triple {2439#true} ~n := #in~n; {2582#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:23,558 INFO L280 TraceCheckUtils]: 35: Hoare triple {2582#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,558 INFO L280 TraceCheckUtils]: 36: Hoare triple {2560#(<= |fibo1_#in~n| 0)} assume true; {2560#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:20:23,559 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2560#(<= |fibo1_#in~n| 0)} {2595#(<= |fibo2_#in~n| fibo2_~n)} #55#return; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:23,560 INFO L280 TraceCheckUtils]: 38: Hoare triple {2677#(<= |fibo2_#in~n| 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:23,560 INFO L280 TraceCheckUtils]: 39: Hoare triple {2677#(<= |fibo2_#in~n| 2)} assume true; {2677#(<= |fibo2_#in~n| 2)} is VALID [2020-07-17 22:20:23,562 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2677#(<= |fibo2_#in~n| 2)} {2582#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:23,566 INFO L280 TraceCheckUtils]: 41: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:23,567 INFO L263 TraceCheckUtils]: 42: Hoare triple {2687#(<= |fibo1_#in~n| 3)} call #t~ret1 := fibo2(~n - 2); {2439#true} is VALID [2020-07-17 22:20:23,567 INFO L280 TraceCheckUtils]: 43: Hoare triple {2439#true} ~n := #in~n; {2439#true} is VALID [2020-07-17 22:20:23,567 INFO L280 TraceCheckUtils]: 44: Hoare triple {2439#true} assume !(~n < 1); {2439#true} is VALID [2020-07-17 22:20:23,567 INFO L280 TraceCheckUtils]: 45: Hoare triple {2439#true} assume 1 == ~n;#res := 1; {2439#true} is VALID [2020-07-17 22:20:23,568 INFO L280 TraceCheckUtils]: 46: Hoare triple {2439#true} assume true; {2439#true} is VALID [2020-07-17 22:20:23,569 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2439#true} {2687#(<= |fibo1_#in~n| 3)} #59#return; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:23,574 INFO L280 TraceCheckUtils]: 48: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:23,575 INFO L280 TraceCheckUtils]: 49: Hoare triple {2687#(<= |fibo1_#in~n| 3)} assume true; {2687#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:23,576 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2687#(<= |fibo1_#in~n| 3)} {2443#(<= 4 main_~x~0)} #51#return; {2440#false} is VALID [2020-07-17 22:20:23,576 INFO L280 TraceCheckUtils]: 51: Hoare triple {2440#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {2440#false} is VALID [2020-07-17 22:20:23,576 INFO L280 TraceCheckUtils]: 52: Hoare triple {2440#false} assume 3 == ~result~0; {2440#false} is VALID [2020-07-17 22:20:23,576 INFO L280 TraceCheckUtils]: 53: Hoare triple {2440#false} assume !false; {2440#false} is VALID [2020-07-17 22:20:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-17 22:20:23,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:23,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-17 22:20:23,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078210088] [2020-07-17 22:20:23,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-17 22:20:23,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:23,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:20:23,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:23,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:20:23,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:20:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:20:23,673 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 12 states. [2020-07-17 22:20:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:25,155 INFO L93 Difference]: Finished difference Result 265 states and 511 transitions. [2020-07-17 22:20:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:20:25,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-17 22:20:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:20:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2020-07-17 22:20:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:20:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2020-07-17 22:20:25,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 122 transitions. [2020-07-17 22:20:25,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:25,322 INFO L225 Difference]: With dead ends: 265 [2020-07-17 22:20:25,323 INFO L226 Difference]: Without dead ends: 165 [2020-07-17 22:20:25,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-07-17 22:20:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-17 22:20:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2020-07-17 22:20:25,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:25,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 142 states. [2020-07-17 22:20:25,480 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 142 states. [2020-07-17 22:20:25,480 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 142 states. [2020-07-17 22:20:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:25,494 INFO L93 Difference]: Finished difference Result 165 states and 285 transitions. [2020-07-17 22:20:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 285 transitions. [2020-07-17 22:20:25,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:25,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:25,497 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 165 states. [2020-07-17 22:20:25,497 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 165 states. [2020-07-17 22:20:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:25,523 INFO L93 Difference]: Finished difference Result 165 states and 285 transitions. [2020-07-17 22:20:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 285 transitions. [2020-07-17 22:20:25,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:25,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:25,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:25,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-17 22:20:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 244 transitions. [2020-07-17 22:20:25,535 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 244 transitions. Word has length 54 [2020-07-17 22:20:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:25,536 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 244 transitions. [2020-07-17 22:20:25,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:20:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 244 transitions. [2020-07-17 22:20:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 22:20:25,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:25,538 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:25,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:20:25,752 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-07-17 22:20:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:25,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972187442] [2020-07-17 22:20:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,800 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-17 22:20:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:25,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:25,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,943 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:25,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:25,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,953 INFO L263 TraceCheckUtils]: 3: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:25,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,953 INFO L280 TraceCheckUtils]: 5: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:25,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:25,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,955 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,956 INFO L263 TraceCheckUtils]: 10: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:25,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:25,956 INFO L280 TraceCheckUtils]: 13: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,957 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,960 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:25,966 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:25,967 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:25,967 INFO L280 TraceCheckUtils]: 3: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,968 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,970 INFO L263 TraceCheckUtils]: 3: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-17 22:20:25,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:25,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,973 INFO L263 TraceCheckUtils]: 7: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:25,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:25,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:25,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,975 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,975 INFO L280 TraceCheckUtils]: 13: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,976 INFO L263 TraceCheckUtils]: 14: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:25,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:25,976 INFO L280 TraceCheckUtils]: 17: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,977 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:25,980 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,981 INFO L280 TraceCheckUtils]: 22: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,981 INFO L263 TraceCheckUtils]: 23: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-17 22:20:25,981 INFO L280 TraceCheckUtils]: 24: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:25,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:25,982 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:25,982 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:25,983 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,984 INFO L280 TraceCheckUtils]: 29: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,984 INFO L280 TraceCheckUtils]: 30: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:25,986 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-17 22:20:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:26,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,010 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-17 22:20:26,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-17 22:20:26,011 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,012 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,013 INFO L263 TraceCheckUtils]: 7: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,015 INFO L280 TraceCheckUtils]: 9: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:26,016 INFO L280 TraceCheckUtils]: 10: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,016 INFO L263 TraceCheckUtils]: 11: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,018 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,019 INFO L280 TraceCheckUtils]: 17: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,019 INFO L263 TraceCheckUtils]: 18: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,019 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,019 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:26,019 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,020 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,021 INFO L280 TraceCheckUtils]: 23: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,022 INFO L280 TraceCheckUtils]: 24: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,023 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,024 INFO L280 TraceCheckUtils]: 26: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,024 INFO L263 TraceCheckUtils]: 27: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,024 INFO L280 TraceCheckUtils]: 28: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,025 INFO L280 TraceCheckUtils]: 29: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,025 INFO L280 TraceCheckUtils]: 30: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,025 INFO L280 TraceCheckUtils]: 31: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,026 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,027 INFO L280 TraceCheckUtils]: 33: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,027 INFO L280 TraceCheckUtils]: 34: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,028 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-17 22:20:26,029 INFO L280 TraceCheckUtils]: 36: Hoare triple {3682#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-17 22:20:26,029 INFO L263 TraceCheckUtils]: 37: Hoare triple {3682#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,030 INFO L280 TraceCheckUtils]: 38: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,030 INFO L280 TraceCheckUtils]: 39: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,031 INFO L280 TraceCheckUtils]: 40: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,032 INFO L280 TraceCheckUtils]: 41: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,033 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-17 22:20:26,033 INFO L280 TraceCheckUtils]: 43: Hoare triple {3600#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3600#false} is VALID [2020-07-17 22:20:26,034 INFO L280 TraceCheckUtils]: 44: Hoare triple {3600#false} assume true; {3600#false} is VALID [2020-07-17 22:20:26,034 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {3600#false} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-17 22:20:26,036 INFO L263 TraceCheckUtils]: 0: Hoare triple {3599#true} call ULTIMATE.init(); {3599#true} is VALID [2020-07-17 22:20:26,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-17 22:20:26,037 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret5 := main(); {3599#true} is VALID [2020-07-17 22:20:26,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~x~0 := 4; {3603#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:26,038 INFO L263 TraceCheckUtils]: 5: Hoare triple {3603#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {3599#true} is VALID [2020-07-17 22:20:26,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-17 22:20:26,039 INFO L263 TraceCheckUtils]: 9: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,040 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,040 INFO L280 TraceCheckUtils]: 11: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,041 INFO L263 TraceCheckUtils]: 13: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} ~n := #in~n; {3713#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {3713#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} is VALID [2020-07-17 22:20:26,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {3714#(and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|))} assume !(1 == ~n); {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,044 INFO L263 TraceCheckUtils]: 17: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,044 INFO L280 TraceCheckUtils]: 18: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,046 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #57#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,047 INFO L280 TraceCheckUtils]: 23: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,047 INFO L263 TraceCheckUtils]: 24: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,047 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:26,048 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,049 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3715#(<= 2 |fibo1_#in~n|)} #59#return; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,049 INFO L280 TraceCheckUtils]: 29: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,050 INFO L280 TraceCheckUtils]: 30: Hoare triple {3715#(<= 2 |fibo1_#in~n|)} assume true; {3715#(<= 2 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:26,051 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3715#(<= 2 |fibo1_#in~n|)} {3688#(= fibo2_~n |fibo2_#in~n|)} #53#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,052 INFO L280 TraceCheckUtils]: 32: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,052 INFO L263 TraceCheckUtils]: 33: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,052 INFO L280 TraceCheckUtils]: 34: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,053 INFO L280 TraceCheckUtils]: 35: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,053 INFO L280 TraceCheckUtils]: 36: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,053 INFO L280 TraceCheckUtils]: 37: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,054 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3599#true} {3707#(<= 3 |fibo2_#in~n|)} #55#return; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,055 INFO L280 TraceCheckUtils]: 39: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,055 INFO L280 TraceCheckUtils]: 40: Hoare triple {3707#(<= 3 |fibo2_#in~n|)} assume true; {3707#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,057 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3707#(<= 3 |fibo2_#in~n|)} {3599#true} #57#return; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-17 22:20:26,058 INFO L280 TraceCheckUtils]: 42: Hoare triple {3682#(<= 4 fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3682#(<= 4 fibo1_~n)} is VALID [2020-07-17 22:20:26,058 INFO L263 TraceCheckUtils]: 43: Hoare triple {3682#(<= 4 fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,058 INFO L280 TraceCheckUtils]: 44: Hoare triple {3599#true} ~n := #in~n; {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,059 INFO L280 TraceCheckUtils]: 45: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {3688#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:26,060 INFO L280 TraceCheckUtils]: 46: Hoare triple {3688#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,060 INFO L280 TraceCheckUtils]: 47: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,062 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3682#(<= 4 fibo1_~n)} #59#return; {3600#false} is VALID [2020-07-17 22:20:26,062 INFO L280 TraceCheckUtils]: 49: Hoare triple {3600#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3600#false} is VALID [2020-07-17 22:20:26,062 INFO L280 TraceCheckUtils]: 50: Hoare triple {3600#false} assume true; {3600#false} is VALID [2020-07-17 22:20:26,062 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3600#false} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-17 22:20:26,063 INFO L280 TraceCheckUtils]: 52: Hoare triple {3600#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {3600#false} is VALID [2020-07-17 22:20:26,063 INFO L280 TraceCheckUtils]: 53: Hoare triple {3600#false} assume 3 == ~result~0; {3600#false} is VALID [2020-07-17 22:20:26,063 INFO L280 TraceCheckUtils]: 54: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2020-07-17 22:20:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:20:26,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972187442] [2020-07-17 22:20:26,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890128543] [2020-07-17 22:20:26,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:26,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:20:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:26,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:26,222 INFO L263 TraceCheckUtils]: 0: Hoare triple {3599#true} call ULTIMATE.init(); {3599#true} is VALID [2020-07-17 22:20:26,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,223 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3599#true} {3599#true} #47#return; {3599#true} is VALID [2020-07-17 22:20:26,223 INFO L263 TraceCheckUtils]: 3: Hoare triple {3599#true} call #t~ret5 := main(); {3599#true} is VALID [2020-07-17 22:20:26,224 INFO L280 TraceCheckUtils]: 4: Hoare triple {3599#true} ~x~0 := 4; {3603#(<= 4 main_~x~0)} is VALID [2020-07-17 22:20:26,224 INFO L263 TraceCheckUtils]: 5: Hoare triple {3603#(<= 4 main_~x~0)} call #t~ret4 := fibo1(~x~0); {3599#true} is VALID [2020-07-17 22:20:26,226 INFO L280 TraceCheckUtils]: 6: Hoare triple {3599#true} ~n := #in~n; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:26,226 INFO L280 TraceCheckUtils]: 7: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:26,227 INFO L280 TraceCheckUtils]: 8: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:26,227 INFO L263 TraceCheckUtils]: 9: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,227 INFO L280 TraceCheckUtils]: 12: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L263 TraceCheckUtils]: 13: Hoare triple {3599#true} call #t~ret2 := fibo1(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L280 TraceCheckUtils]: 14: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L280 TraceCheckUtils]: 15: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L280 TraceCheckUtils]: 16: Hoare triple {3599#true} assume !(1 == ~n); {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L263 TraceCheckUtils]: 17: Hoare triple {3599#true} call #t~ret0 := fibo2(~n - 1); {3599#true} is VALID [2020-07-17 22:20:26,228 INFO L280 TraceCheckUtils]: 18: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,229 INFO L280 TraceCheckUtils]: 19: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,229 INFO L280 TraceCheckUtils]: 20: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,229 INFO L280 TraceCheckUtils]: 21: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,229 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3599#true} {3599#true} #57#return; {3599#true} is VALID [2020-07-17 22:20:26,230 INFO L280 TraceCheckUtils]: 23: Hoare triple {3599#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3599#true} is VALID [2020-07-17 22:20:26,230 INFO L263 TraceCheckUtils]: 24: Hoare triple {3599#true} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,230 INFO L280 TraceCheckUtils]: 25: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,230 INFO L280 TraceCheckUtils]: 26: Hoare triple {3599#true} assume ~n < 1;#res := 0; {3599#true} is VALID [2020-07-17 22:20:26,231 INFO L280 TraceCheckUtils]: 27: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,231 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3599#true} {3599#true} #59#return; {3599#true} is VALID [2020-07-17 22:20:26,231 INFO L280 TraceCheckUtils]: 29: Hoare triple {3599#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3599#true} is VALID [2020-07-17 22:20:26,232 INFO L280 TraceCheckUtils]: 30: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,232 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3599#true} {3599#true} #53#return; {3599#true} is VALID [2020-07-17 22:20:26,232 INFO L280 TraceCheckUtils]: 32: Hoare triple {3599#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3599#true} is VALID [2020-07-17 22:20:26,232 INFO L263 TraceCheckUtils]: 33: Hoare triple {3599#true} call #t~ret3 := fibo1(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,232 INFO L280 TraceCheckUtils]: 34: Hoare triple {3599#true} ~n := #in~n; {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L280 TraceCheckUtils]: 35: Hoare triple {3599#true} assume !(~n < 1); {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L280 TraceCheckUtils]: 36: Hoare triple {3599#true} assume 1 == ~n;#res := 1; {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L280 TraceCheckUtils]: 37: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3599#true} {3599#true} #55#return; {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L280 TraceCheckUtils]: 39: Hoare triple {3599#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {3599#true} is VALID [2020-07-17 22:20:26,233 INFO L280 TraceCheckUtils]: 40: Hoare triple {3599#true} assume true; {3599#true} is VALID [2020-07-17 22:20:26,235 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3599#true} {3747#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:26,235 INFO L280 TraceCheckUtils]: 42: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3747#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:20:26,236 INFO L263 TraceCheckUtils]: 43: Hoare triple {3747#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret1 := fibo2(~n - 2); {3599#true} is VALID [2020-07-17 22:20:26,237 INFO L280 TraceCheckUtils]: 44: Hoare triple {3599#true} ~n := #in~n; {3862#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:26,237 INFO L280 TraceCheckUtils]: 45: Hoare triple {3862#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {3862#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:20:26,238 INFO L280 TraceCheckUtils]: 46: Hoare triple {3862#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,238 INFO L280 TraceCheckUtils]: 47: Hoare triple {3725#(<= |fibo2_#in~n| 1)} assume true; {3725#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:26,240 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3725#(<= |fibo2_#in~n| 1)} {3747#(<= |fibo1_#in~n| fibo1_~n)} #59#return; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:26,240 INFO L280 TraceCheckUtils]: 49: Hoare triple {3875#(<= |fibo1_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:26,241 INFO L280 TraceCheckUtils]: 50: Hoare triple {3875#(<= |fibo1_#in~n| 3)} assume true; {3875#(<= |fibo1_#in~n| 3)} is VALID [2020-07-17 22:20:26,242 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {3875#(<= |fibo1_#in~n| 3)} {3603#(<= 4 main_~x~0)} #51#return; {3600#false} is VALID [2020-07-17 22:20:26,242 INFO L280 TraceCheckUtils]: 52: Hoare triple {3600#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {3600#false} is VALID [2020-07-17 22:20:26,243 INFO L280 TraceCheckUtils]: 53: Hoare triple {3600#false} assume 3 == ~result~0; {3600#false} is VALID [2020-07-17 22:20:26,243 INFO L280 TraceCheckUtils]: 54: Hoare triple {3600#false} assume !false; {3600#false} is VALID [2020-07-17 22:20:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-17 22:20:26,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:26,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2020-07-17 22:20:26,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621934037] [2020-07-17 22:20:26,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-17 22:20:26,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:26,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:20:26,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:26,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:20:26,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:26,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:20:26,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:20:26,328 INFO L87 Difference]: Start difference. First operand 142 states and 244 transitions. Second operand 13 states. [2020-07-17 22:20:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:27,736 INFO L93 Difference]: Finished difference Result 304 states and 583 transitions. [2020-07-17 22:20:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:20:27,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-07-17 22:20:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:20:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2020-07-17 22:20:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:20:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2020-07-17 22:20:27,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 125 transitions. [2020-07-17 22:20:27,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:27,923 INFO L225 Difference]: With dead ends: 304 [2020-07-17 22:20:27,924 INFO L226 Difference]: Without dead ends: 101 [2020-07-17 22:20:27,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:20:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-17 22:20:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2020-07-17 22:20:27,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:27,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 83 states. [2020-07-17 22:20:27,990 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 83 states. [2020-07-17 22:20:27,990 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 83 states. [2020-07-17 22:20:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:28,014 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2020-07-17 22:20:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-07-17 22:20:28,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:28,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:28,016 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 101 states. [2020-07-17 22:20:28,016 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 101 states. [2020-07-17 22:20:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:28,023 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2020-07-17 22:20:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-07-17 22:20:28,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:28,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:28,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:28,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-17 22:20:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2020-07-17 22:20:28,032 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 55 [2020-07-17 22:20:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:28,033 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2020-07-17 22:20:28,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:20:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2020-07-17 22:20:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-17 22:20:28,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:28,036 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:28,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:28,251 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1751947273, now seen corresponding path program 2 times [2020-07-17 22:20:28,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:28,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062149357] [2020-07-17 22:20:28,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,294 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-17 22:20:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,434 INFO L280 TraceCheckUtils]: 3: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,435 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,447 INFO L263 TraceCheckUtils]: 3: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,451 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,452 INFO L263 TraceCheckUtils]: 10: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,453 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,454 INFO L280 TraceCheckUtils]: 15: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,455 INFO L280 TraceCheckUtils]: 16: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,456 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,463 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,464 INFO L280 TraceCheckUtils]: 3: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,465 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,467 INFO L263 TraceCheckUtils]: 3: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,468 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,468 INFO L280 TraceCheckUtils]: 5: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,469 INFO L280 TraceCheckUtils]: 6: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,469 INFO L263 TraceCheckUtils]: 7: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,470 INFO L280 TraceCheckUtils]: 9: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,473 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,473 INFO L263 TraceCheckUtils]: 14: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,474 INFO L280 TraceCheckUtils]: 16: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,475 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,475 INFO L280 TraceCheckUtils]: 19: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,477 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,478 INFO L280 TraceCheckUtils]: 22: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,478 INFO L263 TraceCheckUtils]: 23: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,478 INFO L280 TraceCheckUtils]: 24: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,479 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,480 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,480 INFO L280 TraceCheckUtils]: 29: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,481 INFO L280 TraceCheckUtils]: 30: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,482 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-17 22:20:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,551 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,579 INFO L280 TraceCheckUtils]: 3: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,581 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-17 22:20:28,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,582 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,583 INFO L280 TraceCheckUtils]: 5: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,586 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,587 INFO L263 TraceCheckUtils]: 10: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,589 INFO L280 TraceCheckUtils]: 14: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,591 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-17 22:20:28,591 INFO L280 TraceCheckUtils]: 16: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-17 22:20:28,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-17 22:20:28,592 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-17 22:20:28,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,594 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,595 INFO L280 TraceCheckUtils]: 5: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,596 INFO L280 TraceCheckUtils]: 6: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,596 INFO L263 TraceCheckUtils]: 7: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,599 INFO L263 TraceCheckUtils]: 11: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,601 INFO L280 TraceCheckUtils]: 14: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,603 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,604 INFO L280 TraceCheckUtils]: 17: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,604 INFO L263 TraceCheckUtils]: 18: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,605 INFO L280 TraceCheckUtils]: 19: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,605 INFO L280 TraceCheckUtils]: 20: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,605 INFO L280 TraceCheckUtils]: 21: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,606 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,607 INFO L280 TraceCheckUtils]: 24: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,608 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,609 INFO L280 TraceCheckUtils]: 26: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,609 INFO L263 TraceCheckUtils]: 27: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,610 INFO L280 TraceCheckUtils]: 28: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,610 INFO L280 TraceCheckUtils]: 29: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,610 INFO L280 TraceCheckUtils]: 30: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,610 INFO L280 TraceCheckUtils]: 31: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,611 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,612 INFO L280 TraceCheckUtils]: 33: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,612 INFO L280 TraceCheckUtils]: 34: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,614 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-17 22:20:28,615 INFO L280 TraceCheckUtils]: 36: Hoare triple {4707#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4707#(<= fibo1_~n 4)} is VALID [2020-07-17 22:20:28,615 INFO L263 TraceCheckUtils]: 37: Hoare triple {4707#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,615 INFO L280 TraceCheckUtils]: 38: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,615 INFO L280 TraceCheckUtils]: 39: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,616 INFO L263 TraceCheckUtils]: 41: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,617 INFO L280 TraceCheckUtils]: 42: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,617 INFO L280 TraceCheckUtils]: 43: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,618 INFO L280 TraceCheckUtils]: 44: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,619 INFO L280 TraceCheckUtils]: 45: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,621 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,622 INFO L280 TraceCheckUtils]: 47: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,622 INFO L263 TraceCheckUtils]: 48: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,623 INFO L280 TraceCheckUtils]: 49: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,624 INFO L280 TraceCheckUtils]: 50: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,624 INFO L280 TraceCheckUtils]: 51: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,625 INFO L280 TraceCheckUtils]: 52: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,626 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-17 22:20:28,626 INFO L280 TraceCheckUtils]: 54: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-17 22:20:28,627 INFO L280 TraceCheckUtils]: 55: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-17 22:20:28,627 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-17 22:20:28,627 INFO L280 TraceCheckUtils]: 57: Hoare triple {4611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4611#false} is VALID [2020-07-17 22:20:28,627 INFO L280 TraceCheckUtils]: 58: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-17 22:20:28,628 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4611#false} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-17 22:20:28,631 INFO L263 TraceCheckUtils]: 0: Hoare triple {4610#true} call ULTIMATE.init(); {4610#true} is VALID [2020-07-17 22:20:28,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,632 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-17 22:20:28,632 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret5 := main(); {4610#true} is VALID [2020-07-17 22:20:28,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~x~0 := 4; {4614#(<= main_~x~0 4)} is VALID [2020-07-17 22:20:28,633 INFO L263 TraceCheckUtils]: 5: Hoare triple {4614#(<= main_~x~0 4)} call #t~ret4 := fibo1(~x~0); {4610#true} is VALID [2020-07-17 22:20:28,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,634 INFO L263 TraceCheckUtils]: 9: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,636 INFO L263 TraceCheckUtils]: 13: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,638 INFO L263 TraceCheckUtils]: 17: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,639 INFO L280 TraceCheckUtils]: 18: Hoare triple {4610#true} ~n := #in~n; {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,640 INFO L280 TraceCheckUtils]: 19: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4727#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,641 INFO L280 TraceCheckUtils]: 20: Hoare triple {4727#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,642 INFO L280 TraceCheckUtils]: 21: Hoare triple {4763#(<= |fibo2_#in~n| 1)} assume true; {4763#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:20:28,643 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4763#(<= |fibo2_#in~n| 1)} {4752#(= fibo1_~n |fibo1_#in~n|)} #57#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,645 INFO L263 TraceCheckUtils]: 24: Hoare triple {4758#(<= |fibo1_#in~n| 2)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,645 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,645 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,645 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,646 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4758#(<= |fibo1_#in~n| 2)} #59#return; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,647 INFO L280 TraceCheckUtils]: 29: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,647 INFO L280 TraceCheckUtils]: 30: Hoare triple {4758#(<= |fibo1_#in~n| 2)} assume true; {4758#(<= |fibo1_#in~n| 2)} is VALID [2020-07-17 22:20:28,649 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4758#(<= |fibo1_#in~n| 2)} {4727#(= fibo2_~n |fibo2_#in~n|)} #53#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,649 INFO L280 TraceCheckUtils]: 32: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,650 INFO L263 TraceCheckUtils]: 33: Hoare triple {4746#(<= |fibo2_#in~n| 3)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,650 INFO L280 TraceCheckUtils]: 34: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,650 INFO L280 TraceCheckUtils]: 35: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,650 INFO L280 TraceCheckUtils]: 36: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,650 INFO L280 TraceCheckUtils]: 37: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,651 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4610#true} {4746#(<= |fibo2_#in~n| 3)} #55#return; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,652 INFO L280 TraceCheckUtils]: 39: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,652 INFO L280 TraceCheckUtils]: 40: Hoare triple {4746#(<= |fibo2_#in~n| 3)} assume true; {4746#(<= |fibo2_#in~n| 3)} is VALID [2020-07-17 22:20:28,653 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4746#(<= |fibo2_#in~n| 3)} {4610#true} #57#return; {4707#(<= fibo1_~n 4)} is VALID [2020-07-17 22:20:28,654 INFO L280 TraceCheckUtils]: 42: Hoare triple {4707#(<= fibo1_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4707#(<= fibo1_~n 4)} is VALID [2020-07-17 22:20:28,654 INFO L263 TraceCheckUtils]: 43: Hoare triple {4707#(<= fibo1_~n 4)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,654 INFO L280 TraceCheckUtils]: 44: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,655 INFO L280 TraceCheckUtils]: 45: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,655 INFO L280 TraceCheckUtils]: 46: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,655 INFO L263 TraceCheckUtils]: 47: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,656 INFO L280 TraceCheckUtils]: 48: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,656 INFO L280 TraceCheckUtils]: 49: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,657 INFO L280 TraceCheckUtils]: 50: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,658 INFO L280 TraceCheckUtils]: 51: Hoare triple {4775#(<= |fibo1_#in~n| 1)} assume true; {4775#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:20:28,659 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4775#(<= |fibo1_#in~n| 1)} {4610#true} #53#return; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,659 INFO L280 TraceCheckUtils]: 53: Hoare triple {4769#(<= fibo2_~n 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4769#(<= fibo2_~n 2)} is VALID [2020-07-17 22:20:28,660 INFO L263 TraceCheckUtils]: 54: Hoare triple {4769#(<= fibo2_~n 2)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,660 INFO L280 TraceCheckUtils]: 55: Hoare triple {4610#true} ~n := #in~n; {4752#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,661 INFO L280 TraceCheckUtils]: 56: Hoare triple {4752#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,661 INFO L280 TraceCheckUtils]: 57: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,662 INFO L280 TraceCheckUtils]: 58: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,663 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4769#(<= fibo2_~n 2)} #55#return; {4611#false} is VALID [2020-07-17 22:20:28,663 INFO L280 TraceCheckUtils]: 60: Hoare triple {4611#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4611#false} is VALID [2020-07-17 22:20:28,663 INFO L280 TraceCheckUtils]: 61: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-17 22:20:28,663 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4611#false} {4707#(<= fibo1_~n 4)} #59#return; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L280 TraceCheckUtils]: 63: Hoare triple {4611#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L280 TraceCheckUtils]: 64: Hoare triple {4611#false} assume true; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4611#false} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L280 TraceCheckUtils]: 66: Hoare triple {4611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L280 TraceCheckUtils]: 67: Hoare triple {4611#false} assume 3 == ~result~0; {4611#false} is VALID [2020-07-17 22:20:28,664 INFO L280 TraceCheckUtils]: 68: Hoare triple {4611#false} assume !false; {4611#false} is VALID [2020-07-17 22:20:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-17 22:20:28,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062149357] [2020-07-17 22:20:28,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500902178] [2020-07-17 22:20:28,669 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:28,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:20:28,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:20:28,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:20:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:20:28,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:20:28,942 INFO L263 TraceCheckUtils]: 0: Hoare triple {4610#true} call ULTIMATE.init(); {4610#true} is VALID [2020-07-17 22:20:28,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,943 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4610#true} {4610#true} #47#return; {4610#true} is VALID [2020-07-17 22:20:28,943 INFO L263 TraceCheckUtils]: 3: Hoare triple {4610#true} call #t~ret5 := main(); {4610#true} is VALID [2020-07-17 22:20:28,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {4610#true} ~x~0 := 4; {4614#(<= main_~x~0 4)} is VALID [2020-07-17 22:20:28,944 INFO L263 TraceCheckUtils]: 5: Hoare triple {4614#(<= main_~x~0 4)} call #t~ret4 := fibo1(~x~0); {4610#true} is VALID [2020-07-17 22:20:28,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {4610#true} ~n := #in~n; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,946 INFO L263 TraceCheckUtils]: 9: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,946 INFO L280 TraceCheckUtils]: 11: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,947 INFO L263 TraceCheckUtils]: 13: Hoare triple {4610#true} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,947 INFO L280 TraceCheckUtils]: 14: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,947 INFO L280 TraceCheckUtils]: 16: Hoare triple {4610#true} assume !(1 == ~n); {4610#true} is VALID [2020-07-17 22:20:28,947 INFO L263 TraceCheckUtils]: 17: Hoare triple {4610#true} call #t~ret0 := fibo2(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,948 INFO L280 TraceCheckUtils]: 18: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,948 INFO L280 TraceCheckUtils]: 19: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,948 INFO L280 TraceCheckUtils]: 20: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,948 INFO L280 TraceCheckUtils]: 21: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,948 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4610#true} {4610#true} #57#return; {4610#true} is VALID [2020-07-17 22:20:28,949 INFO L280 TraceCheckUtils]: 23: Hoare triple {4610#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4610#true} is VALID [2020-07-17 22:20:28,949 INFO L263 TraceCheckUtils]: 24: Hoare triple {4610#true} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,949 INFO L280 TraceCheckUtils]: 25: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,949 INFO L280 TraceCheckUtils]: 26: Hoare triple {4610#true} assume ~n < 1;#res := 0; {4610#true} is VALID [2020-07-17 22:20:28,949 INFO L280 TraceCheckUtils]: 27: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,950 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4610#true} {4610#true} #59#return; {4610#true} is VALID [2020-07-17 22:20:28,950 INFO L280 TraceCheckUtils]: 29: Hoare triple {4610#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4610#true} is VALID [2020-07-17 22:20:28,950 INFO L280 TraceCheckUtils]: 30: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,950 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {4610#true} {4610#true} #53#return; {4610#true} is VALID [2020-07-17 22:20:28,951 INFO L280 TraceCheckUtils]: 32: Hoare triple {4610#true} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4610#true} is VALID [2020-07-17 22:20:28,951 INFO L263 TraceCheckUtils]: 33: Hoare triple {4610#true} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,951 INFO L280 TraceCheckUtils]: 34: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,951 INFO L280 TraceCheckUtils]: 35: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,951 INFO L280 TraceCheckUtils]: 36: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,952 INFO L280 TraceCheckUtils]: 37: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,952 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4610#true} {4610#true} #55#return; {4610#true} is VALID [2020-07-17 22:20:28,952 INFO L280 TraceCheckUtils]: 39: Hoare triple {4610#true} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4610#true} is VALID [2020-07-17 22:20:28,952 INFO L280 TraceCheckUtils]: 40: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,953 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {4610#true} {4798#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,954 INFO L280 TraceCheckUtils]: 42: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,954 INFO L263 TraceCheckUtils]: 43: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,955 INFO L280 TraceCheckUtils]: 44: Hoare triple {4610#true} ~n := #in~n; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,956 INFO L280 TraceCheckUtils]: 45: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,956 INFO L280 TraceCheckUtils]: 46: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,956 INFO L263 TraceCheckUtils]: 47: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {4610#true} is VALID [2020-07-17 22:20:28,956 INFO L280 TraceCheckUtils]: 48: Hoare triple {4610#true} ~n := #in~n; {4610#true} is VALID [2020-07-17 22:20:28,957 INFO L280 TraceCheckUtils]: 49: Hoare triple {4610#true} assume !(~n < 1); {4610#true} is VALID [2020-07-17 22:20:28,957 INFO L280 TraceCheckUtils]: 50: Hoare triple {4610#true} assume 1 == ~n;#res := 1; {4610#true} is VALID [2020-07-17 22:20:28,957 INFO L280 TraceCheckUtils]: 51: Hoare triple {4610#true} assume true; {4610#true} is VALID [2020-07-17 22:20:28,958 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {4610#true} {4913#(<= fibo2_~n |fibo2_#in~n|)} #53#return; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,958 INFO L280 TraceCheckUtils]: 53: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4913#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,959 INFO L263 TraceCheckUtils]: 54: Hoare triple {4913#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {4610#true} is VALID [2020-07-17 22:20:28,959 INFO L280 TraceCheckUtils]: 55: Hoare triple {4610#true} ~n := #in~n; {4798#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,960 INFO L280 TraceCheckUtils]: 56: Hoare triple {4798#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,961 INFO L280 TraceCheckUtils]: 57: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,961 INFO L280 TraceCheckUtils]: 58: Hoare triple {4776#(<= 1 |fibo1_#in~n|)} assume true; {4776#(<= 1 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,963 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {4776#(<= 1 |fibo1_#in~n|)} {4913#(<= fibo2_~n |fibo2_#in~n|)} #55#return; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,963 INFO L280 TraceCheckUtils]: 60: Hoare triple {4959#(<= 3 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret3;havoc #t~ret2; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,964 INFO L280 TraceCheckUtils]: 61: Hoare triple {4959#(<= 3 |fibo2_#in~n|)} assume true; {4959#(<= 3 |fibo2_#in~n|)} is VALID [2020-07-17 22:20:28,966 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4959#(<= 3 |fibo2_#in~n|)} {4798#(<= fibo1_~n |fibo1_#in~n|)} #59#return; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,966 INFO L280 TraceCheckUtils]: 63: Hoare triple {4969#(<= 5 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,967 INFO L280 TraceCheckUtils]: 64: Hoare triple {4969#(<= 5 |fibo1_#in~n|)} assume true; {4969#(<= 5 |fibo1_#in~n|)} is VALID [2020-07-17 22:20:28,968 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4969#(<= 5 |fibo1_#in~n|)} {4614#(<= main_~x~0 4)} #51#return; {4611#false} is VALID [2020-07-17 22:20:28,969 INFO L280 TraceCheckUtils]: 66: Hoare triple {4611#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {4611#false} is VALID [2020-07-17 22:20:28,969 INFO L280 TraceCheckUtils]: 67: Hoare triple {4611#false} assume 3 == ~result~0; {4611#false} is VALID [2020-07-17 22:20:28,969 INFO L280 TraceCheckUtils]: 68: Hoare triple {4611#false} assume !false; {4611#false} is VALID [2020-07-17 22:20:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-07-17 22:20:28,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:20:28,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2020-07-17 22:20:28,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821807545] [2020-07-17 22:20:28,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-17 22:20:28,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:20:28,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:20:29,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:29,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:20:29,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:20:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:20:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:20:29,082 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 16 states. [2020-07-17 22:20:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:30,900 INFO L93 Difference]: Finished difference Result 174 states and 293 transitions. [2020-07-17 22:20:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 22:20:30,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-17 22:20:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:20:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:20:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2020-07-17 22:20:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:20:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 147 transitions. [2020-07-17 22:20:30,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 147 transitions. [2020-07-17 22:20:31,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:20:31,118 INFO L225 Difference]: With dead ends: 174 [2020-07-17 22:20:31,118 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:20:31,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2020-07-17 22:20:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:20:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2020-07-17 22:20:31,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:20:31,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 80 states. [2020-07-17 22:20:31,167 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 80 states. [2020-07-17 22:20:31,167 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 80 states. [2020-07-17 22:20:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:31,173 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-17 22:20:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-17 22:20:31,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:31,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:31,174 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 89 states. [2020-07-17 22:20:31,174 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 89 states. [2020-07-17 22:20:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:20:31,178 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-17 22:20:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-17 22:20:31,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:20:31,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:20:31,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:20:31,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:20:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 22:20:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2020-07-17 22:20:31,182 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 69 [2020-07-17 22:20:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:20:31,182 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2020-07-17 22:20:31,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:20:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2020-07-17 22:20:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-17 22:20:31,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:20:31,184 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:20:31,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:20:31,399 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:20:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:20:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times [2020-07-17 22:20:31,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:20:31,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029600709] [2020-07-17 22:20:31,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:20:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:20:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:20:31,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:20:31,442 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:20:31,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:20:31,484 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:20:31,484 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:20:31,484 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:20:31,484 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:20:31,484 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:20:31,485 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:20:31,486 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:20:31,487 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:20:31,488 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:20:31,489 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:20:31,489 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:20:31,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:20:31 BoogieIcfgContainer [2020-07-17 22:20:31,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:20:31,495 INFO L168 Benchmark]: Toolchain (without parser) took 18384.25 ms. Allocated memory was 147.3 MB in the beginning and 353.9 MB in the end (delta: 206.6 MB). Free memory was 105.7 MB in the beginning and 245.7 MB in the end (delta: -140.0 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,495 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.78 ms. Allocated memory is still 147.3 MB. Free memory was 105.3 MB in the beginning and 95.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,496 INFO L168 Benchmark]: Boogie Preprocessor took 116.64 ms. Allocated memory was 147.3 MB in the beginning and 203.4 MB in the end (delta: 56.1 MB). Free memory was 95.5 MB in the beginning and 182.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,497 INFO L168 Benchmark]: RCFGBuilder took 406.11 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 163.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,498 INFO L168 Benchmark]: TraceAbstraction took 17525.74 ms. Allocated memory was 203.4 MB in the beginning and 353.9 MB in the end (delta: 150.5 MB). Free memory was 162.3 MB in the beginning and 245.7 MB in the end (delta: -83.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:20:31,500 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.78 ms. Allocated memory is still 147.3 MB. Free memory was 105.3 MB in the beginning and 95.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.64 ms. Allocated memory was 147.3 MB in the beginning and 203.4 MB in the end (delta: 56.1 MB). Free memory was 95.5 MB in the beginning and 182.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.11 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 163.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17525.74 ms. Allocated memory was 203.4 MB in the beginning and 353.9 MB in the end (delta: 150.5 MB). Free memory was 162.3 MB in the beginning and 245.7 MB in the end (delta: -83.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 4; VAL [x=4] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=3, x=4] [L37] int result = fibo1(x); [L38] COND TRUE result == 3 VAL [result=3, x=4] [L39] __VERIFIER_error() VAL [result=3, x=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 337 SDslu, 1423 SDs, 0 SdLazy, 1900 SolverSat, 296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 70 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 52071 SizeOfPredicates, 25 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 330/432 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 incorrect! Received shutdown request...