/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/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:43:38,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:43:38,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:43:38,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:43:38,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:43:38,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:43:38,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:43:38,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:43:38,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:43:38,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:43:38,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:43:38,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:43:38,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:43:38,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:43:38,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:43:38,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:43:38,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:43:38,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:43:38,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:43:38,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:43:38,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:43:38,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:43:38,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:43:38,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:43:38,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:43:38,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:43:38,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:43:38,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:43:38,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:43:38,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:43:38,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:43:38,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:43:38,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:43:38,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:43:38,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:43:38,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:43:38,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:43:38,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:43:38,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:43:38,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:43:38,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:43:38,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:43:38,977 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:43:38,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:43:38,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:43:38,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:43:38,980 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:43:38,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:43:38,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:43:38,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:43:38,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:43:38,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:43:38,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:43:38,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:43:38,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:43:38,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:43:38,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:43:38,983 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:43:38,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:43:38,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:43:38,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:43:38,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:43:38,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:43:38,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:38,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:43:38,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:43:38,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:43:38,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:43:38,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:43:38,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:43:38,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:43:38,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:43:39,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:43:39,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:43:39,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:43:39,319 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:43:39,320 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:43:39,320 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-10 14:43:39,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f92d6c0b/43d486154c994817b624d0aa8819dfb3/FLAGa0a1f782b [2020-07-10 14:43:39,850 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:43:39,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-10 14:43:39,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f92d6c0b/43d486154c994817b624d0aa8819dfb3/FLAGa0a1f782b [2020-07-10 14:43:40,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f92d6c0b/43d486154c994817b624d0aa8819dfb3 [2020-07-10 14:43:40,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:43:40,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:43:40,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:40,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:43:40,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:43:40,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456872f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40, skipping insertion in model container [2020-07-10 14:43:40,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:43:40,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:43:40,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:40,441 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:43:40,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:43:40,474 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:43:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40 WrapperNode [2020-07-10 14:43:40,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:43:40,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:43:40,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:43:40,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:43:40,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... [2020-07-10 14:43:40,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:43:40,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:43:40,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:43:40,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:43:40,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:43:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:43:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-10 14:43:40,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:43:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:43:40,930 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:43:40,930 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:43:40,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:40 BoogieIcfgContainer [2020-07-10 14:43:40,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:43:40,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:43:40,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:43:40,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:43:40,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:43:40" (1/3) ... [2020-07-10 14:43:40,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:40, skipping insertion in model container [2020-07-10 14:43:40,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:43:40" (2/3) ... [2020-07-10 14:43:40,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dde5d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:43:40, skipping insertion in model container [2020-07-10 14:43:40,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:43:40" (3/3) ... [2020-07-10 14:43:40,946 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-10 14:43:40,964 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:43:40,972 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:43:40,988 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:43:41,017 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:43:41,017 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:43:41,017 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:43:41,017 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:43:41,017 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:43:41,018 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:43:41,018 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:43:41,018 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:43:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-10 14:43:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:43:41,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:41,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:41,055 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-10 14:43:41,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:41,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218083270] [2020-07-10 14:43:41,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:41,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 14:43:41,323 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #34#return; {26#true} is VALID [2020-07-10 14:43:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:41,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} ~n := #in~n; {35#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:41,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:41,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#(<= |fibonacci_#in~n| 0)} assume true; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:41,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#(<= |fibonacci_#in~n| 0)} {26#true} #38#return; {34#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:41,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-10 14:43:41,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 14:43:41,378 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #34#return; {26#true} is VALID [2020-07-10 14:43:41,378 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2020-07-10 14:43:41,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {26#true} is VALID [2020-07-10 14:43:41,379 INFO L263 TraceCheckUtils]: 5: Hoare triple {26#true} call #t~ret3 := fibonacci(~x~0); {26#true} is VALID [2020-07-10 14:43:41,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~n := #in~n; {35#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:41,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:41,383 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(<= |fibonacci_#in~n| 0)} assume true; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:41,386 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {36#(<= |fibonacci_#in~n| 0)} {26#true} #38#return; {34#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:41,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#(not (= 5 main_~x~0))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {34#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:41,388 INFO L280 TraceCheckUtils]: 11: Hoare triple {34#(not (= 5 main_~x~0))} assume !(5 != ~x~0 || 3 == ~result~0); {27#false} is VALID [2020-07-10 14:43:41,389 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-10 14:43:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:41,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218083270] [2020-07-10 14:43:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:41,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:43:41,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292432496] [2020-07-10 14:43:41,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:43:41,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:41,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:43:41,440 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-10 14:43:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:43:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:43:41,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:43:41,456 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-10 14:43:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:41,730 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-10 14:43:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:43:41,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:43:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:43:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-10 14:43:41,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-10 14:43:41,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:41,834 INFO L225 Difference]: With dead ends: 35 [2020-07-10 14:43:41,835 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 14:43:41,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 14:43:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 14:43:41,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:41,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 14:43:41,896 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 14:43:41,896 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 14:43:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:41,902 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-10 14:43:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 14:43:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:41,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:41,904 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 14:43:41,905 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 14:43:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:41,909 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-10 14:43:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 14:43:41,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:41,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:41,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:41,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:43:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-10 14:43:41,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-10 14:43:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:41,918 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-10 14:43:41,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:43:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 14:43:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 14:43:41,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:41,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:41,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:43:41,920 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-10 14:43:41,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:41,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82910233] [2020-07-10 14:43:41,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:41,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-10 14:43:41,977 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {155#true} {155#true} #34#return; {155#true} is VALID [2020-07-10 14:43:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} ~n := #in~n; {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {165#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,043 INFO L280 TraceCheckUtils]: 3: Hoare triple {166#(<= |fibonacci_#in~n| 1)} assume true; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,044 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {166#(<= |fibonacci_#in~n| 1)} {155#true} #38#return; {164#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:42,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2020-07-10 14:43:42,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-10 14:43:42,046 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {155#true} {155#true} #34#return; {155#true} is VALID [2020-07-10 14:43:42,046 INFO L263 TraceCheckUtils]: 3: Hoare triple {155#true} call #t~ret4 := main(); {155#true} is VALID [2020-07-10 14:43:42,046 INFO L280 TraceCheckUtils]: 4: Hoare triple {155#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {155#true} is VALID [2020-07-10 14:43:42,047 INFO L263 TraceCheckUtils]: 5: Hoare triple {155#true} call #t~ret3 := fibonacci(~x~0); {155#true} is VALID [2020-07-10 14:43:42,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {155#true} ~n := #in~n; {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,049 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,050 INFO L280 TraceCheckUtils]: 8: Hoare triple {165#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,051 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#(<= |fibonacci_#in~n| 1)} assume true; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,052 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {166#(<= |fibonacci_#in~n| 1)} {155#true} #38#return; {164#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:42,053 INFO L280 TraceCheckUtils]: 11: Hoare triple {164#(not (= 5 main_~x~0))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {164#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:42,055 INFO L280 TraceCheckUtils]: 12: Hoare triple {164#(not (= 5 main_~x~0))} assume !(5 != ~x~0 || 3 == ~result~0); {156#false} is VALID [2020-07-10 14:43:42,055 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-10 14:43:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:42,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82910233] [2020-07-10 14:43:42,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:43:42,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:43:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621082058] [2020-07-10 14:43:42,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:43:42,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:42,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:43:42,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:42,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:43:42,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:42,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:43:42,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:43:42,083 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-10 14:43:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:42,240 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-10 14:43:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:43:42,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 14:43:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-10 14:43:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:43:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-10 14:43:42,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-10 14:43:42,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:42,292 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:43:42,293 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:43:42,294 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:43:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:43:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-10 14:43:42,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:42,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-10 14:43:42,309 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-10 14:43:42,309 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-10 14:43:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:42,313 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-10 14:43:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-10 14:43:42,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:42,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:42,314 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-10 14:43:42,315 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-10 14:43:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:42,319 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-10 14:43:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-10 14:43:42,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:42,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:42,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:42,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:43:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-10 14:43:42,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-10 14:43:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:42,324 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-10 14:43:42,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:43:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 14:43:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:43:42,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:42,326 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:42,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:43:42,327 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-10 14:43:42,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:42,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449844455] [2020-07-10 14:43:42,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,410 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-10 14:43:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,560 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-10 14:43:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-10 14:43:42,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,578 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-10 14:43:42,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume !(~n < 1); {302#(< 0 fibonacci_~n)} is VALID [2020-07-10 14:43:42,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {302#(< 0 fibonacci_~n)} assume !(1 == ~n); {303#(< 1 fibonacci_~n)} is VALID [2020-07-10 14:43:42,585 INFO L263 TraceCheckUtils]: 3: Hoare triple {303#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-10 14:43:42,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,592 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-10 14:43:42,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {282#false} is VALID [2020-07-10 14:43:42,593 INFO L263 TraceCheckUtils]: 9: Hoare triple {282#false} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-10 14:43:42,593 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-10 14:43:42,594 INFO L280 TraceCheckUtils]: 12: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,597 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-10 14:43:42,597 INFO L280 TraceCheckUtils]: 14: Hoare triple {282#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {282#false} is VALID [2020-07-10 14:43:42,597 INFO L280 TraceCheckUtils]: 15: Hoare triple {282#false} assume true; {282#false} is VALID [2020-07-10 14:43:42,598 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {282#false} {281#true} #38#return; {282#false} is VALID [2020-07-10 14:43:42,601 INFO L263 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2020-07-10 14:43:42,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-10 14:43:42,602 INFO L263 TraceCheckUtils]: 3: Hoare triple {281#true} call #t~ret4 := main(); {281#true} is VALID [2020-07-10 14:43:42,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {281#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {281#true} is VALID [2020-07-10 14:43:42,602 INFO L263 TraceCheckUtils]: 5: Hoare triple {281#true} call #t~ret3 := fibonacci(~x~0); {281#true} is VALID [2020-07-10 14:43:42,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {281#true} assume !(~n < 1); {302#(< 0 fibonacci_~n)} is VALID [2020-07-10 14:43:42,605 INFO L280 TraceCheckUtils]: 8: Hoare triple {302#(< 0 fibonacci_~n)} assume !(1 == ~n); {303#(< 1 fibonacci_~n)} is VALID [2020-07-10 14:43:42,606 INFO L263 TraceCheckUtils]: 9: Hoare triple {303#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-10 14:43:42,606 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:42,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {312#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,610 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-10 14:43:42,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {282#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {282#false} is VALID [2020-07-10 14:43:42,612 INFO L263 TraceCheckUtils]: 15: Hoare triple {282#false} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-10 14:43:42,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,613 INFO L280 TraceCheckUtils]: 17: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-10 14:43:42,613 INFO L280 TraceCheckUtils]: 18: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,614 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-10 14:43:42,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {282#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {282#false} is VALID [2020-07-10 14:43:42,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#false} assume true; {282#false} is VALID [2020-07-10 14:43:42,614 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {282#false} {281#true} #38#return; {282#false} is VALID [2020-07-10 14:43:42,615 INFO L280 TraceCheckUtils]: 23: Hoare triple {282#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {282#false} is VALID [2020-07-10 14:43:42,615 INFO L280 TraceCheckUtils]: 24: Hoare triple {282#false} assume !(5 != ~x~0 || 3 == ~result~0); {282#false} is VALID [2020-07-10 14:43:42,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {282#false} assume !false; {282#false} is VALID [2020-07-10 14:43:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:42,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449844455] [2020-07-10 14:43:42,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517868188] [2020-07-10 14:43:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:43:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:42,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:42,867 INFO L263 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2020-07-10 14:43:42,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,868 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-10 14:43:42,868 INFO L263 TraceCheckUtils]: 3: Hoare triple {281#true} call #t~ret4 := main(); {281#true} is VALID [2020-07-10 14:43:42,868 INFO L280 TraceCheckUtils]: 4: Hoare triple {281#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {281#true} is VALID [2020-07-10 14:43:42,869 INFO L263 TraceCheckUtils]: 5: Hoare triple {281#true} call #t~ret3 := fibonacci(~x~0); {281#true} is VALID [2020-07-10 14:43:42,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {281#true} ~n := #in~n; {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:42,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {335#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:42,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {335#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:42,872 INFO L263 TraceCheckUtils]: 9: Hoare triple {335#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-10 14:43:42,879 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:42,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {335#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:42,882 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {335#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {357#(<= |fibonacci_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,883 INFO L263 TraceCheckUtils]: 15: Hoare triple {357#(<= |fibonacci_#in~n| 1)} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-10 14:43:42,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-10 14:43:42,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-10 14:43:42,884 INFO L280 TraceCheckUtils]: 18: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-10 14:43:42,885 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {281#true} {357#(<= |fibonacci_#in~n| 1)} #32#return; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,886 INFO L280 TraceCheckUtils]: 20: Hoare triple {357#(<= |fibonacci_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,887 INFO L280 TraceCheckUtils]: 21: Hoare triple {357#(<= |fibonacci_#in~n| 1)} assume true; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:42,888 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {357#(<= |fibonacci_#in~n| 1)} {281#true} #38#return; {385#(<= main_~x~0 1)} is VALID [2020-07-10 14:43:42,889 INFO L280 TraceCheckUtils]: 23: Hoare triple {385#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {385#(<= main_~x~0 1)} is VALID [2020-07-10 14:43:42,891 INFO L280 TraceCheckUtils]: 24: Hoare triple {385#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {282#false} is VALID [2020-07-10 14:43:42,891 INFO L280 TraceCheckUtils]: 25: Hoare triple {282#false} assume !false; {282#false} is VALID [2020-07-10 14:43:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:43:42,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:42,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-10 14:43:42,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720100468] [2020-07-10 14:43:42,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-10 14:43:42,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:42,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 14:43:42,957 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-10 14:43:42,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 14:43:42,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 14:43:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:43:42,958 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-10 14:43:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:43,315 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-10 14:43:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:43:43,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-10 14:43:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:43:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-10 14:43:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 14:43:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-10 14:43:43,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2020-07-10 14:43:43,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:43,405 INFO L225 Difference]: With dead ends: 38 [2020-07-10 14:43:43,405 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:43:43,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:43:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:43:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 14:43:43,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:43,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 14:43:43,424 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:43:43,424 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:43:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:43,427 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-10 14:43:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-10 14:43:43,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:43,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:43,429 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:43:43,429 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:43:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:43,432 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-10 14:43:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-10 14:43:43,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:43,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:43,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:43,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:43:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-10 14:43:43,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-10 14:43:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:43,437 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-10 14:43:43,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 14:43:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-10 14:43:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:43:43,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:43,440 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:43,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:43:43,654 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-10 14:43:43,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:43,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706687908] [2020-07-10 14:43:43,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,713 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-10 14:43:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,782 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {564#(<= |fibonacci_#in~n| 1)} {553#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-10 14:43:43,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-10 14:43:43,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-10 14:43:43,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,804 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,806 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {564#(<= |fibonacci_#in~n| 1)} {553#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,806 INFO L280 TraceCheckUtils]: 9: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,807 INFO L263 TraceCheckUtils]: 10: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-10 14:43:43,807 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-10 14:43:43,807 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-10 14:43:43,807 INFO L280 TraceCheckUtils]: 13: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,809 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,811 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {559#(<= |fibonacci_#in~n| 2)} {530#true} #38#return; {552#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:43,812 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-10 14:43:43,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,813 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-10 14:43:43,813 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret4 := main(); {530#true} is VALID [2020-07-10 14:43:43,813 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {530#true} is VALID [2020-07-10 14:43:43,813 INFO L263 TraceCheckUtils]: 5: Hoare triple {530#true} call #t~ret3 := fibonacci(~x~0); {530#true} is VALID [2020-07-10 14:43:43,814 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,815 INFO L280 TraceCheckUtils]: 7: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,816 INFO L280 TraceCheckUtils]: 8: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,816 INFO L263 TraceCheckUtils]: 9: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-10 14:43:43,816 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,817 INFO L280 TraceCheckUtils]: 11: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:43,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,821 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {564#(<= |fibonacci_#in~n| 1)} {553#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,822 INFO L263 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-10 14:43:43,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-10 14:43:43,823 INFO L280 TraceCheckUtils]: 18: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-10 14:43:43,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,824 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,826 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,827 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {559#(<= |fibonacci_#in~n| 2)} {530#true} #38#return; {552#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:43,827 INFO L280 TraceCheckUtils]: 24: Hoare triple {552#(not (= 5 main_~x~0))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {552#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:43,828 INFO L280 TraceCheckUtils]: 25: Hoare triple {552#(not (= 5 main_~x~0))} assume !(5 != ~x~0 || 3 == ~result~0); {531#false} is VALID [2020-07-10 14:43:43,828 INFO L280 TraceCheckUtils]: 26: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-10 14:43:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 14:43:43,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706687908] [2020-07-10 14:43:43,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920201948] [2020-07-10 14:43:43,831 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-10 14:43:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 14:43:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:43,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:43,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-10 14:43:43,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,951 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-10 14:43:43,952 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret4 := main(); {530#true} is VALID [2020-07-10 14:43:43,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {530#true} is VALID [2020-07-10 14:43:43,952 INFO L263 TraceCheckUtils]: 5: Hoare triple {530#true} call #t~ret3 := fibonacci(~x~0); {530#true} is VALID [2020-07-10 14:43:43,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} ~n := #in~n; {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:43,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:43,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:43,954 INFO L263 TraceCheckUtils]: 9: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-10 14:43:43,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~n := #in~n; {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:43,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:43,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:43,959 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {564#(<= |fibonacci_#in~n| 1)} {586#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,959 INFO L280 TraceCheckUtils]: 15: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,960 INFO L263 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-10 14:43:43,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-10 14:43:43,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-10 14:43:43,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 14:43:43,962 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,963 INFO L280 TraceCheckUtils]: 21: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:43,964 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {559#(<= |fibonacci_#in~n| 2)} {530#true} #38#return; {638#(<= main_~x~0 2)} is VALID [2020-07-10 14:43:43,965 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {638#(<= main_~x~0 2)} is VALID [2020-07-10 14:43:43,966 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {531#false} is VALID [2020-07-10 14:43:43,966 INFO L280 TraceCheckUtils]: 26: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-10 14:43:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 14:43:43,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:43,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 14:43:43,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655126417] [2020-07-10 14:43:43,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 14:43:43,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:43,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:43:44,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:44,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:43:44,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:43:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:43:44,013 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-07-10 14:43:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:44,362 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-10 14:43:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 14:43:44,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 14:43:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:43:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 14:43:44,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-10 14:43:44,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:44,444 INFO L225 Difference]: With dead ends: 41 [2020-07-10 14:43:44,444 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 14:43:44,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:43:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 14:43:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 14:43:44,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:44,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:44,471 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:44,471 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:44,476 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-07-10 14:43:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-10 14:43:44,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:44,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:44,478 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:44,479 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 14:43:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:44,487 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-07-10 14:43:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-10 14:43:44,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:44,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:44,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:44,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 14:43:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-10 14:43:44,499 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-10 14:43:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:44,500 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-10 14:43:44,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:43:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-10 14:43:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 14:43:44,509 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:44,510 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:44,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:44,711 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-07-10 14:43:44,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:44,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600416776] [2020-07-10 14:43:44,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,790 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-10 14:43:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-10 14:43:44,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,903 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:44,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,912 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 14:43:44,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,914 INFO L263 TraceCheckUtils]: 3: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:44,915 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,915 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-10 14:43:44,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,917 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,917 INFO L280 TraceCheckUtils]: 9: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,917 INFO L263 TraceCheckUtils]: 10: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:44,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:44,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,919 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,920 INFO L280 TraceCheckUtils]: 15: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,922 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:44,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-10 14:43:44,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume !(1 == ~n); {829#true} is VALID [2020-07-10 14:43:44,948 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:44,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 14:43:44,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,952 INFO L263 TraceCheckUtils]: 7: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:44,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-10 14:43:44,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,954 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,955 INFO L263 TraceCheckUtils]: 14: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:44,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:44,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,957 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,959 INFO L280 TraceCheckUtils]: 19: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,963 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:44,965 INFO L280 TraceCheckUtils]: 22: Hoare triple {882#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:44,965 INFO L263 TraceCheckUtils]: 23: Hoare triple {882#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:44,967 INFO L280 TraceCheckUtils]: 24: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,969 INFO L280 TraceCheckUtils]: 25: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,970 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,971 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-10 14:43:44,971 INFO L280 TraceCheckUtils]: 28: Hoare triple {830#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {830#false} is VALID [2020-07-10 14:43:44,972 INFO L280 TraceCheckUtils]: 29: Hoare triple {830#false} assume true; {830#false} is VALID [2020-07-10 14:43:44,972 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {830#false} {829#true} #38#return; {830#false} is VALID [2020-07-10 14:43:44,973 INFO L263 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2020-07-10 14:43:44,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-10 14:43:44,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret4 := main(); {829#true} is VALID [2020-07-10 14:43:44,974 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {829#true} is VALID [2020-07-10 14:43:44,974 INFO L263 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~ret3 := fibonacci(~x~0); {829#true} is VALID [2020-07-10 14:43:44,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#true} assume !(1 == ~n); {829#true} is VALID [2020-07-10 14:43:44,975 INFO L263 TraceCheckUtils]: 9: Hoare triple {829#true} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:44,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 14:43:44,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {888#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,979 INFO L263 TraceCheckUtils]: 13: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:44,979 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-10 14:43:44,980 INFO L280 TraceCheckUtils]: 16: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-10 14:43:44,980 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,982 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,984 INFO L263 TraceCheckUtils]: 20: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:44,984 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:44,984 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:44,984 INFO L280 TraceCheckUtils]: 23: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:44,985 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,986 INFO L280 TraceCheckUtils]: 25: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,989 INFO L280 TraceCheckUtils]: 26: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,990 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:44,991 INFO L280 TraceCheckUtils]: 28: Hoare triple {882#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-10 14:43:44,991 INFO L263 TraceCheckUtils]: 29: Hoare triple {882#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:44,992 INFO L280 TraceCheckUtils]: 30: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:44,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {887#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1;#res := 0; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:44,995 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-10 14:43:44,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {830#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {830#false} is VALID [2020-07-10 14:43:44,995 INFO L280 TraceCheckUtils]: 35: Hoare triple {830#false} assume true; {830#false} is VALID [2020-07-10 14:43:44,995 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {830#false} {829#true} #38#return; {830#false} is VALID [2020-07-10 14:43:44,996 INFO L280 TraceCheckUtils]: 37: Hoare triple {830#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {830#false} is VALID [2020-07-10 14:43:44,996 INFO L280 TraceCheckUtils]: 38: Hoare triple {830#false} assume !(5 != ~x~0 || 3 == ~result~0); {830#false} is VALID [2020-07-10 14:43:44,996 INFO L280 TraceCheckUtils]: 39: Hoare triple {830#false} assume !false; {830#false} is VALID [2020-07-10 14:43:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 14:43:44,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600416776] [2020-07-10 14:43:44,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530840765] [2020-07-10 14:43:44,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:45,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:43:45,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:45,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:43:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:45,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:45,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2020-07-10 14:43:45,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:45,191 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-10 14:43:45,191 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret4 := main(); {829#true} is VALID [2020-07-10 14:43:45,191 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {829#true} is VALID [2020-07-10 14:43:45,192 INFO L263 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~ret3 := fibonacci(~x~0); {829#true} is VALID [2020-07-10 14:43:45,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,194 INFO L263 TraceCheckUtils]: 9: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:45,195 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,196 INFO L263 TraceCheckUtils]: 13: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-10 14:43:45,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,197 INFO L280 TraceCheckUtils]: 15: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:45,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} assume 1 == ~n;#res := 1; {952#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:45,199 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= |fibonacci_#in~n| 1)} assume true; {952#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:45,200 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {952#(<= |fibonacci_#in~n| 1)} {921#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:45,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {959#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:45,201 INFO L263 TraceCheckUtils]: 20: Hoare triple {959#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:45,201 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:45,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:45,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:45,203 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {829#true} {959#(<= |fibonacci_#in~n| 2)} #32#return; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:45,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {959#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:45,204 INFO L280 TraceCheckUtils]: 26: Hoare triple {959#(<= |fibonacci_#in~n| 2)} assume true; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:45,206 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {959#(<= |fibonacci_#in~n| 2)} {921#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:45,207 INFO L280 TraceCheckUtils]: 28: Hoare triple {987#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:45,207 INFO L263 TraceCheckUtils]: 29: Hoare triple {987#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-10 14:43:45,207 INFO L280 TraceCheckUtils]: 30: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-10 14:43:45,208 INFO L280 TraceCheckUtils]: 31: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-10 14:43:45,208 INFO L280 TraceCheckUtils]: 32: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-10 14:43:45,209 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {829#true} {987#(<= |fibonacci_#in~n| 3)} #32#return; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:45,210 INFO L280 TraceCheckUtils]: 34: Hoare triple {987#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:45,210 INFO L280 TraceCheckUtils]: 35: Hoare triple {987#(<= |fibonacci_#in~n| 3)} assume true; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:45,211 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {987#(<= |fibonacci_#in~n| 3)} {829#true} #38#return; {1015#(<= main_~x~0 3)} is VALID [2020-07-10 14:43:45,212 INFO L280 TraceCheckUtils]: 37: Hoare triple {1015#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1015#(<= main_~x~0 3)} is VALID [2020-07-10 14:43:45,213 INFO L280 TraceCheckUtils]: 38: Hoare triple {1015#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {830#false} is VALID [2020-07-10 14:43:45,213 INFO L280 TraceCheckUtils]: 39: Hoare triple {830#false} assume !false; {830#false} is VALID [2020-07-10 14:43:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-10 14:43:45,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:45,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-10 14:43:45,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784516728] [2020-07-10 14:43:45,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-10 14:43:45,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:45,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:43:45,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:45,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:43:45,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:43:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:43:45,286 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-10 14:43:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:46,047 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-07-10 14:43:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 14:43:46,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-10 14:43:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:43:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2020-07-10 14:43:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:43:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2020-07-10 14:43:46,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2020-07-10 14:43:46,153 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-10 14:43:46,155 INFO L225 Difference]: With dead ends: 71 [2020-07-10 14:43:46,156 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 14:43:46,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-10 14:43:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 14:43:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-10 14:43:46,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:46,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-10 14:43:46,175 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 14:43:46,175 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 14:43:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:46,179 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-10 14:43:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-10 14:43:46,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:46,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:46,180 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 14:43:46,180 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 14:43:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:46,184 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-10 14:43:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-10 14:43:46,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:46,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:46,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:46,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 14:43:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-10 14:43:46,188 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-07-10 14:43:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:46,188 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-10 14:43:46,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:43:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-10 14:43:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-10 14:43:46,190 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:46,191 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:46,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:46,404 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 3 times [2020-07-10 14:43:46,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:46,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876049105] [2020-07-10 14:43:46,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,475 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-10 14:43:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,654 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1407#(<= |fibonacci_#in~n| 1)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,679 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,680 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,681 INFO L280 TraceCheckUtils]: 6: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,683 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1407#(<= |fibonacci_#in~n| 1)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,684 INFO L263 TraceCheckUtils]: 10: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,684 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,685 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,686 INFO L280 TraceCheckUtils]: 15: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,688 INFO L280 TraceCheckUtils]: 16: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,690 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1402#(<= |fibonacci_#in~n| 2)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,698 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,701 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,718 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,719 INFO L263 TraceCheckUtils]: 7: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,725 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1407#(<= |fibonacci_#in~n| 1)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,726 INFO L263 TraceCheckUtils]: 14: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,726 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,726 INFO L280 TraceCheckUtils]: 17: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,728 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,728 INFO L280 TraceCheckUtils]: 19: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,729 INFO L280 TraceCheckUtils]: 20: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,731 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1402#(<= |fibonacci_#in~n| 2)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,732 INFO L280 TraceCheckUtils]: 22: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,733 INFO L263 TraceCheckUtils]: 23: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,734 INFO L280 TraceCheckUtils]: 24: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,734 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,734 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,735 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,736 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,737 INFO L280 TraceCheckUtils]: 29: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,738 INFO L280 TraceCheckUtils]: 30: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,739 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1391#(<= |fibonacci_#in~n| 3)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,770 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,779 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:46,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-10 14:43:46,780 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,782 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:46,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-10 14:43:46,782 INFO L263 TraceCheckUtils]: 10: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,785 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:46,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1257#true} is VALID [2020-07-10 14:43:46,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,786 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,789 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,790 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,791 INFO L280 TraceCheckUtils]: 6: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,791 INFO L263 TraceCheckUtils]: 7: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,792 INFO L280 TraceCheckUtils]: 8: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,793 INFO L280 TraceCheckUtils]: 10: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,794 INFO L263 TraceCheckUtils]: 11: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,795 INFO L280 TraceCheckUtils]: 13: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,796 INFO L280 TraceCheckUtils]: 14: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,798 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1407#(<= |fibonacci_#in~n| 1)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,799 INFO L280 TraceCheckUtils]: 17: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,799 INFO L263 TraceCheckUtils]: 18: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,800 INFO L280 TraceCheckUtils]: 20: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,800 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,801 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,802 INFO L280 TraceCheckUtils]: 24: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,804 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1402#(<= |fibonacci_#in~n| 2)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,804 INFO L280 TraceCheckUtils]: 26: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,805 INFO L263 TraceCheckUtils]: 27: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,805 INFO L280 TraceCheckUtils]: 28: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,805 INFO L280 TraceCheckUtils]: 29: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,806 INFO L280 TraceCheckUtils]: 30: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,806 INFO L280 TraceCheckUtils]: 31: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,807 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,808 INFO L280 TraceCheckUtils]: 33: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,809 INFO L280 TraceCheckUtils]: 34: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,810 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1391#(<= |fibonacci_#in~n| 3)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,811 INFO L280 TraceCheckUtils]: 36: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,811 INFO L263 TraceCheckUtils]: 37: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,811 INFO L280 TraceCheckUtils]: 38: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,812 INFO L280 TraceCheckUtils]: 39: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,812 INFO L280 TraceCheckUtils]: 40: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-10 14:43:46,812 INFO L263 TraceCheckUtils]: 41: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,813 INFO L280 TraceCheckUtils]: 42: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,813 INFO L280 TraceCheckUtils]: 43: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,813 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,813 INFO L280 TraceCheckUtils]: 45: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,813 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:46,814 INFO L280 TraceCheckUtils]: 47: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-10 14:43:46,814 INFO L263 TraceCheckUtils]: 48: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,814 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,814 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,814 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,815 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:46,815 INFO L280 TraceCheckUtils]: 53: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1257#true} is VALID [2020-07-10 14:43:46,815 INFO L280 TraceCheckUtils]: 54: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,817 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,820 INFO L280 TraceCheckUtils]: 56: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,820 INFO L280 TraceCheckUtils]: 57: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,822 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1354#(<= |fibonacci_#in~n| 4)} {1257#true} #38#return; {1320#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:46,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2020-07-10 14:43:46,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,828 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-10 14:43:46,828 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret4 := main(); {1257#true} is VALID [2020-07-10 14:43:46,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1257#true} is VALID [2020-07-10 14:43:46,828 INFO L263 TraceCheckUtils]: 5: Hoare triple {1257#true} call #t~ret3 := fibonacci(~x~0); {1257#true} is VALID [2020-07-10 14:43:46,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,830 INFO L263 TraceCheckUtils]: 9: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,831 INFO L280 TraceCheckUtils]: 10: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,831 INFO L280 TraceCheckUtils]: 11: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,832 INFO L280 TraceCheckUtils]: 12: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,832 INFO L263 TraceCheckUtils]: 13: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,846 INFO L280 TraceCheckUtils]: 14: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,847 INFO L280 TraceCheckUtils]: 16: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,847 INFO L263 TraceCheckUtils]: 17: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,848 INFO L280 TraceCheckUtils]: 19: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:46,849 INFO L280 TraceCheckUtils]: 20: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,849 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:46,850 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1407#(<= |fibonacci_#in~n| 1)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,851 INFO L280 TraceCheckUtils]: 23: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,851 INFO L263 TraceCheckUtils]: 24: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,851 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,852 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,852 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,853 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,853 INFO L280 TraceCheckUtils]: 29: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,854 INFO L280 TraceCheckUtils]: 30: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:46,855 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1402#(<= |fibonacci_#in~n| 2)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,855 INFO L280 TraceCheckUtils]: 32: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,856 INFO L263 TraceCheckUtils]: 33: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,856 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,856 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,856 INFO L280 TraceCheckUtils]: 36: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,856 INFO L280 TraceCheckUtils]: 37: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,857 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,858 INFO L280 TraceCheckUtils]: 39: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,859 INFO L280 TraceCheckUtils]: 40: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:46,860 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1391#(<= |fibonacci_#in~n| 3)} {1321#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,861 INFO L280 TraceCheckUtils]: 42: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,861 INFO L263 TraceCheckUtils]: 43: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,861 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,862 INFO L280 TraceCheckUtils]: 45: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,862 INFO L280 TraceCheckUtils]: 46: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-10 14:43:46,862 INFO L263 TraceCheckUtils]: 47: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:46,862 INFO L280 TraceCheckUtils]: 48: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,862 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:46,863 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:46,863 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,863 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:46,863 INFO L280 TraceCheckUtils]: 53: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-10 14:43:46,863 INFO L263 TraceCheckUtils]: 54: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:46,864 INFO L280 TraceCheckUtils]: 55: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:46,864 INFO L280 TraceCheckUtils]: 56: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:46,864 INFO L280 TraceCheckUtils]: 57: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,864 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:46,864 INFO L280 TraceCheckUtils]: 59: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1257#true} is VALID [2020-07-10 14:43:46,865 INFO L280 TraceCheckUtils]: 60: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:46,866 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,866 INFO L280 TraceCheckUtils]: 62: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,867 INFO L280 TraceCheckUtils]: 63: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:46,867 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {1354#(<= |fibonacci_#in~n| 4)} {1257#true} #38#return; {1320#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:46,868 INFO L280 TraceCheckUtils]: 65: Hoare triple {1320#(not (= 5 main_~x~0))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1320#(not (= 5 main_~x~0))} is VALID [2020-07-10 14:43:46,868 INFO L280 TraceCheckUtils]: 66: Hoare triple {1320#(not (= 5 main_~x~0))} assume !(5 != ~x~0 || 3 == ~result~0); {1258#false} is VALID [2020-07-10 14:43:46,869 INFO L280 TraceCheckUtils]: 67: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-10 14:43:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-10 14:43:46,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876049105] [2020-07-10 14:43:46,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616134411] [2020-07-10 14:43:46,875 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:46,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-10 14:43:46,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:46,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:43:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:46,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:47,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2020-07-10 14:43:47,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,151 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-10 14:43:47,151 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret4 := main(); {1257#true} is VALID [2020-07-10 14:43:47,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1257#true} is VALID [2020-07-10 14:43:47,152 INFO L263 TraceCheckUtils]: 5: Hoare triple {1257#true} call #t~ret3 := fibonacci(~x~0); {1257#true} is VALID [2020-07-10 14:43:47,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,154 INFO L280 TraceCheckUtils]: 7: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,154 INFO L263 TraceCheckUtils]: 9: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L263 TraceCheckUtils]: 13: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:47,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-10 14:43:47,156 INFO L263 TraceCheckUtils]: 17: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:47,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:47,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:47,157 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,157 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:47,157 INFO L280 TraceCheckUtils]: 23: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-10 14:43:47,157 INFO L263 TraceCheckUtils]: 24: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:47,157 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,158 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-10 14:43:47,158 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,158 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:47,158 INFO L280 TraceCheckUtils]: 29: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1257#true} is VALID [2020-07-10 14:43:47,158 INFO L280 TraceCheckUtils]: 30: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,159 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-10 14:43:47,159 INFO L280 TraceCheckUtils]: 32: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-10 14:43:47,159 INFO L263 TraceCheckUtils]: 33: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:47,159 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,159 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:47,160 INFO L280 TraceCheckUtils]: 36: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:47,160 INFO L280 TraceCheckUtils]: 37: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,160 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-10 14:43:47,160 INFO L280 TraceCheckUtils]: 39: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1257#true} is VALID [2020-07-10 14:43:47,160 INFO L280 TraceCheckUtils]: 40: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,162 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1257#true} {1438#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,163 INFO L280 TraceCheckUtils]: 42: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,163 INFO L263 TraceCheckUtils]: 43: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:47,164 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,165 INFO L280 TraceCheckUtils]: 45: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(~n < 1); {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,165 INFO L280 TraceCheckUtils]: 46: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume !(1 == ~n); {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,166 INFO L263 TraceCheckUtils]: 47: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-10 14:43:47,166 INFO L280 TraceCheckUtils]: 48: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-10 14:43:47,166 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-10 14:43:47,166 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-10 14:43:47,166 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-10 14:43:47,168 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1257#true} {1438#(<= |fibonacci_#in~n| fibonacci_~n)} #30#return; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,168 INFO L280 TraceCheckUtils]: 53: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,168 INFO L263 TraceCheckUtils]: 54: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-10 14:43:47,169 INFO L280 TraceCheckUtils]: 55: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-10 14:43:47,170 INFO L280 TraceCheckUtils]: 56: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} assume ~n < 1;#res := 0; {1589#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:47,170 INFO L280 TraceCheckUtils]: 57: Hoare triple {1589#(<= |fibonacci_#in~n| 0)} assume true; {1589#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 14:43:47,172 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1589#(<= |fibonacci_#in~n| 0)} {1438#(<= |fibonacci_#in~n| fibonacci_~n)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:47,173 INFO L280 TraceCheckUtils]: 59: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:47,174 INFO L280 TraceCheckUtils]: 60: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:47,175 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {1402#(<= |fibonacci_#in~n| 2)} {1438#(<= |fibonacci_#in~n| fibonacci_~n)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:47,176 INFO L280 TraceCheckUtils]: 62: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:47,176 INFO L280 TraceCheckUtils]: 63: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:47,177 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {1354#(<= |fibonacci_#in~n| 4)} {1257#true} #38#return; {1614#(<= main_~x~0 4)} is VALID [2020-07-10 14:43:47,178 INFO L280 TraceCheckUtils]: 65: Hoare triple {1614#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1614#(<= main_~x~0 4)} is VALID [2020-07-10 14:43:47,179 INFO L280 TraceCheckUtils]: 66: Hoare triple {1614#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {1258#false} is VALID [2020-07-10 14:43:47,179 INFO L280 TraceCheckUtils]: 67: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-10 14:43:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-10 14:43:47,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:47,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 14:43:47,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618208576] [2020-07-10 14:43:47,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-07-10 14:43:47,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:47,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 14:43:47,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:47,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 14:43:47,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 14:43:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:43:47,266 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2020-07-10 14:43:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:47,800 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2020-07-10 14:43:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 14:43:47,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-07-10 14:43:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:43:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-10 14:43:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 14:43:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-10 14:43:47,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2020-07-10 14:43:47,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:47,926 INFO L225 Difference]: With dead ends: 87 [2020-07-10 14:43:47,926 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 14:43:47,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:43:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 14:43:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-07-10 14:43:47,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:47,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2020-07-10 14:43:47,960 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2020-07-10 14:43:47,961 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2020-07-10 14:43:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:47,965 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-10 14:43:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-10 14:43:47,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:47,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:47,967 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2020-07-10 14:43:47,967 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2020-07-10 14:43:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:47,973 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-10 14:43:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-10 14:43:47,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:47,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:47,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:47,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 14:43:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-07-10 14:43:47,978 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 68 [2020-07-10 14:43:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:47,978 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-07-10 14:43:47,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 14:43:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2020-07-10 14:43:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-10 14:43:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:47,982 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:48,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:48,196 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 4 times [2020-07-10 14:43:48,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:48,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363269014] [2020-07-10 14:43:48,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,325 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-10 14:43:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,580 INFO L280 TraceCheckUtils]: 3: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,582 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,590 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,592 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,596 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,597 INFO L263 TraceCheckUtils]: 10: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,599 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,601 INFO L280 TraceCheckUtils]: 16: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,602 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2266#(<= |fibonacci_#in~n| 2)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,610 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,612 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,615 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,618 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,619 INFO L263 TraceCheckUtils]: 14: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,621 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,622 INFO L280 TraceCheckUtils]: 19: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,624 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2266#(<= |fibonacci_#in~n| 2)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,625 INFO L280 TraceCheckUtils]: 22: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,625 INFO L263 TraceCheckUtils]: 23: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,625 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,626 INFO L280 TraceCheckUtils]: 26: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,626 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,627 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,628 INFO L280 TraceCheckUtils]: 29: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,628 INFO L280 TraceCheckUtils]: 30: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,630 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2255#(<= |fibonacci_#in~n| 3)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,654 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,659 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:48,660 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,661 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:48,661 INFO L263 TraceCheckUtils]: 10: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,662 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:48,663 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,664 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,666 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,668 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,670 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,671 INFO L280 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:48,675 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,675 INFO L263 TraceCheckUtils]: 18: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,676 INFO L280 TraceCheckUtils]: 21: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,677 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,679 INFO L280 TraceCheckUtils]: 24: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:48,680 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2266#(<= |fibonacci_#in~n| 2)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,681 INFO L280 TraceCheckUtils]: 26: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,681 INFO L263 TraceCheckUtils]: 27: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,682 INFO L280 TraceCheckUtils]: 28: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,682 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,682 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,682 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,683 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,684 INFO L280 TraceCheckUtils]: 33: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,684 INFO L280 TraceCheckUtils]: 34: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:48,686 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2255#(<= |fibonacci_#in~n| 3)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,687 INFO L280 TraceCheckUtils]: 36: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,687 INFO L263 TraceCheckUtils]: 37: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,687 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,687 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,687 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:48,688 INFO L263 TraceCheckUtils]: 41: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,688 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,688 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,688 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,689 INFO L280 TraceCheckUtils]: 45: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,689 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,689 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:48,689 INFO L263 TraceCheckUtils]: 48: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,689 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,690 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,690 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,690 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,690 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:48,690 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,692 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,692 INFO L280 TraceCheckUtils]: 56: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,693 INFO L280 TraceCheckUtils]: 57: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:48,694 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-10 14:43:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,852 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,857 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,859 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,862 INFO L263 TraceCheckUtils]: 3: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,862 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,863 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,863 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,864 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,865 INFO L280 TraceCheckUtils]: 9: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,865 INFO L263 TraceCheckUtils]: 10: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,866 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,866 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,867 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,868 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,869 INFO L280 TraceCheckUtils]: 15: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,870 INFO L280 TraceCheckUtils]: 16: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,871 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,880 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,883 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,884 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,885 INFO L280 TraceCheckUtils]: 6: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,885 INFO L263 TraceCheckUtils]: 7: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,886 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,888 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,889 INFO L263 TraceCheckUtils]: 14: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,890 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,891 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,895 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,896 INFO L263 TraceCheckUtils]: 23: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,896 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,897 INFO L280 TraceCheckUtils]: 26: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,897 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,899 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,900 INFO L280 TraceCheckUtils]: 29: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,900 INFO L280 TraceCheckUtils]: 30: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,902 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,934 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,934 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,939 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,940 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:48,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,940 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,941 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,941 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:48,941 INFO L263 TraceCheckUtils]: 10: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,942 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:48,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,946 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,949 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,951 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,953 INFO L263 TraceCheckUtils]: 11: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,954 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,954 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,955 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,955 INFO L280 TraceCheckUtils]: 17: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,956 INFO L263 TraceCheckUtils]: 18: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,956 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,956 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,956 INFO L280 TraceCheckUtils]: 21: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,957 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,958 INFO L280 TraceCheckUtils]: 23: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,958 INFO L280 TraceCheckUtils]: 24: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,959 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,960 INFO L280 TraceCheckUtils]: 26: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,960 INFO L263 TraceCheckUtils]: 27: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,960 INFO L280 TraceCheckUtils]: 28: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,960 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,961 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,961 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,962 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,962 INFO L280 TraceCheckUtils]: 33: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,963 INFO L280 TraceCheckUtils]: 34: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,964 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,965 INFO L280 TraceCheckUtils]: 36: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,965 INFO L263 TraceCheckUtils]: 37: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,965 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,965 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,966 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:48,966 INFO L263 TraceCheckUtils]: 41: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,966 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,966 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,966 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,967 INFO L280 TraceCheckUtils]: 45: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,967 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:48,967 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:48,967 INFO L263 TraceCheckUtils]: 48: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,968 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,968 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,968 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,968 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:48,969 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:48,969 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,970 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,970 INFO L280 TraceCheckUtils]: 56: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,971 INFO L280 TraceCheckUtils]: 57: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,972 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2378#(<= 3 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:48,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,983 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,984 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,991 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,992 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,994 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,994 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,995 INFO L280 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,995 INFO L280 TraceCheckUtils]: 14: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,996 INFO L263 TraceCheckUtils]: 15: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:48,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,996 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:48,996 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:48,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:48,997 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,998 INFO L280 TraceCheckUtils]: 21: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:48,998 INFO L263 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:48,998 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:48,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:48,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,000 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,001 INFO L280 TraceCheckUtils]: 27: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,001 INFO L280 TraceCheckUtils]: 28: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,002 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,003 INFO L280 TraceCheckUtils]: 30: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,003 INFO L263 TraceCheckUtils]: 31: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,003 INFO L280 TraceCheckUtils]: 32: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,004 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,004 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,004 INFO L280 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,005 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,005 INFO L280 TraceCheckUtils]: 37: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,006 INFO L280 TraceCheckUtils]: 38: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,007 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,008 INFO L280 TraceCheckUtils]: 40: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,008 INFO L263 TraceCheckUtils]: 41: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,008 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,008 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,009 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,009 INFO L263 TraceCheckUtils]: 45: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,009 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,009 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,009 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,010 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,010 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,010 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,010 INFO L263 TraceCheckUtils]: 52: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,010 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,011 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,011 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,011 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,011 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,012 INFO L280 TraceCheckUtils]: 58: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,013 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,013 INFO L280 TraceCheckUtils]: 60: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,014 INFO L280 TraceCheckUtils]: 61: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,015 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2378#(<= 3 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,016 INFO L280 TraceCheckUtils]: 63: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,016 INFO L263 TraceCheckUtils]: 64: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,016 INFO L280 TraceCheckUtils]: 65: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,016 INFO L280 TraceCheckUtils]: 66: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,016 INFO L280 TraceCheckUtils]: 67: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,017 INFO L280 TraceCheckUtils]: 68: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,018 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,018 INFO L280 TraceCheckUtils]: 70: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,019 INFO L280 TraceCheckUtils]: 71: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,020 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-10 14:43:49,024 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,025 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,026 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,027 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,028 INFO L280 TraceCheckUtils]: 10: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,029 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,031 INFO L280 TraceCheckUtils]: 14: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,031 INFO L263 TraceCheckUtils]: 15: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,032 INFO L280 TraceCheckUtils]: 18: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:49,033 INFO L280 TraceCheckUtils]: 19: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:49,034 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,035 INFO L280 TraceCheckUtils]: 21: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,035 INFO L263 TraceCheckUtils]: 22: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,036 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,036 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,036 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,037 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,037 INFO L280 TraceCheckUtils]: 27: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,038 INFO L280 TraceCheckUtils]: 28: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,038 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2266#(<= |fibonacci_#in~n| 2)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,039 INFO L280 TraceCheckUtils]: 30: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,039 INFO L263 TraceCheckUtils]: 31: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,039 INFO L280 TraceCheckUtils]: 32: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,039 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,039 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,040 INFO L280 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,040 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,041 INFO L280 TraceCheckUtils]: 37: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,041 INFO L280 TraceCheckUtils]: 38: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,050 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2255#(<= |fibonacci_#in~n| 3)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,051 INFO L280 TraceCheckUtils]: 40: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,051 INFO L263 TraceCheckUtils]: 41: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,051 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,051 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,052 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,052 INFO L263 TraceCheckUtils]: 45: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,052 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,052 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,052 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,053 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,053 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,053 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,053 INFO L263 TraceCheckUtils]: 52: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,053 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,054 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,054 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,054 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,054 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,055 INFO L280 TraceCheckUtils]: 58: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,056 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,056 INFO L280 TraceCheckUtils]: 60: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,057 INFO L280 TraceCheckUtils]: 61: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,058 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-10 14:43:49,058 INFO L280 TraceCheckUtils]: 63: Hoare triple {2111#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-10 14:43:49,058 INFO L263 TraceCheckUtils]: 64: Hoare triple {2111#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,059 INFO L280 TraceCheckUtils]: 65: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,059 INFO L280 TraceCheckUtils]: 66: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,060 INFO L280 TraceCheckUtils]: 67: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,060 INFO L263 TraceCheckUtils]: 68: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,061 INFO L280 TraceCheckUtils]: 69: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,061 INFO L280 TraceCheckUtils]: 70: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,062 INFO L280 TraceCheckUtils]: 71: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,062 INFO L263 TraceCheckUtils]: 72: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,063 INFO L280 TraceCheckUtils]: 73: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,063 INFO L280 TraceCheckUtils]: 74: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,064 INFO L280 TraceCheckUtils]: 75: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,064 INFO L263 TraceCheckUtils]: 76: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,064 INFO L280 TraceCheckUtils]: 77: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,065 INFO L280 TraceCheckUtils]: 78: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,065 INFO L280 TraceCheckUtils]: 79: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,066 INFO L263 TraceCheckUtils]: 80: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,066 INFO L280 TraceCheckUtils]: 81: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,066 INFO L280 TraceCheckUtils]: 82: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,066 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,066 INFO L280 TraceCheckUtils]: 84: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,067 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,068 INFO L280 TraceCheckUtils]: 86: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,068 INFO L263 TraceCheckUtils]: 87: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,068 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,068 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,068 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,069 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,070 INFO L280 TraceCheckUtils]: 92: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,070 INFO L280 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,071 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,072 INFO L280 TraceCheckUtils]: 95: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,072 INFO L263 TraceCheckUtils]: 96: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,072 INFO L280 TraceCheckUtils]: 97: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,072 INFO L280 TraceCheckUtils]: 98: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,073 INFO L280 TraceCheckUtils]: 99: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,073 INFO L280 TraceCheckUtils]: 100: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,074 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,074 INFO L280 TraceCheckUtils]: 102: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,075 INFO L280 TraceCheckUtils]: 103: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,076 INFO L275 TraceCheckUtils]: 104: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,076 INFO L280 TraceCheckUtils]: 105: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,076 INFO L263 TraceCheckUtils]: 106: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,077 INFO L280 TraceCheckUtils]: 107: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,077 INFO L280 TraceCheckUtils]: 108: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,077 INFO L280 TraceCheckUtils]: 109: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,077 INFO L263 TraceCheckUtils]: 110: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,077 INFO L280 TraceCheckUtils]: 111: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,078 INFO L280 TraceCheckUtils]: 112: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,078 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,078 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,078 INFO L275 TraceCheckUtils]: 115: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,078 INFO L280 TraceCheckUtils]: 116: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,079 INFO L263 TraceCheckUtils]: 117: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,079 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,079 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,079 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,079 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,080 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,080 INFO L280 TraceCheckUtils]: 123: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,081 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,082 INFO L280 TraceCheckUtils]: 125: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,082 INFO L280 TraceCheckUtils]: 126: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,083 INFO L275 TraceCheckUtils]: 127: Hoare quadruple {2378#(<= 3 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,084 INFO L280 TraceCheckUtils]: 128: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,084 INFO L263 TraceCheckUtils]: 129: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,084 INFO L280 TraceCheckUtils]: 130: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,084 INFO L280 TraceCheckUtils]: 131: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,084 INFO L280 TraceCheckUtils]: 132: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,085 INFO L280 TraceCheckUtils]: 133: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,086 INFO L275 TraceCheckUtils]: 134: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,086 INFO L280 TraceCheckUtils]: 135: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,087 INFO L280 TraceCheckUtils]: 136: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,088 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-10 14:43:49,088 INFO L280 TraceCheckUtils]: 138: Hoare triple {1908#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1908#false} is VALID [2020-07-10 14:43:49,088 INFO L280 TraceCheckUtils]: 139: Hoare triple {1908#false} assume true; {1908#false} is VALID [2020-07-10 14:43:49,088 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1908#false} {1907#true} #38#return; {1908#false} is VALID [2020-07-10 14:43:49,103 INFO L263 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2020-07-10 14:43:49,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,103 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-10 14:43:49,104 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret4 := main(); {1907#true} is VALID [2020-07-10 14:43:49,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1907#true} is VALID [2020-07-10 14:43:49,104 INFO L263 TraceCheckUtils]: 5: Hoare triple {1907#true} call #t~ret3 := fibonacci(~x~0); {1907#true} is VALID [2020-07-10 14:43:49,104 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,105 INFO L263 TraceCheckUtils]: 9: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,106 INFO L280 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,107 INFO L263 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,107 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,108 INFO L280 TraceCheckUtils]: 15: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,109 INFO L263 TraceCheckUtils]: 17: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,110 INFO L263 TraceCheckUtils]: 21: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,112 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n;#res := 1; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:49,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 14:43:49,113 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2271#(<= |fibonacci_#in~n| 1)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,114 INFO L280 TraceCheckUtils]: 27: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,114 INFO L263 TraceCheckUtils]: 28: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,114 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,114 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,115 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,115 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,116 INFO L280 TraceCheckUtils]: 33: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,116 INFO L280 TraceCheckUtils]: 34: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 14:43:49,117 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2266#(<= |fibonacci_#in~n| 2)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,123 INFO L280 TraceCheckUtils]: 36: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,124 INFO L263 TraceCheckUtils]: 37: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,124 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,124 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,125 INFO L280 TraceCheckUtils]: 41: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,127 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,128 INFO L280 TraceCheckUtils]: 43: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,129 INFO L280 TraceCheckUtils]: 44: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 14:43:49,130 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2255#(<= |fibonacci_#in~n| 3)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,130 INFO L280 TraceCheckUtils]: 46: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,130 INFO L263 TraceCheckUtils]: 47: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,131 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,131 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,131 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,131 INFO L263 TraceCheckUtils]: 51: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,131 INFO L280 TraceCheckUtils]: 52: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,132 INFO L263 TraceCheckUtils]: 58: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,133 INFO L280 TraceCheckUtils]: 59: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,133 INFO L280 TraceCheckUtils]: 60: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,133 INFO L280 TraceCheckUtils]: 61: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,133 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,133 INFO L280 TraceCheckUtils]: 63: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,134 INFO L280 TraceCheckUtils]: 64: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,135 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,135 INFO L280 TraceCheckUtils]: 66: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,136 INFO L280 TraceCheckUtils]: 67: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 14:43:49,137 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-10 14:43:49,137 INFO L280 TraceCheckUtils]: 69: Hoare triple {2111#(<= fibonacci_~n 5)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-10 14:43:49,137 INFO L263 TraceCheckUtils]: 70: Hoare triple {2111#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,138 INFO L280 TraceCheckUtils]: 71: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,138 INFO L280 TraceCheckUtils]: 72: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,139 INFO L280 TraceCheckUtils]: 73: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,139 INFO L263 TraceCheckUtils]: 74: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,140 INFO L280 TraceCheckUtils]: 75: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,140 INFO L280 TraceCheckUtils]: 76: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,141 INFO L280 TraceCheckUtils]: 77: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,141 INFO L263 TraceCheckUtils]: 78: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,141 INFO L280 TraceCheckUtils]: 79: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,142 INFO L280 TraceCheckUtils]: 80: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,143 INFO L280 TraceCheckUtils]: 81: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,143 INFO L263 TraceCheckUtils]: 82: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,143 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,144 INFO L280 TraceCheckUtils]: 84: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,145 INFO L280 TraceCheckUtils]: 85: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,145 INFO L263 TraceCheckUtils]: 86: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,145 INFO L280 TraceCheckUtils]: 87: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,145 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,145 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,145 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,146 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,147 INFO L280 TraceCheckUtils]: 92: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,147 INFO L263 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,147 INFO L280 TraceCheckUtils]: 94: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,147 INFO L280 TraceCheckUtils]: 95: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,148 INFO L280 TraceCheckUtils]: 96: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,148 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,149 INFO L280 TraceCheckUtils]: 98: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,149 INFO L280 TraceCheckUtils]: 99: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,151 INFO L275 TraceCheckUtils]: 100: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,151 INFO L280 TraceCheckUtils]: 101: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,151 INFO L263 TraceCheckUtils]: 102: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,152 INFO L280 TraceCheckUtils]: 103: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,152 INFO L280 TraceCheckUtils]: 104: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,152 INFO L280 TraceCheckUtils]: 105: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,152 INFO L280 TraceCheckUtils]: 106: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,153 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,153 INFO L280 TraceCheckUtils]: 108: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,154 INFO L280 TraceCheckUtils]: 109: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,155 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,156 INFO L280 TraceCheckUtils]: 111: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,156 INFO L263 TraceCheckUtils]: 112: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,156 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,156 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,156 INFO L280 TraceCheckUtils]: 115: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,157 INFO L263 TraceCheckUtils]: 116: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,157 INFO L280 TraceCheckUtils]: 117: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,157 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,157 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,157 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L263 TraceCheckUtils]: 123: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L280 TraceCheckUtils]: 124: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L280 TraceCheckUtils]: 125: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,158 INFO L280 TraceCheckUtils]: 126: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,159 INFO L275 TraceCheckUtils]: 127: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,159 INFO L280 TraceCheckUtils]: 128: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,159 INFO L280 TraceCheckUtils]: 129: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,160 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,161 INFO L280 TraceCheckUtils]: 131: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,161 INFO L280 TraceCheckUtils]: 132: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,163 INFO L275 TraceCheckUtils]: 133: Hoare quadruple {2378#(<= 3 |fibonacci_#in~n|)} {2185#(= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,163 INFO L280 TraceCheckUtils]: 134: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,163 INFO L263 TraceCheckUtils]: 135: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,164 INFO L280 TraceCheckUtils]: 136: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,164 INFO L280 TraceCheckUtils]: 137: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,164 INFO L280 TraceCheckUtils]: 138: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,164 INFO L280 TraceCheckUtils]: 139: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,165 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,166 INFO L280 TraceCheckUtils]: 141: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,166 INFO L280 TraceCheckUtils]: 142: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,167 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-10 14:43:49,167 INFO L280 TraceCheckUtils]: 144: Hoare triple {1908#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1908#false} is VALID [2020-07-10 14:43:49,168 INFO L280 TraceCheckUtils]: 145: Hoare triple {1908#false} assume true; {1908#false} is VALID [2020-07-10 14:43:49,168 INFO L275 TraceCheckUtils]: 146: Hoare quadruple {1908#false} {1907#true} #38#return; {1908#false} is VALID [2020-07-10 14:43:49,168 INFO L280 TraceCheckUtils]: 147: Hoare triple {1908#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {1908#false} is VALID [2020-07-10 14:43:49,168 INFO L280 TraceCheckUtils]: 148: Hoare triple {1908#false} assume !(5 != ~x~0 || 3 == ~result~0); {1908#false} is VALID [2020-07-10 14:43:49,168 INFO L280 TraceCheckUtils]: 149: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-10 14:43:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-07-10 14:43:49,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363269014] [2020-07-10 14:43:49,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752377530] [2020-07-10 14:43:49,185 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-10 14:43:49,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 14:43:49,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:49,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 14:43:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:49,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:49,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2020-07-10 14:43:49,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,563 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-10 14:43:49,563 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret4 := main(); {1907#true} is VALID [2020-07-10 14:43:49,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {1907#true} is VALID [2020-07-10 14:43:49,563 INFO L263 TraceCheckUtils]: 5: Hoare triple {1907#true} call #t~ret3 := fibonacci(~x~0); {1907#true} is VALID [2020-07-10 14:43:49,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,566 INFO L263 TraceCheckUtils]: 9: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,566 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,566 INFO L263 TraceCheckUtils]: 13: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L263 TraceCheckUtils]: 17: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,568 INFO L263 TraceCheckUtils]: 21: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,568 INFO L280 TraceCheckUtils]: 22: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,568 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,568 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L263 TraceCheckUtils]: 28: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,569 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,570 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,570 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,570 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,570 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,570 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L280 TraceCheckUtils]: 36: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L263 TraceCheckUtils]: 37: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,571 INFO L280 TraceCheckUtils]: 41: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,572 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,572 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,572 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,572 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,572 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L263 TraceCheckUtils]: 47: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L263 TraceCheckUtils]: 51: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,573 INFO L280 TraceCheckUtils]: 52: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,574 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,574 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,574 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,574 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,574 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,575 INFO L263 TraceCheckUtils]: 58: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,575 INFO L280 TraceCheckUtils]: 59: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,575 INFO L280 TraceCheckUtils]: 60: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,575 INFO L280 TraceCheckUtils]: 61: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,575 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,576 INFO L280 TraceCheckUtils]: 63: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,576 INFO L280 TraceCheckUtils]: 64: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,576 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,576 INFO L280 TraceCheckUtils]: 66: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,576 INFO L280 TraceCheckUtils]: 67: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,577 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1907#true} {2461#(<= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,578 INFO L280 TraceCheckUtils]: 69: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,578 INFO L263 TraceCheckUtils]: 70: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,578 INFO L280 TraceCheckUtils]: 71: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,579 INFO L280 TraceCheckUtils]: 72: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,579 INFO L280 TraceCheckUtils]: 73: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,580 INFO L263 TraceCheckUtils]: 74: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,580 INFO L280 TraceCheckUtils]: 75: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,580 INFO L280 TraceCheckUtils]: 76: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,581 INFO L280 TraceCheckUtils]: 77: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,581 INFO L263 TraceCheckUtils]: 78: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,582 INFO L280 TraceCheckUtils]: 79: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,582 INFO L280 TraceCheckUtils]: 80: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,583 INFO L280 TraceCheckUtils]: 81: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,583 INFO L263 TraceCheckUtils]: 82: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,584 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,584 INFO L280 TraceCheckUtils]: 84: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,585 INFO L280 TraceCheckUtils]: 85: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,585 INFO L263 TraceCheckUtils]: 86: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,585 INFO L280 TraceCheckUtils]: 87: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,586 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,586 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,586 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,587 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,589 INFO L280 TraceCheckUtils]: 92: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,589 INFO L263 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,589 INFO L280 TraceCheckUtils]: 94: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,590 INFO L280 TraceCheckUtils]: 95: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,590 INFO L280 TraceCheckUtils]: 96: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,590 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,591 INFO L280 TraceCheckUtils]: 98: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,591 INFO L280 TraceCheckUtils]: 99: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,593 INFO L275 TraceCheckUtils]: 100: Hoare quadruple {2421#(<= 1 |fibonacci_#in~n|)} {2461#(<= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,594 INFO L280 TraceCheckUtils]: 101: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,594 INFO L263 TraceCheckUtils]: 102: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,594 INFO L280 TraceCheckUtils]: 103: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,595 INFO L280 TraceCheckUtils]: 104: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,595 INFO L280 TraceCheckUtils]: 105: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,595 INFO L280 TraceCheckUtils]: 106: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,598 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,602 INFO L280 TraceCheckUtils]: 108: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,603 INFO L280 TraceCheckUtils]: 109: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,604 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {2415#(<= 2 |fibonacci_#in~n|)} {2461#(<= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,604 INFO L280 TraceCheckUtils]: 111: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,604 INFO L263 TraceCheckUtils]: 112: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,604 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,605 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,605 INFO L280 TraceCheckUtils]: 115: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-10 14:43:49,605 INFO L263 TraceCheckUtils]: 116: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-10 14:43:49,605 INFO L280 TraceCheckUtils]: 117: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,605 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,606 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,606 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,606 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-10 14:43:49,606 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-10 14:43:49,607 INFO L263 TraceCheckUtils]: 123: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,607 INFO L280 TraceCheckUtils]: 124: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,607 INFO L280 TraceCheckUtils]: 125: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-10 14:43:49,607 INFO L280 TraceCheckUtils]: 126: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,607 INFO L275 TraceCheckUtils]: 127: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-10 14:43:49,608 INFO L280 TraceCheckUtils]: 128: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1907#true} is VALID [2020-07-10 14:43:49,608 INFO L280 TraceCheckUtils]: 129: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,609 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,614 INFO L280 TraceCheckUtils]: 131: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,615 INFO L280 TraceCheckUtils]: 132: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,616 INFO L275 TraceCheckUtils]: 133: Hoare quadruple {2378#(<= 3 |fibonacci_#in~n|)} {2461#(<= fibonacci_~n |fibonacci_#in~n|)} #30#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,617 INFO L280 TraceCheckUtils]: 134: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,617 INFO L263 TraceCheckUtils]: 135: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-10 14:43:49,617 INFO L280 TraceCheckUtils]: 136: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-10 14:43:49,618 INFO L280 TraceCheckUtils]: 137: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-10 14:43:49,618 INFO L280 TraceCheckUtils]: 138: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-10 14:43:49,618 INFO L280 TraceCheckUtils]: 139: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-10 14:43:49,619 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,619 INFO L280 TraceCheckUtils]: 141: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,620 INFO L280 TraceCheckUtils]: 142: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,621 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2461#(<= fibonacci_~n |fibonacci_#in~n|)} #32#return; {2873#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,622 INFO L280 TraceCheckUtils]: 144: Hoare triple {2873#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {2873#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,622 INFO L280 TraceCheckUtils]: 145: Hoare triple {2873#(<= 6 |fibonacci_#in~n|)} assume true; {2873#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 14:43:49,623 INFO L275 TraceCheckUtils]: 146: Hoare quadruple {2873#(<= 6 |fibonacci_#in~n|)} {1907#true} #38#return; {2883#(<= 6 main_~x~0)} is VALID [2020-07-10 14:43:49,624 INFO L280 TraceCheckUtils]: 147: Hoare triple {2883#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {2883#(<= 6 main_~x~0)} is VALID [2020-07-10 14:43:49,625 INFO L280 TraceCheckUtils]: 148: Hoare triple {2883#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {1908#false} is VALID [2020-07-10 14:43:49,625 INFO L280 TraceCheckUtils]: 149: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-10 14:43:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 327 proven. 131 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2020-07-10 14:43:49,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2020-07-10 14:43:49,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588247784] [2020-07-10 14:43:49,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2020-07-10 14:43:50,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:50,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:43:50,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:50,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:43:50,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:43:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:43:50,578 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 15 states. [2020-07-10 14:43:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:52,261 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2020-07-10 14:43:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-10 14:43:52,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2020-07-10 14:43:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:43:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2020-07-10 14:43:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:43:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2020-07-10 14:43:52,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 143 transitions. [2020-07-10 14:43:52,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:43:52,478 INFO L225 Difference]: With dead ends: 121 [2020-07-10 14:43:52,479 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 14:43:52,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2020-07-10 14:43:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 14:43:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2020-07-10 14:43:52,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:43:52,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 61 states. [2020-07-10 14:43:52,529 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 61 states. [2020-07-10 14:43:52,530 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 61 states. [2020-07-10 14:43:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:52,534 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-10 14:43:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-10 14:43:52,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:52,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:52,535 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 65 states. [2020-07-10 14:43:52,536 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 65 states. [2020-07-10 14:43:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:43:52,540 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-10 14:43:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-10 14:43:52,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:43:52,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:43:52,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:43:52,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:43:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 14:43:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2020-07-10 14:43:52,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 150 [2020-07-10 14:43:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:43:52,545 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2020-07-10 14:43:52,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:43:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2020-07-10 14:43:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-10 14:43:52,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:43:52,547 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:43:52,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 14:43:52,761 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:43:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:43:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 5 times [2020-07-10 14:43:52,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:43:52,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631164422] [2020-07-10 14:43:52,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:43:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:43:52,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 14:43:52,823 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:103) at de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement$AtomicTraceElementBuilder.build(AtomicTraceElement.java:308) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createATESequence(IcfgProgramExecution.java:227) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:77) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 14:43:52,830 INFO L168 Benchmark]: Toolchain (without parser) took 12600.23 ms. Allocated memory was 145.2 MB in the beginning and 358.6 MB in the end (delta: 213.4 MB). Free memory was 103.3 MB in the beginning and 265.9 MB in the end (delta: -162.6 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,831 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.82 ms. Allocated memory is still 145.2 MB. Free memory was 102.8 MB in the beginning and 93.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,833 INFO L168 Benchmark]: Boogie Preprocessor took 127.92 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.2 MB in the beginning and 181.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,833 INFO L168 Benchmark]: RCFGBuilder took 328.49 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 165.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,834 INFO L168 Benchmark]: TraceAbstraction took 11888.57 ms. Allocated memory was 202.4 MB in the beginning and 358.6 MB in the end (delta: 156.2 MB). Free memory was 164.5 MB in the beginning and 265.9 MB in the end (delta: -101.4 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:43:52,837 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 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.82 ms. Allocated memory is still 145.2 MB. Free memory was 102.8 MB in the beginning and 93.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.92 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.2 MB in the beginning and 181.6 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 328.49 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 165.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11888.57 ms. Allocated memory was 202.4 MB in the beginning and 358.6 MB in the end (delta: 156.2 MB). Free memory was 164.5 MB in the beginning and 265.9 MB in the end (delta: -101.4 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: You must have same procedures except when you have threads or when this is a call or a return: assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2;: de.uni_freiburg.informatik.ultimate.core.model.translation.AtomicTraceElement.(AtomicTraceElement.java:117) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...