/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:53:07,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:53:07,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:53:07,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:53:07,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:53:07,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:53:07,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:53:07,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:53:07,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:53:07,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:53:07,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:53:07,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:53:07,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:53:07,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:53:07,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:53:07,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:53:07,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:53:07,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:53:07,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:53:07,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:53:07,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:53:07,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:53:07,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:53:07,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:53:07,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:53:07,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:53:07,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:53:07,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:53:07,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:53:07,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:53:07,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:53:07,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:53:07,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:53:07,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:53:07,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:53:07,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:53:07,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:53:07,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:53:07,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:53:07,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:53:07,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:53:07,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:53:07,600 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:53:07,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:53:07,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:53:07,602 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:53:07,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:53:07,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:53:07,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:53:07,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:53:07,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:53:07,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:53:07,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:53:07,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:53:07,604 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:53:07,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:53:07,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:53:07,604 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:53:07,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:53:07,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:53:07,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:53:07,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:53:07,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:53:07,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:53:07,606 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:53:07,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:53:07,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:53:07,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:53:07,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:53:07,930 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:53:07,931 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-18 04:53:08,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922b0669c/4546491fa9ec4459b1794fe5d62851d8/FLAG7a48c74e3 [2020-07-18 04:53:08,566 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:53:08,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-18 04:53:08,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922b0669c/4546491fa9ec4459b1794fe5d62851d8/FLAG7a48c74e3 [2020-07-18 04:53:08,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922b0669c/4546491fa9ec4459b1794fe5d62851d8 [2020-07-18 04:53:08,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:53:08,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:53:08,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:53:08,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:53:08,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:53:08,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:53:08" (1/1) ... [2020-07-18 04:53:08,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b902dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:08, skipping insertion in model container [2020-07-18 04:53:08,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:53:08" (1/1) ... [2020-07-18 04:53:08,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:53:08,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:53:09,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:53:09,203 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:53:09,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:53:09,237 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:53:09,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09 WrapperNode [2020-07-18 04:53:09,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:53:09,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:53:09,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:53:09,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:53:09,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (1/1) ... [2020-07-18 04:53:09,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:53:09,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:53:09,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:53:09,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:53:09,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (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-18 04:53:09,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:53:09,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:53:09,439 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-18 04:53:09,439 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-18 04:53:09,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:53:09,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:53:09,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:53:09,802 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:53:09,803 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:53:09,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:53:09 BoogieIcfgContainer [2020-07-18 04:53:09,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:53:09,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:53:09,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:53:09,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:53:09,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:53:08" (1/3) ... [2020-07-18 04:53:09,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1ebea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:53:09, skipping insertion in model container [2020-07-18 04:53:09,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:53:09" (2/3) ... [2020-07-18 04:53:09,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1ebea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:53:09, skipping insertion in model container [2020-07-18 04:53:09,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:53:09" (3/3) ... [2020-07-18 04:53:09,819 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-18 04:53:09,833 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:53:09,842 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:53:09,858 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:53:09,888 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:53:09,889 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:53:09,889 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:53:09,889 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:53:09,889 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:53:09,890 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:53:09,890 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:53:09,890 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:53:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-18 04:53:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 04:53:09,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:09,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:09,917 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-18 04:53:09,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:09,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952275618] [2020-07-18 04:53:09,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 04:53:10,153 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-18 04:53:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:10,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:10,222 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,225 INFO L280 TraceCheckUtils]: 3: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,228 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-18 04:53:10,229 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2020-07-18 04:53:10,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-18 04:53:10,230 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #59#return; {48#true} is VALID [2020-07-18 04:53:10,230 INFO L263 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret5 := main(); {48#true} is VALID [2020-07-18 04:53:10,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} ~x~0 := 2; {52#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:10,232 INFO L263 TraceCheckUtils]: 5: Hoare triple {52#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {48#true} is VALID [2020-07-18 04:53:10,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#true} ~n := #in~n; {58#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:10,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {59#(<= |fibo1_#in~n| 0)} #res := 0; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {59#(<= |fibo1_#in~n| 0)} assume true; {59#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:10,240 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {59#(<= |fibo1_#in~n| 0)} {52#(<= 2 main_~x~0)} #63#return; {49#false} is VALID [2020-07-18 04:53:10,241 INFO L280 TraceCheckUtils]: 11: Hoare triple {49#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {49#false} is VALID [2020-07-18 04:53:10,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#false} ~result~0 := #t~ret4; {49#false} is VALID [2020-07-18 04:53:10,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {49#false} havoc #t~ret4; {49#false} is VALID [2020-07-18 04:53:10,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {49#false} assume 1 != ~result~0; {49#false} is VALID [2020-07-18 04:53:10,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-18 04:53:10,245 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-18 04:53:10,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952275618] [2020-07-18 04:53:10,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:53:10,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:53:10,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960336132] [2020-07-18 04:53:10,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:53:10,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:10,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:53:10,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:53:10,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:10,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:53:10,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:53:10,320 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-18 04:53:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:10,897 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-18 04:53:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:53:10,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-18 04:53:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-18 04:53:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-18 04:53:10,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-18 04:53:11,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:11,067 INFO L225 Difference]: With dead ends: 58 [2020-07-18 04:53:11,068 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 04:53:11,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:53:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 04:53:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-18 04:53:11,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:11,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,173 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,173 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,183 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 04:53:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,185 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,186 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-18 04:53:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,194 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 04:53:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:11,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:53:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-18 04:53:11,204 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-18 04:53:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:11,205 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-18 04:53:11,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:53:11,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-18 04:53:11,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 04:53:11,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:11,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:11,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:53:11,277 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-18 04:53:11,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:11,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1363843470] [2020-07-18 04:53:11,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-18 04:53:11,320 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-18 04:53:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:11,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,363 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,366 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-18 04:53:11,367 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2020-07-18 04:53:11,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-18 04:53:11,368 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #59#return; {348#true} is VALID [2020-07-18 04:53:11,368 INFO L263 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2020-07-18 04:53:11,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 2; {352#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:11,370 INFO L263 TraceCheckUtils]: 5: Hoare triple {352#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {348#true} is VALID [2020-07-18 04:53:11,371 INFO L280 TraceCheckUtils]: 6: Hoare triple {348#true} ~n := #in~n; {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {359#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:11,373 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,374 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#(<= |fibo1_#in~n| 1)} #res := 1; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,376 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(<= |fibo1_#in~n| 1)} assume true; {360#(<= |fibo1_#in~n| 1)} is VALID [2020-07-18 04:53:11,378 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {360#(<= |fibo1_#in~n| 1)} {352#(<= 2 main_~x~0)} #63#return; {349#false} is VALID [2020-07-18 04:53:11,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {349#false} is VALID [2020-07-18 04:53:11,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} ~result~0 := #t~ret4; {349#false} is VALID [2020-07-18 04:53:11,379 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#false} havoc #t~ret4; {349#false} is VALID [2020-07-18 04:53:11,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#false} assume 1 != ~result~0; {349#false} is VALID [2020-07-18 04:53:11,380 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-18 04:53:11,381 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-18 04:53:11,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1363843470] [2020-07-18 04:53:11,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:53:11,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:53:11,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696395572] [2020-07-18 04:53:11,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 04:53:11,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:11,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:53:11,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:11,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:53:11,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:53:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:53:11,414 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-18 04:53:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,775 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-18 04:53:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:53:11,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-18 04:53:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-18 04:53:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:53:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-18 04:53:11,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-18 04:53:11,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:11,898 INFO L225 Difference]: With dead ends: 50 [2020-07-18 04:53:11,899 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:53:11,900 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-18 04:53:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:53:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 04:53:11,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:11,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,971 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,971 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 04:53:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,977 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:53:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:53:11,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,979 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 04:53:11,980 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 04:53:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:11,986 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:53:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:53:11,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:11,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:11,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:11,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:53:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-18 04:53:11,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-18 04:53:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:11,994 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-18 04:53:11,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:53:11,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2020-07-18 04:53:12,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-18 04:53:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 04:53:12,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:12,071 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:12,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:53:12,072 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-18 04:53:12,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:12,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357060533] [2020-07-18 04:53:12,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,145 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-18 04:53:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,255 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:12,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,278 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-18 04:53:12,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-18 04:53:12,283 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-18 04:53:12,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,288 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,289 INFO L263 TraceCheckUtils]: 10: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-18 04:53:12,289 INFO L280 TraceCheckUtils]: 11: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,289 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,290 INFO L280 TraceCheckUtils]: 13: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,291 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-18 04:53:12,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-18 04:53:12,293 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-18 04:53:12,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2020-07-18 04:53:12,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,294 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #59#return; {637#true} is VALID [2020-07-18 04:53:12,295 INFO L263 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret5 := main(); {637#true} is VALID [2020-07-18 04:53:12,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 2; {641#(<= 2 main_~x~0)} is VALID [2020-07-18 04:53:12,297 INFO L263 TraceCheckUtils]: 5: Hoare triple {641#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {637#true} is VALID [2020-07-18 04:53:12,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {637#true} assume !(~n < 1); {664#(< 0 fibo1_~n)} is VALID [2020-07-18 04:53:12,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {664#(< 0 fibo1_~n)} assume !(1 == ~n); {665#(< 1 fibo1_~n)} is VALID [2020-07-18 04:53:12,300 INFO L263 TraceCheckUtils]: 9: Hoare triple {665#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {637#true} is VALID [2020-07-18 04:53:12,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#true} ~n := #in~n; {676#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:12,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {676#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {677#(<= |fibo2_#in~n| 0)} #res := 0; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,307 INFO L280 TraceCheckUtils]: 13: Hoare triple {677#(<= |fibo2_#in~n| 0)} assume true; {677#(<= |fibo2_#in~n| 0)} is VALID [2020-07-18 04:53:12,309 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {677#(<= |fibo2_#in~n| 0)} {665#(< 1 fibo1_~n)} #69#return; {638#false} is VALID [2020-07-18 04:53:12,309 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,309 INFO L263 TraceCheckUtils]: 16: Hoare triple {638#false} call #t~ret1 := fibo2(~n - 2); {637#true} is VALID [2020-07-18 04:53:12,310 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#true} ~n := #in~n; {637#true} is VALID [2020-07-18 04:53:12,310 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#true} assume ~n < 1; {637#true} is VALID [2020-07-18 04:53:12,310 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#true} #res := 0; {637#true} is VALID [2020-07-18 04:53:12,311 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#true} assume true; {637#true} is VALID [2020-07-18 04:53:12,311 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {637#true} {638#false} #71#return; {638#false} is VALID [2020-07-18 04:53:12,311 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,312 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#false} #res := #t~ret0 + #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,312 INFO L280 TraceCheckUtils]: 24: Hoare triple {638#false} havoc #t~ret1; {638#false} is VALID [2020-07-18 04:53:12,312 INFO L280 TraceCheckUtils]: 25: Hoare triple {638#false} havoc #t~ret0; {638#false} is VALID [2020-07-18 04:53:12,313 INFO L280 TraceCheckUtils]: 26: Hoare triple {638#false} assume true; {638#false} is VALID [2020-07-18 04:53:12,313 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {638#false} {641#(<= 2 main_~x~0)} #63#return; {638#false} is VALID [2020-07-18 04:53:12,313 INFO L280 TraceCheckUtils]: 28: Hoare triple {638#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {638#false} is VALID [2020-07-18 04:53:12,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {638#false} ~result~0 := #t~ret4; {638#false} is VALID [2020-07-18 04:53:12,314 INFO L280 TraceCheckUtils]: 30: Hoare triple {638#false} havoc #t~ret4; {638#false} is VALID [2020-07-18 04:53:12,314 INFO L280 TraceCheckUtils]: 31: Hoare triple {638#false} assume 1 != ~result~0; {638#false} is VALID [2020-07-18 04:53:12,314 INFO L280 TraceCheckUtils]: 32: Hoare triple {638#false} assume !false; {638#false} is VALID [2020-07-18 04:53:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 04:53:12,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357060533] [2020-07-18 04:53:12,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:12,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:53:12,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55958375] [2020-07-18 04:53:12,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 04:53:12,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:12,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:53:12,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:12,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:53:12,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:53:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:53:12,360 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-18 04:53:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:12,767 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-18 04:53:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:53:12,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 04:53:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-18 04:53:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-18 04:53:12,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-18 04:53:12,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:12,905 INFO L225 Difference]: With dead ends: 82 [2020-07-18 04:53:12,905 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 04:53:12,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:53:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 04:53:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-18 04:53:12,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:12,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,989 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,989 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2020-07-18 04:53:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:12,994 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-18 04:53:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-18 04:53:12,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:12,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:12,995 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2020-07-18 04:53:12,995 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2020-07-18 04:53:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:13,000 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-18 04:53:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-18 04:53:13,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:13,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:13,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:13,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-18 04:53:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-18 04:53:13,005 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-18 04:53:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:13,006 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-18 04:53:13,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:53:13,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-18 04:53:13,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-18 04:53:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 04:53:13,079 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:13,080 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:13,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:53:13,080 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-18 04:53:13,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:13,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1313807219] [2020-07-18 04:53:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:13,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-18 04:53:13,211 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-18 04:53:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:13,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-18 04:53:13,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-18 04:53:13,326 INFO L280 TraceCheckUtils]: 3: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,334 INFO L280 TraceCheckUtils]: 4: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,339 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-18 04:53:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:13,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-18 04:53:13,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,373 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-18 04:53:13,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-18 04:53:13,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {1026#true} assume !(1 == ~n); {1026#true} is VALID [2020-07-18 04:53:13,374 INFO L263 TraceCheckUtils]: 3: Hoare triple {1026#true} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-18 04:53:13,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-18 04:53:13,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-18 04:53:13,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,381 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-18 04:53:13,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-18 04:53:13,382 INFO L263 TraceCheckUtils]: 11: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-18 04:53:13,382 INFO L280 TraceCheckUtils]: 12: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,383 INFO L280 TraceCheckUtils]: 13: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-18 04:53:13,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,387 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-18 04:53:13,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-18 04:53:13,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} #res := #t~ret0 + #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,389 INFO L280 TraceCheckUtils]: 19: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret0; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,392 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {1026#true} #63#return; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-18 04:53:13,393 INFO L263 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2020-07-18 04:53:13,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2020-07-18 04:53:13,394 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #59#return; {1026#true} is VALID [2020-07-18 04:53:13,394 INFO L263 TraceCheckUtils]: 3: Hoare triple {1026#true} call #t~ret5 := main(); {1026#true} is VALID [2020-07-18 04:53:13,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {1026#true} ~x~0 := 2; {1026#true} is VALID [2020-07-18 04:53:13,394 INFO L263 TraceCheckUtils]: 5: Hoare triple {1026#true} call #t~ret4 := fibo1(~x~0); {1026#true} is VALID [2020-07-18 04:53:13,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-18 04:53:13,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {1026#true} assume !(1 == ~n); {1026#true} is VALID [2020-07-18 04:53:13,395 INFO L263 TraceCheckUtils]: 9: Hoare triple {1026#true} call #t~ret0 := fibo2(~n - 1); {1026#true} is VALID [2020-07-18 04:53:13,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {1026#true} assume !(~n < 1); {1026#true} is VALID [2020-07-18 04:53:13,396 INFO L280 TraceCheckUtils]: 12: Hoare triple {1026#true} assume 1 == ~n; {1026#true} is VALID [2020-07-18 04:53:13,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {1026#true} #res := 1; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,397 INFO L280 TraceCheckUtils]: 14: Hoare triple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-18 04:53:13,398 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1069#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {1026#true} #69#return; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-18 04:53:13,399 INFO L280 TraceCheckUtils]: 16: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-18 04:53:13,399 INFO L263 TraceCheckUtils]: 17: Hoare triple {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {1026#true} is VALID [2020-07-18 04:53:13,399 INFO L280 TraceCheckUtils]: 18: Hoare triple {1026#true} ~n := #in~n; {1026#true} is VALID [2020-07-18 04:53:13,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {1026#true} assume ~n < 1; {1026#true} is VALID [2020-07-18 04:53:13,400 INFO L280 TraceCheckUtils]: 20: Hoare triple {1026#true} #res := 0; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,400 INFO L280 TraceCheckUtils]: 21: Hoare triple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-18 04:53:13,401 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1070#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {1061#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #71#return; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-18 04:53:13,403 INFO L280 TraceCheckUtils]: 23: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-18 04:53:13,405 INFO L280 TraceCheckUtils]: 24: Hoare triple {1067#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} #res := #t~ret0 + #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,407 INFO L280 TraceCheckUtils]: 25: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret1; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,412 INFO L280 TraceCheckUtils]: 26: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} havoc #t~ret0; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,413 INFO L280 TraceCheckUtils]: 27: Hoare triple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-18 04:53:13,414 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1068#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {1026#true} #63#return; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-18 04:53:13,415 INFO L280 TraceCheckUtils]: 29: Hoare triple {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-18 04:53:13,416 INFO L280 TraceCheckUtils]: 30: Hoare triple {1053#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} ~result~0 := #t~ret4; {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-18 04:53:13,417 INFO L280 TraceCheckUtils]: 31: Hoare triple {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} havoc #t~ret4; {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-18 04:53:13,418 INFO L280 TraceCheckUtils]: 32: Hoare triple {1054#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {1027#false} is VALID [2020-07-18 04:53:13,418 INFO L280 TraceCheckUtils]: 33: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2020-07-18 04:53:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:53:13,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1313807219] [2020-07-18 04:53:13,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:13,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 04:53:13,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125033861] [2020-07-18 04:53:13,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-07-18 04:53:13,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:13,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 04:53:13,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 04:53:13,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 04:53:13,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-18 04:53:13,464 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 9 states. [2020-07-18 04:53:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:14,113 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-18 04:53:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 04:53:14,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-07-18 04:53:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:53:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-18 04:53:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 04:53:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2020-07-18 04:53:14,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2020-07-18 04:53:14,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:14,230 INFO L225 Difference]: With dead ends: 66 [2020-07-18 04:53:14,231 INFO L226 Difference]: Without dead ends: 60 [2020-07-18 04:53:14,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-18 04:53:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-18 04:53:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2020-07-18 04:53:14,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:14,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 52 states. [2020-07-18 04:53:14,318 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 52 states. [2020-07-18 04:53:14,318 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 52 states. [2020-07-18 04:53:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:14,325 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-18 04:53:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-18 04:53:14,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:14,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:14,326 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 60 states. [2020-07-18 04:53:14,326 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 60 states. [2020-07-18 04:53:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:14,331 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-18 04:53:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-18 04:53:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:14,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:14,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:14,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 04:53:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2020-07-18 04:53:14,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 34 [2020-07-18 04:53:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:14,337 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2020-07-18 04:53:14,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 04:53:14,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 63 transitions. [2020-07-18 04:53:14,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-18 04:53:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 04:53:14,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:14,443 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:14,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:53:14,443 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:14,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash 186293384, now seen corresponding path program 1 times [2020-07-18 04:53:14,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:14,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078950101] [2020-07-18 04:53:14,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:14,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 04:53:14,487 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1437#true} {1437#true} #59#return; {1437#true} is VALID [2020-07-18 04:53:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:14,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {1480#(<= |fibo2_#in~n| 1)} #res := 1; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {1480#(<= |fibo2_#in~n| 1)} assume true; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,550 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1480#(<= |fibo2_#in~n| 1)} {1437#true} #69#return; {1472#(<= fibo1_~n 2)} is VALID [2020-07-18 04:53:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:14,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume 1 == ~n; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} #res := 1; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,583 INFO L280 TraceCheckUtils]: 4: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume true; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,584 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1481#(<= 1 |fibo2_#in~n|)} {1472#(<= fibo1_~n 2)} #71#return; {1438#false} is VALID [2020-07-18 04:53:14,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {1437#true} ~n := #in~n; {1437#true} is VALID [2020-07-18 04:53:14,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume !(~n < 1); {1437#true} is VALID [2020-07-18 04:53:14,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} assume !(1 == ~n); {1437#true} is VALID [2020-07-18 04:53:14,586 INFO L263 TraceCheckUtils]: 3: Hoare triple {1437#true} call #t~ret0 := fibo2(~n - 1); {1437#true} is VALID [2020-07-18 04:53:14,588 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {1480#(<= |fibo2_#in~n| 1)} #res := 1; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {1480#(<= |fibo2_#in~n| 1)} assume true; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,597 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1480#(<= |fibo2_#in~n| 1)} {1437#true} #69#return; {1472#(<= fibo1_~n 2)} is VALID [2020-07-18 04:53:14,597 INFO L280 TraceCheckUtils]: 10: Hoare triple {1472#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1472#(<= fibo1_~n 2)} is VALID [2020-07-18 04:53:14,598 INFO L263 TraceCheckUtils]: 11: Hoare triple {1472#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {1437#true} is VALID [2020-07-18 04:53:14,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,600 INFO L280 TraceCheckUtils]: 14: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume 1 == ~n; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} #res := 1; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,601 INFO L280 TraceCheckUtils]: 16: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume true; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,602 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1481#(<= 1 |fibo2_#in~n|)} {1472#(<= fibo1_~n 2)} #71#return; {1438#false} is VALID [2020-07-18 04:53:14,603 INFO L280 TraceCheckUtils]: 18: Hoare triple {1438#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1438#false} is VALID [2020-07-18 04:53:14,603 INFO L280 TraceCheckUtils]: 19: Hoare triple {1438#false} #res := #t~ret0 + #t~ret1; {1438#false} is VALID [2020-07-18 04:53:14,603 INFO L280 TraceCheckUtils]: 20: Hoare triple {1438#false} havoc #t~ret1; {1438#false} is VALID [2020-07-18 04:53:14,604 INFO L280 TraceCheckUtils]: 21: Hoare triple {1438#false} havoc #t~ret0; {1438#false} is VALID [2020-07-18 04:53:14,604 INFO L280 TraceCheckUtils]: 22: Hoare triple {1438#false} assume true; {1438#false} is VALID [2020-07-18 04:53:14,604 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1438#false} {1441#(<= main_~x~0 2)} #63#return; {1438#false} is VALID [2020-07-18 04:53:14,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2020-07-18 04:53:14,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-18 04:53:14,605 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1437#true} {1437#true} #59#return; {1437#true} is VALID [2020-07-18 04:53:14,606 INFO L263 TraceCheckUtils]: 3: Hoare triple {1437#true} call #t~ret5 := main(); {1437#true} is VALID [2020-07-18 04:53:14,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} ~x~0 := 2; {1441#(<= main_~x~0 2)} is VALID [2020-07-18 04:53:14,607 INFO L263 TraceCheckUtils]: 5: Hoare triple {1441#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1437#true} is VALID [2020-07-18 04:53:14,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {1437#true} ~n := #in~n; {1437#true} is VALID [2020-07-18 04:53:14,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {1437#true} assume !(~n < 1); {1437#true} is VALID [2020-07-18 04:53:14,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {1437#true} assume !(1 == ~n); {1437#true} is VALID [2020-07-18 04:53:14,608 INFO L263 TraceCheckUtils]: 9: Hoare triple {1437#true} call #t~ret0 := fibo2(~n - 1); {1437#true} is VALID [2020-07-18 04:53:14,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,611 INFO L280 TraceCheckUtils]: 13: Hoare triple {1480#(<= |fibo2_#in~n| 1)} #res := 1; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,611 INFO L280 TraceCheckUtils]: 14: Hoare triple {1480#(<= |fibo2_#in~n| 1)} assume true; {1480#(<= |fibo2_#in~n| 1)} is VALID [2020-07-18 04:53:14,612 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1480#(<= |fibo2_#in~n| 1)} {1437#true} #69#return; {1472#(<= fibo1_~n 2)} is VALID [2020-07-18 04:53:14,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {1472#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1472#(<= fibo1_~n 2)} is VALID [2020-07-18 04:53:14,614 INFO L263 TraceCheckUtils]: 17: Hoare triple {1472#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {1437#true} is VALID [2020-07-18 04:53:14,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {1437#true} ~n := #in~n; {1479#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,615 INFO L280 TraceCheckUtils]: 19: Hoare triple {1479#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,616 INFO L280 TraceCheckUtils]: 20: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume 1 == ~n; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,616 INFO L280 TraceCheckUtils]: 21: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} #res := 1; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {1481#(<= 1 |fibo2_#in~n|)} assume true; {1481#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:14,619 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1481#(<= 1 |fibo2_#in~n|)} {1472#(<= fibo1_~n 2)} #71#return; {1438#false} is VALID [2020-07-18 04:53:14,619 INFO L280 TraceCheckUtils]: 24: Hoare triple {1438#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1438#false} is VALID [2020-07-18 04:53:14,619 INFO L280 TraceCheckUtils]: 25: Hoare triple {1438#false} #res := #t~ret0 + #t~ret1; {1438#false} is VALID [2020-07-18 04:53:14,619 INFO L280 TraceCheckUtils]: 26: Hoare triple {1438#false} havoc #t~ret1; {1438#false} is VALID [2020-07-18 04:53:14,620 INFO L280 TraceCheckUtils]: 27: Hoare triple {1438#false} havoc #t~ret0; {1438#false} is VALID [2020-07-18 04:53:14,620 INFO L280 TraceCheckUtils]: 28: Hoare triple {1438#false} assume true; {1438#false} is VALID [2020-07-18 04:53:14,620 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1438#false} {1441#(<= main_~x~0 2)} #63#return; {1438#false} is VALID [2020-07-18 04:53:14,620 INFO L280 TraceCheckUtils]: 30: Hoare triple {1438#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1438#false} is VALID [2020-07-18 04:53:14,621 INFO L280 TraceCheckUtils]: 31: Hoare triple {1438#false} ~result~0 := #t~ret4; {1438#false} is VALID [2020-07-18 04:53:14,621 INFO L280 TraceCheckUtils]: 32: Hoare triple {1438#false} havoc #t~ret4; {1438#false} is VALID [2020-07-18 04:53:14,621 INFO L280 TraceCheckUtils]: 33: Hoare triple {1438#false} assume 1 != ~result~0; {1438#false} is VALID [2020-07-18 04:53:14,621 INFO L280 TraceCheckUtils]: 34: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2020-07-18 04:53:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:53:14,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078950101] [2020-07-18 04:53:14,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:14,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:53:14,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480540440] [2020-07-18 04:53:14,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 04:53:14,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:14,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:53:14,660 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-18 04:53:14,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:53:14,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:53:14,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:53:14,662 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 7 states. [2020-07-18 04:53:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:15,245 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2020-07-18 04:53:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 04:53:15,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 04:53:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2020-07-18 04:53:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2020-07-18 04:53:15,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2020-07-18 04:53:15,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:15,437 INFO L225 Difference]: With dead ends: 101 [2020-07-18 04:53:15,437 INFO L226 Difference]: Without dead ends: 54 [2020-07-18 04:53:15,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:53:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-18 04:53:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-18 04:53:15,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:15,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2020-07-18 04:53:15,542 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-18 04:53:15,542 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-18 04:53:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:15,546 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-18 04:53:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-18 04:53:15,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:15,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:15,548 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2020-07-18 04:53:15,548 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2020-07-18 04:53:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:15,552 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-18 04:53:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-18 04:53:15,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:15,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:15,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:15,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 04:53:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2020-07-18 04:53:15,557 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2020-07-18 04:53:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:15,557 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2020-07-18 04:53:15,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:53:15,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2020-07-18 04:53:15,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-07-18 04:53:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 04:53:15,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:15,654 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:15,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:53:15,655 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-18 04:53:15,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:15,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149251318] [2020-07-18 04:53:15,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,701 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1908#true} {1908#true} #59#return; {1908#true} is VALID [2020-07-18 04:53:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} ~n := #in~n; {1991#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:15,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {1991#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {1992#(<= |fibo1_#in~n| 0)} #res := 0; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {1992#(<= |fibo1_#in~n| 0)} assume true; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,786 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1992#(<= |fibo1_#in~n| 0)} {1980#(< 1 fibo2_~n)} #65#return; {1909#false} is VALID [2020-07-18 04:53:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,805 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1908#true} {1909#false} #67#return; {1909#false} is VALID [2020-07-18 04:53:15,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {1908#true} assume !(~n < 1); {1979#(< 0 fibo2_~n)} is VALID [2020-07-18 04:53:15,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {1979#(< 0 fibo2_~n)} assume !(1 == ~n); {1980#(< 1 fibo2_~n)} is VALID [2020-07-18 04:53:15,808 INFO L263 TraceCheckUtils]: 3: Hoare triple {1980#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1908#true} is VALID [2020-07-18 04:53:15,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {1908#true} ~n := #in~n; {1991#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:15,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {1991#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {1992#(<= |fibo1_#in~n| 0)} #res := 0; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,811 INFO L280 TraceCheckUtils]: 7: Hoare triple {1992#(<= |fibo1_#in~n| 0)} assume true; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,812 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1992#(<= |fibo1_#in~n| 0)} {1980#(< 1 fibo2_~n)} #65#return; {1909#false} is VALID [2020-07-18 04:53:15,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {1909#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,813 INFO L263 TraceCheckUtils]: 10: Hoare triple {1909#false} call #t~ret3 := fibo1(~n - 2); {1908#true} is VALID [2020-07-18 04:53:15,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,814 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1908#true} {1909#false} #67#return; {1909#false} is VALID [2020-07-18 04:53:15,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {1909#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {1909#false} #res := #t~ret2 + #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {1909#false} havoc #t~ret2; {1909#false} is VALID [2020-07-18 04:53:15,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {1909#false} havoc #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {1909#false} assume true; {1909#false} is VALID [2020-07-18 04:53:15,816 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1909#false} {1908#true} #69#return; {1909#false} is VALID [2020-07-18 04:53:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:15,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,823 INFO L280 TraceCheckUtils]: 3: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,823 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1908#true} {1909#false} #71#return; {1909#false} is VALID [2020-07-18 04:53:15,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {1908#true} assume !(~n < 1); {1908#true} is VALID [2020-07-18 04:53:15,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {1908#true} assume !(1 == ~n); {1908#true} is VALID [2020-07-18 04:53:15,824 INFO L263 TraceCheckUtils]: 3: Hoare triple {1908#true} call #t~ret0 := fibo2(~n - 1); {1908#true} is VALID [2020-07-18 04:53:15,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,825 INFO L280 TraceCheckUtils]: 5: Hoare triple {1908#true} assume !(~n < 1); {1979#(< 0 fibo2_~n)} is VALID [2020-07-18 04:53:15,826 INFO L280 TraceCheckUtils]: 6: Hoare triple {1979#(< 0 fibo2_~n)} assume !(1 == ~n); {1980#(< 1 fibo2_~n)} is VALID [2020-07-18 04:53:15,826 INFO L263 TraceCheckUtils]: 7: Hoare triple {1980#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1908#true} is VALID [2020-07-18 04:53:15,827 INFO L280 TraceCheckUtils]: 8: Hoare triple {1908#true} ~n := #in~n; {1991#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:15,827 INFO L280 TraceCheckUtils]: 9: Hoare triple {1991#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {1992#(<= |fibo1_#in~n| 0)} #res := 0; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,828 INFO L280 TraceCheckUtils]: 11: Hoare triple {1992#(<= |fibo1_#in~n| 0)} assume true; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,829 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1992#(<= |fibo1_#in~n| 0)} {1980#(< 1 fibo2_~n)} #65#return; {1909#false} is VALID [2020-07-18 04:53:15,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {1909#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,829 INFO L263 TraceCheckUtils]: 14: Hoare triple {1909#false} call #t~ret3 := fibo1(~n - 2); {1908#true} is VALID [2020-07-18 04:53:15,830 INFO L280 TraceCheckUtils]: 15: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,830 INFO L280 TraceCheckUtils]: 16: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,830 INFO L280 TraceCheckUtils]: 17: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,830 INFO L280 TraceCheckUtils]: 18: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,830 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1908#true} {1909#false} #67#return; {1909#false} is VALID [2020-07-18 04:53:15,831 INFO L280 TraceCheckUtils]: 20: Hoare triple {1909#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,831 INFO L280 TraceCheckUtils]: 21: Hoare triple {1909#false} #res := #t~ret2 + #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,831 INFO L280 TraceCheckUtils]: 22: Hoare triple {1909#false} havoc #t~ret2; {1909#false} is VALID [2020-07-18 04:53:15,831 INFO L280 TraceCheckUtils]: 23: Hoare triple {1909#false} havoc #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,831 INFO L280 TraceCheckUtils]: 24: Hoare triple {1909#false} assume true; {1909#false} is VALID [2020-07-18 04:53:15,832 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1909#false} {1908#true} #69#return; {1909#false} is VALID [2020-07-18 04:53:15,832 INFO L280 TraceCheckUtils]: 26: Hoare triple {1909#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,832 INFO L263 TraceCheckUtils]: 27: Hoare triple {1909#false} call #t~ret1 := fibo2(~n - 2); {1908#true} is VALID [2020-07-18 04:53:15,833 INFO L280 TraceCheckUtils]: 28: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,833 INFO L280 TraceCheckUtils]: 29: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,833 INFO L280 TraceCheckUtils]: 30: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,834 INFO L280 TraceCheckUtils]: 31: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,834 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1908#true} {1909#false} #71#return; {1909#false} is VALID [2020-07-18 04:53:15,834 INFO L280 TraceCheckUtils]: 33: Hoare triple {1909#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,834 INFO L280 TraceCheckUtils]: 34: Hoare triple {1909#false} #res := #t~ret0 + #t~ret1; {1909#false} is VALID [2020-07-18 04:53:15,835 INFO L280 TraceCheckUtils]: 35: Hoare triple {1909#false} havoc #t~ret1; {1909#false} is VALID [2020-07-18 04:53:15,835 INFO L280 TraceCheckUtils]: 36: Hoare triple {1909#false} havoc #t~ret0; {1909#false} is VALID [2020-07-18 04:53:15,835 INFO L280 TraceCheckUtils]: 37: Hoare triple {1909#false} assume true; {1909#false} is VALID [2020-07-18 04:53:15,835 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1909#false} {1912#(<= main_~x~0 2)} #63#return; {1909#false} is VALID [2020-07-18 04:53:15,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {1908#true} call ULTIMATE.init(); {1908#true} is VALID [2020-07-18 04:53:15,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,837 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1908#true} {1908#true} #59#return; {1908#true} is VALID [2020-07-18 04:53:15,838 INFO L263 TraceCheckUtils]: 3: Hoare triple {1908#true} call #t~ret5 := main(); {1908#true} is VALID [2020-07-18 04:53:15,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {1908#true} ~x~0 := 2; {1912#(<= main_~x~0 2)} is VALID [2020-07-18 04:53:15,839 INFO L263 TraceCheckUtils]: 5: Hoare triple {1912#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1908#true} is VALID [2020-07-18 04:53:15,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {1908#true} assume !(~n < 1); {1908#true} is VALID [2020-07-18 04:53:15,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {1908#true} assume !(1 == ~n); {1908#true} is VALID [2020-07-18 04:53:15,840 INFO L263 TraceCheckUtils]: 9: Hoare triple {1908#true} call #t~ret0 := fibo2(~n - 1); {1908#true} is VALID [2020-07-18 04:53:15,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {1908#true} assume !(~n < 1); {1979#(< 0 fibo2_~n)} is VALID [2020-07-18 04:53:15,842 INFO L280 TraceCheckUtils]: 12: Hoare triple {1979#(< 0 fibo2_~n)} assume !(1 == ~n); {1980#(< 1 fibo2_~n)} is VALID [2020-07-18 04:53:15,842 INFO L263 TraceCheckUtils]: 13: Hoare triple {1980#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1908#true} is VALID [2020-07-18 04:53:15,842 INFO L280 TraceCheckUtils]: 14: Hoare triple {1908#true} ~n := #in~n; {1991#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:15,843 INFO L280 TraceCheckUtils]: 15: Hoare triple {1991#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,843 INFO L280 TraceCheckUtils]: 16: Hoare triple {1992#(<= |fibo1_#in~n| 0)} #res := 0; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,844 INFO L280 TraceCheckUtils]: 17: Hoare triple {1992#(<= |fibo1_#in~n| 0)} assume true; {1992#(<= |fibo1_#in~n| 0)} is VALID [2020-07-18 04:53:15,845 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1992#(<= |fibo1_#in~n| 0)} {1980#(< 1 fibo2_~n)} #65#return; {1909#false} is VALID [2020-07-18 04:53:15,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {1909#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,845 INFO L263 TraceCheckUtils]: 20: Hoare triple {1909#false} call #t~ret3 := fibo1(~n - 2); {1908#true} is VALID [2020-07-18 04:53:15,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,845 INFO L280 TraceCheckUtils]: 22: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,845 INFO L280 TraceCheckUtils]: 23: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 24: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,846 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1908#true} {1909#false} #67#return; {1909#false} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 26: Hoare triple {1909#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 27: Hoare triple {1909#false} #res := #t~ret2 + #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 28: Hoare triple {1909#false} havoc #t~ret2; {1909#false} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 29: Hoare triple {1909#false} havoc #t~ret3; {1909#false} is VALID [2020-07-18 04:53:15,846 INFO L280 TraceCheckUtils]: 30: Hoare triple {1909#false} assume true; {1909#false} is VALID [2020-07-18 04:53:15,847 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1909#false} {1908#true} #69#return; {1909#false} is VALID [2020-07-18 04:53:15,847 INFO L280 TraceCheckUtils]: 32: Hoare triple {1909#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,847 INFO L263 TraceCheckUtils]: 33: Hoare triple {1909#false} call #t~ret1 := fibo2(~n - 2); {1908#true} is VALID [2020-07-18 04:53:15,847 INFO L280 TraceCheckUtils]: 34: Hoare triple {1908#true} ~n := #in~n; {1908#true} is VALID [2020-07-18 04:53:15,847 INFO L280 TraceCheckUtils]: 35: Hoare triple {1908#true} assume ~n < 1; {1908#true} is VALID [2020-07-18 04:53:15,847 INFO L280 TraceCheckUtils]: 36: Hoare triple {1908#true} #res := 0; {1908#true} is VALID [2020-07-18 04:53:15,848 INFO L280 TraceCheckUtils]: 37: Hoare triple {1908#true} assume true; {1908#true} is VALID [2020-07-18 04:53:15,848 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1908#true} {1909#false} #71#return; {1909#false} is VALID [2020-07-18 04:53:15,848 INFO L280 TraceCheckUtils]: 39: Hoare triple {1909#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,848 INFO L280 TraceCheckUtils]: 40: Hoare triple {1909#false} #res := #t~ret0 + #t~ret1; {1909#false} is VALID [2020-07-18 04:53:15,848 INFO L280 TraceCheckUtils]: 41: Hoare triple {1909#false} havoc #t~ret1; {1909#false} is VALID [2020-07-18 04:53:15,849 INFO L280 TraceCheckUtils]: 42: Hoare triple {1909#false} havoc #t~ret0; {1909#false} is VALID [2020-07-18 04:53:15,849 INFO L280 TraceCheckUtils]: 43: Hoare triple {1909#false} assume true; {1909#false} is VALID [2020-07-18 04:53:15,849 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1909#false} {1912#(<= main_~x~0 2)} #63#return; {1909#false} is VALID [2020-07-18 04:53:15,849 INFO L280 TraceCheckUtils]: 45: Hoare triple {1909#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1909#false} is VALID [2020-07-18 04:53:15,850 INFO L280 TraceCheckUtils]: 46: Hoare triple {1909#false} ~result~0 := #t~ret4; {1909#false} is VALID [2020-07-18 04:53:15,850 INFO L280 TraceCheckUtils]: 47: Hoare triple {1909#false} havoc #t~ret4; {1909#false} is VALID [2020-07-18 04:53:15,850 INFO L280 TraceCheckUtils]: 48: Hoare triple {1909#false} assume 1 != ~result~0; {1909#false} is VALID [2020-07-18 04:53:15,850 INFO L280 TraceCheckUtils]: 49: Hoare triple {1909#false} assume !false; {1909#false} is VALID [2020-07-18 04:53:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-18 04:53:15,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149251318] [2020-07-18 04:53:15,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:15,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:53:15,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269598149] [2020-07-18 04:53:15,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2020-07-18 04:53:15,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:15,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:53:15,920 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-18 04:53:15,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:53:15,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:53:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:53:15,921 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2020-07-18 04:53:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:16,341 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2020-07-18 04:53:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:53:16,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2020-07-18 04:53:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-18 04:53:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:53:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-18 04:53:16,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2020-07-18 04:53:16,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:16,474 INFO L225 Difference]: With dead ends: 104 [2020-07-18 04:53:16,475 INFO L226 Difference]: Without dead ends: 56 [2020-07-18 04:53:16,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:53:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-18 04:53:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-18 04:53:16,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:16,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-18 04:53:16,607 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-18 04:53:16,608 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-18 04:53:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:16,612 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-18 04:53:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-18 04:53:16,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:16,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:16,613 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-18 04:53:16,613 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-18 04:53:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:16,617 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-18 04:53:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-18 04:53:16,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:16,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:16,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:16,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-18 04:53:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-07-18 04:53:16,622 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 50 [2020-07-18 04:53:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:16,623 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-07-18 04:53:16,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:53:16,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 65 transitions. [2020-07-18 04:53:16,722 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-18 04:53:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-07-18 04:53:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 04:53:16,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:53:16,724 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:53:16,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:53:16,725 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:53:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:53:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-18 04:53:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:53:16,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852813988] [2020-07-18 04:53:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:53:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,766 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2429#true} {2429#true} #59#return; {2429#true} is VALID [2020-07-18 04:53:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume !(~n < 1); {2429#true} is VALID [2020-07-18 04:53:16,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {2429#true} assume 1 == ~n; {2429#true} is VALID [2020-07-18 04:53:16,887 INFO L280 TraceCheckUtils]: 3: Hoare triple {2429#true} #res := 1; {2429#true} is VALID [2020-07-18 04:53:16,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,888 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #65#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,899 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,900 INFO L280 TraceCheckUtils]: 3: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,902 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #67#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} ~n := #in~n; {2504#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {2504#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-18 04:53:16,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,905 INFO L263 TraceCheckUtils]: 3: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2429#true} is VALID [2020-07-18 04:53:16,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {2429#true} assume !(~n < 1); {2429#true} is VALID [2020-07-18 04:53:16,906 INFO L280 TraceCheckUtils]: 6: Hoare triple {2429#true} assume 1 == ~n; {2429#true} is VALID [2020-07-18 04:53:16,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {2429#true} #res := 1; {2429#true} is VALID [2020-07-18 04:53:16,906 INFO L280 TraceCheckUtils]: 8: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,907 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #65#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,908 INFO L280 TraceCheckUtils]: 10: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,908 INFO L263 TraceCheckUtils]: 11: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2429#true} is VALID [2020-07-18 04:53:16,908 INFO L280 TraceCheckUtils]: 12: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,909 INFO L280 TraceCheckUtils]: 13: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,909 INFO L280 TraceCheckUtils]: 14: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,909 INFO L280 TraceCheckUtils]: 15: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,910 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #67#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,911 INFO L280 TraceCheckUtils]: 17: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,912 INFO L280 TraceCheckUtils]: 18: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,912 INFO L280 TraceCheckUtils]: 19: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,913 INFO L280 TraceCheckUtils]: 20: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,914 INFO L280 TraceCheckUtils]: 21: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume true; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,915 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2506#(<= 2 |fibo2_#in~n|)} {2474#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:53:16,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,925 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2429#true} {2498#(<= 3 |fibo1_#in~n|)} #71#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} ~n := #in~n; {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,927 INFO L263 TraceCheckUtils]: 3: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2429#true} is VALID [2020-07-18 04:53:16,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#true} ~n := #in~n; {2504#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {2504#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-18 04:53:16,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,930 INFO L263 TraceCheckUtils]: 7: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2429#true} is VALID [2020-07-18 04:53:16,930 INFO L280 TraceCheckUtils]: 8: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,930 INFO L280 TraceCheckUtils]: 9: Hoare triple {2429#true} assume !(~n < 1); {2429#true} is VALID [2020-07-18 04:53:16,931 INFO L280 TraceCheckUtils]: 10: Hoare triple {2429#true} assume 1 == ~n; {2429#true} is VALID [2020-07-18 04:53:16,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {2429#true} #res := 1; {2429#true} is VALID [2020-07-18 04:53:16,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,932 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #65#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,933 INFO L263 TraceCheckUtils]: 15: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2429#true} is VALID [2020-07-18 04:53:16,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,935 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #67#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,939 INFO L280 TraceCheckUtils]: 24: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,939 INFO L280 TraceCheckUtils]: 25: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume true; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,941 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2506#(<= 2 |fibo2_#in~n|)} {2474#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,942 INFO L280 TraceCheckUtils]: 27: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,942 INFO L263 TraceCheckUtils]: 28: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2429#true} is VALID [2020-07-18 04:53:16,942 INFO L280 TraceCheckUtils]: 29: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,942 INFO L280 TraceCheckUtils]: 30: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,943 INFO L280 TraceCheckUtils]: 31: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,943 INFO L280 TraceCheckUtils]: 32: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,944 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2429#true} {2498#(<= 3 |fibo1_#in~n|)} #71#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,945 INFO L280 TraceCheckUtils]: 34: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,945 INFO L280 TraceCheckUtils]: 35: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,946 INFO L280 TraceCheckUtils]: 36: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} havoc #t~ret1; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,947 INFO L280 TraceCheckUtils]: 37: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} havoc #t~ret0; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,947 INFO L280 TraceCheckUtils]: 38: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume true; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,948 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2498#(<= 3 |fibo1_#in~n|)} {2433#(<= main_~x~0 2)} #63#return; {2430#false} is VALID [2020-07-18 04:53:16,950 INFO L263 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2020-07-18 04:53:16,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,951 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2429#true} {2429#true} #59#return; {2429#true} is VALID [2020-07-18 04:53:16,951 INFO L263 TraceCheckUtils]: 3: Hoare triple {2429#true} call #t~ret5 := main(); {2429#true} is VALID [2020-07-18 04:53:16,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#true} ~x~0 := 2; {2433#(<= main_~x~0 2)} is VALID [2020-07-18 04:53:16,952 INFO L263 TraceCheckUtils]: 5: Hoare triple {2433#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {2429#true} is VALID [2020-07-18 04:53:16,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {2429#true} ~n := #in~n; {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {2474#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,954 INFO L263 TraceCheckUtils]: 9: Hoare triple {2474#(= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {2429#true} is VALID [2020-07-18 04:53:16,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {2429#true} ~n := #in~n; {2504#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {2504#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2020-07-18 04:53:16,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {2505#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,957 INFO L263 TraceCheckUtils]: 13: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {2429#true} is VALID [2020-07-18 04:53:16,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,957 INFO L280 TraceCheckUtils]: 15: Hoare triple {2429#true} assume !(~n < 1); {2429#true} is VALID [2020-07-18 04:53:16,958 INFO L280 TraceCheckUtils]: 16: Hoare triple {2429#true} assume 1 == ~n; {2429#true} is VALID [2020-07-18 04:53:16,958 INFO L280 TraceCheckUtils]: 17: Hoare triple {2429#true} #res := 1; {2429#true} is VALID [2020-07-18 04:53:16,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,959 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #65#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,960 INFO L280 TraceCheckUtils]: 20: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,961 INFO L263 TraceCheckUtils]: 21: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {2429#true} is VALID [2020-07-18 04:53:16,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,961 INFO L280 TraceCheckUtils]: 23: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,961 INFO L280 TraceCheckUtils]: 24: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,962 INFO L280 TraceCheckUtils]: 25: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,963 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2429#true} {2506#(<= 2 |fibo2_#in~n|)} #67#return; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,964 INFO L280 TraceCheckUtils]: 28: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} #res := #t~ret2 + #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,965 INFO L280 TraceCheckUtils]: 29: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret2; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,966 INFO L280 TraceCheckUtils]: 30: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} havoc #t~ret3; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,967 INFO L280 TraceCheckUtils]: 31: Hoare triple {2506#(<= 2 |fibo2_#in~n|)} assume true; {2506#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-18 04:53:16,968 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2506#(<= 2 |fibo2_#in~n|)} {2474#(= fibo1_~n |fibo1_#in~n|)} #69#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,969 INFO L280 TraceCheckUtils]: 33: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,969 INFO L263 TraceCheckUtils]: 34: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {2429#true} is VALID [2020-07-18 04:53:16,969 INFO L280 TraceCheckUtils]: 35: Hoare triple {2429#true} ~n := #in~n; {2429#true} is VALID [2020-07-18 04:53:16,969 INFO L280 TraceCheckUtils]: 36: Hoare triple {2429#true} assume ~n < 1; {2429#true} is VALID [2020-07-18 04:53:16,970 INFO L280 TraceCheckUtils]: 37: Hoare triple {2429#true} #res := 0; {2429#true} is VALID [2020-07-18 04:53:16,970 INFO L280 TraceCheckUtils]: 38: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-18 04:53:16,971 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2429#true} {2498#(<= 3 |fibo1_#in~n|)} #71#return; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,972 INFO L280 TraceCheckUtils]: 40: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,973 INFO L280 TraceCheckUtils]: 41: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} #res := #t~ret0 + #t~ret1; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,974 INFO L280 TraceCheckUtils]: 42: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} havoc #t~ret1; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,974 INFO L280 TraceCheckUtils]: 43: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} havoc #t~ret0; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,975 INFO L280 TraceCheckUtils]: 44: Hoare triple {2498#(<= 3 |fibo1_#in~n|)} assume true; {2498#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-18 04:53:16,976 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2498#(<= 3 |fibo1_#in~n|)} {2433#(<= main_~x~0 2)} #63#return; {2430#false} is VALID [2020-07-18 04:53:16,977 INFO L280 TraceCheckUtils]: 46: Hoare triple {2430#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {2430#false} is VALID [2020-07-18 04:53:16,977 INFO L280 TraceCheckUtils]: 47: Hoare triple {2430#false} ~result~0 := #t~ret4; {2430#false} is VALID [2020-07-18 04:53:16,977 INFO L280 TraceCheckUtils]: 48: Hoare triple {2430#false} havoc #t~ret4; {2430#false} is VALID [2020-07-18 04:53:16,977 INFO L280 TraceCheckUtils]: 49: Hoare triple {2430#false} assume 1 != ~result~0; {2430#false} is VALID [2020-07-18 04:53:16,978 INFO L280 TraceCheckUtils]: 50: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2020-07-18 04:53:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 04:53:16,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852813988] [2020-07-18 04:53:16,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:53:16,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:53:16,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001160457] [2020-07-18 04:53:16,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-18 04:53:16,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:53:16,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:53:17,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:17,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:53:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:53:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:53:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:53:17,039 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 8 states. [2020-07-18 04:53:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:17,605 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-18 04:53:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:53:17,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-18 04:53:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:53:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:53:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-18 04:53:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:53:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2020-07-18 04:53:17,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2020-07-18 04:53:17,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:17,692 INFO L225 Difference]: With dead ends: 56 [2020-07-18 04:53:17,692 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:53:17,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:53:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:53:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:53:17,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:53:17,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:53:17,694 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:53:17,694 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:53:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:17,694 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:53:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:53:17,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:17,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:17,695 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:53:17,695 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:53:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:53:17,695 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:53:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:53:17,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:17,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:53:17,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:53:17,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:53:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:53:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:53:17,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-18 04:53:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:53:17,696 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:53:17,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:53:17,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:53:17,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:53:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:53:17,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:53:17,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 04:53:17,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:53:18,530 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2020-07-18 04:53:19,179 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,179 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,180 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,180 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,180 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,180 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:53:19,181 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-18 04:53:19,181 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-18 04:53:19,181 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-18 04:53:19,181 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-18 04:53:19,181 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-18 04:53:19,182 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~result~0 1) (< 0 main_~result~0) (<= 2 main_~x~0)) [2020-07-18 04:53:19,182 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 2) (<= 2 main_~x~0)) [2020-07-18 04:53:19,183 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1) (<= 2 main_~x~0)) [2020-07-18 04:53:19,183 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 2 main_~x~0) [2020-07-18 04:53:19,183 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1) (<= 2 main_~x~0)) [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= main_~result~0 1) (<= |main_#t~ret4| 1) (< 0 main_~result~0) (<= 2 main_~x~0)) [2020-07-18 04:53:19,185 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= |fibo2_#in~n| 1) (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,185 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= |fibo2_#in~n| 0) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (and (or (not (<= |fibo2_#in~n| 1)) (and (<= |fibo2_#in~n| 0) (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= 1 |fibo2_#in~n|) (<= |fibo2_#res| 1))) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,186 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (and (or (not (<= |fibo2_#in~n| 1)) (and (<= |fibo2_#in~n| 0) (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (and (<= 1 |fibo2_#res|) (<= 1 |fibo2_#in~n|) (<= |fibo2_#res| 1))) (= fibo2_~n |fibo2_#in~n|)) [2020-07-18 04:53:19,187 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0))) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0))) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and .cse0 (or (<= |fibo1_#in~n| 1) (and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))))) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-18 04:53:19,187 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse1) .cse0 (<= .cse1 1))))) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| 0)) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse1) .cse0 (<= .cse1 1))))) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) (<= 1 .cse1) .cse0 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1) (<= .cse1 1))))) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and (<= 1 |fibo1_#t~ret0|) (< 1 fibo1_~n) (<= |fibo1_#t~ret0| 1) .cse0 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))) [2020-07-18 04:53:19,188 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#in~n|) .cse0) (and .cse0 (or (<= |fibo1_#in~n| 1) (and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1)))))) [2020-07-18 04:53:19,222 INFO L163 areAnnotationChecker]: CFG has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:53:19,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:53:19 BoogieIcfgContainer [2020-07-18 04:53:19,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:53:19,247 INFO L168 Benchmark]: Toolchain (without parser) took 10312.14 ms. Allocated memory was 137.4 MB in the beginning and 343.9 MB in the end (delta: 206.6 MB). Free memory was 101.6 MB in the beginning and 271.4 MB in the end (delta: -169.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,255 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.65 ms. Allocated memory is still 137.4 MB. Free memory was 101.2 MB in the beginning and 91.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,258 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 137.4 MB. Free memory was 91.4 MB in the beginning and 89.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,259 INFO L168 Benchmark]: RCFGBuilder took 541.34 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 159.8 MB in the end (delta: -70.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,259 INFO L168 Benchmark]: TraceAbstraction took 9433.45 ms. Allocated memory was 201.9 MB in the beginning and 343.9 MB in the end (delta: 142.1 MB). Free memory was 159.8 MB in the beginning and 271.4 MB in the end (delta: -111.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:53:19,270 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.65 ms. Allocated memory is still 137.4 MB. Free memory was 101.2 MB in the beginning and 91.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 137.4 MB. Free memory was 91.4 MB in the beginning and 89.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.34 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 159.8 MB in the end (delta: -70.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9433.45 ms. Allocated memory was 201.9 MB in the beginning and 343.9 MB in the end (delta: 142.1 MB). Free memory was 159.8 MB in the beginning and 271.4 MB in the end (delta: -111.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 2 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((!(\old(n) <= 1) || ((\old(n) <= 0 && \result <= 0) && 0 <= \result)) || ((1 <= \result && 1 <= \old(n)) && \result <= 1)) && n == \old(n) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (3 <= \old(n) && n == \old(n)) || (n == \old(n) && (\old(n) <= 1 || (1 <= \result && \result <= 1))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 294 SDtfs, 177 SDslu, 1053 SDs, 0 SdLazy, 372 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 297 PreInvPairs, 434 NumberOfFragments, 455 HoareAnnotationTreeSize, 297 FomulaSimplifications, 2072 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 45 FomulaSimplificationsInter, 666 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 16943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 27/49 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...