/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:19:33,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:19:33,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:19:33,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:19:33,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:19:33,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:19:33,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:19:33,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:19:33,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:19:33,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:19:33,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:19:33,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:19:33,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:19:34,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:19:34,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:19:34,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:19:34,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:19:34,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:19:34,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:19:34,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:19:34,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:19:34,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:19:34,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:19:34,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:19:34,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:19:34,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:19:34,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:19:34,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:19:34,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:19:34,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:19:34,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:19:34,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:19:34,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:19:34,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:19:34,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:19:34,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:19:34,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:19:34,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:19:34,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:19:34,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:19:34,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:19:34,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:19:34,038 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:19:34,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:19:34,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:19:34,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:19:34,040 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:19:34,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:19:34,041 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:19:34,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:19:34,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:19:34,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:19:34,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:19:34,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:19:34,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:19:34,042 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:19:34,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:19:34,042 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:19:34,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:19:34,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:19:34,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:19:34,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:19:34,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:19:34,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:19:34,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:19:34,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:19:34,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:19:34,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:19:34,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:19:34,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:19:34,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:19:34,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:19:34,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:19:34,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:19:34,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:19:34,327 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:19:34,327 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:19:34,328 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-17 22:19:34,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01364b215/18838d4935e7439fa60063c00e9f1964/FLAG43e8b1e4e [2020-07-17 22:19:34,861 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:19:34,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-07-17 22:19:34,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01364b215/18838d4935e7439fa60063c00e9f1964/FLAG43e8b1e4e [2020-07-17 22:19:35,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01364b215/18838d4935e7439fa60063c00e9f1964 [2020-07-17 22:19:35,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:19:35,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:19:35,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:19:35,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:19:35,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:19:35,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643b7e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35, skipping insertion in model container [2020-07-17 22:19:35,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:19:35,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:19:35,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:19:35,522 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:19:35,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:19:35,555 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:19:35,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35 WrapperNode [2020-07-17 22:19:35,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:19:35,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:19:35,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:19:35,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:19:35,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... [2020-07-17 22:19:35,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:19:35,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:19:35,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:19:35,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:19:35,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:19:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:19:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:19:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 22:19:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 22:19:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:19:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:19:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:19:36,022 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:19:36,022 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:19:36,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:19:36 BoogieIcfgContainer [2020-07-17 22:19:36,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:19:36,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:19:36,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:19:36,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:19:36,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:19:35" (1/3) ... [2020-07-17 22:19:36,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22447c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:19:36, skipping insertion in model container [2020-07-17 22:19:36,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:35" (2/3) ... [2020-07-17 22:19:36,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22447c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:19:36, skipping insertion in model container [2020-07-17 22:19:36,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:19:36" (3/3) ... [2020-07-17 22:19:36,037 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-07-17 22:19:36,049 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:19:36,057 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:19:36,073 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:19:36,108 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:19:36,108 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:19:36,108 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:19:36,108 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:19:36,108 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:19:36,109 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:19:36,109 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:19:36,109 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:19:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 22:19:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:19:36,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:36,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:36,138 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-17 22:19:36,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:36,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033386594] [2020-07-17 22:19:36,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:36,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:19:36,329 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:19:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:36,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:36,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:36,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:36,394 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-17 22:19:36,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-17 22:19:36,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:19:36,395 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:19:36,396 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-17 22:19:36,397 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 2; {40#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:36,397 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID [2020-07-17 22:19:36,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:36,399 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:36,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:36,403 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID [2020-07-17 22:19:36,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID [2020-07-17 22:19:36,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 1 != ~result~0; {37#false} is VALID [2020-07-17 22:19:36,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-17 22:19:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:19:36,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033386594] [2020-07-17 22:19:36,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:19:36,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:19:36,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803926271] [2020-07-17 22:19:36,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:19:36,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:36,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:19:36,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:36,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:19:36,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:36,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:19:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:19:36,467 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-17 22:19:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:36,746 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:19:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:19:36,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:19:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:19:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:19:36,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-17 22:19:36,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:36,894 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:19:36,894 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:19:36,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:19:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:19:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:19:36,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:36,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:36,966 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:36,966 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:36,978 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:19:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:36,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:36,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:36,980 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:36,980 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:36,986 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:19:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:36,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:36,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:36,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:36,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:19:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:19:37,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-17 22:19:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:37,006 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:19:37,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:19:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:19:37,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:37,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:37,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:19:37,008 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-17 22:19:37,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:37,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779025156] [2020-07-17 22:19:37,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:19:37,047 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:19:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:37,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:37,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,083 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-17 22:19:37,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-17 22:19:37,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:19:37,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:19:37,084 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-17 22:19:37,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 2; {211#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:37,086 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID [2020-07-17 22:19:37,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:37,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:37,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,090 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID [2020-07-17 22:19:37,090 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID [2020-07-17 22:19:37,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 1 != ~result~0; {208#false} is VALID [2020-07-17 22:19:37,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-17 22:19:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:19:37,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779025156] [2020-07-17 22:19:37,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:19:37,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:19:37,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595532185] [2020-07-17 22:19:37,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:19:37,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:37,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:19:37,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:37,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:19:37,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:19:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:19:37,114 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-17 22:19:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:37,295 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-17 22:19:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:19:37,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:19:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:19:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:19:37,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-17 22:19:37,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:37,358 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:19:37,358 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:19:37,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:19:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:19:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-17 22:19:37,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:37,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:37,377 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:37,378 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:37,382 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:19:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:19:37,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:37,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:37,383 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-17 22:19:37,383 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-17 22:19:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:37,387 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:19:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:19:37,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:37,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:37,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:37,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:19:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:19:37,393 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-17 22:19:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:37,393 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:19:37,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:19:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:19:37,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:37,395 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:37,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:19:37,396 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-17 22:19:37,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:37,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059193965] [2020-07-17 22:19:37,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,455 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:37,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,571 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:19:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:37,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,588 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:37,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,593 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:19:37,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:19:37,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:19:37,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:37,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,599 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:19:37,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:19:37,600 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:19:37,601 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:37,603 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,604 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:37,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-17 22:19:37,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:19:37,604 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:19:37,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:19:37,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,606 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:37,606 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:19:37,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:37,608 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-17 22:19:37,608 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:19:37,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:19:37,610 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:19:37,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:37,611 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,616 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID [2020-07-17 22:19:37,616 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:19:37,617 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:19:37,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,619 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:37,619 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,620 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:37,620 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {376#false} is VALID [2020-07-17 22:19:37,620 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:19:37,621 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:19:37,621 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-17 22:19:37,621 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-17 22:19:37,621 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:19:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:19:37,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059193965] [2020-07-17 22:19:37,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476942401] [2020-07-17 22:19:37,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:19:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:37,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:19:37,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:19:37,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:37,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:19:37,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:37,889 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID [2020-07-17 22:19:37,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:19:37,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:19:37,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:19:37,892 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID [2020-07-17 22:19:37,893 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:19:37,894 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID [2020-07-17 22:19:37,896 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,897 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:19:37,898 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:37,898 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:37,898 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:37,900 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,900 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,901 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:37,903 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:19:37,903 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID [2020-07-17 22:19:37,903 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 != ~result~0; {376#false} is VALID [2020-07-17 22:19:37,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:19:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:19:37,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:19:37,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:19:37,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201445976] [2020-07-17 22:19:37,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:19:37,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:37,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:19:37,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:37,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:19:37,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:37,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:19:37,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:19:37,959 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-17 22:19:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:38,528 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-17 22:19:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:19:38,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:19:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:19:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:19:38,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-17 22:19:38,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:38,636 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:19:38,636 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:19:38,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:19:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:19:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 22:19:38,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:38,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:38,661 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:38,661 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:38,664 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:19:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:19:38,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:38,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:38,666 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-17 22:19:38,666 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-17 22:19:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:38,669 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:19:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:19:38,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:38,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:38,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:38,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:19:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-17 22:19:38,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-17 22:19:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:38,674 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-17 22:19:38,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:19:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-17 22:19:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:19:38,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:38,677 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:38,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:19:38,892 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-17 22:19:38,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:38,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850808688] [2020-07-17 22:19:38,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:38,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:19:38,983 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:19:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:39,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,156 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:39,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-17 22:19:39,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-17 22:19:39,210 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:19:39,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,217 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,218 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,218 INFO L263 TraceCheckUtils]: 10: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:19:39,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,221 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-17 22:19:39,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,225 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-17 22:19:39,226 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-17 22:19:39,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:19:39,226 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:19:39,226 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-17 22:19:39,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-17 22:19:39,227 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-17 22:19:39,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,227 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-17 22:19:39,227 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:19:39,228 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,228 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,229 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,229 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,230 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,231 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,231 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:19:39,231 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,232 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,233 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,235 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} is VALID [2020-07-17 22:19:39,236 INFO L280 TraceCheckUtils]: 21: Hoare triple {719#(and (<= 1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|)) (<= (+ |fibo1_#t~ret1| |fibo1_#t~ret0|) 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,237 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,237 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-17 22:19:39,238 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-17 22:19:39,239 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-17 22:19:39,239 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-17 22:19:39,240 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-17 22:19:39,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850808688] [2020-07-17 22:19:39,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142259608] [2020-07-17 22:19:39,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:39,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-17 22:19:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:39,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:19:39,413 INFO L263 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2020-07-17 22:19:39,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2020-07-17 22:19:39,413 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #47#return; {685#true} is VALID [2020-07-17 22:19:39,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2020-07-17 22:19:39,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {685#true} ~x~0 := 2; {685#true} is VALID [2020-07-17 22:19:39,414 INFO L263 TraceCheckUtils]: 5: Hoare triple {685#true} call #t~ret4 := fibo1(~x~0); {685#true} is VALID [2020-07-17 22:19:39,414 INFO L280 TraceCheckUtils]: 6: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,415 INFO L280 TraceCheckUtils]: 7: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,415 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(1 == ~n); {685#true} is VALID [2020-07-17 22:19:39,415 INFO L263 TraceCheckUtils]: 9: Hoare triple {685#true} call #t~ret0 := fibo2(~n - 1); {685#true} is VALID [2020-07-17 22:19:39,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {685#true} assume !(~n < 1); {685#true} is VALID [2020-07-17 22:19:39,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {685#true} assume 1 == ~n;#res := 1; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} assume true; {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} is VALID [2020-07-17 22:19:39,418 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {721#(and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1))} {685#true} #57#return; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,419 INFO L280 TraceCheckUtils]: 15: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,419 INFO L263 TraceCheckUtils]: 16: Hoare triple {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} call #t~ret1 := fibo2(~n - 2); {685#true} is VALID [2020-07-17 22:19:39,419 INFO L280 TraceCheckUtils]: 17: Hoare triple {685#true} ~n := #in~n; {685#true} is VALID [2020-07-17 22:19:39,420 INFO L280 TraceCheckUtils]: 18: Hoare triple {685#true} assume ~n < 1;#res := 0; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,421 INFO L280 TraceCheckUtils]: 19: Hoare triple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} assume true; {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} is VALID [2020-07-17 22:19:39,422 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {722#(and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))} {714#(and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))} #59#return; {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} is VALID [2020-07-17 22:19:39,423 INFO L280 TraceCheckUtils]: 21: Hoare triple {786#(and (<= 1 |fibo1_#t~ret0|) (<= 0 |fibo1_#t~ret1|) (<= |fibo1_#t~ret1| 0) (<= |fibo1_#t~ret0| 1))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,424 INFO L280 TraceCheckUtils]: 22: Hoare triple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} assume true; {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} is VALID [2020-07-17 22:19:39,425 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {720#(and (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))} {685#true} #51#return; {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} is VALID [2020-07-17 22:19:39,426 INFO L280 TraceCheckUtils]: 24: Hoare triple {707#(and (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} is VALID [2020-07-17 22:19:39,427 INFO L280 TraceCheckUtils]: 25: Hoare triple {708#(and (<= main_~result~0 1) (< 0 main_~result~0))} assume 1 != ~result~0; {686#false} is VALID [2020-07-17 22:19:39,427 INFO L280 TraceCheckUtils]: 26: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-17 22:19:39,428 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-17 22:19:39,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:19:39,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-17 22:19:39,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486082583] [2020-07-17 22:19:39,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:19:39,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:39,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:19:39,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:39,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:19:39,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:19:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:19:39,471 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2020-07-17 22:19:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:39,846 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-17 22:19:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:19:39,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:19:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-17 22:19:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-17 22:19:39,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-17 22:19:39,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:39,928 INFO L225 Difference]: With dead ends: 46 [2020-07-17 22:19:39,928 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:19:39,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:19:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:19:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2020-07-17 22:19:39,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:39,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 37 states. [2020-07-17 22:19:39,953 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 37 states. [2020-07-17 22:19:39,953 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 37 states. [2020-07-17 22:19:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:39,957 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-17 22:19:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-17 22:19:39,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:39,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:39,959 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 42 states. [2020-07-17 22:19:39,959 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 42 states. [2020-07-17 22:19:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:39,963 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-17 22:19:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-07-17 22:19:39,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:39,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:39,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:39,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:19:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-17 22:19:39,967 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2020-07-17 22:19:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:39,967 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-17 22:19:39,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:19:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-17 22:19:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:19:39,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:39,971 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] [2020-07-17 22:19:40,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:40,185 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1725129826, now seen corresponding path program 1 times [2020-07-17 22:19:40,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:40,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283298382] [2020-07-17 22:19:40,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-17 22:19:40,226 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-17 22:19:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,296 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,300 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-17 22:19:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,326 INFO L280 TraceCheckUtils]: 2: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,328 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-17 22:19:40,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-17 22:19:40,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-17 22:19:40,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-17 22:19:40,329 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-17 22:19:40,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,331 INFO L280 TraceCheckUtils]: 6: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,333 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-17 22:19:40,334 INFO L280 TraceCheckUtils]: 9: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-17 22:19:40,334 INFO L263 TraceCheckUtils]: 10: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-17 22:19:40,335 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,335 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,337 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-17 22:19:40,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-17 22:19:40,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-17 22:19:40,338 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-17 22:19:40,339 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-17 22:19:40,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-17 22:19:40,339 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-17 22:19:40,340 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-17 22:19:40,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-17 22:19:40,341 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-17 22:19:40,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-17 22:19:40,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-17 22:19:40,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {995#true} assume !(1 == ~n); {995#true} is VALID [2020-07-17 22:19:40,342 INFO L263 TraceCheckUtils]: 9: Hoare triple {995#true} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-17 22:19:40,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,343 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {1031#(<= |fibo2_#in~n| 1)} assume true; {1031#(<= |fibo2_#in~n| 1)} is VALID [2020-07-17 22:19:40,345 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1031#(<= |fibo2_#in~n| 1)} {995#true} #57#return; {1024#(<= fibo1_~n 2)} is VALID [2020-07-17 22:19:40,346 INFO L280 TraceCheckUtils]: 15: Hoare triple {1024#(<= fibo1_~n 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1024#(<= fibo1_~n 2)} is VALID [2020-07-17 22:19:40,346 INFO L263 TraceCheckUtils]: 16: Hoare triple {1024#(<= fibo1_~n 2)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-17 22:19:40,347 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1030#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,347 INFO L280 TraceCheckUtils]: 18: Hoare triple {1030#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,348 INFO L280 TraceCheckUtils]: 19: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,348 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,349 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1024#(<= fibo1_~n 2)} #59#return; {996#false} is VALID [2020-07-17 22:19:40,350 INFO L280 TraceCheckUtils]: 22: Hoare triple {996#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {996#false} is VALID [2020-07-17 22:19:40,350 INFO L280 TraceCheckUtils]: 23: Hoare triple {996#false} assume true; {996#false} is VALID [2020-07-17 22:19:40,350 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {996#false} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-17 22:19:40,350 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-17 22:19:40,351 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-17 22:19:40,351 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-17 22:19:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:19:40,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283298382] [2020-07-17 22:19:40,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145881458] [2020-07-17 22:19:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:19:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:40,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:19:40,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2020-07-17 22:19:40,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-17 22:19:40,480 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {995#true} {995#true} #47#return; {995#true} is VALID [2020-07-17 22:19:40,480 INFO L263 TraceCheckUtils]: 3: Hoare triple {995#true} call #t~ret5 := main(); {995#true} is VALID [2020-07-17 22:19:40,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {995#true} ~x~0 := 2; {999#(<= main_~x~0 2)} is VALID [2020-07-17 22:19:40,481 INFO L263 TraceCheckUtils]: 5: Hoare triple {999#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {995#true} is VALID [2020-07-17 22:19:40,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {995#true} ~n := #in~n; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,483 INFO L263 TraceCheckUtils]: 9: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {995#true} is VALID [2020-07-17 22:19:40,483 INFO L280 TraceCheckUtils]: 10: Hoare triple {995#true} ~n := #in~n; {995#true} is VALID [2020-07-17 22:19:40,484 INFO L280 TraceCheckUtils]: 11: Hoare triple {995#true} assume !(~n < 1); {995#true} is VALID [2020-07-17 22:19:40,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {995#true} assume 1 == ~n;#res := 1; {995#true} is VALID [2020-07-17 22:19:40,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {995#true} assume true; {995#true} is VALID [2020-07-17 22:19:40,485 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {995#true} {1054#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1054#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,486 INFO L263 TraceCheckUtils]: 16: Hoare triple {1054#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {995#true} is VALID [2020-07-17 22:19:40,486 INFO L280 TraceCheckUtils]: 17: Hoare triple {995#true} ~n := #in~n; {1088#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {1088#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,488 INFO L280 TraceCheckUtils]: 19: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,488 INFO L280 TraceCheckUtils]: 20: Hoare triple {1032#(<= 1 |fibo2_#in~n|)} assume true; {1032#(<= 1 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:40,490 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1032#(<= 1 |fibo2_#in~n|)} {1054#(<= fibo1_~n |fibo1_#in~n|)} #59#return; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,490 INFO L280 TraceCheckUtils]: 22: Hoare triple {1101#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,491 INFO L280 TraceCheckUtils]: 23: Hoare triple {1101#(<= 3 |fibo1_#in~n|)} assume true; {1101#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:40,492 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1101#(<= 3 |fibo1_#in~n|)} {999#(<= main_~x~0 2)} #51#return; {996#false} is VALID [2020-07-17 22:19:40,492 INFO L280 TraceCheckUtils]: 25: Hoare triple {996#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {996#false} is VALID [2020-07-17 22:19:40,492 INFO L280 TraceCheckUtils]: 26: Hoare triple {996#false} assume 1 != ~result~0; {996#false} is VALID [2020-07-17 22:19:40,492 INFO L280 TraceCheckUtils]: 27: Hoare triple {996#false} assume !false; {996#false} is VALID [2020-07-17 22:19:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:19:40,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:19:40,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2020-07-17 22:19:40,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892590371] [2020-07-17 22:19:40,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:19:40,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:40,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:19:40,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:40,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:19:40,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:19:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:19:40,526 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 7 states. [2020-07-17 22:19:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:40,841 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2020-07-17 22:19:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:19:40,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:19:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:19:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-17 22:19:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:19:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-17 22:19:40,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-17 22:19:40,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:40,907 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:19:40,907 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:19:40,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:19:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:19:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-17 22:19:40,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:40,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-17 22:19:40,937 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-17 22:19:40,937 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-17 22:19:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:40,941 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-17 22:19:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-17 22:19:40,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:40,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:40,942 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-17 22:19:40,942 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-17 22:19:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:40,945 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2020-07-17 22:19:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2020-07-17 22:19:40,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:40,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:40,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:40,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:19:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-07-17 22:19:40,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2020-07-17 22:19:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:40,950 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-07-17 22:19:40,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:19:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2020-07-17 22:19:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 22:19:40,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:40,952 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:41,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:41,167 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-17 22:19:41,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:41,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923842923] [2020-07-17 22:19:41,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,201 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,201 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-17 22:19:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-17 22:19:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-17 22:19:41,314 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-17 22:19:41,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-17 22:19:41,316 INFO L263 TraceCheckUtils]: 3: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,320 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-17 22:19:41,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-17 22:19:41,320 INFO L263 TraceCheckUtils]: 9: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,321 INFO L280 TraceCheckUtils]: 12: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,322 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-17 22:19:41,322 INFO L280 TraceCheckUtils]: 14: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-17 22:19:41,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-17 22:19:41,323 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-17 22:19:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,328 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-17 22:19:41,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume !(~n < 1); {1309#true} is VALID [2020-07-17 22:19:41,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {1309#true} assume !(1 == ~n); {1309#true} is VALID [2020-07-17 22:19:41,330 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-17 22:19:41,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-17 22:19:41,332 INFO L263 TraceCheckUtils]: 7: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,333 INFO L280 TraceCheckUtils]: 8: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,334 INFO L280 TraceCheckUtils]: 9: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,336 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-17 22:19:41,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-17 22:19:41,337 INFO L263 TraceCheckUtils]: 13: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,339 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-17 22:19:41,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-17 22:19:41,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-17 22:19:41,340 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-17 22:19:41,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {1310#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1310#false} is VALID [2020-07-17 22:19:41,341 INFO L263 TraceCheckUtils]: 22: Hoare triple {1310#false} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,341 INFO L280 TraceCheckUtils]: 23: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,342 INFO L280 TraceCheckUtils]: 25: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,343 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-17 22:19:41,343 INFO L280 TraceCheckUtils]: 27: Hoare triple {1310#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1310#false} is VALID [2020-07-17 22:19:41,343 INFO L280 TraceCheckUtils]: 28: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-17 22:19:41,344 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1310#false} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-17 22:19:41,346 INFO L263 TraceCheckUtils]: 0: Hoare triple {1309#true} call ULTIMATE.init(); {1309#true} is VALID [2020-07-17 22:19:41,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,347 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-17 22:19:41,347 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret5 := main(); {1309#true} is VALID [2020-07-17 22:19:41,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~x~0 := 2; {1313#(<= main_~x~0 2)} is VALID [2020-07-17 22:19:41,349 INFO L263 TraceCheckUtils]: 5: Hoare triple {1313#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1309#true} is VALID [2020-07-17 22:19:41,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {1309#true} assume !(~n < 1); {1309#true} is VALID [2020-07-17 22:19:41,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {1309#true} assume !(1 == ~n); {1309#true} is VALID [2020-07-17 22:19:41,350 INFO L263 TraceCheckUtils]: 9: Hoare triple {1309#true} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {1309#true} assume !(~n < 1); {1365#(< 0 fibo2_~n)} is VALID [2020-07-17 22:19:41,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {1365#(< 0 fibo2_~n)} assume !(1 == ~n); {1366#(< 1 fibo2_~n)} is VALID [2020-07-17 22:19:41,353 INFO L263 TraceCheckUtils]: 13: Hoare triple {1366#(< 1 fibo2_~n)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1375#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {1375#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {1376#(<= |fibo1_#in~n| 0)} assume true; {1376#(<= |fibo1_#in~n| 0)} is VALID [2020-07-17 22:19:41,358 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1376#(<= |fibo1_#in~n| 0)} {1366#(< 1 fibo2_~n)} #53#return; {1310#false} is VALID [2020-07-17 22:19:41,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {1310#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1310#false} is VALID [2020-07-17 22:19:41,359 INFO L263 TraceCheckUtils]: 19: Hoare triple {1310#false} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,359 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,359 INFO L280 TraceCheckUtils]: 21: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,360 INFO L280 TraceCheckUtils]: 22: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,360 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1309#true} {1310#false} #55#return; {1310#false} is VALID [2020-07-17 22:19:41,361 INFO L280 TraceCheckUtils]: 24: Hoare triple {1310#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1310#false} is VALID [2020-07-17 22:19:41,361 INFO L280 TraceCheckUtils]: 25: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-17 22:19:41,361 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1310#false} {1309#true} #57#return; {1310#false} is VALID [2020-07-17 22:19:41,361 INFO L280 TraceCheckUtils]: 27: Hoare triple {1310#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1310#false} is VALID [2020-07-17 22:19:41,362 INFO L263 TraceCheckUtils]: 28: Hoare triple {1310#false} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,362 INFO L280 TraceCheckUtils]: 29: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,362 INFO L280 TraceCheckUtils]: 30: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,363 INFO L280 TraceCheckUtils]: 31: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,363 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1309#true} {1310#false} #59#return; {1310#false} is VALID [2020-07-17 22:19:41,363 INFO L280 TraceCheckUtils]: 33: Hoare triple {1310#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1310#false} is VALID [2020-07-17 22:19:41,363 INFO L280 TraceCheckUtils]: 34: Hoare triple {1310#false} assume true; {1310#false} is VALID [2020-07-17 22:19:41,364 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1310#false} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-17 22:19:41,364 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1310#false} is VALID [2020-07-17 22:19:41,364 INFO L280 TraceCheckUtils]: 37: Hoare triple {1310#false} assume 1 != ~result~0; {1310#false} is VALID [2020-07-17 22:19:41,365 INFO L280 TraceCheckUtils]: 38: Hoare triple {1310#false} assume !false; {1310#false} is VALID [2020-07-17 22:19:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:19:41,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923842923] [2020-07-17 22:19:41,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099508256] [2020-07-17 22:19:41,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:19:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:41,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:19:41,614 INFO L263 TraceCheckUtils]: 0: Hoare triple {1309#true} call ULTIMATE.init(); {1309#true} is VALID [2020-07-17 22:19:41,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1309#true} {1309#true} #47#return; {1309#true} is VALID [2020-07-17 22:19:41,615 INFO L263 TraceCheckUtils]: 3: Hoare triple {1309#true} call #t~ret5 := main(); {1309#true} is VALID [2020-07-17 22:19:41,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {1309#true} ~x~0 := 2; {1313#(<= main_~x~0 2)} is VALID [2020-07-17 22:19:41,616 INFO L263 TraceCheckUtils]: 5: Hoare triple {1313#(<= main_~x~0 2)} call #t~ret4 := fibo1(~x~0); {1309#true} is VALID [2020-07-17 22:19:41,617 INFO L280 TraceCheckUtils]: 6: Hoare triple {1309#true} ~n := #in~n; {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,617 INFO L280 TraceCheckUtils]: 7: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {1398#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,618 INFO L263 TraceCheckUtils]: 9: Hoare triple {1398#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret0 := fibo2(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,619 INFO L280 TraceCheckUtils]: 10: Hoare triple {1309#true} ~n := #in~n; {1411#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {1411#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {1415#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} is VALID [2020-07-17 22:19:41,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {1415#(and (<= fibo2_~n |fibo2_#in~n|) (<= 1 fibo2_~n))} assume !(1 == ~n); {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,621 INFO L263 TraceCheckUtils]: 13: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} call #t~ret2 := fibo1(~n - 1); {1309#true} is VALID [2020-07-17 22:19:41,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,621 INFO L280 TraceCheckUtils]: 15: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,621 INFO L280 TraceCheckUtils]: 16: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,622 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1309#true} {1419#(<= 2 |fibo2_#in~n|)} #53#return; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,623 INFO L263 TraceCheckUtils]: 19: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} call #t~ret3 := fibo1(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,624 INFO L280 TraceCheckUtils]: 20: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,625 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1309#true} {1419#(<= 2 |fibo2_#in~n|)} #55#return; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,626 INFO L280 TraceCheckUtils]: 24: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;#res := #t~ret2 + #t~ret3;havoc #t~ret2;havoc #t~ret3; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {1419#(<= 2 |fibo2_#in~n|)} assume true; {1419#(<= 2 |fibo2_#in~n|)} is VALID [2020-07-17 22:19:41,627 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1419#(<= 2 |fibo2_#in~n|)} {1398#(<= fibo1_~n |fibo1_#in~n|)} #57#return; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,628 INFO L280 TraceCheckUtils]: 27: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,628 INFO L263 TraceCheckUtils]: 28: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} call #t~ret1 := fibo2(~n - 2); {1309#true} is VALID [2020-07-17 22:19:41,629 INFO L280 TraceCheckUtils]: 29: Hoare triple {1309#true} ~n := #in~n; {1309#true} is VALID [2020-07-17 22:19:41,629 INFO L280 TraceCheckUtils]: 30: Hoare triple {1309#true} assume ~n < 1;#res := 0; {1309#true} is VALID [2020-07-17 22:19:41,629 INFO L280 TraceCheckUtils]: 31: Hoare triple {1309#true} assume true; {1309#true} is VALID [2020-07-17 22:19:41,630 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1309#true} {1462#(<= 3 |fibo1_#in~n|)} #59#return; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,631 INFO L280 TraceCheckUtils]: 33: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,631 INFO L280 TraceCheckUtils]: 34: Hoare triple {1462#(<= 3 |fibo1_#in~n|)} assume true; {1462#(<= 3 |fibo1_#in~n|)} is VALID [2020-07-17 22:19:41,632 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1462#(<= 3 |fibo1_#in~n|)} {1313#(<= main_~x~0 2)} #51#return; {1310#false} is VALID [2020-07-17 22:19:41,632 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {1310#false} is VALID [2020-07-17 22:19:41,633 INFO L280 TraceCheckUtils]: 37: Hoare triple {1310#false} assume 1 != ~result~0; {1310#false} is VALID [2020-07-17 22:19:41,633 INFO L280 TraceCheckUtils]: 38: Hoare triple {1310#false} assume !false; {1310#false} is VALID [2020-07-17 22:19:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:19:41,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:19:41,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-17 22:19:41,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091685210] [2020-07-17 22:19:41,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-17 22:19:41,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:41,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:19:41,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:41,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:19:41,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:19:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:19:41,706 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 12 states. [2020-07-17 22:19:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:42,316 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2020-07-17 22:19:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:19:42,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-17 22:19:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:19:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-17 22:19:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:19:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2020-07-17 22:19:42,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2020-07-17 22:19:42,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:19:42,432 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:19:42,432 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:19:42,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:19:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:19:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:19:42,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:42,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:19:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:19:42,436 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:19:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:42,437 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:19:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:19:42,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:42,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:42,437 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:19:42,437 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:19:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:42,438 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:19:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:19:42,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:42,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:42,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:42,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:19:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:19:42,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-07-17 22:19:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:42,441 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:19:42,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:19:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:19:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:42,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:19:42,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:19:42,838 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:19:42,839 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:19:42,839 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:19:42,839 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:19:42,839 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:19:42,839 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:19:42,839 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 2) (<= 2 main_~x~0)) [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-07-17 22:19:42,840 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-17 22:19:42,840 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-17 22:19:42,841 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-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-07-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-07-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-07-17 22:19:42,841 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-07-17 22:19:42,842 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-17 22:19:42,842 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 22:19:42,842 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-17 22:19:42,842 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-17 22:19:42,842 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-07-17 22:19:42,842 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-07-17 22:19:42,842 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-17 22:19:42,842 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-07-17 22:19:42,843 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-07-17 22:19:42,847 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:19:42,848 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:19:42,848 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:19:42,848 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:19:42,848 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-17 22:19:42,849 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:19:42,850 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:19:42,851 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:19:42,852 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:19:42,852 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:19:42,852 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:19:42,852 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:19:42,852 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:19:42,852 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:19:42,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:19:42 BoogieIcfgContainer [2020-07-17 22:19:42,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:19:42,858 INFO L168 Benchmark]: Toolchain (without parser) took 7547.04 ms. Allocated memory was 137.4 MB in the beginning and 308.3 MB in the end (delta: 170.9 MB). Free memory was 102.4 MB in the beginning and 243.0 MB in the end (delta: -140.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,858 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 92.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,860 INFO L168 Benchmark]: Boogie Preprocessor took 110.62 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 180.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,860 INFO L168 Benchmark]: RCFGBuilder took 359.50 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 160.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,861 INFO L168 Benchmark]: TraceAbstraction took 6826.01 ms. Allocated memory was 200.8 MB in the beginning and 308.3 MB in the end (delta: 107.5 MB). Free memory was 160.2 MB in the beginning and 243.0 MB in the end (delta: -82.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:42,864 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 1.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.80 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 92.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.62 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 180.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.50 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 160.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6826.01 ms. Allocated memory was 200.8 MB in the beginning and 308.3 MB in the end (delta: 107.5 MB). Free memory was 160.2 MB in the beginning and 243.0 MB in the end (delta: -82.8 MB). Peak memory consumption was 24.7 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 101 SDslu, 753 SDs, 0 SdLazy, 446 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 50 PreInvPairs, 59 NumberOfFragments, 55 HoareAnnotationTreeSize, 50 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 15275 SizeOfPredicates, 10 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 35/58 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...