/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-267fbe0 [2020-07-17 22:07:18,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:07:18,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:07:18,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:07:18,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:07:18,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:07:18,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:07:18,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:07:18,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:07:19,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:07:19,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:07:19,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:07:19,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:07:19,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:07:19,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:07:19,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:07:19,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:07:19,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:07:19,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:07:19,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:07:19,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:07:19,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:07:19,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:07:19,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:07:19,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:07:19,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:07:19,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:07:19,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:07:19,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:07:19,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:07:19,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:07:19,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:07:19,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:07:19,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:07:19,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:07:19,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:07:19,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:07:19,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:07:19,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:07:19,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:07:19,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:07:19,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:07:19,080 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:07:19,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:07:19,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:07:19,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:07:19,084 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:07:19,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:07:19,085 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:07:19,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:07:19,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:07:19,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:07:19,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:07:19,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:07:19,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:07:19,089 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:07:19,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:07:19,089 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:07:19,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:07:19,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:07:19,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:07:19,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:07:19,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:07:19,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:07:19,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:07:19,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:07:19,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:07:19,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:07:19,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:07:19,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:07:19,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:07:19,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:07:19,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:07:19,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:07:19,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:07:19,414 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:07:19,415 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:07:19,415 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-17 22:07:19,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d591be3/a527a445b5bf45adb86e62390190fa43/FLAGf0f3fe543 [2020-07-17 22:07:19,976 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:07:19,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-17 22:07:19,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d591be3/a527a445b5bf45adb86e62390190fa43/FLAGf0f3fe543 [2020-07-17 22:07:20,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d591be3/a527a445b5bf45adb86e62390190fa43 [2020-07-17 22:07:20,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:07:20,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:07:20,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:07:20,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:07:20,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:07:20,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1e30b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20, skipping insertion in model container [2020-07-17 22:07:20,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:07:20,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:07:20,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:07:20,566 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:07:20,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:07:20,600 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:07:20,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20 WrapperNode [2020-07-17 22:07:20,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:07:20,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:07:20,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:07:20,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:07:20,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... [2020-07-17 22:07:20,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:07:20,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:07:20,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:07:20,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:07:20,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:07:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:07:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:07:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-17 22:07:20,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:07:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:07:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:07:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-17 22:07:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:07:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:07:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:07:21,030 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:07:21,030 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:07:21,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:07:21 BoogieIcfgContainer [2020-07-17 22:07:21,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:07:21,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:07:21,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:07:21,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:07:21,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:07:20" (1/3) ... [2020-07-17 22:07:21,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31253093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:07:21, skipping insertion in model container [2020-07-17 22:07:21,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:07:20" (2/3) ... [2020-07-17 22:07:21,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31253093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:07:21, skipping insertion in model container [2020-07-17 22:07:21,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:07:21" (3/3) ... [2020-07-17 22:07:21,046 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-17 22:07:21,059 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:07:21,068 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:07:21,085 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:07:21,126 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:07:21,126 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:07:21,127 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:07:21,127 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:07:21,136 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:07:21,136 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:07:21,137 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:07:21,137 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:07:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-17 22:07:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:07:21,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:21,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:21,173 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-17 22:07:21,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:21,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267840464] [2020-07-17 22:07:21,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:21,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:07:21,414 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #34#return; {26#true} is VALID [2020-07-17 22:07:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:21,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} ~n := #in~n; {35#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:21,474 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-17 22:07:21,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#(<= |fibonacci_#in~n| 0)} assume true; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:21,486 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-17 22:07:21,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-17 22:07:21,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:07:21,488 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #34#return; {26#true} is VALID [2020-07-17 22:07:21,488 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2020-07-17 22:07:21,488 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-17 22:07:21,489 INFO L263 TraceCheckUtils]: 5: Hoare triple {26#true} call #t~ret3 := fibonacci(~x~0); {26#true} is VALID [2020-07-17 22:07:21,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~n := #in~n; {35#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:21,492 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-17 22:07:21,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(<= |fibonacci_#in~n| 0)} assume true; {36#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:21,496 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-17 22:07:21,498 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-17 22:07:21,500 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-17 22:07:21,501 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-17 22:07:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:07:21,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267840464] [2020-07-17 22:07:21,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:21,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:07:21,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822721921] [2020-07-17 22:07:21,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:07:21,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:21,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:07:21,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:21,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:07:21,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:07:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:07:21,575 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-17 22:07:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:21,833 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:07:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:07:21,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:07:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:07:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:07:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:07:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:07:21,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-17 22:07:21,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:21,946 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:07:21,947 INFO L226 Difference]: Without dead ends: 21 [2020-07-17 22:07:21,951 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-17 22:07:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-17 22:07:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-17 22:07:22,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:22,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-17 22:07:22,006 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:07:22,006 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:07:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:22,013 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-17 22:07:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:07:22,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:22,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:22,015 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-17 22:07:22,015 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-17 22:07:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:22,021 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-17 22:07:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:07:22,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:22,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:22,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:22,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:07:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-17 22:07:22,029 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-17 22:07:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:22,030 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-17 22:07:22,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:07:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:07:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:07:22,032 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:22,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:07:22,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:07:22,033 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:22,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-17 22:07:22,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:22,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827317336] [2020-07-17 22:07:22,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,113 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-17 22:07:22,114 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {155#true} {155#true} #34#return; {155#true} is VALID [2020-07-17 22:07:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} ~n := #in~n; {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:22,197 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-17 22:07:22,198 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-17 22:07:22,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {166#(<= |fibonacci_#in~n| 1)} assume true; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:22,200 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-17 22:07:22,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2020-07-17 22:07:22,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-17 22:07:22,201 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {155#true} {155#true} #34#return; {155#true} is VALID [2020-07-17 22:07:22,202 INFO L263 TraceCheckUtils]: 3: Hoare triple {155#true} call #t~ret4 := main(); {155#true} is VALID [2020-07-17 22:07:22,202 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-17 22:07:22,202 INFO L263 TraceCheckUtils]: 5: Hoare triple {155#true} call #t~ret3 := fibonacci(~x~0); {155#true} is VALID [2020-07-17 22:07:22,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {155#true} ~n := #in~n; {165#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:22,204 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-17 22:07:22,205 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-17 22:07:22,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {166#(<= |fibonacci_#in~n| 1)} assume true; {166#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:22,207 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-17 22:07:22,208 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-17 22:07:22,209 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-17 22:07:22,209 INFO L280 TraceCheckUtils]: 13: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-17 22:07:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:07:22,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827317336] [2020-07-17 22:07:22,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:07:22,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:07:22,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125685881] [2020-07-17 22:07:22,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:07:22,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:22,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:07:22,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:22,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:07:22,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:07:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:07:22,235 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-17 22:07:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:22,390 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-17 22:07:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:07:22,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:07:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:07:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-17 22:07:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:07:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-17 22:07:22,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-17 22:07:22,441 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-17 22:07:22,443 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:07:22,444 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:07:22,445 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-17 22:07:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:07:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-17 22:07:22,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:22,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-17 22:07:22,457 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-17 22:07:22,458 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-17 22:07:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:22,461 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-17 22:07:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-17 22:07:22,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:22,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:22,463 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-17 22:07:22,463 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-17 22:07:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:22,467 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-17 22:07:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-17 22:07:22,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:22,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:22,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:22,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:07:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-17 22:07:22,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-17 22:07:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:22,479 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-17 22:07:22,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:07:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-17 22:07:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:07:22,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:22,481 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-17 22:07:22,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:07:22,481 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-17 22:07:22,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:22,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915693306] [2020-07-17 22:07:22,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,526 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-17 22:07:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:22,601 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-17 22:07:22,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:22,603 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-17 22:07:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-17 22:07:22,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-17 22:07:22,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume !(~n < 1); {302#(< 0 fibonacci_~n)} is VALID [2020-07-17 22:07:22,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {302#(< 0 fibonacci_~n)} assume !(1 == ~n); {303#(< 1 fibonacci_~n)} is VALID [2020-07-17 22:07:22,637 INFO L263 TraceCheckUtils]: 3: Hoare triple {303#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-17 22:07:22,637 INFO L280 TraceCheckUtils]: 4: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:22,638 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-17 22:07:22,639 INFO L280 TraceCheckUtils]: 6: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:22,640 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-17 22:07:22,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {282#false} is VALID [2020-07-17 22:07:22,641 INFO L263 TraceCheckUtils]: 9: Hoare triple {282#false} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-17 22:07:22,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-17 22:07:22,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,642 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-17 22:07:22,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {282#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {282#false} is VALID [2020-07-17 22:07:22,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {282#false} assume true; {282#false} is VALID [2020-07-17 22:07:22,643 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {282#false} {281#true} #38#return; {282#false} is VALID [2020-07-17 22:07:22,644 INFO L263 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2020-07-17 22:07:22,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-17 22:07:22,645 INFO L263 TraceCheckUtils]: 3: Hoare triple {281#true} call #t~ret4 := main(); {281#true} is VALID [2020-07-17 22:07:22,645 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-17 22:07:22,645 INFO L263 TraceCheckUtils]: 5: Hoare triple {281#true} call #t~ret3 := fibonacci(~x~0); {281#true} is VALID [2020-07-17 22:07:22,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {281#true} assume !(~n < 1); {302#(< 0 fibonacci_~n)} is VALID [2020-07-17 22:07:22,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {302#(< 0 fibonacci_~n)} assume !(1 == ~n); {303#(< 1 fibonacci_~n)} is VALID [2020-07-17 22:07:22,650 INFO L263 TraceCheckUtils]: 9: Hoare triple {303#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-17 22:07:22,653 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {312#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:22,653 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-17 22:07:22,654 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:22,655 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {313#(<= |fibonacci_#in~n| 0)} {303#(< 1 fibonacci_~n)} #30#return; {282#false} is VALID [2020-07-17 22:07:22,656 INFO L280 TraceCheckUtils]: 14: Hoare triple {282#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {282#false} is VALID [2020-07-17 22:07:22,656 INFO L263 TraceCheckUtils]: 15: Hoare triple {282#false} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-17 22:07:22,656 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-17 22:07:22,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,657 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {281#true} {282#false} #32#return; {282#false} is VALID [2020-07-17 22:07:22,657 INFO L280 TraceCheckUtils]: 20: Hoare triple {282#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {282#false} is VALID [2020-07-17 22:07:22,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {282#false} assume true; {282#false} is VALID [2020-07-17 22:07:22,658 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {282#false} {281#true} #38#return; {282#false} is VALID [2020-07-17 22:07:22,658 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-17 22:07:22,659 INFO L280 TraceCheckUtils]: 24: Hoare triple {282#false} assume !(5 != ~x~0 || 3 == ~result~0); {282#false} is VALID [2020-07-17 22:07:22,659 INFO L280 TraceCheckUtils]: 25: Hoare triple {282#false} assume !false; {282#false} is VALID [2020-07-17 22:07:22,661 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-17 22:07:22,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915693306] [2020-07-17 22:07:22,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496641168] [2020-07-17 22:07:22,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:07:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:22,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:22,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2020-07-17 22:07:22,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,867 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #34#return; {281#true} is VALID [2020-07-17 22:07:22,867 INFO L263 TraceCheckUtils]: 3: Hoare triple {281#true} call #t~ret4 := main(); {281#true} is VALID [2020-07-17 22:07:22,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-17 22:07:22,868 INFO L263 TraceCheckUtils]: 5: Hoare triple {281#true} call #t~ret3 := fibonacci(~x~0); {281#true} is VALID [2020-07-17 22:07:22,869 INFO L280 TraceCheckUtils]: 6: Hoare triple {281#true} ~n := #in~n; {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:22,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-17 22:07:22,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-17 22:07:22,871 INFO L263 TraceCheckUtils]: 9: Hoare triple {335#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {281#true} is VALID [2020-07-17 22:07:22,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {281#true} ~n := #in~n; {335#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:22,873 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-17 22:07:22,874 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#(<= |fibonacci_#in~n| 0)} assume true; {313#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:22,875 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-17 22:07:22,876 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-17 22:07:22,876 INFO L263 TraceCheckUtils]: 15: Hoare triple {357#(<= |fibonacci_#in~n| 1)} call #t~ret1 := fibonacci(~n - 2); {281#true} is VALID [2020-07-17 22:07:22,877 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#true} ~n := #in~n; {281#true} is VALID [2020-07-17 22:07:22,877 INFO L280 TraceCheckUtils]: 17: Hoare triple {281#true} assume ~n < 1;#res := 0; {281#true} is VALID [2020-07-17 22:07:22,877 INFO L280 TraceCheckUtils]: 18: Hoare triple {281#true} assume true; {281#true} is VALID [2020-07-17 22:07:22,879 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {281#true} {357#(<= |fibonacci_#in~n| 1)} #32#return; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:22,879 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~ret0;havoc #t~ret1; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:22,880 INFO L280 TraceCheckUtils]: 21: Hoare triple {357#(<= |fibonacci_#in~n| 1)} assume true; {357#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:22,881 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {357#(<= |fibonacci_#in~n| 1)} {281#true} #38#return; {385#(<= main_~x~0 1)} is VALID [2020-07-17 22:07:22,882 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-17 22:07:22,883 INFO L280 TraceCheckUtils]: 24: Hoare triple {385#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {282#false} is VALID [2020-07-17 22:07:22,883 INFO L280 TraceCheckUtils]: 25: Hoare triple {282#false} assume !false; {282#false} is VALID [2020-07-17 22:07:22,885 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-17 22:07:22,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-17 22:07:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469287475] [2020-07-17 22:07:22,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-17 22:07:22,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:22,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:07:22,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:22,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:07:22,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:22,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:07:22,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:07:22,946 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-17 22:07:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:23,329 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-17 22:07:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:07:23,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-17 22:07:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:07:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-17 22:07:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:07:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2020-07-17 22:07:23,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2020-07-17 22:07:23,406 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-17 22:07:23,408 INFO L225 Difference]: With dead ends: 38 [2020-07-17 22:07:23,409 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:07:23,410 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-17 22:07:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:07:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:07:23,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:23,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:07:23,421 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:07:23,421 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:07:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:23,424 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-17 22:07:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:07:23,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:23,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:23,426 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:07:23,426 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:07:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:23,429 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-17 22:07:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:07:23,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:23,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:23,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:23,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:07:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-17 22:07:23,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-17 22:07:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:23,434 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-17 22:07:23,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:07:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-17 22:07:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:07:23,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:23,436 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-17 22:07:23,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:07:23,651 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-17 22:07:23,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:23,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005699756] [2020-07-17 22:07:23,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,703 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-17 22:07:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:23,774 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-17 22:07:23,775 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-17 22:07:23,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:23,777 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-17 22:07:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-17 22:07:23,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-17 22:07:23,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:23,788 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-17 22:07:23,788 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-17 22:07:23,789 INFO L263 TraceCheckUtils]: 3: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-17 22:07:23,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:23,790 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-17 22:07:23,791 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-17 22:07:23,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:23,793 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-17 22:07:23,794 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-17 22:07:23,794 INFO L263 TraceCheckUtils]: 10: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-17 22:07:23,795 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-17 22:07:23,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-17 22:07:23,795 INFO L280 TraceCheckUtils]: 13: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,796 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,797 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~ret0;havoc #t~ret1; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,799 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-17 22:07:23,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-17 22:07:23,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,801 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-17 22:07:23,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret4 := main(); {530#true} is VALID [2020-07-17 22:07:23,801 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-17 22:07:23,801 INFO L263 TraceCheckUtils]: 5: Hoare triple {530#true} call #t~ret3 := fibonacci(~x~0); {530#true} is VALID [2020-07-17 22:07:23,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:23,803 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-17 22:07:23,804 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-17 22:07:23,804 INFO L263 TraceCheckUtils]: 9: Hoare triple {553#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-17 22:07:23,805 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~n := #in~n; {553#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:23,806 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-17 22:07:23,807 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-17 22:07:23,807 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:23,809 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-17 22:07:23,809 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-17 22:07:23,810 INFO L263 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-17 22:07:23,810 INFO L280 TraceCheckUtils]: 17: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-17 22:07:23,810 INFO L280 TraceCheckUtils]: 18: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-17 22:07:23,811 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,812 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,813 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~ret0;havoc #t~ret1; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,813 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,815 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-17 22:07:23,815 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-17 22:07:23,816 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-17 22:07:23,816 INFO L280 TraceCheckUtils]: 26: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-17 22:07:23,817 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-17 22:07:23,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005699756] [2020-07-17 22:07:23,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712318833] [2020-07-17 22:07:23,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:07:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:23,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:23,943 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-17 22:07:23,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,944 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #34#return; {530#true} is VALID [2020-07-17 22:07:23,944 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret4 := main(); {530#true} is VALID [2020-07-17 22:07:23,944 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-17 22:07:23,945 INFO L263 TraceCheckUtils]: 5: Hoare triple {530#true} call #t~ret3 := fibonacci(~x~0); {530#true} is VALID [2020-07-17 22:07:23,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} ~n := #in~n; {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:23,946 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-17 22:07:23,947 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-17 22:07:23,947 INFO L263 TraceCheckUtils]: 9: Hoare triple {586#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {530#true} is VALID [2020-07-17 22:07:23,948 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} ~n := #in~n; {586#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:23,948 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-17 22:07:23,949 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-17 22:07:23,950 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(<= |fibonacci_#in~n| 1)} assume true; {564#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:23,951 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-17 22:07:23,952 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-17 22:07:23,952 INFO L263 TraceCheckUtils]: 16: Hoare triple {559#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {530#true} is VALID [2020-07-17 22:07:23,953 INFO L280 TraceCheckUtils]: 17: Hoare triple {530#true} ~n := #in~n; {530#true} is VALID [2020-07-17 22:07:23,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {530#true} assume ~n < 1;#res := 0; {530#true} is VALID [2020-07-17 22:07:23,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-17 22:07:23,954 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {530#true} {559#(<= |fibonacci_#in~n| 2)} #32#return; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,955 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~ret0;havoc #t~ret1; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,956 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(<= |fibonacci_#in~n| 2)} assume true; {559#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:23,957 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {559#(<= |fibonacci_#in~n| 2)} {530#true} #38#return; {638#(<= main_~x~0 2)} is VALID [2020-07-17 22:07:23,958 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-17 22:07:23,958 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {531#false} is VALID [2020-07-17 22:07:23,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-17 22:07:23,960 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-17 22:07:23,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:23,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-17 22:07:23,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748414143] [2020-07-17 22:07:23,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-17 22:07:23,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:23,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:07:24,001 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-17 22:07:24,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:07:24,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:24,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:07:24,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:07:24,002 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-07-17 22:07:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:24,306 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-17 22:07:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:07:24,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-17 22:07:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:07:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-17 22:07:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:07:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-17 22:07:24,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-17 22:07:24,372 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-17 22:07:24,376 INFO L225 Difference]: With dead ends: 41 [2020-07-17 22:07:24,376 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:07:24,377 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-17 22:07:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:07:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-17 22:07:24,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:24,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-17 22:07:24,402 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:07:24,402 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:07:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:24,407 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-07-17 22:07:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-17 22:07:24,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:24,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:24,409 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:07:24,409 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:07:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:24,413 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-07-17 22:07:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-17 22:07:24,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:24,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:24,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:24,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:07:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-17 22:07:24,418 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-17 22:07:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:24,419 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-17 22:07:24,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:07:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-17 22:07:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:07:24,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:24,421 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-17 22:07:24,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:24,636 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-07-17 22:07:24,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:24,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104312732] [2020-07-17 22:07:24,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,690 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-17 22:07:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-17 22:07:24,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,805 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:24,814 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,815 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,817 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-17 22:07:24,818 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-17 22:07:24,818 INFO L263 TraceCheckUtils]: 3: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:24,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-17 22:07:24,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,821 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,821 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-17 22:07:24,821 INFO L263 TraceCheckUtils]: 10: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:24,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,822 INFO L280 TraceCheckUtils]: 12: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:24,822 INFO L280 TraceCheckUtils]: 13: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,823 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,824 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~ret0;havoc #t~ret1; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,825 INFO L280 TraceCheckUtils]: 16: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,826 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,846 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-17 22:07:24,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:24,848 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-17 22:07:24,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {829#true} assume !(1 == ~n); {829#true} is VALID [2020-07-17 22:07:24,849 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:24,850 INFO L280 TraceCheckUtils]: 4: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,851 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-17 22:07:24,851 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-17 22:07:24,852 INFO L263 TraceCheckUtils]: 7: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:24,852 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,852 INFO L280 TraceCheckUtils]: 9: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,852 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-17 22:07:24,853 INFO L280 TraceCheckUtils]: 11: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,854 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,854 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-17 22:07:24,855 INFO L263 TraceCheckUtils]: 14: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:24,855 INFO L280 TraceCheckUtils]: 15: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,855 INFO L280 TraceCheckUtils]: 16: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:24,855 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,857 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,857 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~ret0;havoc #t~ret1; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,858 INFO L280 TraceCheckUtils]: 20: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,859 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:24,860 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-17 22:07:24,860 INFO L263 TraceCheckUtils]: 23: Hoare triple {882#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:24,861 INFO L280 TraceCheckUtils]: 24: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,862 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-17 22:07:24,862 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:24,864 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-17 22:07:24,864 INFO L280 TraceCheckUtils]: 28: Hoare triple {830#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {830#false} is VALID [2020-07-17 22:07:24,864 INFO L280 TraceCheckUtils]: 29: Hoare triple {830#false} assume true; {830#false} is VALID [2020-07-17 22:07:24,865 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {830#false} {829#true} #38#return; {830#false} is VALID [2020-07-17 22:07:24,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2020-07-17 22:07:24,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,867 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-17 22:07:24,867 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret4 := main(); {829#true} is VALID [2020-07-17 22:07:24,867 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-17 22:07:24,867 INFO L263 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~ret3 := fibonacci(~x~0); {829#true} is VALID [2020-07-17 22:07:24,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,868 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,868 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#true} assume !(1 == ~n); {829#true} is VALID [2020-07-17 22:07:24,868 INFO L263 TraceCheckUtils]: 9: Hoare triple {829#true} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:24,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,870 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-17 22:07:24,871 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-17 22:07:24,871 INFO L263 TraceCheckUtils]: 13: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:24,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {829#true} assume !(~n < 1); {829#true} is VALID [2020-07-17 22:07:24,872 INFO L280 TraceCheckUtils]: 16: Hoare triple {829#true} assume 1 == ~n;#res := 1; {829#true} is VALID [2020-07-17 22:07:24,872 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,873 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #30#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,874 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-17 22:07:24,874 INFO L263 TraceCheckUtils]: 20: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:24,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:24,875 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:24,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:24,876 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {829#true} {889#(<= 2 |fibonacci_#in~n|)} #32#return; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,877 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~ret0;havoc #t~ret1; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {889#(<= 2 |fibonacci_#in~n|)} assume true; {889#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,878 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {889#(<= 2 |fibonacci_#in~n|)} {829#true} #30#return; {882#(<= 3 fibonacci_~n)} is VALID [2020-07-17 22:07:24,879 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-17 22:07:24,880 INFO L263 TraceCheckUtils]: 29: Hoare triple {882#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:24,880 INFO L280 TraceCheckUtils]: 30: Hoare triple {829#true} ~n := #in~n; {887#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:24,881 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-17 22:07:24,882 INFO L280 TraceCheckUtils]: 32: Hoare triple {899#(<= |fibonacci_#in~n| 0)} assume true; {899#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:24,883 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {899#(<= |fibonacci_#in~n| 0)} {882#(<= 3 fibonacci_~n)} #32#return; {830#false} is VALID [2020-07-17 22:07:24,884 INFO L280 TraceCheckUtils]: 34: Hoare triple {830#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {830#false} is VALID [2020-07-17 22:07:24,884 INFO L280 TraceCheckUtils]: 35: Hoare triple {830#false} assume true; {830#false} is VALID [2020-07-17 22:07:24,884 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {830#false} {829#true} #38#return; {830#false} is VALID [2020-07-17 22:07:24,885 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-17 22:07:24,885 INFO L280 TraceCheckUtils]: 38: Hoare triple {830#false} assume !(5 != ~x~0 || 3 == ~result~0); {830#false} is VALID [2020-07-17 22:07:24,885 INFO L280 TraceCheckUtils]: 39: Hoare triple {830#false} assume !false; {830#false} is VALID [2020-07-17 22:07:24,887 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-17 22:07:24,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104312732] [2020-07-17 22:07:24,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224346416] [2020-07-17 22:07:24,888 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-17 22:07:24,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:07:24,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:07:24,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:07:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:24,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:25,080 INFO L263 TraceCheckUtils]: 0: Hoare triple {829#true} call ULTIMATE.init(); {829#true} is VALID [2020-07-17 22:07:25,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:25,081 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {829#true} {829#true} #34#return; {829#true} is VALID [2020-07-17 22:07:25,082 INFO L263 TraceCheckUtils]: 3: Hoare triple {829#true} call #t~ret4 := main(); {829#true} is VALID [2020-07-17 22:07:25,082 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-17 22:07:25,082 INFO L263 TraceCheckUtils]: 5: Hoare triple {829#true} call #t~ret3 := fibonacci(~x~0); {829#true} is VALID [2020-07-17 22:07:25,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:25,084 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-17 22:07:25,084 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-17 22:07:25,085 INFO L263 TraceCheckUtils]: 9: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:25,085 INFO L280 TraceCheckUtils]: 10: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:25,086 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-17 22:07:25,087 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-17 22:07:25,087 INFO L263 TraceCheckUtils]: 13: Hoare triple {921#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {829#true} is VALID [2020-07-17 22:07:25,088 INFO L280 TraceCheckUtils]: 14: Hoare triple {829#true} ~n := #in~n; {921#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:25,088 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-17 22:07:25,089 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-17 22:07:25,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= |fibonacci_#in~n| 1)} assume true; {952#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:25,091 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-17 22:07:25,092 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-17 22:07:25,092 INFO L263 TraceCheckUtils]: 20: Hoare triple {959#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:25,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:25,092 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:25,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:25,094 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {829#true} {959#(<= |fibonacci_#in~n| 2)} #32#return; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:25,094 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~ret0;havoc #t~ret1; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:25,095 INFO L280 TraceCheckUtils]: 26: Hoare triple {959#(<= |fibonacci_#in~n| 2)} assume true; {959#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:25,096 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-17 22:07:25,097 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-17 22:07:25,097 INFO L263 TraceCheckUtils]: 29: Hoare triple {987#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {829#true} is VALID [2020-07-17 22:07:25,097 INFO L280 TraceCheckUtils]: 30: Hoare triple {829#true} ~n := #in~n; {829#true} is VALID [2020-07-17 22:07:25,097 INFO L280 TraceCheckUtils]: 31: Hoare triple {829#true} assume ~n < 1;#res := 0; {829#true} is VALID [2020-07-17 22:07:25,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {829#true} assume true; {829#true} is VALID [2020-07-17 22:07:25,099 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {829#true} {987#(<= |fibonacci_#in~n| 3)} #32#return; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:25,099 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~ret0;havoc #t~ret1; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:25,100 INFO L280 TraceCheckUtils]: 35: Hoare triple {987#(<= |fibonacci_#in~n| 3)} assume true; {987#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:25,101 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {987#(<= |fibonacci_#in~n| 3)} {829#true} #38#return; {1015#(<= main_~x~0 3)} is VALID [2020-07-17 22:07:25,102 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-17 22:07:25,103 INFO L280 TraceCheckUtils]: 38: Hoare triple {1015#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {830#false} is VALID [2020-07-17 22:07:25,103 INFO L280 TraceCheckUtils]: 39: Hoare triple {830#false} assume !false; {830#false} is VALID [2020-07-17 22:07:25,105 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-17 22:07:25,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:25,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-17 22:07:25,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148773648] [2020-07-17 22:07:25,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-17 22:07:25,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:25,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:07:25,172 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-17 22:07:25,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:07:25,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:07:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:07:25,174 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-17 22:07:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:25,908 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-07-17 22:07:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:07:25,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-17 22:07:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:07:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2020-07-17 22:07:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:07:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2020-07-17 22:07:25,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2020-07-17 22:07:26,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:07:26,024 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:07:26,024 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:07:26,026 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-17 22:07:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:07:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-17 22:07:26,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:26,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-17 22:07:26,044 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-17 22:07:26,044 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-17 22:07:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:26,047 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-17 22:07:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-17 22:07:26,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:26,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:26,048 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-17 22:07:26,049 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-17 22:07:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:26,052 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-17 22:07:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-17 22:07:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:26,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:26,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:26,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:07:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-17 22:07:26,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-07-17 22:07:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:26,056 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-17 22:07:26,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:07:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-17 22:07:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-17 22:07:26,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:26,059 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-17 22:07:26,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:26,272 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 3 times [2020-07-17 22:07:26,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:26,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213102619] [2020-07-17 22:07:26,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,353 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-17 22:07:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,548 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-17 22:07:26,549 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-17 22:07:26,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:26,551 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-17 22:07:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,563 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-17 22:07:26,564 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-17 22:07:26,565 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,567 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-17 22:07:26,568 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-17 22:07:26,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:26,571 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-17 22:07:26,572 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-17 22:07:26,572 INFO L263 TraceCheckUtils]: 10: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,575 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,576 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~ret0;havoc #t~ret1; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,582 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-17 22:07:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,593 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,594 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,596 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-17 22:07:26,596 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-17 22:07:26,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,598 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,598 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-17 22:07:26,602 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-17 22:07:26,603 INFO L263 TraceCheckUtils]: 7: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,605 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-17 22:07:26,606 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-17 22:07:26,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:26,609 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-17 22:07:26,610 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-17 22:07:26,610 INFO L263 TraceCheckUtils]: 14: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,611 INFO L280 TraceCheckUtils]: 17: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,612 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,613 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~ret0;havoc #t~ret1; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,615 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-17 22:07:26,616 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-17 22:07:26,617 INFO L263 TraceCheckUtils]: 23: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,617 INFO L280 TraceCheckUtils]: 24: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,618 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,618 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,620 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,621 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~ret0;havoc #t~ret1; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,622 INFO L280 TraceCheckUtils]: 30: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,624 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-17 22:07:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,660 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,665 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:26,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-17 22:07:26,667 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,668 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:26,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-17 22:07:26,669 INFO L263 TraceCheckUtils]: 10: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,670 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:26,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1257#true} is VALID [2020-07-17 22:07:26,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,672 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,674 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-17 22:07:26,675 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-17 22:07:26,675 INFO L263 TraceCheckUtils]: 3: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,677 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-17 22:07:26,678 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-17 22:07:26,678 INFO L263 TraceCheckUtils]: 7: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,679 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-17 22:07:26,680 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-17 22:07:26,681 INFO L263 TraceCheckUtils]: 11: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,682 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-17 22:07:26,683 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-17 22:07:26,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:26,686 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-17 22:07:26,687 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-17 22:07:26,687 INFO L263 TraceCheckUtils]: 18: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,688 INFO L280 TraceCheckUtils]: 19: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,688 INFO L280 TraceCheckUtils]: 20: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,694 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,695 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~ret0;havoc #t~ret1; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,698 INFO L280 TraceCheckUtils]: 24: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,702 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-17 22:07:26,703 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-17 22:07:26,703 INFO L263 TraceCheckUtils]: 27: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,703 INFO L280 TraceCheckUtils]: 28: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,704 INFO L280 TraceCheckUtils]: 31: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,706 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,707 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~ret0;havoc #t~ret1; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,707 INFO L280 TraceCheckUtils]: 34: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,709 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-17 22:07:26,710 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-17 22:07:26,711 INFO L263 TraceCheckUtils]: 37: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,711 INFO L280 TraceCheckUtils]: 38: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,711 INFO L280 TraceCheckUtils]: 39: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,711 INFO L280 TraceCheckUtils]: 40: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-17 22:07:26,712 INFO L263 TraceCheckUtils]: 41: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,712 INFO L280 TraceCheckUtils]: 42: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,712 INFO L280 TraceCheckUtils]: 43: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,713 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,713 INFO L280 TraceCheckUtils]: 45: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,713 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:26,714 INFO L280 TraceCheckUtils]: 47: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-17 22:07:26,714 INFO L263 TraceCheckUtils]: 48: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,714 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,715 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,715 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,715 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:26,716 INFO L280 TraceCheckUtils]: 53: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1257#true} is VALID [2020-07-17 22:07:26,716 INFO L280 TraceCheckUtils]: 54: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,717 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,718 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~ret0;havoc #t~ret1; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,719 INFO L280 TraceCheckUtils]: 57: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,720 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-17 22:07:26,726 INFO L263 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2020-07-17 22:07:26,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-17 22:07:26,727 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret4 := main(); {1257#true} is VALID [2020-07-17 22:07:26,727 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-17 22:07:26,728 INFO L263 TraceCheckUtils]: 5: Hoare triple {1257#true} call #t~ret3 := fibonacci(~x~0); {1257#true} is VALID [2020-07-17 22:07:26,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,730 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-17 22:07:26,730 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-17 22:07:26,731 INFO L263 TraceCheckUtils]: 9: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,732 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-17 22:07:26,733 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-17 22:07:26,733 INFO L263 TraceCheckUtils]: 13: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,735 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-17 22:07:26,735 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-17 22:07:26,735 INFO L263 TraceCheckUtils]: 17: Hoare triple {1321#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,736 INFO L280 TraceCheckUtils]: 18: Hoare triple {1257#true} ~n := #in~n; {1321#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:26,736 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-17 22:07:26,737 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-17 22:07:26,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#(<= |fibonacci_#in~n| 1)} assume true; {1407#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:26,739 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-17 22:07:26,740 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-17 22:07:26,741 INFO L263 TraceCheckUtils]: 24: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,741 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,741 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,742 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,743 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1402#(<= |fibonacci_#in~n| 2)} #32#return; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,743 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~ret0;havoc #t~ret1; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,744 INFO L280 TraceCheckUtils]: 30: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:26,745 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-17 22:07:26,746 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-17 22:07:26,746 INFO L263 TraceCheckUtils]: 33: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,747 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,747 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,747 INFO L280 TraceCheckUtils]: 36: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,747 INFO L280 TraceCheckUtils]: 37: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,748 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1257#true} {1391#(<= |fibonacci_#in~n| 3)} #32#return; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,749 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~ret0;havoc #t~ret1; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,750 INFO L280 TraceCheckUtils]: 40: Hoare triple {1391#(<= |fibonacci_#in~n| 3)} assume true; {1391#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:26,752 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-17 22:07:26,753 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-17 22:07:26,753 INFO L263 TraceCheckUtils]: 43: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,754 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,754 INFO L280 TraceCheckUtils]: 45: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,754 INFO L280 TraceCheckUtils]: 46: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-17 22:07:26,754 INFO L263 TraceCheckUtils]: 47: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:26,755 INFO L280 TraceCheckUtils]: 48: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,755 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:26,755 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:26,756 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,756 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:26,756 INFO L280 TraceCheckUtils]: 53: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-17 22:07:26,756 INFO L263 TraceCheckUtils]: 54: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:26,757 INFO L280 TraceCheckUtils]: 55: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:26,757 INFO L280 TraceCheckUtils]: 56: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:26,757 INFO L280 TraceCheckUtils]: 57: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,757 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:26,758 INFO L280 TraceCheckUtils]: 59: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1257#true} is VALID [2020-07-17 22:07:26,758 INFO L280 TraceCheckUtils]: 60: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:26,760 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {1257#true} {1354#(<= |fibonacci_#in~n| 4)} #32#return; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,760 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~ret0;havoc #t~ret1; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,761 INFO L280 TraceCheckUtils]: 63: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:26,763 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-17 22:07:26,764 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-17 22:07:26,765 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-17 22:07:26,765 INFO L280 TraceCheckUtils]: 67: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-17 22:07:26,772 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-17 22:07:26,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213102619] [2020-07-17 22:07:26,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895471035] [2020-07-17 22:07:26,773 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-17 22:07:26,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-17 22:07:26,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:07:26,825 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:07:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:26,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:27,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {1257#true} call ULTIMATE.init(); {1257#true} is VALID [2020-07-17 22:07:27,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} #34#return; {1257#true} is VALID [2020-07-17 22:07:27,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {1257#true} call #t~ret4 := main(); {1257#true} is VALID [2020-07-17 22:07:27,029 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-17 22:07:27,030 INFO L263 TraceCheckUtils]: 5: Hoare triple {1257#true} call #t~ret3 := fibonacci(~x~0); {1257#true} is VALID [2020-07-17 22:07:27,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:27,031 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-17 22:07:27,031 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-17 22:07:27,032 INFO L263 TraceCheckUtils]: 9: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:27,032 INFO L280 TraceCheckUtils]: 10: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,032 INFO L280 TraceCheckUtils]: 11: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:27,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-17 22:07:27,032 INFO L263 TraceCheckUtils]: 13: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L280 TraceCheckUtils]: 14: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L280 TraceCheckUtils]: 15: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {1257#true} assume !(1 == ~n); {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L263 TraceCheckUtils]: 17: Hoare triple {1257#true} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L280 TraceCheckUtils]: 18: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,033 INFO L280 TraceCheckUtils]: 19: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:27,034 INFO L280 TraceCheckUtils]: 20: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:27,034 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,034 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:27,034 INFO L280 TraceCheckUtils]: 23: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-17 22:07:27,034 INFO L263 TraceCheckUtils]: 24: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:27,035 INFO L280 TraceCheckUtils]: 25: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,035 INFO L280 TraceCheckUtils]: 26: Hoare triple {1257#true} assume ~n < 1;#res := 0; {1257#true} is VALID [2020-07-17 22:07:27,035 INFO L280 TraceCheckUtils]: 27: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,035 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:27,035 INFO L280 TraceCheckUtils]: 29: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1257#true} is VALID [2020-07-17 22:07:27,036 INFO L280 TraceCheckUtils]: 30: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,036 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1257#true} {1257#true} #30#return; {1257#true} is VALID [2020-07-17 22:07:27,036 INFO L280 TraceCheckUtils]: 32: Hoare triple {1257#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1257#true} is VALID [2020-07-17 22:07:27,036 INFO L263 TraceCheckUtils]: 33: Hoare triple {1257#true} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:27,036 INFO L280 TraceCheckUtils]: 34: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L280 TraceCheckUtils]: 35: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L280 TraceCheckUtils]: 36: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L280 TraceCheckUtils]: 37: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1257#true} {1257#true} #32#return; {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L280 TraceCheckUtils]: 39: Hoare triple {1257#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1257#true} is VALID [2020-07-17 22:07:27,037 INFO L280 TraceCheckUtils]: 40: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,039 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-17 22:07:27,040 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-17 22:07:27,040 INFO L263 TraceCheckUtils]: 43: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:27,040 INFO L280 TraceCheckUtils]: 44: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:27,041 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-17 22:07:27,041 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-17 22:07:27,042 INFO L263 TraceCheckUtils]: 47: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {1257#true} is VALID [2020-07-17 22:07:27,042 INFO L280 TraceCheckUtils]: 48: Hoare triple {1257#true} ~n := #in~n; {1257#true} is VALID [2020-07-17 22:07:27,042 INFO L280 TraceCheckUtils]: 49: Hoare triple {1257#true} assume !(~n < 1); {1257#true} is VALID [2020-07-17 22:07:27,042 INFO L280 TraceCheckUtils]: 50: Hoare triple {1257#true} assume 1 == ~n;#res := 1; {1257#true} is VALID [2020-07-17 22:07:27,042 INFO L280 TraceCheckUtils]: 51: Hoare triple {1257#true} assume true; {1257#true} is VALID [2020-07-17 22:07:27,043 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-17 22:07:27,044 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-17 22:07:27,044 INFO L263 TraceCheckUtils]: 54: Hoare triple {1438#(<= |fibonacci_#in~n| fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1257#true} is VALID [2020-07-17 22:07:27,045 INFO L280 TraceCheckUtils]: 55: Hoare triple {1257#true} ~n := #in~n; {1438#(<= |fibonacci_#in~n| fibonacci_~n)} is VALID [2020-07-17 22:07:27,046 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-17 22:07:27,046 INFO L280 TraceCheckUtils]: 57: Hoare triple {1589#(<= |fibonacci_#in~n| 0)} assume true; {1589#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-17 22:07:27,047 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-17 22:07:27,048 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~ret0;havoc #t~ret1; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:27,048 INFO L280 TraceCheckUtils]: 60: Hoare triple {1402#(<= |fibonacci_#in~n| 2)} assume true; {1402#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:27,050 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-17 22:07:27,051 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~ret0;havoc #t~ret1; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:27,051 INFO L280 TraceCheckUtils]: 63: Hoare triple {1354#(<= |fibonacci_#in~n| 4)} assume true; {1354#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:27,052 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {1354#(<= |fibonacci_#in~n| 4)} {1257#true} #38#return; {1614#(<= main_~x~0 4)} is VALID [2020-07-17 22:07:27,053 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-17 22:07:27,053 INFO L280 TraceCheckUtils]: 66: Hoare triple {1614#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {1258#false} is VALID [2020-07-17 22:07:27,053 INFO L280 TraceCheckUtils]: 67: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-17 22:07:27,057 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-17 22:07:27,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:27,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:07:27,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194845548] [2020-07-17 22:07:27,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-07-17 22:07:27,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:27,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:07:27,142 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-17 22:07:27,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:07:27,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:07:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:07:27,143 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2020-07-17 22:07:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:27,633 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2020-07-17 22:07:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:07:27,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-07-17 22:07:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:07:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-17 22:07:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:07:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2020-07-17 22:07:27,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2020-07-17 22:07:27,762 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-17 22:07:27,765 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:07:27,766 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:07:27,767 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-17 22:07:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:07:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-07-17 22:07:27,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:27,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2020-07-17 22:07:27,789 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2020-07-17 22:07:27,789 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2020-07-17 22:07:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:27,793 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-17 22:07:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-17 22:07:27,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:27,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:27,794 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2020-07-17 22:07:27,794 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2020-07-17 22:07:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:27,798 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-07-17 22:07:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2020-07-17 22:07:27,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:27,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:27,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:27,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:07:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-07-17 22:07:27,802 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 68 [2020-07-17 22:07:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:27,803 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-07-17 22:07:27,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:07:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2020-07-17 22:07:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-17 22:07:27,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:27,806 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-17 22:07:28,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:07:28,021 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 4 times [2020-07-17 22:07:28,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:28,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660104196] [2020-07-17 22:07:28,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,102 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-17 22:07:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,274 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-17 22:07:28,275 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-17 22:07:28,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,288 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-17 22:07:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,295 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-17 22:07:28,296 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-17 22:07:28,297 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,298 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-17 22:07:28,298 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-17 22:07:28,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,300 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-17 22:07:28,301 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-17 22:07:28,301 INFO L263 TraceCheckUtils]: 10: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,301 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,301 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,302 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,303 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~ret0;havoc #t~ret1; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,303 INFO L280 TraceCheckUtils]: 16: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,305 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-17 22:07:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,311 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,312 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-17 22:07:28,312 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-17 22:07:28,312 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,313 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-17 22:07:28,314 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-17 22:07:28,314 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,315 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-17 22:07:28,316 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-17 22:07:28,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,317 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-17 22:07:28,318 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-17 22:07:28,318 INFO L263 TraceCheckUtils]: 14: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,319 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,319 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,320 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,321 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~ret0;havoc #t~ret1; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,321 INFO L280 TraceCheckUtils]: 20: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,322 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-17 22:07:28,323 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-17 22:07:28,323 INFO L263 TraceCheckUtils]: 23: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,323 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,324 INFO L280 TraceCheckUtils]: 26: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,324 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,325 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,325 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~ret0;havoc #t~ret1; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,326 INFO L280 TraceCheckUtils]: 30: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,327 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-17 22:07:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,342 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,350 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,351 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,352 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,352 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,353 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,353 INFO L263 TraceCheckUtils]: 10: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,353 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,354 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,354 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,355 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,358 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-17 22:07:28,359 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-17 22:07:28,359 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,360 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-17 22:07:28,361 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-17 22:07:28,361 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,361 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,362 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-17 22:07:28,362 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-17 22:07:28,363 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,363 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,364 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-17 22:07:28,364 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-17 22:07:28,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,366 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-17 22:07:28,367 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-17 22:07:28,367 INFO L263 TraceCheckUtils]: 18: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,367 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,368 INFO L280 TraceCheckUtils]: 21: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,368 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,369 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~ret0;havoc #t~ret1; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,370 INFO L280 TraceCheckUtils]: 24: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,371 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-17 22:07:28,371 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-17 22:07:28,372 INFO L263 TraceCheckUtils]: 27: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,372 INFO L280 TraceCheckUtils]: 28: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,372 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,372 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,372 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,373 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,374 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~ret0;havoc #t~ret1; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,374 INFO L280 TraceCheckUtils]: 34: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,376 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-17 22:07:28,376 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-17 22:07:28,376 INFO L263 TraceCheckUtils]: 37: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,377 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,377 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,377 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,377 INFO L263 TraceCheckUtils]: 41: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,377 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,378 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,378 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,378 INFO L280 TraceCheckUtils]: 45: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,378 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,378 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,379 INFO L263 TraceCheckUtils]: 48: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,379 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,379 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,379 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,379 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,380 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,380 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,381 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,381 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~ret0;havoc #t~ret1; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,382 INFO L280 TraceCheckUtils]: 57: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,383 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-17 22:07:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,531 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,538 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,542 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,543 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-17 22:07:28,543 INFO L263 TraceCheckUtils]: 10: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,543 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,544 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,545 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,545 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,546 INFO L280 TraceCheckUtils]: 16: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,548 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-17 22:07:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,555 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,557 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-17 22:07:28,557 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-17 22:07:28,557 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,559 INFO L263 TraceCheckUtils]: 7: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,560 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,561 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,562 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-17 22:07:28,562 INFO L263 TraceCheckUtils]: 14: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,562 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,564 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,565 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,567 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-17 22:07:28,568 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-17 22:07:28,568 INFO L263 TraceCheckUtils]: 23: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,568 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,569 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,569 INFO L280 TraceCheckUtils]: 26: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,569 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,570 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,571 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,571 INFO L280 TraceCheckUtils]: 30: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,573 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-17 22:07:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,587 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,587 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,594 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,595 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,595 INFO L263 TraceCheckUtils]: 10: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,596 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,596 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,597 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,599 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-17 22:07:28,600 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-17 22:07:28,600 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,600 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,601 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-17 22:07:28,601 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-17 22:07:28,602 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,604 INFO L263 TraceCheckUtils]: 11: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,605 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,607 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,607 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-17 22:07:28,608 INFO L263 TraceCheckUtils]: 18: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,608 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,608 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,609 INFO L280 TraceCheckUtils]: 21: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,610 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,610 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,611 INFO L280 TraceCheckUtils]: 24: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,612 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-17 22:07:28,613 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-17 22:07:28,613 INFO L263 TraceCheckUtils]: 27: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,614 INFO L280 TraceCheckUtils]: 28: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,614 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,614 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,615 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,616 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,616 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,617 INFO L280 TraceCheckUtils]: 34: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,619 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-17 22:07:28,620 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-17 22:07:28,620 INFO L263 TraceCheckUtils]: 37: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,620 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,621 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,621 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,621 INFO L263 TraceCheckUtils]: 41: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,621 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,622 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,622 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,622 INFO L280 TraceCheckUtils]: 45: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,623 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,623 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,623 INFO L263 TraceCheckUtils]: 48: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,623 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,624 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,624 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,624 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,625 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,625 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,626 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,627 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~ret0;havoc #t~ret1; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,628 INFO L280 TraceCheckUtils]: 57: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,629 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-17 22:07:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,640 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,641 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,642 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,643 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-17 22:07:28,644 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-17 22:07:28,644 INFO L263 TraceCheckUtils]: 3: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,645 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,645 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-17 22:07:28,646 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-17 22:07:28,646 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,648 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-17 22:07:28,648 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-17 22:07:28,649 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,651 INFO L263 TraceCheckUtils]: 15: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,652 INFO L280 TraceCheckUtils]: 17: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,652 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,653 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,654 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-17 22:07:28,654 INFO L263 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,656 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,657 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,657 INFO L280 TraceCheckUtils]: 28: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,659 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-17 22:07:28,660 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-17 22:07:28,660 INFO L263 TraceCheckUtils]: 31: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,660 INFO L280 TraceCheckUtils]: 32: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,660 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,662 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,662 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,663 INFO L280 TraceCheckUtils]: 38: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,664 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-17 22:07:28,665 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-17 22:07:28,665 INFO L263 TraceCheckUtils]: 41: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,665 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,666 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,666 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,666 INFO L263 TraceCheckUtils]: 45: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,666 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,667 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,667 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,667 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,668 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,668 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,668 INFO L263 TraceCheckUtils]: 52: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,669 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,669 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,669 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,670 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,670 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,670 INFO L280 TraceCheckUtils]: 58: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,672 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,673 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~ret0;havoc #t~ret1; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,674 INFO L280 TraceCheckUtils]: 61: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,691 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-17 22:07:28,692 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-17 22:07:28,692 INFO L263 TraceCheckUtils]: 64: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,693 INFO L280 TraceCheckUtils]: 65: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,693 INFO L280 TraceCheckUtils]: 66: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,693 INFO L280 TraceCheckUtils]: 67: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,694 INFO L280 TraceCheckUtils]: 68: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,695 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,695 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~ret0;havoc #t~ret1; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,696 INFO L280 TraceCheckUtils]: 71: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,697 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-17 22:07:28,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,705 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,705 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,706 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-17 22:07:28,707 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-17 22:07:28,707 INFO L263 TraceCheckUtils]: 7: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,707 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,708 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-17 22:07:28,709 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-17 22:07:28,709 INFO L263 TraceCheckUtils]: 11: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,711 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-17 22:07:28,711 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-17 22:07:28,712 INFO L263 TraceCheckUtils]: 15: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,713 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-17 22:07:28,713 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-17 22:07:28,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,715 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-17 22:07:28,716 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-17 22:07:28,716 INFO L263 TraceCheckUtils]: 22: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,717 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,718 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,719 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~ret0;havoc #t~ret1; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,720 INFO L280 TraceCheckUtils]: 28: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,721 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-17 22:07:28,722 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-17 22:07:28,722 INFO L263 TraceCheckUtils]: 31: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,723 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,723 INFO L280 TraceCheckUtils]: 35: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,724 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,724 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~ret0;havoc #t~ret1; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,725 INFO L280 TraceCheckUtils]: 38: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,726 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-17 22:07:28,727 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-17 22:07:28,727 INFO L263 TraceCheckUtils]: 41: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,727 INFO L280 TraceCheckUtils]: 42: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,727 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,727 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,728 INFO L263 TraceCheckUtils]: 45: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,728 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,728 INFO L280 TraceCheckUtils]: 47: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,728 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,728 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,729 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,729 INFO L280 TraceCheckUtils]: 51: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,729 INFO L263 TraceCheckUtils]: 52: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,729 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,729 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,730 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,730 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,730 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,730 INFO L280 TraceCheckUtils]: 58: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,731 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,732 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~ret0;havoc #t~ret1; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,732 INFO L280 TraceCheckUtils]: 61: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,733 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-17 22:07:28,734 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-17 22:07:28,734 INFO L263 TraceCheckUtils]: 64: Hoare triple {2111#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,735 INFO L280 TraceCheckUtils]: 65: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,735 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-17 22:07:28,736 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-17 22:07:28,736 INFO L263 TraceCheckUtils]: 68: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,737 INFO L280 TraceCheckUtils]: 69: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,737 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-17 22:07:28,738 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-17 22:07:28,738 INFO L263 TraceCheckUtils]: 72: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,738 INFO L280 TraceCheckUtils]: 73: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,739 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-17 22:07:28,740 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-17 22:07:28,740 INFO L263 TraceCheckUtils]: 76: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,740 INFO L280 TraceCheckUtils]: 77: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,741 INFO L280 TraceCheckUtils]: 78: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,742 INFO L280 TraceCheckUtils]: 79: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,742 INFO L263 TraceCheckUtils]: 80: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,742 INFO L280 TraceCheckUtils]: 81: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,742 INFO L280 TraceCheckUtils]: 82: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,742 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,743 INFO L280 TraceCheckUtils]: 84: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,743 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,744 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-17 22:07:28,744 INFO L263 TraceCheckUtils]: 87: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,744 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,745 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,745 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,746 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,746 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,747 INFO L280 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,748 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-17 22:07:28,749 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-17 22:07:28,749 INFO L263 TraceCheckUtils]: 96: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,749 INFO L280 TraceCheckUtils]: 97: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,749 INFO L280 TraceCheckUtils]: 98: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,749 INFO L280 TraceCheckUtils]: 99: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,750 INFO L280 TraceCheckUtils]: 100: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,750 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,751 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,751 INFO L280 TraceCheckUtils]: 103: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,753 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-17 22:07:28,753 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-17 22:07:28,753 INFO L263 TraceCheckUtils]: 106: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,754 INFO L280 TraceCheckUtils]: 107: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,754 INFO L280 TraceCheckUtils]: 108: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,754 INFO L280 TraceCheckUtils]: 109: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,754 INFO L263 TraceCheckUtils]: 110: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,754 INFO L280 TraceCheckUtils]: 111: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,755 INFO L280 TraceCheckUtils]: 112: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,755 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,755 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,755 INFO L275 TraceCheckUtils]: 115: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,755 INFO L280 TraceCheckUtils]: 116: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,756 INFO L263 TraceCheckUtils]: 117: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,756 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,756 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,756 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,756 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,757 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,757 INFO L280 TraceCheckUtils]: 123: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,758 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,759 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~ret0;havoc #t~ret1; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,759 INFO L280 TraceCheckUtils]: 126: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,761 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-17 22:07:28,761 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-17 22:07:28,762 INFO L263 TraceCheckUtils]: 129: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,762 INFO L280 TraceCheckUtils]: 130: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,762 INFO L280 TraceCheckUtils]: 131: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,762 INFO L280 TraceCheckUtils]: 132: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,763 INFO L280 TraceCheckUtils]: 133: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,764 INFO L275 TraceCheckUtils]: 134: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,764 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~ret0;havoc #t~ret1; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,765 INFO L280 TraceCheckUtils]: 136: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,766 INFO L275 TraceCheckUtils]: 137: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-17 22:07:28,766 INFO L280 TraceCheckUtils]: 138: Hoare triple {1908#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1908#false} is VALID [2020-07-17 22:07:28,766 INFO L280 TraceCheckUtils]: 139: Hoare triple {1908#false} assume true; {1908#false} is VALID [2020-07-17 22:07:28,767 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1908#false} {1907#true} #38#return; {1908#false} is VALID [2020-07-17 22:07:28,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2020-07-17 22:07:28,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,785 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-17 22:07:28,785 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret4 := main(); {1907#true} is VALID [2020-07-17 22:07:28,785 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-17 22:07:28,785 INFO L263 TraceCheckUtils]: 5: Hoare triple {1907#true} call #t~ret3 := fibonacci(~x~0); {1907#true} is VALID [2020-07-17 22:07:28,786 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,786 INFO L280 TraceCheckUtils]: 7: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,786 INFO L280 TraceCheckUtils]: 8: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,786 INFO L263 TraceCheckUtils]: 9: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,787 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,787 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-17 22:07:28,788 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-17 22:07:28,788 INFO L263 TraceCheckUtils]: 13: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,789 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-17 22:07:28,790 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-17 22:07:28,790 INFO L263 TraceCheckUtils]: 17: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,791 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-17 22:07:28,792 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-17 22:07:28,792 INFO L263 TraceCheckUtils]: 21: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,792 INFO L280 TraceCheckUtils]: 22: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,793 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-17 22:07:28,794 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-17 22:07:28,794 INFO L280 TraceCheckUtils]: 25: Hoare triple {2271#(<= |fibonacci_#in~n| 1)} assume true; {2271#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-17 22:07:28,796 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-17 22:07:28,797 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-17 22:07:28,797 INFO L263 TraceCheckUtils]: 28: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,797 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,798 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,798 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,799 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {2266#(<= |fibonacci_#in~n| 2)} #32#return; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,799 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~ret0;havoc #t~ret1; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,800 INFO L280 TraceCheckUtils]: 34: Hoare triple {2266#(<= |fibonacci_#in~n| 2)} assume true; {2266#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-17 22:07:28,801 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-17 22:07:28,802 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-17 22:07:28,802 INFO L263 TraceCheckUtils]: 37: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,802 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,803 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,803 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,803 INFO L280 TraceCheckUtils]: 41: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,804 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1907#true} {2255#(<= |fibonacci_#in~n| 3)} #32#return; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,806 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~ret0;havoc #t~ret1; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,806 INFO L280 TraceCheckUtils]: 44: Hoare triple {2255#(<= |fibonacci_#in~n| 3)} assume true; {2255#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-17 22:07:28,808 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-17 22:07:28,809 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-17 22:07:28,809 INFO L263 TraceCheckUtils]: 47: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,809 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,810 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,810 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,810 INFO L263 TraceCheckUtils]: 51: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,810 INFO L280 TraceCheckUtils]: 52: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,811 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,811 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,811 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,811 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,811 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,812 INFO L263 TraceCheckUtils]: 58: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,812 INFO L280 TraceCheckUtils]: 59: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,812 INFO L280 TraceCheckUtils]: 60: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,812 INFO L280 TraceCheckUtils]: 61: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,812 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,813 INFO L280 TraceCheckUtils]: 63: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,813 INFO L280 TraceCheckUtils]: 64: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,814 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {1907#true} {2218#(<= |fibonacci_#in~n| 4)} #32#return; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,815 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~ret0;havoc #t~ret1; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,816 INFO L280 TraceCheckUtils]: 67: Hoare triple {2218#(<= |fibonacci_#in~n| 4)} assume true; {2218#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-17 22:07:28,817 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2218#(<= |fibonacci_#in~n| 4)} {1907#true} #30#return; {2111#(<= fibonacci_~n 5)} is VALID [2020-07-17 22:07:28,818 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-17 22:07:28,818 INFO L263 TraceCheckUtils]: 70: Hoare triple {2111#(<= fibonacci_~n 5)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,819 INFO L280 TraceCheckUtils]: 71: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,819 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-17 22:07:28,820 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-17 22:07:28,820 INFO L263 TraceCheckUtils]: 74: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,821 INFO L280 TraceCheckUtils]: 75: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,821 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-17 22:07:28,822 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-17 22:07:28,822 INFO L263 TraceCheckUtils]: 78: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,822 INFO L280 TraceCheckUtils]: 79: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,823 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-17 22:07:28,824 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-17 22:07:28,824 INFO L263 TraceCheckUtils]: 82: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,825 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} ~n := #in~n; {2185#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,825 INFO L280 TraceCheckUtils]: 84: Hoare triple {2185#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,826 INFO L280 TraceCheckUtils]: 85: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,826 INFO L263 TraceCheckUtils]: 86: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,827 INFO L280 TraceCheckUtils]: 87: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,827 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,827 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,828 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,829 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,830 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-17 22:07:28,830 INFO L263 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,830 INFO L280 TraceCheckUtils]: 94: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,830 INFO L280 TraceCheckUtils]: 95: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,830 INFO L280 TraceCheckUtils]: 96: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,831 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,832 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,833 INFO L280 TraceCheckUtils]: 99: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,834 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-17 22:07:28,835 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-17 22:07:28,835 INFO L263 TraceCheckUtils]: 102: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,835 INFO L280 TraceCheckUtils]: 103: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,836 INFO L280 TraceCheckUtils]: 104: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,836 INFO L280 TraceCheckUtils]: 105: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,836 INFO L280 TraceCheckUtils]: 106: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,837 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,838 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,839 INFO L280 TraceCheckUtils]: 109: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,840 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-17 22:07:28,841 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-17 22:07:28,841 INFO L263 TraceCheckUtils]: 112: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,841 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,841 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,841 INFO L280 TraceCheckUtils]: 115: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:28,841 INFO L263 TraceCheckUtils]: 116: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:28,842 INFO L280 TraceCheckUtils]: 117: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,842 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,842 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,842 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,842 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L263 TraceCheckUtils]: 123: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L280 TraceCheckUtils]: 124: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L280 TraceCheckUtils]: 125: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L280 TraceCheckUtils]: 126: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,843 INFO L275 TraceCheckUtils]: 127: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:28,844 INFO L280 TraceCheckUtils]: 128: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:28,844 INFO L280 TraceCheckUtils]: 129: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,845 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,845 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~ret0;havoc #t~ret1; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,846 INFO L280 TraceCheckUtils]: 132: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,847 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-17 22:07:28,848 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-17 22:07:28,848 INFO L263 TraceCheckUtils]: 135: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:28,848 INFO L280 TraceCheckUtils]: 136: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:28,848 INFO L280 TraceCheckUtils]: 137: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:28,849 INFO L280 TraceCheckUtils]: 138: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:28,849 INFO L280 TraceCheckUtils]: 139: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:28,850 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,850 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~ret0;havoc #t~ret1; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,851 INFO L280 TraceCheckUtils]: 142: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:28,852 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {2340#(<= 4 |fibonacci_#in~n|)} {2111#(<= fibonacci_~n 5)} #32#return; {1908#false} is VALID [2020-07-17 22:07:28,852 INFO L280 TraceCheckUtils]: 144: Hoare triple {1908#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1908#false} is VALID [2020-07-17 22:07:28,852 INFO L280 TraceCheckUtils]: 145: Hoare triple {1908#false} assume true; {1908#false} is VALID [2020-07-17 22:07:28,853 INFO L275 TraceCheckUtils]: 146: Hoare quadruple {1908#false} {1907#true} #38#return; {1908#false} is VALID [2020-07-17 22:07:28,853 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-17 22:07:28,853 INFO L280 TraceCheckUtils]: 148: Hoare triple {1908#false} assume !(5 != ~x~0 || 3 == ~result~0); {1908#false} is VALID [2020-07-17 22:07:28,853 INFO L280 TraceCheckUtils]: 149: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-17 22:07:28,874 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-17 22:07:28,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660104196] [2020-07-17 22:07:28,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454436449] [2020-07-17 22:07:28,875 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-17 22:07:28,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:07:28,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:07:28,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:07:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:07:28,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:07:29,286 INFO L263 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2020-07-17 22:07:29,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,287 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #34#return; {1907#true} is VALID [2020-07-17 22:07:29,287 INFO L263 TraceCheckUtils]: 3: Hoare triple {1907#true} call #t~ret4 := main(); {1907#true} is VALID [2020-07-17 22:07:29,288 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-17 22:07:29,288 INFO L263 TraceCheckUtils]: 5: Hoare triple {1907#true} call #t~ret3 := fibonacci(~x~0); {1907#true} is VALID [2020-07-17 22:07:29,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,289 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-17 22:07:29,290 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-17 22:07:29,290 INFO L263 TraceCheckUtils]: 9: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L280 TraceCheckUtils]: 12: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L263 TraceCheckUtils]: 13: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L280 TraceCheckUtils]: 14: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L280 TraceCheckUtils]: 15: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:29,291 INFO L263 TraceCheckUtils]: 17: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L263 TraceCheckUtils]: 21: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 22: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 24: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,292 INFO L280 TraceCheckUtils]: 25: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L280 TraceCheckUtils]: 27: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L263 TraceCheckUtils]: 28: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L280 TraceCheckUtils]: 29: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L280 TraceCheckUtils]: 30: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L280 TraceCheckUtils]: 31: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,293 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L280 TraceCheckUtils]: 33: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L280 TraceCheckUtils]: 34: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L280 TraceCheckUtils]: 36: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L263 TraceCheckUtils]: 37: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,294 INFO L280 TraceCheckUtils]: 38: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,295 INFO L280 TraceCheckUtils]: 39: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,295 INFO L280 TraceCheckUtils]: 40: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,295 INFO L280 TraceCheckUtils]: 41: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,295 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:29,295 INFO L280 TraceCheckUtils]: 43: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L280 TraceCheckUtils]: 44: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L280 TraceCheckUtils]: 46: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L263 TraceCheckUtils]: 47: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L280 TraceCheckUtils]: 48: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,296 INFO L280 TraceCheckUtils]: 49: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,297 INFO L280 TraceCheckUtils]: 50: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:29,297 INFO L263 TraceCheckUtils]: 51: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,297 INFO L280 TraceCheckUtils]: 52: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,297 INFO L280 TraceCheckUtils]: 53: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,297 INFO L280 TraceCheckUtils]: 54: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L280 TraceCheckUtils]: 55: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L280 TraceCheckUtils]: 57: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L263 TraceCheckUtils]: 58: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L280 TraceCheckUtils]: 59: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,298 INFO L280 TraceCheckUtils]: 60: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L280 TraceCheckUtils]: 61: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L280 TraceCheckUtils]: 63: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L280 TraceCheckUtils]: 64: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:29,299 INFO L280 TraceCheckUtils]: 66: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:29,300 INFO L280 TraceCheckUtils]: 67: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,301 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-17 22:07:29,301 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-17 22:07:29,301 INFO L263 TraceCheckUtils]: 70: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,302 INFO L280 TraceCheckUtils]: 71: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,302 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-17 22:07:29,303 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-17 22:07:29,303 INFO L263 TraceCheckUtils]: 74: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,304 INFO L280 TraceCheckUtils]: 75: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,304 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-17 22:07:29,305 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-17 22:07:29,305 INFO L263 TraceCheckUtils]: 78: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,306 INFO L280 TraceCheckUtils]: 79: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,306 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-17 22:07:29,307 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-17 22:07:29,307 INFO L263 TraceCheckUtils]: 82: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,307 INFO L280 TraceCheckUtils]: 83: Hoare triple {1907#true} ~n := #in~n; {2461#(<= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,312 INFO L280 TraceCheckUtils]: 84: Hoare triple {2461#(<= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,313 INFO L280 TraceCheckUtils]: 85: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,313 INFO L263 TraceCheckUtils]: 86: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,313 INFO L280 TraceCheckUtils]: 87: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,313 INFO L280 TraceCheckUtils]: 88: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,314 INFO L280 TraceCheckUtils]: 89: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,314 INFO L280 TraceCheckUtils]: 90: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,315 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #30#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,315 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-17 22:07:29,315 INFO L263 TraceCheckUtils]: 93: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,316 INFO L280 TraceCheckUtils]: 94: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,316 INFO L280 TraceCheckUtils]: 95: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:29,316 INFO L280 TraceCheckUtils]: 96: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,317 INFO L275 TraceCheckUtils]: 97: Hoare quadruple {1907#true} {2421#(<= 1 |fibonacci_#in~n|)} #32#return; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,317 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~ret0;havoc #t~ret1; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,318 INFO L280 TraceCheckUtils]: 99: Hoare triple {2421#(<= 1 |fibonacci_#in~n|)} assume true; {2421#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,327 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-17 22:07:29,328 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-17 22:07:29,328 INFO L263 TraceCheckUtils]: 102: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,329 INFO L280 TraceCheckUtils]: 103: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,329 INFO L280 TraceCheckUtils]: 104: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,329 INFO L280 TraceCheckUtils]: 105: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,329 INFO L280 TraceCheckUtils]: 106: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,330 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {1907#true} {2415#(<= 2 |fibonacci_#in~n|)} #32#return; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,331 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~ret0;havoc #t~ret1; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,331 INFO L280 TraceCheckUtils]: 109: Hoare triple {2415#(<= 2 |fibonacci_#in~n|)} assume true; {2415#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,332 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-17 22:07:29,333 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-17 22:07:29,333 INFO L263 TraceCheckUtils]: 112: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,333 INFO L280 TraceCheckUtils]: 113: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,334 INFO L280 TraceCheckUtils]: 114: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,334 INFO L280 TraceCheckUtils]: 115: Hoare triple {1907#true} assume !(1 == ~n); {1907#true} is VALID [2020-07-17 22:07:29,334 INFO L263 TraceCheckUtils]: 116: Hoare triple {1907#true} call #t~ret0 := fibonacci(~n - 1); {1907#true} is VALID [2020-07-17 22:07:29,334 INFO L280 TraceCheckUtils]: 117: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,334 INFO L280 TraceCheckUtils]: 118: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L280 TraceCheckUtils]: 119: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L280 TraceCheckUtils]: 120: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L275 TraceCheckUtils]: 121: Hoare quadruple {1907#true} {1907#true} #30#return; {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L280 TraceCheckUtils]: 122: Hoare triple {1907#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L263 TraceCheckUtils]: 123: Hoare triple {1907#true} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,335 INFO L280 TraceCheckUtils]: 124: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,336 INFO L280 TraceCheckUtils]: 125: Hoare triple {1907#true} assume ~n < 1;#res := 0; {1907#true} is VALID [2020-07-17 22:07:29,336 INFO L280 TraceCheckUtils]: 126: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,336 INFO L275 TraceCheckUtils]: 127: Hoare quadruple {1907#true} {1907#true} #32#return; {1907#true} is VALID [2020-07-17 22:07:29,336 INFO L280 TraceCheckUtils]: 128: Hoare triple {1907#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {1907#true} is VALID [2020-07-17 22:07:29,336 INFO L280 TraceCheckUtils]: 129: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,337 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {1907#true} {2378#(<= 3 |fibonacci_#in~n|)} #32#return; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,338 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~ret0;havoc #t~ret1; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,338 INFO L280 TraceCheckUtils]: 132: Hoare triple {2378#(<= 3 |fibonacci_#in~n|)} assume true; {2378#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,340 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-17 22:07:29,340 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-17 22:07:29,340 INFO L263 TraceCheckUtils]: 135: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1907#true} is VALID [2020-07-17 22:07:29,341 INFO L280 TraceCheckUtils]: 136: Hoare triple {1907#true} ~n := #in~n; {1907#true} is VALID [2020-07-17 22:07:29,341 INFO L280 TraceCheckUtils]: 137: Hoare triple {1907#true} assume !(~n < 1); {1907#true} is VALID [2020-07-17 22:07:29,341 INFO L280 TraceCheckUtils]: 138: Hoare triple {1907#true} assume 1 == ~n;#res := 1; {1907#true} is VALID [2020-07-17 22:07:29,341 INFO L280 TraceCheckUtils]: 139: Hoare triple {1907#true} assume true; {1907#true} is VALID [2020-07-17 22:07:29,342 INFO L275 TraceCheckUtils]: 140: Hoare quadruple {1907#true} {2340#(<= 4 |fibonacci_#in~n|)} #32#return; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,342 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~ret0;havoc #t~ret1; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,343 INFO L280 TraceCheckUtils]: 142: Hoare triple {2340#(<= 4 |fibonacci_#in~n|)} assume true; {2340#(<= 4 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,344 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-17 22:07:29,345 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~ret0;havoc #t~ret1; {2873#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,345 INFO L280 TraceCheckUtils]: 145: Hoare triple {2873#(<= 6 |fibonacci_#in~n|)} assume true; {2873#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-17 22:07:29,346 INFO L275 TraceCheckUtils]: 146: Hoare quadruple {2873#(<= 6 |fibonacci_#in~n|)} {1907#true} #38#return; {2883#(<= 6 main_~x~0)} is VALID [2020-07-17 22:07:29,362 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-17 22:07:29,364 INFO L280 TraceCheckUtils]: 148: Hoare triple {2883#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {1908#false} is VALID [2020-07-17 22:07:29,364 INFO L280 TraceCheckUtils]: 149: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2020-07-17 22:07:29,379 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-17 22:07:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:07:29,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2020-07-17 22:07:29,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061451484] [2020-07-17 22:07:29,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2020-07-17 22:07:30,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:07:30,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:07:30,190 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-17 22:07:30,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:07:30,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:07:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:07:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:07:30,191 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 15 states. [2020-07-17 22:07:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:31,773 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2020-07-17 22:07:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 22:07:31,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2020-07-17 22:07:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:07:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:07:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2020-07-17 22:07:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:07:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2020-07-17 22:07:31,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 143 transitions. [2020-07-17 22:07:31,987 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-17 22:07:31,991 INFO L225 Difference]: With dead ends: 121 [2020-07-17 22:07:31,992 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:07:31,994 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-17 22:07:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:07:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2020-07-17 22:07:32,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:07:32,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 61 states. [2020-07-17 22:07:32,039 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 61 states. [2020-07-17 22:07:32,039 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 61 states. [2020-07-17 22:07:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:32,044 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-17 22:07:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-17 22:07:32,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:32,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:32,045 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 65 states. [2020-07-17 22:07:32,045 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 65 states. [2020-07-17 22:07:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:07:32,049 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-17 22:07:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-17 22:07:32,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:07:32,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:07:32,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:07:32,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:07:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 22:07:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2020-07-17 22:07:32,054 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 150 [2020-07-17 22:07:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:07:32,055 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2020-07-17 22:07:32,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:07:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2020-07-17 22:07:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-17 22:07:32,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:07:32,057 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-17 22:07:32,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:07:32,271 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:07:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:07:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 5 times [2020-07-17 22:07:32,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:07:32,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034868605] [2020-07-17 22:07:32,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:07:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:07:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:07:32,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:07:32,333 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-17 22:07:32,340 INFO L168 Benchmark]: Toolchain (without parser) took 11983.02 ms. Allocated memory was 144.7 MB in the beginning and 372.8 MB in the end (delta: 228.1 MB). Free memory was 101.8 MB in the beginning and 117.4 MB in the end (delta: -15.6 MB). Peak memory consumption was 212.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,341 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.84 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 91.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,342 INFO L168 Benchmark]: Boogie Preprocessor took 31.13 ms. Allocated memory is still 144.7 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,343 INFO L168 Benchmark]: RCFGBuilder took 401.68 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.4 MB in the beginning and 165.6 MB in the end (delta: -75.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,343 INFO L168 Benchmark]: TraceAbstraction took 11300.92 ms. Allocated memory was 201.9 MB in the beginning and 372.8 MB in the end (delta: 170.9 MB). Free memory was 164.9 MB in the beginning and 117.4 MB in the end (delta: 47.5 MB). Peak memory consumption was 218.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:07:32,346 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.84 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 91.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.13 ms. Allocated memory is still 144.7 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.68 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.4 MB in the beginning and 165.6 MB in the end (delta: -75.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11300.92 ms. Allocated memory was 201.9 MB in the beginning and 372.8 MB in the end (delta: 170.9 MB). Free memory was 164.9 MB in the beginning and 117.4 MB in the end (delta: 47.5 MB). Peak memory consumption was 218.4 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...