/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:36:12,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:36:12,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:36:12,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:36:12,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:36:12,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:36:12,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:36:12,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:36:12,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:36:12,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:36:12,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:36:12,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:36:12,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:36:12,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:36:12,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:36:12,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:36:12,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:36:12,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:36:12,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:36:12,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:36:12,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:36:12,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:36:12,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:36:12,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:36:12,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:36:12,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:36:12,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:36:12,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:36:12,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:36:12,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:36:12,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:36:12,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:36:12,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:36:12,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:36:12,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:36:12,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:36:12,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:36:12,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:36:12,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:36:12,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:36:12,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:36:12,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:36:12,318 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:36:12,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:36:12,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:36:12,320 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:36:12,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:36:12,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:36:12,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:36:12,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:36:12,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:36:12,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:36:12,321 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:36:12,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:36:12,321 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:36:12,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:36:12,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:36:12,322 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:36:12,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:36:12,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:36:12,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:12,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:36:12,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:36:12,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:36:12,324 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:36:12,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:36:12,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:36:12,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:36:12,639 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:36:12,639 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:36:12,640 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-10 18:36:12,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb71c364/74b4eccf065e4da4a051b67246736830/FLAG330ff6f58 [2020-07-10 18:36:13,131 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:36:13,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-07-10 18:36:13,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb71c364/74b4eccf065e4da4a051b67246736830/FLAG330ff6f58 [2020-07-10 18:36:13,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb71c364/74b4eccf065e4da4a051b67246736830 [2020-07-10 18:36:13,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:36:13,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:36:13,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:13,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:36:13,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:36:13,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff49edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13, skipping insertion in model container [2020-07-10 18:36:13,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:36:13,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:36:13,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:13,711 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:36:13,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:36:13,744 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:36:13,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13 WrapperNode [2020-07-10 18:36:13,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:36:13,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:36:13,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:36:13,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:36:13,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... [2020-07-10 18:36:13,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:36:13,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:36:13,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:36:13,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:36:13,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:36:13,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:36:13,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:36:13,912 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-10 18:36:13,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:36:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:36:14,165 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:36:14,166 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:36:14,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:14 BoogieIcfgContainer [2020-07-10 18:36:14,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:36:14,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:36:14,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:36:14,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:36:14,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:36:13" (1/3) ... [2020-07-10 18:36:14,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c6e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:14, skipping insertion in model container [2020-07-10 18:36:14,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:13" (2/3) ... [2020-07-10 18:36:14,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c6e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:14, skipping insertion in model container [2020-07-10 18:36:14,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:14" (3/3) ... [2020-07-10 18:36:14,179 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-07-10 18:36:14,191 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:36:14,199 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:36:14,225 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:36:14,285 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:36:14,285 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:36:14,290 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:36:14,291 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:36:14,291 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:36:14,291 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:36:14,291 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:36:14,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:36:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 18:36:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 18:36:14,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:14,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:14,328 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-10 18:36:14,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:14,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855806673] [2020-07-10 18:36:14,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 18:36:14,557 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-10 18:36:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:14,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,674 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-10 18:36:14,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-10 18:36:14,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 18:36:14,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #44#return; {36#true} is VALID [2020-07-10 18:36:14,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret4 := main(); {36#true} is VALID [2020-07-10 18:36:14,676 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {36#true} is VALID [2020-07-10 18:36:14,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~x~0 := #t~nondet2; {36#true} is VALID [2020-07-10 18:36:14,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet2; {36#true} is VALID [2020-07-10 18:36:14,678 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := fibonacci(~x~0); {36#true} is VALID [2020-07-10 18:36:14,680 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~n := #in~n; {46#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:14,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,684 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#(<= |fibonacci_#in~n| 0)} #res := 0; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,688 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(<= |fibonacci_#in~n| 0)} assume true; {47#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:14,691 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(<= |fibonacci_#in~n| 0)} {36#true} #48#return; {45#(<= main_~x~0 0)} is VALID [2020-07-10 18:36:14,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(<= main_~x~0 0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {45#(<= main_~x~0 0)} is VALID [2020-07-10 18:36:14,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(<= main_~x~0 0)} ~result~0 := #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-10 18:36:14,694 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(<= main_~x~0 0)} havoc #t~ret3; {45#(<= main_~x~0 0)} is VALID [2020-07-10 18:36:14,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(<= main_~x~0 0)} assume !(5 != ~x~0 || 3 == ~result~0); {37#false} is VALID [2020-07-10 18:36:14,697 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 18:36:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:36:14,702 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:14,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855806673] [2020-07-10 18:36:14,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:14,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:36:14,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535890310] [2020-07-10 18:36:14,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:36:14,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:14,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:36:14,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:36:14,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:36:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:36:14,805 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-10 18:36:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,156 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-10 18:36:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:36:15,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-10 18:36:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-10 18:36:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-10 18:36:15,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-10 18:36:15,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,287 INFO L225 Difference]: With dead ends: 48 [2020-07-10 18:36:15,287 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 18:36:15,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 18:36:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 18:36:15,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:15,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:15,356 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:15,357 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,363 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 18:36:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:15,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:15,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:15,365 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:15,365 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 18:36:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,370 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 18:36:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:15,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:15,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:15,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:15,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 18:36:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-10 18:36:15,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-10 18:36:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:15,378 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-10 18:36:15,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:36:15,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-10 18:36:15,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 18:36:15,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:15,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:15,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:36:15,431 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-10 18:36:15,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:15,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694537048] [2020-07-10 18:36:15,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:36:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-10 18:36:15,469 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-10 18:36:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:15,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,507 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-10 18:36:15,508 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-10 18:36:15,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-10 18:36:15,509 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #44#return; {268#true} is VALID [2020-07-10 18:36:15,509 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret4 := main(); {268#true} is VALID [2020-07-10 18:36:15,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {268#true} is VALID [2020-07-10 18:36:15,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#true} ~x~0 := #t~nondet2; {268#true} is VALID [2020-07-10 18:36:15,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#true} havoc #t~nondet2; {268#true} is VALID [2020-07-10 18:36:15,510 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#true} call #t~ret3 := fibonacci(~x~0); {268#true} is VALID [2020-07-10 18:36:15,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#true} ~n := #in~n; {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {279#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:15,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {280#(<= |fibonacci_#in~n| 1)} #res := 1; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {280#(<= |fibonacci_#in~n| 1)} assume true; {280#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:15,515 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {280#(<= |fibonacci_#in~n| 1)} {268#true} #48#return; {278#(<= main_~x~0 1)} is VALID [2020-07-10 18:36:15,516 INFO L280 TraceCheckUtils]: 14: Hoare triple {278#(<= main_~x~0 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {278#(<= main_~x~0 1)} is VALID [2020-07-10 18:36:15,517 INFO L280 TraceCheckUtils]: 15: Hoare triple {278#(<= main_~x~0 1)} ~result~0 := #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-10 18:36:15,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {278#(<= main_~x~0 1)} havoc #t~ret3; {278#(<= main_~x~0 1)} is VALID [2020-07-10 18:36:15,519 INFO L280 TraceCheckUtils]: 17: Hoare triple {278#(<= main_~x~0 1)} assume !(5 != ~x~0 || 3 == ~result~0); {269#false} is VALID [2020-07-10 18:36:15,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-10 18:36:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:36:15,521 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:15,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694537048] [2020-07-10 18:36:15,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:15,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 18:36:15,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148970250] [2020-07-10 18:36:15,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 18:36:15,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:15,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 18:36:15,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 18:36:15,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 18:36:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:36:15,548 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-10 18:36:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,736 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 18:36:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 18:36:15,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 18:36:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 18:36:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 18:36:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-10 18:36:15,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-10 18:36:15,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,799 INFO L225 Difference]: With dead ends: 38 [2020-07-10 18:36:15,799 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 18:36:15,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 18:36:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 18:36:15,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:15,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 18:36:15,835 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 18:36:15,835 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 18:36:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,840 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-10 18:36:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-10 18:36:15,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:15,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:15,841 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 18:36:15,842 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 18:36:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:15,845 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-10 18:36:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-10 18:36:15,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:15,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:15,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:15,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 18:36:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-10 18:36:15,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-10 18:36:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:15,851 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-10 18:36:15,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 18:36:15,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2020-07-10 18:36:15,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 18:36:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 18:36:15,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:15,909 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:15,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:36:15,909 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-10 18:36:15,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:15,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459105162] [2020-07-10 18:36:15,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 61 to 113 [2020-07-10 18:36:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 18:36:16,043 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-10 18:36:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,125 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,127 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-10 18:36:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-10 18:36:16,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-10 18:36:16,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-10 18:36:16,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 18:36:16,137 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-10 18:36:16,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-10 18:36:16,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-10 18:36:16,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-10 18:36:16,140 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-10 18:36:16,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,146 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-10 18:36:16,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-10 18:36:16,147 INFO L263 TraceCheckUtils]: 10: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-10 18:36:16,148 INFO L280 TraceCheckUtils]: 11: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-10 18:36:16,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-10 18:36:16,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-10 18:36:16,149 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 18:36:16,149 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-10 18:36:16,149 INFO L280 TraceCheckUtils]: 16: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-10 18:36:16,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-10 18:36:16,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-10 18:36:16,151 INFO L280 TraceCheckUtils]: 19: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-10 18:36:16,151 INFO L280 TraceCheckUtils]: 20: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-10 18:36:16,151 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-10 18:36:16,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-10 18:36:16,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 18:36:16,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #44#return; {485#true} is VALID [2020-07-10 18:36:16,154 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret4 := main(); {485#true} is VALID [2020-07-10 18:36:16,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {485#true} is VALID [2020-07-10 18:36:16,155 INFO L280 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := #t~nondet2; {485#true} is VALID [2020-07-10 18:36:16,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#true} havoc #t~nondet2; {485#true} is VALID [2020-07-10 18:36:16,156 INFO L263 TraceCheckUtils]: 7: Hoare triple {485#true} call #t~ret3 := fibonacci(~x~0); {485#true} is VALID [2020-07-10 18:36:16,156 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-10 18:36:16,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume !(~n < 1); {511#(< 0 fibonacci_~n)} is VALID [2020-07-10 18:36:16,158 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#(< 0 fibonacci_~n)} assume !(1 == ~n); {512#(< 1 fibonacci_~n)} is VALID [2020-07-10 18:36:16,159 INFO L263 TraceCheckUtils]: 11: Hoare triple {512#(< 1 fibonacci_~n)} call #t~ret0 := fibonacci(~n - 1); {485#true} is VALID [2020-07-10 18:36:16,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {485#true} ~n := #in~n; {523#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,161 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,162 INFO L280 TraceCheckUtils]: 14: Hoare triple {524#(<= |fibonacci_#in~n| 0)} #res := 0; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,163 INFO L280 TraceCheckUtils]: 15: Hoare triple {524#(<= |fibonacci_#in~n| 0)} assume true; {524#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:16,165 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {524#(<= |fibonacci_#in~n| 0)} {512#(< 1 fibonacci_~n)} #40#return; {486#false} is VALID [2020-07-10 18:36:16,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {486#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {486#false} is VALID [2020-07-10 18:36:16,165 INFO L263 TraceCheckUtils]: 18: Hoare triple {486#false} call #t~ret1 := fibonacci(~n - 2); {485#true} is VALID [2020-07-10 18:36:16,166 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#true} ~n := #in~n; {485#true} is VALID [2020-07-10 18:36:16,166 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#true} assume ~n < 1; {485#true} is VALID [2020-07-10 18:36:16,166 INFO L280 TraceCheckUtils]: 21: Hoare triple {485#true} #res := 0; {485#true} is VALID [2020-07-10 18:36:16,167 INFO L280 TraceCheckUtils]: 22: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 18:36:16,167 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {485#true} {486#false} #42#return; {486#false} is VALID [2020-07-10 18:36:16,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {486#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {486#false} is VALID [2020-07-10 18:36:16,168 INFO L280 TraceCheckUtils]: 25: Hoare triple {486#false} #res := #t~ret0 + #t~ret1; {486#false} is VALID [2020-07-10 18:36:16,168 INFO L280 TraceCheckUtils]: 26: Hoare triple {486#false} havoc #t~ret0; {486#false} is VALID [2020-07-10 18:36:16,169 INFO L280 TraceCheckUtils]: 27: Hoare triple {486#false} havoc #t~ret1; {486#false} is VALID [2020-07-10 18:36:16,169 INFO L280 TraceCheckUtils]: 28: Hoare triple {486#false} assume true; {486#false} is VALID [2020-07-10 18:36:16,169 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {486#false} {485#true} #48#return; {486#false} is VALID [2020-07-10 18:36:16,170 INFO L280 TraceCheckUtils]: 30: Hoare triple {486#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {486#false} is VALID [2020-07-10 18:36:16,170 INFO L280 TraceCheckUtils]: 31: Hoare triple {486#false} ~result~0 := #t~ret3; {486#false} is VALID [2020-07-10 18:36:16,171 INFO L280 TraceCheckUtils]: 32: Hoare triple {486#false} havoc #t~ret3; {486#false} is VALID [2020-07-10 18:36:16,171 INFO L280 TraceCheckUtils]: 33: Hoare triple {486#false} assume !(5 != ~x~0 || 3 == ~result~0); {486#false} is VALID [2020-07-10 18:36:16,171 INFO L280 TraceCheckUtils]: 34: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-10 18:36:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 18:36:16,188 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:16,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459105162] [2020-07-10 18:36:16,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:16,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:36:16,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286124399] [2020-07-10 18:36:16,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 18:36:16,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:16,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:36:16,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:36:16,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:16,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:36:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:16,234 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-10 18:36:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,509 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-10 18:36:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:36:16,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-10 18:36:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 18:36:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 18:36:16,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-10 18:36:16,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,609 INFO L225 Difference]: With dead ends: 54 [2020-07-10 18:36:16,609 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 18:36:16,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 18:36:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 18:36:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 18:36:16,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:16,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:16,651 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:16,651 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,654 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 18:36:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 18:36:16,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:16,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:16,656 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:16,656 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 18:36:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:16,658 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 18:36:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 18:36:16,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:16,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:16,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:16,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 18:36:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 18:36:16,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-10 18:36:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:16,665 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 18:36:16,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:36:16,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2020-07-10 18:36:16,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 18:36:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 18:36:16,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:16,717 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:16,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:36:16,718 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-10 18:36:16,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:16,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155640457] [2020-07-10 18:36:16,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-10 18:36:16,799 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-10 18:36:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,903 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:16,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-10 18:36:16,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-10 18:36:16,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-10 18:36:16,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-10 18:36:16,912 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,915 INFO L263 TraceCheckUtils]: 3: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-10 18:36:16,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,916 INFO L280 TraceCheckUtils]: 5: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,920 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,922 INFO L263 TraceCheckUtils]: 11: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-10 18:36:16,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-10 18:36:16,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-10 18:36:16,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-10 18:36:16,923 INFO L280 TraceCheckUtils]: 15: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-10 18:36:16,925 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,926 INFO L280 TraceCheckUtils]: 17: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,928 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,930 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,930 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,932 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-10 18:36:16,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2020-07-10 18:36:16,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-10 18:36:16,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #44#return; {771#true} is VALID [2020-07-10 18:36:16,933 INFO L263 TraceCheckUtils]: 3: Hoare triple {771#true} call #t~ret4 := main(); {771#true} is VALID [2020-07-10 18:36:16,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {771#true} is VALID [2020-07-10 18:36:16,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {771#true} ~x~0 := #t~nondet2; {771#true} is VALID [2020-07-10 18:36:16,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {771#true} havoc #t~nondet2; {771#true} is VALID [2020-07-10 18:36:16,934 INFO L263 TraceCheckUtils]: 7: Hoare triple {771#true} call #t~ret3 := fibonacci(~x~0); {771#true} is VALID [2020-07-10 18:36:16,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,936 INFO L280 TraceCheckUtils]: 9: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,937 INFO L263 TraceCheckUtils]: 11: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {771#true} is VALID [2020-07-10 18:36:16,938 INFO L280 TraceCheckUtils]: 12: Hoare triple {771#true} ~n := #in~n; {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,938 INFO L280 TraceCheckUtils]: 13: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {799#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:16,939 INFO L280 TraceCheckUtils]: 14: Hoare triple {799#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,940 INFO L280 TraceCheckUtils]: 15: Hoare triple {812#(<= |fibonacci_#in~n| 1)} #res := 1; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,940 INFO L280 TraceCheckUtils]: 16: Hoare triple {812#(<= |fibonacci_#in~n| 1)} assume true; {812#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:16,942 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {812#(<= |fibonacci_#in~n| 1)} {799#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,943 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,943 INFO L263 TraceCheckUtils]: 19: Hoare triple {806#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {771#true} is VALID [2020-07-10 18:36:16,943 INFO L280 TraceCheckUtils]: 20: Hoare triple {771#true} ~n := #in~n; {771#true} is VALID [2020-07-10 18:36:16,943 INFO L280 TraceCheckUtils]: 21: Hoare triple {771#true} assume ~n < 1; {771#true} is VALID [2020-07-10 18:36:16,944 INFO L280 TraceCheckUtils]: 22: Hoare triple {771#true} #res := 0; {771#true} is VALID [2020-07-10 18:36:16,944 INFO L280 TraceCheckUtils]: 23: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-10 18:36:16,945 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {771#true} {806#(<= |fibonacci_#in~n| 2)} #42#return; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,946 INFO L280 TraceCheckUtils]: 25: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,946 INFO L280 TraceCheckUtils]: 26: Hoare triple {806#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,947 INFO L280 TraceCheckUtils]: 27: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,948 INFO L280 TraceCheckUtils]: 28: Hoare triple {806#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,948 INFO L280 TraceCheckUtils]: 29: Hoare triple {806#(<= |fibonacci_#in~n| 2)} assume true; {806#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:16,949 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {806#(<= |fibonacci_#in~n| 2)} {771#true} #48#return; {798#(<= main_~x~0 2)} is VALID [2020-07-10 18:36:16,950 INFO L280 TraceCheckUtils]: 31: Hoare triple {798#(<= main_~x~0 2)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {798#(<= main_~x~0 2)} is VALID [2020-07-10 18:36:16,951 INFO L280 TraceCheckUtils]: 32: Hoare triple {798#(<= main_~x~0 2)} ~result~0 := #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-10 18:36:16,951 INFO L280 TraceCheckUtils]: 33: Hoare triple {798#(<= main_~x~0 2)} havoc #t~ret3; {798#(<= main_~x~0 2)} is VALID [2020-07-10 18:36:16,952 INFO L280 TraceCheckUtils]: 34: Hoare triple {798#(<= main_~x~0 2)} assume !(5 != ~x~0 || 3 == ~result~0); {772#false} is VALID [2020-07-10 18:36:16,952 INFO L280 TraceCheckUtils]: 35: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-10 18:36:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 18:36:16,954 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:16,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155640457] [2020-07-10 18:36:16,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:16,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:36:16,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528366926] [2020-07-10 18:36:16,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-10 18:36:16,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:16,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:36:17,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:17,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:36:17,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:36:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:36:17,008 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-07-10 18:36:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,366 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-10 18:36:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 18:36:17,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-10 18:36:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-10 18:36:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:36:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-10 18:36:17,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-10 18:36:17,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:17,469 INFO L225 Difference]: With dead ends: 58 [2020-07-10 18:36:17,470 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 18:36:17,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-10 18:36:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 18:36:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 18:36:17,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:17,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 18:36:17,553 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 18:36:17,553 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 18:36:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,558 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-10 18:36:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-10 18:36:17,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:17,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:17,559 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 18:36:17,559 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 18:36:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:17,564 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2020-07-10 18:36:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-10 18:36:17,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:17,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:17,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:17,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 18:36:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-10 18:36:17,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-10 18:36:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:17,570 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-10 18:36:17,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:36:17,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2020-07-10 18:36:17,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-10 18:36:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 18:36:17,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:17,654 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:17,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:36:17,655 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-10 18:36:17,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:17,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554274058] [2020-07-10 18:36:17,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,814 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-10 18:36:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-10 18:36:17,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-10 18:36:17,913 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,916 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-10 18:36:17,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-10 18:36:17,923 INFO L280 TraceCheckUtils]: 3: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,924 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:17,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,927 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-10 18:36:17,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-10 18:36:17,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-10 18:36:17,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,929 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,930 INFO L263 TraceCheckUtils]: 11: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-10 18:36:17,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-10 18:36:17,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-10 18:36:17,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,931 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,932 INFO L280 TraceCheckUtils]: 17: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,933 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,934 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:17,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,960 INFO L280 TraceCheckUtils]: 3: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,961 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-10 18:36:17,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-10 18:36:17,963 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-10 18:36:17,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:17,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,965 INFO L263 TraceCheckUtils]: 7: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-10 18:36:17,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-10 18:36:17,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-10 18:36:17,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,969 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,969 INFO L280 TraceCheckUtils]: 14: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,970 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-10 18:36:17,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-10 18:36:17,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-10 18:36:17,971 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,972 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,976 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,977 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,978 INFO L280 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,978 INFO L280 TraceCheckUtils]: 24: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,979 INFO L280 TraceCheckUtils]: 25: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,980 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:17,981 INFO L280 TraceCheckUtils]: 27: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:17,981 INFO L263 TraceCheckUtils]: 28: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-10 18:36:17,983 INFO L280 TraceCheckUtils]: 29: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,985 INFO L280 TraceCheckUtils]: 30: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,987 INFO L280 TraceCheckUtils]: 31: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,988 INFO L280 TraceCheckUtils]: 32: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:17,990 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-10 18:36:17,990 INFO L280 TraceCheckUtils]: 34: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-10 18:36:17,990 INFO L280 TraceCheckUtils]: 35: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-10 18:36:17,990 INFO L280 TraceCheckUtils]: 36: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-10 18:36:17,990 INFO L280 TraceCheckUtils]: 37: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-10 18:36:17,990 INFO L280 TraceCheckUtils]: 38: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-10 18:36:17,991 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-10 18:36:17,993 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-10 18:36:17,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,993 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #44#return; {1145#true} is VALID [2020-07-10 18:36:17,993 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret4 := main(); {1145#true} is VALID [2020-07-10 18:36:17,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} ~x~0 := #t~nondet2; {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#true} havoc #t~nondet2; {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L263 TraceCheckUtils]: 7: Hoare triple {1145#true} call #t~ret3 := fibonacci(~x~0); {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {1145#true} assume !(1 == ~n); {1145#true} is VALID [2020-07-10 18:36:17,995 INFO L263 TraceCheckUtils]: 11: Hoare triple {1145#true} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-10 18:36:17,995 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} is VALID [2020-07-10 18:36:17,997 INFO L280 TraceCheckUtils]: 14: Hoare triple {1219#(and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|))} assume !(1 == ~n); {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,997 INFO L263 TraceCheckUtils]: 15: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1145#true} is VALID [2020-07-10 18:36:17,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#true} assume !(~n < 1); {1145#true} is VALID [2020-07-10 18:36:17,997 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#true} assume 1 == ~n; {1145#true} is VALID [2020-07-10 18:36:17,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#true} #res := 1; {1145#true} is VALID [2020-07-10 18:36:17,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:17,998 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #40#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:17,999 INFO L263 TraceCheckUtils]: 23: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-10 18:36:17,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {1145#true} ~n := #in~n; {1145#true} is VALID [2020-07-10 18:36:17,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#true} assume ~n < 1; {1145#true} is VALID [2020-07-10 18:36:17,999 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#true} #res := 0; {1145#true} is VALID [2020-07-10 18:36:18,000 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-10 18:36:18,000 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1145#true} {1220#(<= 2 |fibonacci_#in~n|)} #42#return; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,001 INFO L280 TraceCheckUtils]: 29: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,001 INFO L280 TraceCheckUtils]: 30: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,002 INFO L280 TraceCheckUtils]: 31: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,003 INFO L280 TraceCheckUtils]: 33: Hoare triple {1220#(<= 2 |fibonacci_#in~n|)} assume true; {1220#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,006 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1220#(<= 2 |fibonacci_#in~n|)} {1145#true} #40#return; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:18,006 INFO L280 TraceCheckUtils]: 35: Hoare triple {1212#(<= 3 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1212#(<= 3 fibonacci_~n)} is VALID [2020-07-10 18:36:18,006 INFO L263 TraceCheckUtils]: 36: Hoare triple {1212#(<= 3 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {1145#true} is VALID [2020-07-10 18:36:18,007 INFO L280 TraceCheckUtils]: 37: Hoare triple {1145#true} ~n := #in~n; {1218#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:18,007 INFO L280 TraceCheckUtils]: 38: Hoare triple {1218#(= fibonacci_~n |fibonacci_#in~n|)} assume ~n < 1; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:18,008 INFO L280 TraceCheckUtils]: 39: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} #res := 0; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:18,008 INFO L280 TraceCheckUtils]: 40: Hoare triple {1232#(<= |fibonacci_#in~n| 0)} assume true; {1232#(<= |fibonacci_#in~n| 0)} is VALID [2020-07-10 18:36:18,009 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1232#(<= |fibonacci_#in~n| 0)} {1212#(<= 3 fibonacci_~n)} #42#return; {1146#false} is VALID [2020-07-10 18:36:18,009 INFO L280 TraceCheckUtils]: 42: Hoare triple {1146#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1146#false} is VALID [2020-07-10 18:36:18,009 INFO L280 TraceCheckUtils]: 43: Hoare triple {1146#false} #res := #t~ret0 + #t~ret1; {1146#false} is VALID [2020-07-10 18:36:18,010 INFO L280 TraceCheckUtils]: 44: Hoare triple {1146#false} havoc #t~ret0; {1146#false} is VALID [2020-07-10 18:36:18,010 INFO L280 TraceCheckUtils]: 45: Hoare triple {1146#false} havoc #t~ret1; {1146#false} is VALID [2020-07-10 18:36:18,010 INFO L280 TraceCheckUtils]: 46: Hoare triple {1146#false} assume true; {1146#false} is VALID [2020-07-10 18:36:18,010 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1146#false} {1145#true} #48#return; {1146#false} is VALID [2020-07-10 18:36:18,011 INFO L280 TraceCheckUtils]: 48: Hoare triple {1146#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1146#false} is VALID [2020-07-10 18:36:18,011 INFO L280 TraceCheckUtils]: 49: Hoare triple {1146#false} ~result~0 := #t~ret3; {1146#false} is VALID [2020-07-10 18:36:18,011 INFO L280 TraceCheckUtils]: 50: Hoare triple {1146#false} havoc #t~ret3; {1146#false} is VALID [2020-07-10 18:36:18,011 INFO L280 TraceCheckUtils]: 51: Hoare triple {1146#false} assume !(5 != ~x~0 || 3 == ~result~0); {1146#false} is VALID [2020-07-10 18:36:18,011 INFO L280 TraceCheckUtils]: 52: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-10 18:36:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-10 18:36:18,014 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:18,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554274058] [2020-07-10 18:36:18,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:18,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 18:36:18,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198537034] [2020-07-10 18:36:18,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-10 18:36:18,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:18,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 18:36:18,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 18:36:18,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 18:36:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:36:18,085 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-07-10 18:36:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:18,549 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-10 18:36:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 18:36:18,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-10 18:36:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-10 18:36:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2020-07-10 18:36:18,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2020-07-10 18:36:18,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:18,663 INFO L225 Difference]: With dead ends: 110 [2020-07-10 18:36:18,664 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 18:36:18,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 18:36:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-10 18:36:18,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:18,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 54 states. [2020-07-10 18:36:18,784 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 54 states. [2020-07-10 18:36:18,784 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 54 states. [2020-07-10 18:36:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:18,790 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-10 18:36:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-10 18:36:18,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:18,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:18,791 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 66 states. [2020-07-10 18:36:18,791 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 66 states. [2020-07-10 18:36:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:18,797 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2020-07-10 18:36:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2020-07-10 18:36:18,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:18,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:18,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:18,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 18:36:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-10 18:36:18,802 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-10 18:36:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:18,803 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-10 18:36:18,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 18:36:18,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2020-07-10 18:36:18,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-10 18:36:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 18:36:18,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:18,907 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:18,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:36:18,907 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-10 18:36:18,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:18,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [241071064] [2020-07-10 18:36:18,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,063 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-10 18:36:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,186 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,190 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-10 18:36:19,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-10 18:36:19,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,196 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-10 18:36:19,201 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,205 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,205 INFO L280 TraceCheckUtils]: 10: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,206 INFO L263 TraceCheckUtils]: 11: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-10 18:36:19,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-10 18:36:19,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-10 18:36:19,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,208 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,208 INFO L280 TraceCheckUtils]: 17: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,209 INFO L280 TraceCheckUtils]: 18: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,209 INFO L280 TraceCheckUtils]: 19: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,210 INFO L280 TraceCheckUtils]: 20: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,210 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,212 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:19,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-10 18:36:19,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-10 18:36:19,229 INFO L280 TraceCheckUtils]: 3: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-10 18:36:19,229 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,230 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,232 INFO L280 TraceCheckUtils]: 2: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-10 18:36:19,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,233 INFO L280 TraceCheckUtils]: 5: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,233 INFO L263 TraceCheckUtils]: 7: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-10 18:36:19,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,236 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,238 INFO L280 TraceCheckUtils]: 12: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,240 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,240 INFO L263 TraceCheckUtils]: 15: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-10 18:36:19,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-10 18:36:19,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-10 18:36:19,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,242 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,243 INFO L280 TraceCheckUtils]: 21: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,244 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,244 INFO L280 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,245 INFO L280 TraceCheckUtils]: 24: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,246 INFO L280 TraceCheckUtils]: 25: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,247 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,247 INFO L280 TraceCheckUtils]: 27: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,248 INFO L263 TraceCheckUtils]: 28: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-10 18:36:19,248 INFO L280 TraceCheckUtils]: 29: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-10 18:36:19,248 INFO L280 TraceCheckUtils]: 31: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-10 18:36:19,249 INFO L280 TraceCheckUtils]: 32: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-10 18:36:19,249 INFO L280 TraceCheckUtils]: 33: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,250 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,251 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,254 INFO L280 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,255 INFO L280 TraceCheckUtils]: 37: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,256 INFO L280 TraceCheckUtils]: 38: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,256 INFO L280 TraceCheckUtils]: 39: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,257 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-10 18:36:19,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2020-07-10 18:36:19,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,260 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1703#true} {1703#true} #44#return; {1703#true} is VALID [2020-07-10 18:36:19,260 INFO L263 TraceCheckUtils]: 3: Hoare triple {1703#true} call #t~ret4 := main(); {1703#true} is VALID [2020-07-10 18:36:19,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {1703#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1703#true} is VALID [2020-07-10 18:36:19,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {1703#true} ~x~0 := #t~nondet2; {1703#true} is VALID [2020-07-10 18:36:19,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {1703#true} havoc #t~nondet2; {1703#true} is VALID [2020-07-10 18:36:19,261 INFO L263 TraceCheckUtils]: 7: Hoare triple {1703#true} call #t~ret3 := fibonacci(~x~0); {1703#true} is VALID [2020-07-10 18:36:19,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,264 INFO L280 TraceCheckUtils]: 10: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,264 INFO L263 TraceCheckUtils]: 11: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-10 18:36:19,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,266 INFO L263 TraceCheckUtils]: 15: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {1703#true} is VALID [2020-07-10 18:36:19,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {1703#true} ~n := #in~n; {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {1749#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:19,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {1749#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} #res := 1; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,269 INFO L280 TraceCheckUtils]: 20: Hoare triple {1792#(<= |fibonacci_#in~n| 1)} assume true; {1792#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:19,270 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1792#(<= |fibonacci_#in~n| 1)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,271 INFO L263 TraceCheckUtils]: 23: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-10 18:36:19,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {1703#true} assume ~n < 1; {1703#true} is VALID [2020-07-10 18:36:19,271 INFO L280 TraceCheckUtils]: 26: Hoare triple {1703#true} #res := 0; {1703#true} is VALID [2020-07-10 18:36:19,272 INFO L280 TraceCheckUtils]: 27: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,272 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1703#true} {1786#(<= |fibonacci_#in~n| 2)} #42#return; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,273 INFO L280 TraceCheckUtils]: 29: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,274 INFO L280 TraceCheckUtils]: 30: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,274 INFO L280 TraceCheckUtils]: 31: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,275 INFO L280 TraceCheckUtils]: 32: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,276 INFO L280 TraceCheckUtils]: 33: Hoare triple {1786#(<= |fibonacci_#in~n| 2)} assume true; {1786#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:19,277 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1786#(<= |fibonacci_#in~n| 2)} {1749#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,278 INFO L280 TraceCheckUtils]: 35: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,278 INFO L263 TraceCheckUtils]: 36: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {1703#true} is VALID [2020-07-10 18:36:19,278 INFO L280 TraceCheckUtils]: 37: Hoare triple {1703#true} ~n := #in~n; {1703#true} is VALID [2020-07-10 18:36:19,278 INFO L280 TraceCheckUtils]: 38: Hoare triple {1703#true} assume !(~n < 1); {1703#true} is VALID [2020-07-10 18:36:19,279 INFO L280 TraceCheckUtils]: 39: Hoare triple {1703#true} assume 1 == ~n; {1703#true} is VALID [2020-07-10 18:36:19,279 INFO L280 TraceCheckUtils]: 40: Hoare triple {1703#true} #res := 1; {1703#true} is VALID [2020-07-10 18:36:19,279 INFO L280 TraceCheckUtils]: 41: Hoare triple {1703#true} assume true; {1703#true} is VALID [2020-07-10 18:36:19,280 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1703#true} {1773#(<= |fibonacci_#in~n| 3)} #42#return; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,281 INFO L280 TraceCheckUtils]: 43: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,281 INFO L280 TraceCheckUtils]: 44: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,282 INFO L280 TraceCheckUtils]: 45: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,282 INFO L280 TraceCheckUtils]: 46: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,283 INFO L280 TraceCheckUtils]: 47: Hoare triple {1773#(<= |fibonacci_#in~n| 3)} assume true; {1773#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:19,284 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1773#(<= |fibonacci_#in~n| 3)} {1703#true} #48#return; {1748#(<= main_~x~0 3)} is VALID [2020-07-10 18:36:19,284 INFO L280 TraceCheckUtils]: 49: Hoare triple {1748#(<= main_~x~0 3)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1748#(<= main_~x~0 3)} is VALID [2020-07-10 18:36:19,285 INFO L280 TraceCheckUtils]: 50: Hoare triple {1748#(<= main_~x~0 3)} ~result~0 := #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-10 18:36:19,285 INFO L280 TraceCheckUtils]: 51: Hoare triple {1748#(<= main_~x~0 3)} havoc #t~ret3; {1748#(<= main_~x~0 3)} is VALID [2020-07-10 18:36:19,286 INFO L280 TraceCheckUtils]: 52: Hoare triple {1748#(<= main_~x~0 3)} assume !(5 != ~x~0 || 3 == ~result~0); {1704#false} is VALID [2020-07-10 18:36:19,286 INFO L280 TraceCheckUtils]: 53: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2020-07-10 18:36:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-10 18:36:19,289 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:19,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [241071064] [2020-07-10 18:36:19,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:19,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 18:36:19,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864116145] [2020-07-10 18:36:19,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-10 18:36:19,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:19,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 18:36:19,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:19,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 18:36:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 18:36:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:36:19,338 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-07-10 18:36:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:19,875 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-10 18:36:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 18:36:19,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-10 18:36:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-10 18:36:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 18:36:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-10 18:36:19,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-10 18:36:19,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:19,972 INFO L225 Difference]: With dead ends: 88 [2020-07-10 18:36:19,972 INFO L226 Difference]: Without dead ends: 82 [2020-07-10 18:36:19,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-10 18:36:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-10 18:36:20,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:20,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 76 states. [2020-07-10 18:36:20,123 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 76 states. [2020-07-10 18:36:20,123 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 76 states. [2020-07-10 18:36:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:20,130 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-10 18:36:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-10 18:36:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:20,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:20,131 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 82 states. [2020-07-10 18:36:20,131 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 82 states. [2020-07-10 18:36:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:20,138 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2020-07-10 18:36:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2020-07-10 18:36:20,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:20,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:20,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:20,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:36:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-10 18:36:20,145 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-10 18:36:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:20,146 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-10 18:36:20,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 18:36:20,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 102 transitions. [2020-07-10 18:36:20,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-10 18:36:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-10 18:36:20,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:20,299 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:20,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:36:20,300 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-10 18:36:20,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:20,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404428725] [2020-07-10 18:36:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 113 to 223 [2020-07-10 18:36:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,474 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-10 18:36:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,591 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,603 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,606 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,615 INFO L280 TraceCheckUtils]: 7: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,618 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,619 INFO L263 TraceCheckUtils]: 11: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,621 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,622 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,624 INFO L280 TraceCheckUtils]: 20: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,626 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,634 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,634 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,636 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,638 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,641 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,643 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,646 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,648 INFO L263 TraceCheckUtils]: 15: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,648 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,650 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,651 INFO L280 TraceCheckUtils]: 22: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,652 INFO L280 TraceCheckUtils]: 23: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,652 INFO L280 TraceCheckUtils]: 24: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,666 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,668 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 27: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,669 INFO L263 TraceCheckUtils]: 28: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,669 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,670 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,671 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,672 INFO L280 TraceCheckUtils]: 35: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,672 INFO L280 TraceCheckUtils]: 36: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,673 INFO L280 TraceCheckUtils]: 37: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,674 INFO L280 TraceCheckUtils]: 38: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,674 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,675 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,771 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,777 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,778 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,783 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,783 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,784 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,786 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,786 INFO L280 TraceCheckUtils]: 17: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,788 INFO L280 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,788 INFO L280 TraceCheckUtils]: 20: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,791 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,798 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,801 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,803 INFO L263 TraceCheckUtils]: 7: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,804 INFO L280 TraceCheckUtils]: 11: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,805 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,806 INFO L263 TraceCheckUtils]: 15: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,806 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,807 INFO L280 TraceCheckUtils]: 17: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,807 INFO L280 TraceCheckUtils]: 18: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,807 INFO L280 TraceCheckUtils]: 19: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,808 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,809 INFO L280 TraceCheckUtils]: 21: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,810 INFO L280 TraceCheckUtils]: 22: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,810 INFO L280 TraceCheckUtils]: 23: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,811 INFO L280 TraceCheckUtils]: 24: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,812 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,813 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,814 INFO L280 TraceCheckUtils]: 27: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,814 INFO L263 TraceCheckUtils]: 28: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,815 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,815 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,816 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,816 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,818 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,819 INFO L280 TraceCheckUtils]: 36: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,820 INFO L280 TraceCheckUtils]: 37: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,821 INFO L280 TraceCheckUtils]: 38: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,822 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,823 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:20,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,835 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,841 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,841 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,844 INFO L263 TraceCheckUtils]: 11: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,845 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,845 INFO L280 TraceCheckUtils]: 13: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,846 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,847 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,849 INFO L263 TraceCheckUtils]: 19: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,849 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,849 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,849 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,850 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,851 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,851 INFO L280 TraceCheckUtils]: 25: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,852 INFO L280 TraceCheckUtils]: 26: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,852 INFO L280 TraceCheckUtils]: 27: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,853 INFO L280 TraceCheckUtils]: 28: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,854 INFO L280 TraceCheckUtils]: 29: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,855 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,856 INFO L280 TraceCheckUtils]: 31: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,856 INFO L263 TraceCheckUtils]: 32: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,856 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,856 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,857 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,857 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,857 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,858 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,859 INFO L280 TraceCheckUtils]: 39: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,859 INFO L280 TraceCheckUtils]: 40: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,860 INFO L280 TraceCheckUtils]: 41: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,861 INFO L280 TraceCheckUtils]: 42: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,861 INFO L280 TraceCheckUtils]: 43: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,863 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,864 INFO L280 TraceCheckUtils]: 45: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,864 INFO L263 TraceCheckUtils]: 46: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,865 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,865 INFO L280 TraceCheckUtils]: 48: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,866 INFO L280 TraceCheckUtils]: 49: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,866 INFO L280 TraceCheckUtils]: 50: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,866 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,867 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,868 INFO L280 TraceCheckUtils]: 53: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,868 INFO L280 TraceCheckUtils]: 54: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,869 INFO L280 TraceCheckUtils]: 55: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,870 INFO L280 TraceCheckUtils]: 56: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,871 INFO L280 TraceCheckUtils]: 57: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,872 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-10 18:36:20,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-10 18:36:20,877 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,880 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,880 INFO L263 TraceCheckUtils]: 7: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,883 INFO L263 TraceCheckUtils]: 11: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,887 INFO L280 TraceCheckUtils]: 16: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,888 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,889 INFO L280 TraceCheckUtils]: 18: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,889 INFO L263 TraceCheckUtils]: 19: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,889 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,890 INFO L280 TraceCheckUtils]: 21: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,890 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,890 INFO L280 TraceCheckUtils]: 23: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,891 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,892 INFO L280 TraceCheckUtils]: 25: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,893 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,894 INFO L280 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,896 INFO L280 TraceCheckUtils]: 29: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,897 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,898 INFO L280 TraceCheckUtils]: 31: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,899 INFO L263 TraceCheckUtils]: 32: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,899 INFO L280 TraceCheckUtils]: 33: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,899 INFO L280 TraceCheckUtils]: 34: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,900 INFO L280 TraceCheckUtils]: 35: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,900 INFO L280 TraceCheckUtils]: 36: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,900 INFO L280 TraceCheckUtils]: 37: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,902 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,903 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,904 INFO L280 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,904 INFO L280 TraceCheckUtils]: 41: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,905 INFO L280 TraceCheckUtils]: 42: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,906 INFO L280 TraceCheckUtils]: 43: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,908 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:20,909 INFO L280 TraceCheckUtils]: 45: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:20,909 INFO L263 TraceCheckUtils]: 46: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,910 INFO L280 TraceCheckUtils]: 47: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,911 INFO L280 TraceCheckUtils]: 48: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,912 INFO L280 TraceCheckUtils]: 49: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,912 INFO L263 TraceCheckUtils]: 50: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,913 INFO L280 TraceCheckUtils]: 51: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,914 INFO L280 TraceCheckUtils]: 52: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,915 INFO L280 TraceCheckUtils]: 53: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,915 INFO L263 TraceCheckUtils]: 54: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,916 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,917 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,918 INFO L280 TraceCheckUtils]: 57: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,918 INFO L263 TraceCheckUtils]: 58: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,919 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,919 INFO L280 TraceCheckUtils]: 60: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,919 INFO L280 TraceCheckUtils]: 61: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,920 INFO L280 TraceCheckUtils]: 62: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,920 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,921 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,922 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,923 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,923 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,923 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,924 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,924 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,925 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,926 INFO L280 TraceCheckUtils]: 72: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,927 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,928 INFO L280 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,929 INFO L280 TraceCheckUtils]: 75: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,930 INFO L280 TraceCheckUtils]: 76: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,932 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,933 INFO L280 TraceCheckUtils]: 78: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,933 INFO L263 TraceCheckUtils]: 79: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,933 INFO L280 TraceCheckUtils]: 80: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,934 INFO L280 TraceCheckUtils]: 81: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,934 INFO L280 TraceCheckUtils]: 82: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,934 INFO L280 TraceCheckUtils]: 83: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,935 INFO L280 TraceCheckUtils]: 84: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,936 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,937 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,937 INFO L280 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,938 INFO L280 TraceCheckUtils]: 88: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,939 INFO L280 TraceCheckUtils]: 89: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,939 INFO L280 TraceCheckUtils]: 90: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,941 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,942 INFO L280 TraceCheckUtils]: 92: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,942 INFO L263 TraceCheckUtils]: 93: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,943 INFO L280 TraceCheckUtils]: 94: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,943 INFO L280 TraceCheckUtils]: 95: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,943 INFO L280 TraceCheckUtils]: 96: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,944 INFO L280 TraceCheckUtils]: 97: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,944 INFO L280 TraceCheckUtils]: 98: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,945 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,946 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,947 INFO L280 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,948 INFO L280 TraceCheckUtils]: 102: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,948 INFO L280 TraceCheckUtils]: 103: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,949 INFO L280 TraceCheckUtils]: 104: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,951 INFO L275 TraceCheckUtils]: 105: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-10 18:36:20,952 INFO L280 TraceCheckUtils]: 106: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-10 18:36:20,952 INFO L280 TraceCheckUtils]: 107: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-10 18:36:20,952 INFO L280 TraceCheckUtils]: 108: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-10 18:36:20,952 INFO L280 TraceCheckUtils]: 109: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-10 18:36:20,953 INFO L280 TraceCheckUtils]: 110: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-10 18:36:20,953 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-10 18:36:20,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {2296#true} call ULTIMATE.init(); {2296#true} is VALID [2020-07-10 18:36:20,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,976 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2296#true} {2296#true} #44#return; {2296#true} is VALID [2020-07-10 18:36:20,976 INFO L263 TraceCheckUtils]: 3: Hoare triple {2296#true} call #t~ret4 := main(); {2296#true} is VALID [2020-07-10 18:36:20,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {2296#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2296#true} is VALID [2020-07-10 18:36:20,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {2296#true} ~x~0 := #t~nondet2; {2296#true} is VALID [2020-07-10 18:36:20,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {2296#true} havoc #t~nondet2; {2296#true} is VALID [2020-07-10 18:36:20,977 INFO L263 TraceCheckUtils]: 7: Hoare triple {2296#true} call #t~ret3 := fibonacci(~x~0); {2296#true} is VALID [2020-07-10 18:36:20,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {2296#true} assume !(1 == ~n); {2296#true} is VALID [2020-07-10 18:36:20,979 INFO L263 TraceCheckUtils]: 11: Hoare triple {2296#true} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,980 INFO L280 TraceCheckUtils]: 12: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,982 INFO L263 TraceCheckUtils]: 15: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,984 INFO L280 TraceCheckUtils]: 18: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,984 INFO L263 TraceCheckUtils]: 19: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:20,985 INFO L280 TraceCheckUtils]: 20: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,986 INFO L280 TraceCheckUtils]: 21: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:20,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} #res := 1; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,988 INFO L280 TraceCheckUtils]: 24: Hoare triple {2556#(<= |fibonacci_#in~n| 1)} assume true; {2556#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:20,989 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2556#(<= |fibonacci_#in~n| 1)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,990 INFO L280 TraceCheckUtils]: 26: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,990 INFO L263 TraceCheckUtils]: 27: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,990 INFO L280 TraceCheckUtils]: 28: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,990 INFO L280 TraceCheckUtils]: 29: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:20,991 INFO L280 TraceCheckUtils]: 30: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:20,991 INFO L280 TraceCheckUtils]: 31: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:20,992 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2296#true} {2550#(<= |fibonacci_#in~n| 2)} #42#return; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,993 INFO L280 TraceCheckUtils]: 33: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,993 INFO L280 TraceCheckUtils]: 34: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,994 INFO L280 TraceCheckUtils]: 35: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,995 INFO L280 TraceCheckUtils]: 36: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,995 INFO L280 TraceCheckUtils]: 37: Hoare triple {2550#(<= |fibonacci_#in~n| 2)} assume true; {2550#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:20,997 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2550#(<= |fibonacci_#in~n| 2)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,997 INFO L280 TraceCheckUtils]: 39: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:20,998 INFO L263 TraceCheckUtils]: 40: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:20,998 INFO L280 TraceCheckUtils]: 41: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:20,998 INFO L280 TraceCheckUtils]: 42: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:20,998 INFO L280 TraceCheckUtils]: 43: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:20,999 INFO L280 TraceCheckUtils]: 44: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:20,999 INFO L280 TraceCheckUtils]: 45: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:21,001 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2296#true} {2537#(<= |fibonacci_#in~n| 3)} #42#return; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,002 INFO L280 TraceCheckUtils]: 47: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,002 INFO L280 TraceCheckUtils]: 48: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,003 INFO L280 TraceCheckUtils]: 49: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,004 INFO L280 TraceCheckUtils]: 50: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,005 INFO L280 TraceCheckUtils]: 51: Hoare triple {2537#(<= |fibonacci_#in~n| 3)} assume true; {2537#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:21,006 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2537#(<= |fibonacci_#in~n| 3)} {2296#true} #40#return; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:21,007 INFO L280 TraceCheckUtils]: 53: Hoare triple {2453#(<= fibonacci_~n 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2453#(<= fibonacci_~n 4)} is VALID [2020-07-10 18:36:21,007 INFO L263 TraceCheckUtils]: 54: Hoare triple {2453#(<= fibonacci_~n 4)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:21,008 INFO L280 TraceCheckUtils]: 55: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,009 INFO L280 TraceCheckUtils]: 56: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,010 INFO L280 TraceCheckUtils]: 57: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,010 INFO L263 TraceCheckUtils]: 58: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:21,011 INFO L280 TraceCheckUtils]: 59: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,012 INFO L280 TraceCheckUtils]: 60: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,013 INFO L280 TraceCheckUtils]: 61: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,013 INFO L263 TraceCheckUtils]: 62: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:21,014 INFO L280 TraceCheckUtils]: 63: Hoare triple {2296#true} ~n := #in~n; {2513#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,015 INFO L280 TraceCheckUtils]: 64: Hoare triple {2513#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,016 INFO L280 TraceCheckUtils]: 65: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,016 INFO L263 TraceCheckUtils]: 66: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {2296#true} is VALID [2020-07-10 18:36:21,016 INFO L280 TraceCheckUtils]: 67: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:21,017 INFO L280 TraceCheckUtils]: 68: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:21,017 INFO L280 TraceCheckUtils]: 69: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:21,017 INFO L280 TraceCheckUtils]: 70: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:21,018 INFO L280 TraceCheckUtils]: 71: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:21,019 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #40#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,020 INFO L280 TraceCheckUtils]: 73: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,020 INFO L263 TraceCheckUtils]: 74: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:21,021 INFO L280 TraceCheckUtils]: 75: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:21,021 INFO L280 TraceCheckUtils]: 76: Hoare triple {2296#true} assume ~n < 1; {2296#true} is VALID [2020-07-10 18:36:21,021 INFO L280 TraceCheckUtils]: 77: Hoare triple {2296#true} #res := 0; {2296#true} is VALID [2020-07-10 18:36:21,022 INFO L280 TraceCheckUtils]: 78: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:21,023 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2296#true} {2635#(<= 1 |fibonacci_#in~n|)} #42#return; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,024 INFO L280 TraceCheckUtils]: 80: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,025 INFO L280 TraceCheckUtils]: 81: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,026 INFO L280 TraceCheckUtils]: 82: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,026 INFO L280 TraceCheckUtils]: 83: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,027 INFO L280 TraceCheckUtils]: 84: Hoare triple {2635#(<= 1 |fibonacci_#in~n|)} assume true; {2635#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,029 INFO L275 TraceCheckUtils]: 85: Hoare quadruple {2635#(<= 1 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,030 INFO L280 TraceCheckUtils]: 86: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,030 INFO L263 TraceCheckUtils]: 87: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:21,031 INFO L280 TraceCheckUtils]: 88: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:21,031 INFO L280 TraceCheckUtils]: 89: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:21,031 INFO L280 TraceCheckUtils]: 90: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:21,032 INFO L280 TraceCheckUtils]: 91: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:21,032 INFO L280 TraceCheckUtils]: 92: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:21,033 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {2296#true} {2628#(<= 2 |fibonacci_#in~n|)} #42#return; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,034 INFO L280 TraceCheckUtils]: 94: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,035 INFO L280 TraceCheckUtils]: 95: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,036 INFO L280 TraceCheckUtils]: 96: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,037 INFO L280 TraceCheckUtils]: 97: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,038 INFO L280 TraceCheckUtils]: 98: Hoare triple {2628#(<= 2 |fibonacci_#in~n|)} assume true; {2628#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,040 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {2628#(<= 2 |fibonacci_#in~n|)} {2513#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,040 INFO L280 TraceCheckUtils]: 100: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,041 INFO L263 TraceCheckUtils]: 101: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {2296#true} is VALID [2020-07-10 18:36:21,041 INFO L280 TraceCheckUtils]: 102: Hoare triple {2296#true} ~n := #in~n; {2296#true} is VALID [2020-07-10 18:36:21,042 INFO L280 TraceCheckUtils]: 103: Hoare triple {2296#true} assume !(~n < 1); {2296#true} is VALID [2020-07-10 18:36:21,042 INFO L280 TraceCheckUtils]: 104: Hoare triple {2296#true} assume 1 == ~n; {2296#true} is VALID [2020-07-10 18:36:21,042 INFO L280 TraceCheckUtils]: 105: Hoare triple {2296#true} #res := 1; {2296#true} is VALID [2020-07-10 18:36:21,042 INFO L280 TraceCheckUtils]: 106: Hoare triple {2296#true} assume true; {2296#true} is VALID [2020-07-10 18:36:21,044 INFO L275 TraceCheckUtils]: 107: Hoare quadruple {2296#true} {2598#(<= 3 |fibonacci_#in~n|)} #42#return; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,044 INFO L280 TraceCheckUtils]: 108: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,045 INFO L280 TraceCheckUtils]: 109: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,046 INFO L280 TraceCheckUtils]: 110: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,046 INFO L280 TraceCheckUtils]: 111: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,047 INFO L280 TraceCheckUtils]: 112: Hoare triple {2598#(<= 3 |fibonacci_#in~n|)} assume true; {2598#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:21,048 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2598#(<= 3 |fibonacci_#in~n|)} {2453#(<= fibonacci_~n 4)} #42#return; {2297#false} is VALID [2020-07-10 18:36:21,048 INFO L280 TraceCheckUtils]: 114: Hoare triple {2297#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2297#false} is VALID [2020-07-10 18:36:21,049 INFO L280 TraceCheckUtils]: 115: Hoare triple {2297#false} #res := #t~ret0 + #t~ret1; {2297#false} is VALID [2020-07-10 18:36:21,049 INFO L280 TraceCheckUtils]: 116: Hoare triple {2297#false} havoc #t~ret0; {2297#false} is VALID [2020-07-10 18:36:21,049 INFO L280 TraceCheckUtils]: 117: Hoare triple {2297#false} havoc #t~ret1; {2297#false} is VALID [2020-07-10 18:36:21,049 INFO L280 TraceCheckUtils]: 118: Hoare triple {2297#false} assume true; {2297#false} is VALID [2020-07-10 18:36:21,049 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {2297#false} {2296#true} #48#return; {2297#false} is VALID [2020-07-10 18:36:21,050 INFO L280 TraceCheckUtils]: 120: Hoare triple {2297#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2297#false} is VALID [2020-07-10 18:36:21,050 INFO L280 TraceCheckUtils]: 121: Hoare triple {2297#false} ~result~0 := #t~ret3; {2297#false} is VALID [2020-07-10 18:36:21,050 INFO L280 TraceCheckUtils]: 122: Hoare triple {2297#false} havoc #t~ret3; {2297#false} is VALID [2020-07-10 18:36:21,051 INFO L280 TraceCheckUtils]: 123: Hoare triple {2297#false} assume !(5 != ~x~0 || 3 == ~result~0); {2297#false} is VALID [2020-07-10 18:36:21,051 INFO L280 TraceCheckUtils]: 124: Hoare triple {2297#false} assume !false; {2297#false} is VALID [2020-07-10 18:36:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-07-10 18:36:21,077 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:21,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404428725] [2020-07-10 18:36:21,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:21,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 18:36:21,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268591393] [2020-07-10 18:36:21,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-10 18:36:21,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:21,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 18:36:21,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:21,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 18:36:21,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:21,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 18:36:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:21,183 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-07-10 18:36:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,038 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-07-10 18:36:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 18:36:22,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-10 18:36:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-10 18:36:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 115 transitions. [2020-07-10 18:36:22,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 115 transitions. [2020-07-10 18:36:22,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:22,186 INFO L225 Difference]: With dead ends: 139 [2020-07-10 18:36:22,187 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 18:36:22,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-07-10 18:36:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 18:36:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-07-10 18:36:22,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:22,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 61 states. [2020-07-10 18:36:22,296 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 61 states. [2020-07-10 18:36:22,296 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 61 states. [2020-07-10 18:36:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,300 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-10 18:36:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-10 18:36:22,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:22,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:22,301 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 70 states. [2020-07-10 18:36:22,301 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 70 states. [2020-07-10 18:36:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:22,307 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-07-10 18:36:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-10 18:36:22,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:22,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:22,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:22,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 18:36:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-07-10 18:36:22,314 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-07-10 18:36:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:22,314 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-07-10 18:36:22,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 18:36:22,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 72 transitions. [2020-07-10 18:36:22,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-07-10 18:36:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-10 18:36:22,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:22,433 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:22,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 18:36:22,434 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-10 18:36:22,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:22,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956794473] [2020-07-10 18:36:22,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,596 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-10 18:36:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,697 INFO L280 TraceCheckUtils]: 4: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,699 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,705 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,706 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,710 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,710 INFO L280 TraceCheckUtils]: 7: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,711 INFO L280 TraceCheckUtils]: 8: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,712 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,713 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,713 INFO L263 TraceCheckUtils]: 11: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,713 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,714 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,715 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,716 INFO L280 TraceCheckUtils]: 17: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,716 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,718 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,719 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,725 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,726 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,728 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,728 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,730 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,734 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,735 INFO L263 TraceCheckUtils]: 15: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,736 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,736 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,737 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,738 INFO L280 TraceCheckUtils]: 21: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,739 INFO L280 TraceCheckUtils]: 22: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,739 INFO L280 TraceCheckUtils]: 23: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,740 INFO L280 TraceCheckUtils]: 24: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,740 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,742 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,742 INFO L280 TraceCheckUtils]: 27: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,743 INFO L263 TraceCheckUtils]: 28: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,743 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,743 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,743 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,743 INFO L280 TraceCheckUtils]: 32: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,744 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,744 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,745 INFO L280 TraceCheckUtils]: 35: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,746 INFO L280 TraceCheckUtils]: 36: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,746 INFO L280 TraceCheckUtils]: 37: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,747 INFO L280 TraceCheckUtils]: 38: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,747 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,749 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,763 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-10 18:36:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:22,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,767 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-10 18:36:22,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-10 18:36:22,768 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,768 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,769 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,769 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-10 18:36:22,770 INFO L280 TraceCheckUtils]: 10: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,770 INFO L263 TraceCheckUtils]: 11: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,770 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L280 TraceCheckUtils]: 17: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L280 TraceCheckUtils]: 18: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L280 TraceCheckUtils]: 19: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-10 18:36:22,771 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,772 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,772 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,774 INFO L263 TraceCheckUtils]: 3: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,774 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,775 INFO L263 TraceCheckUtils]: 7: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,776 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,777 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,777 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,778 INFO L280 TraceCheckUtils]: 15: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,779 INFO L280 TraceCheckUtils]: 16: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,780 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,780 INFO L280 TraceCheckUtils]: 18: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,780 INFO L263 TraceCheckUtils]: 19: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,780 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,781 INFO L280 TraceCheckUtils]: 23: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,781 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,785 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,786 INFO L280 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,786 INFO L280 TraceCheckUtils]: 28: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,787 INFO L280 TraceCheckUtils]: 29: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,788 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,788 INFO L263 TraceCheckUtils]: 32: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,788 INFO L280 TraceCheckUtils]: 33: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,788 INFO L280 TraceCheckUtils]: 34: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,789 INFO L280 TraceCheckUtils]: 35: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,789 INFO L280 TraceCheckUtils]: 36: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,789 INFO L280 TraceCheckUtils]: 37: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,789 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,790 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,790 INFO L280 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,790 INFO L280 TraceCheckUtils]: 41: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,791 INFO L280 TraceCheckUtils]: 42: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,791 INFO L280 TraceCheckUtils]: 43: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,792 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,793 INFO L280 TraceCheckUtils]: 45: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,793 INFO L263 TraceCheckUtils]: 46: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,793 INFO L280 TraceCheckUtils]: 47: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,793 INFO L280 TraceCheckUtils]: 48: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,793 INFO L280 TraceCheckUtils]: 49: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-10 18:36:22,793 INFO L263 TraceCheckUtils]: 50: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,793 INFO L280 TraceCheckUtils]: 51: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L280 TraceCheckUtils]: 52: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L280 TraceCheckUtils]: 53: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L280 TraceCheckUtils]: 54: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,794 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 64: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,795 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,796 INFO L280 TraceCheckUtils]: 66: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-10 18:36:22,796 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,796 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,797 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,797 INFO L280 TraceCheckUtils]: 70: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,797 INFO L280 TraceCheckUtils]: 71: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,798 INFO L280 TraceCheckUtils]: 72: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,798 INFO L280 TraceCheckUtils]: 73: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,799 INFO L280 TraceCheckUtils]: 74: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,799 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-10 18:36:22,802 INFO L263 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3215#true} {3215#true} #44#return; {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L263 TraceCheckUtils]: 3: Hoare triple {3215#true} call #t~ret4 := main(); {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {3215#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {3215#true} ~x~0 := #t~nondet2; {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {3215#true} havoc #t~nondet2; {3215#true} is VALID [2020-07-10 18:36:22,803 INFO L263 TraceCheckUtils]: 7: Hoare triple {3215#true} call #t~ret3 := fibonacci(~x~0); {3215#true} is VALID [2020-07-10 18:36:22,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,804 INFO L280 TraceCheckUtils]: 9: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,805 INFO L280 TraceCheckUtils]: 10: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,805 INFO L263 TraceCheckUtils]: 11: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,810 INFO L280 TraceCheckUtils]: 12: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,811 INFO L280 TraceCheckUtils]: 13: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,811 INFO L263 TraceCheckUtils]: 15: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,812 INFO L280 TraceCheckUtils]: 16: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,813 INFO L280 TraceCheckUtils]: 18: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,813 INFO L263 TraceCheckUtils]: 19: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,813 INFO L280 TraceCheckUtils]: 20: Hoare triple {3215#true} ~n := #in~n; {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,814 INFO L280 TraceCheckUtils]: 21: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {3296#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:22,814 INFO L280 TraceCheckUtils]: 22: Hoare triple {3296#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} #res := 1; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,815 INFO L280 TraceCheckUtils]: 24: Hoare triple {3404#(<= |fibonacci_#in~n| 1)} assume true; {3404#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:22,816 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3404#(<= |fibonacci_#in~n| 1)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,816 INFO L280 TraceCheckUtils]: 26: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,816 INFO L263 TraceCheckUtils]: 27: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,816 INFO L280 TraceCheckUtils]: 28: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,816 INFO L280 TraceCheckUtils]: 29: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,817 INFO L280 TraceCheckUtils]: 30: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,817 INFO L280 TraceCheckUtils]: 31: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,817 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3215#true} {3398#(<= |fibonacci_#in~n| 2)} #42#return; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,818 INFO L280 TraceCheckUtils]: 33: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,818 INFO L280 TraceCheckUtils]: 34: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} #res := #t~ret0 + #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret0; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,819 INFO L280 TraceCheckUtils]: 36: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} havoc #t~ret1; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,820 INFO L280 TraceCheckUtils]: 37: Hoare triple {3398#(<= |fibonacci_#in~n| 2)} assume true; {3398#(<= |fibonacci_#in~n| 2)} is VALID [2020-07-10 18:36:22,820 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3398#(<= |fibonacci_#in~n| 2)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,821 INFO L280 TraceCheckUtils]: 39: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,821 INFO L263 TraceCheckUtils]: 40: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,821 INFO L280 TraceCheckUtils]: 41: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,821 INFO L280 TraceCheckUtils]: 42: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,821 INFO L280 TraceCheckUtils]: 43: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,822 INFO L280 TraceCheckUtils]: 44: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,822 INFO L280 TraceCheckUtils]: 45: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,822 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3215#true} {3385#(<= |fibonacci_#in~n| 3)} #42#return; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,823 INFO L280 TraceCheckUtils]: 47: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,823 INFO L280 TraceCheckUtils]: 48: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} #res := #t~ret0 + #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,824 INFO L280 TraceCheckUtils]: 49: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret0; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,825 INFO L280 TraceCheckUtils]: 50: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} havoc #t~ret1; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,825 INFO L280 TraceCheckUtils]: 51: Hoare triple {3385#(<= |fibonacci_#in~n| 3)} assume true; {3385#(<= |fibonacci_#in~n| 3)} is VALID [2020-07-10 18:36:22,826 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3385#(<= |fibonacci_#in~n| 3)} {3296#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,827 INFO L280 TraceCheckUtils]: 53: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,827 INFO L263 TraceCheckUtils]: 54: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,827 INFO L280 TraceCheckUtils]: 55: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,827 INFO L280 TraceCheckUtils]: 56: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,827 INFO L280 TraceCheckUtils]: 57: Hoare triple {3215#true} assume !(1 == ~n); {3215#true} is VALID [2020-07-10 18:36:22,827 INFO L263 TraceCheckUtils]: 58: Hoare triple {3215#true} call #t~ret0 := fibonacci(~n - 1); {3215#true} is VALID [2020-07-10 18:36:22,828 INFO L280 TraceCheckUtils]: 59: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,828 INFO L280 TraceCheckUtils]: 60: Hoare triple {3215#true} assume !(~n < 1); {3215#true} is VALID [2020-07-10 18:36:22,828 INFO L280 TraceCheckUtils]: 61: Hoare triple {3215#true} assume 1 == ~n; {3215#true} is VALID [2020-07-10 18:36:22,828 INFO L280 TraceCheckUtils]: 62: Hoare triple {3215#true} #res := 1; {3215#true} is VALID [2020-07-10 18:36:22,829 INFO L280 TraceCheckUtils]: 63: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,829 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {3215#true} {3215#true} #40#return; {3215#true} is VALID [2020-07-10 18:36:22,829 INFO L280 TraceCheckUtils]: 65: Hoare triple {3215#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,829 INFO L263 TraceCheckUtils]: 66: Hoare triple {3215#true} call #t~ret1 := fibonacci(~n - 2); {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L280 TraceCheckUtils]: 67: Hoare triple {3215#true} ~n := #in~n; {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L280 TraceCheckUtils]: 68: Hoare triple {3215#true} assume ~n < 1; {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L280 TraceCheckUtils]: 69: Hoare triple {3215#true} #res := 0; {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L280 TraceCheckUtils]: 70: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {3215#true} {3215#true} #42#return; {3215#true} is VALID [2020-07-10 18:36:22,830 INFO L280 TraceCheckUtils]: 72: Hoare triple {3215#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3215#true} is VALID [2020-07-10 18:36:22,831 INFO L280 TraceCheckUtils]: 73: Hoare triple {3215#true} #res := #t~ret0 + #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,831 INFO L280 TraceCheckUtils]: 74: Hoare triple {3215#true} havoc #t~ret0; {3215#true} is VALID [2020-07-10 18:36:22,831 INFO L280 TraceCheckUtils]: 75: Hoare triple {3215#true} havoc #t~ret1; {3215#true} is VALID [2020-07-10 18:36:22,831 INFO L280 TraceCheckUtils]: 76: Hoare triple {3215#true} assume true; {3215#true} is VALID [2020-07-10 18:36:22,832 INFO L275 TraceCheckUtils]: 77: Hoare quadruple {3215#true} {3338#(<= |fibonacci_#in~n| 4)} #42#return; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,832 INFO L280 TraceCheckUtils]: 78: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,832 INFO L280 TraceCheckUtils]: 79: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} #res := #t~ret0 + #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,833 INFO L280 TraceCheckUtils]: 80: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret0; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,833 INFO L280 TraceCheckUtils]: 81: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} havoc #t~ret1; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,834 INFO L280 TraceCheckUtils]: 82: Hoare triple {3338#(<= |fibonacci_#in~n| 4)} assume true; {3338#(<= |fibonacci_#in~n| 4)} is VALID [2020-07-10 18:36:22,834 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {3338#(<= |fibonacci_#in~n| 4)} {3215#true} #48#return; {3295#(<= main_~x~0 4)} is VALID [2020-07-10 18:36:22,838 INFO L280 TraceCheckUtils]: 84: Hoare triple {3295#(<= main_~x~0 4)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3295#(<= main_~x~0 4)} is VALID [2020-07-10 18:36:22,841 INFO L280 TraceCheckUtils]: 85: Hoare triple {3295#(<= main_~x~0 4)} ~result~0 := #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-10 18:36:22,841 INFO L280 TraceCheckUtils]: 86: Hoare triple {3295#(<= main_~x~0 4)} havoc #t~ret3; {3295#(<= main_~x~0 4)} is VALID [2020-07-10 18:36:22,842 INFO L280 TraceCheckUtils]: 87: Hoare triple {3295#(<= main_~x~0 4)} assume !(5 != ~x~0 || 3 == ~result~0); {3216#false} is VALID [2020-07-10 18:36:22,842 INFO L280 TraceCheckUtils]: 88: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2020-07-10 18:36:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-10 18:36:22,848 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:22,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956794473] [2020-07-10 18:36:22,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:22,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 18:36:22,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006537728] [2020-07-10 18:36:22,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-10 18:36:22,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:22,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 18:36:22,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:22,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 18:36:22,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 18:36:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 18:36:22,921 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-07-10 18:36:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:23,413 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-07-10 18:36:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 18:36:23,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-10 18:36:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 18:36:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-10 18:36:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 18:36:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-10 18:36:23,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-10 18:36:23,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:23,525 INFO L225 Difference]: With dead ends: 73 [2020-07-10 18:36:23,525 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 18:36:23,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-10 18:36:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 18:36:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-10 18:36:23,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:23,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-10 18:36:23,658 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-10 18:36:23,658 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-10 18:36:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:23,662 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-10 18:36:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-10 18:36:23,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:23,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:23,663 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-10 18:36:23,663 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-10 18:36:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:23,667 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-10 18:36:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-10 18:36:23,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:23,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:23,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:23,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-10 18:36:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-07-10 18:36:23,672 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-07-10 18:36:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:23,672 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-07-10 18:36:23,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 18:36:23,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 79 transitions. [2020-07-10 18:36:23,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-10 18:36:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-10 18:36:23,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:23,787 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:23,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 18:36:23,787 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:23,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-10 18:36:23,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:23,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402662084] [2020-07-10 18:36:23,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,038 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-10 18:36:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,144 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,145 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,149 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,149 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,150 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,151 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,152 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,152 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,152 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,153 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,153 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,153 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,153 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,154 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,154 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,154 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,159 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,159 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,160 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,161 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,161 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,162 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,163 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,163 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,163 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,164 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,164 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,164 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,165 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,165 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,165 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,165 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,165 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,166 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,166 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,166 INFO L263 TraceCheckUtils]: 28: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,166 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,167 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,167 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,167 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,167 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,168 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,168 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,168 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,168 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,168 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,169 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,169 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,179 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,183 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,184 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,185 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,186 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,187 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,187 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,188 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,188 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,188 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,189 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,189 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,190 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,191 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,191 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,192 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,192 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,192 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,192 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,193 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,193 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,194 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,194 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,194 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,194 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,194 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,195 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,195 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,195 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,195 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,196 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,196 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,196 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,196 INFO L263 TraceCheckUtils]: 32: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,196 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,197 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,197 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,197 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,197 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,198 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,198 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,198 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,198 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,198 INFO L280 TraceCheckUtils]: 42: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,199 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,199 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,199 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,199 INFO L263 TraceCheckUtils]: 46: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,199 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,200 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,200 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,200 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,200 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,201 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,201 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,201 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,201 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,201 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,202 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,202 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,202 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,202 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,202 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,203 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,203 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,203 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,203 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,203 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,204 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,204 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,204 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,204 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,205 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,205 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,205 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,205 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,207 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,324 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,330 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,332 INFO L280 TraceCheckUtils]: 2: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,333 INFO L263 TraceCheckUtils]: 3: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,335 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,336 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,336 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,337 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,338 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,339 INFO L280 TraceCheckUtils]: 17: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,341 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,342 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,348 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,349 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,351 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,352 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,354 INFO L263 TraceCheckUtils]: 7: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,356 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,357 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,358 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,358 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,359 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,359 INFO L280 TraceCheckUtils]: 21: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,360 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,360 INFO L280 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,361 INFO L280 TraceCheckUtils]: 24: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,361 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,362 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,363 INFO L280 TraceCheckUtils]: 27: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,363 INFO L263 TraceCheckUtils]: 28: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,363 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,364 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,364 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,364 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,364 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,366 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,367 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,368 INFO L280 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,369 INFO L280 TraceCheckUtils]: 37: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,369 INFO L280 TraceCheckUtils]: 38: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,370 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,372 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,396 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,396 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,405 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,406 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,407 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,408 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,408 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,409 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,410 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,410 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,411 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,417 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,419 INFO L280 TraceCheckUtils]: 10: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,419 INFO L263 TraceCheckUtils]: 11: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,422 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,423 INFO L280 TraceCheckUtils]: 18: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,423 INFO L263 TraceCheckUtils]: 19: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,423 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,424 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,424 INFO L280 TraceCheckUtils]: 23: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,425 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,427 INFO L280 TraceCheckUtils]: 26: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,427 INFO L280 TraceCheckUtils]: 27: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,428 INFO L280 TraceCheckUtils]: 28: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,429 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,430 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,431 INFO L280 TraceCheckUtils]: 31: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,431 INFO L263 TraceCheckUtils]: 32: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,432 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,443 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,443 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,443 INFO L280 TraceCheckUtils]: 36: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,443 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,445 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,445 INFO L280 TraceCheckUtils]: 39: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,446 INFO L280 TraceCheckUtils]: 40: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,446 INFO L280 TraceCheckUtils]: 41: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,447 INFO L280 TraceCheckUtils]: 42: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,448 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,449 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,450 INFO L280 TraceCheckUtils]: 45: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,450 INFO L263 TraceCheckUtils]: 46: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,450 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,450 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,451 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,451 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,451 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,451 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,452 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,452 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,452 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,452 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,452 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,453 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,453 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,453 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,453 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,453 INFO L280 TraceCheckUtils]: 62: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,454 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,454 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,454 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,454 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,455 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,455 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,456 INFO L275 TraceCheckUtils]: 69: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,456 INFO L280 TraceCheckUtils]: 70: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,457 INFO L280 TraceCheckUtils]: 71: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,458 INFO L280 TraceCheckUtils]: 72: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,458 INFO L280 TraceCheckUtils]: 73: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,459 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,460 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:36:24,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,487 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-10 18:36:24,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,488 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,490 INFO L263 TraceCheckUtils]: 7: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,492 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,492 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,494 INFO L280 TraceCheckUtils]: 14: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,494 INFO L263 TraceCheckUtils]: 15: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,494 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,495 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,497 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,498 INFO L263 TraceCheckUtils]: 23: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,498 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,498 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,498 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,499 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,500 INFO L280 TraceCheckUtils]: 29: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,501 INFO L280 TraceCheckUtils]: 30: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,501 INFO L280 TraceCheckUtils]: 31: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,502 INFO L280 TraceCheckUtils]: 32: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,503 INFO L280 TraceCheckUtils]: 33: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,504 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,505 INFO L280 TraceCheckUtils]: 35: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,505 INFO L263 TraceCheckUtils]: 36: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,506 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,506 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,506 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,506 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,506 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,507 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,508 INFO L280 TraceCheckUtils]: 43: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,509 INFO L280 TraceCheckUtils]: 44: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,509 INFO L280 TraceCheckUtils]: 45: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,510 INFO L280 TraceCheckUtils]: 46: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,510 INFO L280 TraceCheckUtils]: 47: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,512 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,513 INFO L280 TraceCheckUtils]: 49: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,513 INFO L263 TraceCheckUtils]: 50: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,513 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,513 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,514 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,514 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,514 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,514 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,514 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,515 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,515 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,515 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,515 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,515 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,516 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,516 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,516 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,517 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,517 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,517 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,517 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,518 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,518 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,518 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,519 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,520 INFO L280 TraceCheckUtils]: 74: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,521 INFO L280 TraceCheckUtils]: 75: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,521 INFO L280 TraceCheckUtils]: 76: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,522 INFO L280 TraceCheckUtils]: 77: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,523 INFO L280 TraceCheckUtils]: 78: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,524 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,525 INFO L280 TraceCheckUtils]: 80: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,525 INFO L263 TraceCheckUtils]: 81: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,525 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,526 INFO L280 TraceCheckUtils]: 83: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,527 INFO L280 TraceCheckUtils]: 84: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,528 INFO L280 TraceCheckUtils]: 85: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,528 INFO L280 TraceCheckUtils]: 86: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,530 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-10 18:36:24,530 INFO L280 TraceCheckUtils]: 88: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-10 18:36:24,530 INFO L280 TraceCheckUtils]: 89: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,531 INFO L280 TraceCheckUtils]: 90: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-10 18:36:24,531 INFO L280 TraceCheckUtils]: 91: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,531 INFO L280 TraceCheckUtils]: 92: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-10 18:36:24,531 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,541 INFO L263 TraceCheckUtils]: 3: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,542 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,543 INFO L263 TraceCheckUtils]: 11: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,544 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,544 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,544 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,544 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,544 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L280 TraceCheckUtils]: 19: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,546 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,546 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,546 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,546 INFO L280 TraceCheckUtils]: 29: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,547 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,547 INFO L280 TraceCheckUtils]: 31: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,547 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,547 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,547 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,548 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,548 INFO L263 TraceCheckUtils]: 36: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,548 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,548 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,549 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,549 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,549 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,549 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,549 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,550 INFO L280 TraceCheckUtils]: 44: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,550 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,550 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,550 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,550 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,551 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,551 INFO L263 TraceCheckUtils]: 50: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,551 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,551 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,551 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,552 INFO L263 TraceCheckUtils]: 54: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,552 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,552 INFO L280 TraceCheckUtils]: 56: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,552 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,552 INFO L280 TraceCheckUtils]: 58: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,553 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,553 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,553 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,553 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,553 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,554 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,554 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,554 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,554 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,555 INFO L280 TraceCheckUtils]: 68: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,555 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,555 INFO L280 TraceCheckUtils]: 70: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,555 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,556 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,556 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,556 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,556 INFO L280 TraceCheckUtils]: 75: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,556 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,557 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,557 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,558 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,559 INFO L280 TraceCheckUtils]: 80: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,559 INFO L263 TraceCheckUtils]: 81: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,559 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,560 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,560 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,560 INFO L263 TraceCheckUtils]: 85: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,561 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,562 INFO L280 TraceCheckUtils]: 87: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,562 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,562 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,563 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,564 INFO L280 TraceCheckUtils]: 91: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,564 INFO L280 TraceCheckUtils]: 92: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,564 INFO L263 TraceCheckUtils]: 93: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,565 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,566 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,567 INFO L280 TraceCheckUtils]: 96: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,567 INFO L263 TraceCheckUtils]: 97: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,567 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,567 INFO L280 TraceCheckUtils]: 99: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,567 INFO L280 TraceCheckUtils]: 100: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,568 INFO L280 TraceCheckUtils]: 101: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,568 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,569 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,570 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,570 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,570 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,570 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,571 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,571 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,572 INFO L275 TraceCheckUtils]: 110: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,573 INFO L280 TraceCheckUtils]: 111: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,573 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,574 INFO L280 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,575 INFO L280 TraceCheckUtils]: 114: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,575 INFO L280 TraceCheckUtils]: 115: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,577 INFO L275 TraceCheckUtils]: 116: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,578 INFO L280 TraceCheckUtils]: 117: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,578 INFO L263 TraceCheckUtils]: 118: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,578 INFO L280 TraceCheckUtils]: 119: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,578 INFO L280 TraceCheckUtils]: 120: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,579 INFO L280 TraceCheckUtils]: 121: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,579 INFO L280 TraceCheckUtils]: 122: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,579 INFO L280 TraceCheckUtils]: 123: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,580 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,581 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,582 INFO L280 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,582 INFO L280 TraceCheckUtils]: 127: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,583 INFO L280 TraceCheckUtils]: 128: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,584 INFO L280 TraceCheckUtils]: 129: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,585 INFO L275 TraceCheckUtils]: 130: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,586 INFO L280 TraceCheckUtils]: 131: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,586 INFO L263 TraceCheckUtils]: 132: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,587 INFO L280 TraceCheckUtils]: 133: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,587 INFO L280 TraceCheckUtils]: 134: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,587 INFO L280 TraceCheckUtils]: 135: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,587 INFO L263 TraceCheckUtils]: 136: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,587 INFO L280 TraceCheckUtils]: 137: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,588 INFO L280 TraceCheckUtils]: 138: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,588 INFO L280 TraceCheckUtils]: 139: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,588 INFO L280 TraceCheckUtils]: 140: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,588 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,589 INFO L275 TraceCheckUtils]: 142: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,589 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,589 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,589 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,590 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,590 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,590 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,590 INFO L275 TraceCheckUtils]: 149: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,591 INFO L280 TraceCheckUtils]: 150: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,591 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,591 INFO L280 TraceCheckUtils]: 152: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,591 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,592 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,593 INFO L275 TraceCheckUtils]: 155: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,594 INFO L280 TraceCheckUtils]: 156: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,594 INFO L280 TraceCheckUtils]: 157: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,595 INFO L280 TraceCheckUtils]: 158: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,596 INFO L280 TraceCheckUtils]: 159: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,596 INFO L280 TraceCheckUtils]: 160: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,598 INFO L275 TraceCheckUtils]: 161: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,598 INFO L280 TraceCheckUtils]: 162: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,598 INFO L263 TraceCheckUtils]: 163: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,599 INFO L280 TraceCheckUtils]: 164: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,600 INFO L280 TraceCheckUtils]: 165: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,600 INFO L280 TraceCheckUtils]: 166: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,601 INFO L280 TraceCheckUtils]: 167: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,601 INFO L280 TraceCheckUtils]: 168: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,603 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-10 18:36:24,603 INFO L280 TraceCheckUtils]: 170: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-10 18:36:24,603 INFO L280 TraceCheckUtils]: 171: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,603 INFO L280 TraceCheckUtils]: 172: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-10 18:36:24,603 INFO L280 TraceCheckUtils]: 173: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,604 INFO L280 TraceCheckUtils]: 174: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-10 18:36:24,604 INFO L275 TraceCheckUtils]: 175: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,605 INFO L280 TraceCheckUtils]: 176: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,605 INFO L280 TraceCheckUtils]: 177: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,606 INFO L280 TraceCheckUtils]: 178: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,606 INFO L280 TraceCheckUtils]: 179: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,607 INFO L280 TraceCheckUtils]: 180: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,608 INFO L275 TraceCheckUtils]: 181: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-10 18:36:24,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2020-07-10 18:36:24,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3840#true} {3840#true} #44#return; {3840#true} is VALID [2020-07-10 18:36:24,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {3840#true} call #t~ret4 := main(); {3840#true} is VALID [2020-07-10 18:36:24,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {3840#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {3840#true} ~x~0 := #t~nondet2; {3840#true} is VALID [2020-07-10 18:36:24,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {3840#true} havoc #t~nondet2; {3840#true} is VALID [2020-07-10 18:36:24,632 INFO L263 TraceCheckUtils]: 7: Hoare triple {3840#true} call #t~ret3 := fibonacci(~x~0); {3840#true} is VALID [2020-07-10 18:36:24,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,634 INFO L263 TraceCheckUtils]: 11: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,635 INFO L280 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,635 INFO L263 TraceCheckUtils]: 15: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,635 INFO L280 TraceCheckUtils]: 16: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,636 INFO L280 TraceCheckUtils]: 18: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,636 INFO L263 TraceCheckUtils]: 19: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,636 INFO L280 TraceCheckUtils]: 20: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,636 INFO L280 TraceCheckUtils]: 21: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L280 TraceCheckUtils]: 22: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L263 TraceCheckUtils]: 23: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L280 TraceCheckUtils]: 24: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L280 TraceCheckUtils]: 25: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L280 TraceCheckUtils]: 26: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,637 INFO L280 TraceCheckUtils]: 27: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,638 INFO L280 TraceCheckUtils]: 28: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,638 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,638 INFO L280 TraceCheckUtils]: 30: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,638 INFO L263 TraceCheckUtils]: 31: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,638 INFO L280 TraceCheckUtils]: 32: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,639 INFO L280 TraceCheckUtils]: 33: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,639 INFO L280 TraceCheckUtils]: 34: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,639 INFO L280 TraceCheckUtils]: 35: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,639 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,639 INFO L280 TraceCheckUtils]: 37: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,640 INFO L280 TraceCheckUtils]: 38: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,640 INFO L280 TraceCheckUtils]: 39: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,640 INFO L280 TraceCheckUtils]: 40: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,640 INFO L280 TraceCheckUtils]: 41: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,640 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,641 INFO L280 TraceCheckUtils]: 43: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,641 INFO L263 TraceCheckUtils]: 44: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,641 INFO L280 TraceCheckUtils]: 45: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,641 INFO L280 TraceCheckUtils]: 46: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,641 INFO L280 TraceCheckUtils]: 47: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,642 INFO L280 TraceCheckUtils]: 48: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,642 INFO L280 TraceCheckUtils]: 49: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,642 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,642 INFO L280 TraceCheckUtils]: 51: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,642 INFO L280 TraceCheckUtils]: 52: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,643 INFO L280 TraceCheckUtils]: 53: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,643 INFO L280 TraceCheckUtils]: 54: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,643 INFO L280 TraceCheckUtils]: 55: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,643 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,643 INFO L280 TraceCheckUtils]: 57: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,644 INFO L263 TraceCheckUtils]: 58: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,644 INFO L280 TraceCheckUtils]: 59: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,644 INFO L280 TraceCheckUtils]: 60: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,644 INFO L280 TraceCheckUtils]: 61: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,644 INFO L263 TraceCheckUtils]: 62: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,645 INFO L280 TraceCheckUtils]: 63: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,645 INFO L280 TraceCheckUtils]: 64: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,645 INFO L280 TraceCheckUtils]: 65: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,645 INFO L280 TraceCheckUtils]: 66: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,645 INFO L280 TraceCheckUtils]: 67: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,646 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,646 INFO L280 TraceCheckUtils]: 69: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,646 INFO L263 TraceCheckUtils]: 70: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,646 INFO L280 TraceCheckUtils]: 71: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,646 INFO L280 TraceCheckUtils]: 72: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,647 INFO L280 TraceCheckUtils]: 73: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,647 INFO L280 TraceCheckUtils]: 74: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,647 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,647 INFO L280 TraceCheckUtils]: 76: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,647 INFO L280 TraceCheckUtils]: 77: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L280 TraceCheckUtils]: 78: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L280 TraceCheckUtils]: 79: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L280 TraceCheckUtils]: 80: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L280 TraceCheckUtils]: 82: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,648 INFO L280 TraceCheckUtils]: 83: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,649 INFO L280 TraceCheckUtils]: 84: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,649 INFO L280 TraceCheckUtils]: 85: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,649 INFO L280 TraceCheckUtils]: 86: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,650 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3840#true} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,651 INFO L280 TraceCheckUtils]: 88: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,651 INFO L263 TraceCheckUtils]: 89: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,651 INFO L280 TraceCheckUtils]: 90: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,651 INFO L280 TraceCheckUtils]: 91: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,652 INFO L280 TraceCheckUtils]: 92: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,652 INFO L263 TraceCheckUtils]: 93: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,652 INFO L280 TraceCheckUtils]: 94: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,653 INFO L280 TraceCheckUtils]: 95: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,654 INFO L280 TraceCheckUtils]: 96: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,654 INFO L263 TraceCheckUtils]: 97: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,654 INFO L280 TraceCheckUtils]: 98: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,655 INFO L280 TraceCheckUtils]: 99: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,656 INFO L280 TraceCheckUtils]: 100: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(1 == ~n); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,656 INFO L263 TraceCheckUtils]: 101: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,657 INFO L280 TraceCheckUtils]: 102: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,657 INFO L280 TraceCheckUtils]: 103: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,658 INFO L280 TraceCheckUtils]: 104: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume !(1 == ~n); {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,658 INFO L263 TraceCheckUtils]: 105: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,659 INFO L280 TraceCheckUtils]: 106: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,659 INFO L280 TraceCheckUtils]: 107: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,659 INFO L280 TraceCheckUtils]: 108: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,659 INFO L280 TraceCheckUtils]: 109: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,659 INFO L280 TraceCheckUtils]: 110: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,660 INFO L275 TraceCheckUtils]: 111: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #40#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,661 INFO L280 TraceCheckUtils]: 112: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,661 INFO L263 TraceCheckUtils]: 113: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,661 INFO L280 TraceCheckUtils]: 114: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,662 INFO L280 TraceCheckUtils]: 115: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,662 INFO L280 TraceCheckUtils]: 116: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,662 INFO L280 TraceCheckUtils]: 117: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,663 INFO L275 TraceCheckUtils]: 118: Hoare quadruple {3840#true} {4492#(<= 1 |fibonacci_#in~n|)} #42#return; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,664 INFO L280 TraceCheckUtils]: 119: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,664 INFO L280 TraceCheckUtils]: 120: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,665 INFO L280 TraceCheckUtils]: 121: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret0; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,665 INFO L280 TraceCheckUtils]: 122: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} havoc #t~ret1; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,666 INFO L280 TraceCheckUtils]: 123: Hoare triple {4492#(<= 1 |fibonacci_#in~n|)} assume true; {4492#(<= 1 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,667 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4492#(<= 1 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,668 INFO L280 TraceCheckUtils]: 125: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,668 INFO L263 TraceCheckUtils]: 126: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,668 INFO L280 TraceCheckUtils]: 127: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,668 INFO L280 TraceCheckUtils]: 128: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,668 INFO L280 TraceCheckUtils]: 129: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,669 INFO L280 TraceCheckUtils]: 130: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,669 INFO L280 TraceCheckUtils]: 131: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,670 INFO L275 TraceCheckUtils]: 132: Hoare quadruple {3840#true} {4485#(<= 2 |fibonacci_#in~n|)} #42#return; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,670 INFO L280 TraceCheckUtils]: 133: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,671 INFO L280 TraceCheckUtils]: 134: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,672 INFO L280 TraceCheckUtils]: 135: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret0; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,672 INFO L280 TraceCheckUtils]: 136: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} havoc #t~ret1; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,673 INFO L280 TraceCheckUtils]: 137: Hoare triple {4485#(<= 2 |fibonacci_#in~n|)} assume true; {4485#(<= 2 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,674 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4485#(<= 2 |fibonacci_#in~n|)} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #40#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,675 INFO L280 TraceCheckUtils]: 139: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,675 INFO L263 TraceCheckUtils]: 140: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,675 INFO L280 TraceCheckUtils]: 141: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L280 TraceCheckUtils]: 142: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L280 TraceCheckUtils]: 143: Hoare triple {3840#true} assume !(1 == ~n); {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L263 TraceCheckUtils]: 144: Hoare triple {3840#true} call #t~ret0 := fibonacci(~n - 1); {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L280 TraceCheckUtils]: 145: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L280 TraceCheckUtils]: 146: Hoare triple {3840#true} assume !(~n < 1); {3840#true} is VALID [2020-07-10 18:36:24,676 INFO L280 TraceCheckUtils]: 147: Hoare triple {3840#true} assume 1 == ~n; {3840#true} is VALID [2020-07-10 18:36:24,677 INFO L280 TraceCheckUtils]: 148: Hoare triple {3840#true} #res := 1; {3840#true} is VALID [2020-07-10 18:36:24,677 INFO L280 TraceCheckUtils]: 149: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,677 INFO L275 TraceCheckUtils]: 150: Hoare quadruple {3840#true} {3840#true} #40#return; {3840#true} is VALID [2020-07-10 18:36:24,677 INFO L280 TraceCheckUtils]: 151: Hoare triple {3840#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,677 INFO L263 TraceCheckUtils]: 152: Hoare triple {3840#true} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,678 INFO L280 TraceCheckUtils]: 153: Hoare triple {3840#true} ~n := #in~n; {3840#true} is VALID [2020-07-10 18:36:24,678 INFO L280 TraceCheckUtils]: 154: Hoare triple {3840#true} assume ~n < 1; {3840#true} is VALID [2020-07-10 18:36:24,678 INFO L280 TraceCheckUtils]: 155: Hoare triple {3840#true} #res := 0; {3840#true} is VALID [2020-07-10 18:36:24,678 INFO L280 TraceCheckUtils]: 156: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,678 INFO L275 TraceCheckUtils]: 157: Hoare quadruple {3840#true} {3840#true} #42#return; {3840#true} is VALID [2020-07-10 18:36:24,679 INFO L280 TraceCheckUtils]: 158: Hoare triple {3840#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3840#true} is VALID [2020-07-10 18:36:24,679 INFO L280 TraceCheckUtils]: 159: Hoare triple {3840#true} #res := #t~ret0 + #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,679 INFO L280 TraceCheckUtils]: 160: Hoare triple {3840#true} havoc #t~ret0; {3840#true} is VALID [2020-07-10 18:36:24,679 INFO L280 TraceCheckUtils]: 161: Hoare triple {3840#true} havoc #t~ret1; {3840#true} is VALID [2020-07-10 18:36:24,679 INFO L280 TraceCheckUtils]: 162: Hoare triple {3840#true} assume true; {3840#true} is VALID [2020-07-10 18:36:24,680 INFO L275 TraceCheckUtils]: 163: Hoare quadruple {3840#true} {4438#(<= 3 |fibonacci_#in~n|)} #42#return; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,681 INFO L280 TraceCheckUtils]: 164: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,682 INFO L280 TraceCheckUtils]: 165: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,682 INFO L280 TraceCheckUtils]: 166: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret0; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,683 INFO L280 TraceCheckUtils]: 167: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} havoc #t~ret1; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,683 INFO L280 TraceCheckUtils]: 168: Hoare triple {4438#(<= 3 |fibonacci_#in~n|)} assume true; {4438#(<= 3 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,684 INFO L275 TraceCheckUtils]: 169: Hoare quadruple {4438#(<= 3 |fibonacci_#in~n|)} {3840#true} #40#return; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,685 INFO L280 TraceCheckUtils]: 170: Hoare triple {4390#(<= 4 fibonacci_~n)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4390#(<= 4 fibonacci_~n)} is VALID [2020-07-10 18:36:24,685 INFO L263 TraceCheckUtils]: 171: Hoare triple {4390#(<= 4 fibonacci_~n)} call #t~ret1 := fibonacci(~n - 2); {3840#true} is VALID [2020-07-10 18:36:24,686 INFO L280 TraceCheckUtils]: 172: Hoare triple {3840#true} ~n := #in~n; {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,687 INFO L280 TraceCheckUtils]: 173: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume !(~n < 1); {4027#(= fibonacci_~n |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,687 INFO L280 TraceCheckUtils]: 174: Hoare triple {4027#(= fibonacci_~n |fibonacci_#in~n|)} assume 1 == ~n; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,688 INFO L280 TraceCheckUtils]: 175: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} #res := 1; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,689 INFO L280 TraceCheckUtils]: 176: Hoare triple {4515#(<= |fibonacci_#in~n| 1)} assume true; {4515#(<= |fibonacci_#in~n| 1)} is VALID [2020-07-10 18:36:24,690 INFO L275 TraceCheckUtils]: 177: Hoare quadruple {4515#(<= |fibonacci_#in~n| 1)} {4390#(<= 4 fibonacci_~n)} #42#return; {3841#false} is VALID [2020-07-10 18:36:24,690 INFO L280 TraceCheckUtils]: 178: Hoare triple {3841#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3841#false} is VALID [2020-07-10 18:36:24,691 INFO L280 TraceCheckUtils]: 179: Hoare triple {3841#false} #res := #t~ret0 + #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,691 INFO L280 TraceCheckUtils]: 180: Hoare triple {3841#false} havoc #t~ret0; {3841#false} is VALID [2020-07-10 18:36:24,691 INFO L280 TraceCheckUtils]: 181: Hoare triple {3841#false} havoc #t~ret1; {3841#false} is VALID [2020-07-10 18:36:24,691 INFO L280 TraceCheckUtils]: 182: Hoare triple {3841#false} assume true; {3841#false} is VALID [2020-07-10 18:36:24,691 INFO L275 TraceCheckUtils]: 183: Hoare quadruple {3841#false} {4027#(= fibonacci_~n |fibonacci_#in~n|)} #42#return; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,692 INFO L280 TraceCheckUtils]: 184: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,693 INFO L280 TraceCheckUtils]: 185: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} #res := #t~ret0 + #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,693 INFO L280 TraceCheckUtils]: 186: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret0; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,694 INFO L280 TraceCheckUtils]: 187: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} havoc #t~ret1; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,695 INFO L280 TraceCheckUtils]: 188: Hoare triple {4198#(<= 6 |fibonacci_#in~n|)} assume true; {4198#(<= 6 |fibonacci_#in~n|)} is VALID [2020-07-10 18:36:24,696 INFO L275 TraceCheckUtils]: 189: Hoare quadruple {4198#(<= 6 |fibonacci_#in~n|)} {3840#true} #48#return; {4026#(<= 6 main_~x~0)} is VALID [2020-07-10 18:36:24,697 INFO L280 TraceCheckUtils]: 190: Hoare triple {4026#(<= 6 main_~x~0)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4026#(<= 6 main_~x~0)} is VALID [2020-07-10 18:36:24,697 INFO L280 TraceCheckUtils]: 191: Hoare triple {4026#(<= 6 main_~x~0)} ~result~0 := #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-10 18:36:24,698 INFO L280 TraceCheckUtils]: 192: Hoare triple {4026#(<= 6 main_~x~0)} havoc #t~ret3; {4026#(<= 6 main_~x~0)} is VALID [2020-07-10 18:36:24,699 INFO L280 TraceCheckUtils]: 193: Hoare triple {4026#(<= 6 main_~x~0)} assume !(5 != ~x~0 || 3 == ~result~0); {3841#false} is VALID [2020-07-10 18:36:24,699 INFO L280 TraceCheckUtils]: 194: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2020-07-10 18:36:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 116 proven. 33 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-07-10 18:36:24,722 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:36:24,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402662084] [2020-07-10 18:36:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:36:24,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 18:36:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024756612] [2020-07-10 18:36:24,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-10 18:36:24,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:36:24,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 18:36:24,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:24,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 18:36:24,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:36:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 18:36:24,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:36:24,851 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2020-07-10 18:36:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:25,726 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2020-07-10 18:36:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 18:36:25,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-07-10 18:36:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:36:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-10 18:36:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:36:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2020-07-10 18:36:25,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2020-07-10 18:36:25,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:25,873 INFO L225 Difference]: With dead ends: 143 [2020-07-10 18:36:25,874 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 18:36:25,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-10 18:36:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 18:36:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-10 18:36:26,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:36:26,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-10 18:36:26,007 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 18:36:26,007 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 18:36:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:26,012 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 18:36:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 18:36:26,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:26,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:26,014 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-10 18:36:26,014 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-10 18:36:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:36:26,017 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-10 18:36:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 18:36:26,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:36:26,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:36:26,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:36:26,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:36:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 18:36:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-07-10 18:36:26,020 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 195 [2020-07-10 18:36:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:36:26,021 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-07-10 18:36:26,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 18:36:26,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 77 transitions. [2020-07-10 18:36:26,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:36:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-10 18:36:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-10 18:36:26,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:36:26,145 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:36:26,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 18:36:26,145 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:36:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:36:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-07-10 18:36:26,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:36:26,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256663571] [2020-07-10 18:36:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-10 18:36:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:36:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:36:26,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 18:36:26,429 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; 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.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:36:26,436 INFO L168 Benchmark]: Toolchain (without parser) took 12934.99 ms. Allocated memory was 138.9 MB in the beginning and 370.7 MB in the end (delta: 231.7 MB). Free memory was 104.4 MB in the beginning and 336.0 MB in the end (delta: -231.6 MB). Peak memory consumption was 180.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,438 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.05 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,439 INFO L168 Benchmark]: Boogie Preprocessor took 111.66 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 94.5 MB in the beginning and 183.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,445 INFO L168 Benchmark]: RCFGBuilder took 312.91 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 165.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:36:26,445 INFO L168 Benchmark]: TraceAbstraction took 12261.65 ms. Allocated memory was 203.9 MB in the beginning and 370.7 MB in the end (delta: 166.7 MB). Free memory was 165.2 MB in the beginning and 336.0 MB in the end (delta: -170.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:36:26,450 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.05 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.66 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 94.5 MB in the beginning and 183.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.91 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 165.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12261.65 ms. Allocated memory was 203.9 MB in the beginning and 370.7 MB in the end (delta: 166.7 MB). Free memory was 165.2 MB in the beginning and 336.0 MB in the end (delta: -170.8 MB). There was no memory consumed. 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; 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;: 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...