/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:19:26,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:19:26,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:19:26,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:19:26,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:19:26,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:19:26,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:19:26,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:19:26,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:19:26,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:19:26,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:19:26,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:19:26,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:19:26,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:19:26,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:19:26,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:19:26,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:19:26,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:19:26,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:19:26,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:19:26,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:19:26,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:19:26,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:19:26,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:19:26,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:19:26,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:19:26,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:19:26,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:19:26,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:19:26,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:19:26,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:19:26,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:19:26,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:19:26,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:19:26,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:19:26,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:19:26,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:19:26,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:19:26,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:19:26,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:19:26,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:19:26,725 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:26,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:19:26,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:19:26,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:19:26,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:19:26,767 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:19:26,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:19:26,768 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:19:26,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:19:26,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:19:26,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:19:26,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:19:26,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:19:26,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:19:26,769 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:19:26,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:19:26,770 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:19:26,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:19:26,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:19:26,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:19:26,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:19:26,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:19:26,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:19:26,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:19:26,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:19:26,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:19:26,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:19:26,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:19:26,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:19:26,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:19:26,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:19:27,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:19:27,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:19:27,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:19:27,064 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:19:27,065 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:19:27,066 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-17 22:19:27,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b43bd0c/fcb54d6f829c459ab2c74916d6ea1579/FLAG91b0c1ced [2020-07-17 22:19:27,588 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:19:27,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c [2020-07-17 22:19:27,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b43bd0c/fcb54d6f829c459ab2c74916d6ea1579/FLAG91b0c1ced [2020-07-17 22:19:28,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b43bd0c/fcb54d6f829c459ab2c74916d6ea1579 [2020-07-17 22:19:28,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:19:28,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:19:28,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:19:28,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:19:28,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:19:28,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:19:28" (1/1) ... [2020-07-17 22:19:28,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71873450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:28, skipping insertion in model container [2020-07-17 22:19:28,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:19:28" (1/1) ... [2020-07-17 22:19:28,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:19:28,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:19:28,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:19:28,232 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:19:28,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:19:28,266 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:19:28,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:28 WrapperNode [2020-07-17 22:19:28,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:19:28,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:19:28,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:19:28,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:19:28,280 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:28" (1/1) ... [2020-07-17 22:19:28,281 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:28" (1/1) ... [2020-07-17 22:19:28,286 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:28" (1/1) ... [2020-07-17 22:19:28,286 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:28" (1/1) ... [2020-07-17 22:19:28,378 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:28" (1/1) ... [2020-07-17 22:19:28,381 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:28" (1/1) ... [2020-07-17 22:19:28,386 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:28" (1/1) ... [2020-07-17 22:19:28,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:19:28,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:19:28,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:19:28,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:19:28,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:28" (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:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:19:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:19:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 22:19:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 22:19:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:19:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:19:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:19:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 22:19:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 22:19:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:19:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:19:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:19:28,817 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:19:28,817 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:19:28,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:19:28 BoogieIcfgContainer [2020-07-17 22:19:28,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:19:28,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:19:28,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:19:28,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:19:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:19:28" (1/3) ... [2020-07-17 22:19:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31820a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:19:28, skipping insertion in model container [2020-07-17 22:19:28,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:19:28" (2/3) ... [2020-07-17 22:19:28,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31820a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:19:28, skipping insertion in model container [2020-07-17 22:19:28,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:19:28" (3/3) ... [2020-07-17 22:19:28,829 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c [2020-07-17 22:19:28,840 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:19:28,847 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:19:28,861 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:19:28,883 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:19:28,883 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:19:28,884 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:19:28,884 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:19:28,884 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:19:28,884 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:19:28,884 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:19:28,884 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:19:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 22:19:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:19:28,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:28,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:28,908 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-17 22:19:28,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:28,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170194001] [2020-07-17 22:19:28,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:19:29,109 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:19:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:29,183 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:29,184 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:29,186 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:29,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-17 22:19:29,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-17 22:19:29,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID [2020-07-17 22:19:29,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2020-07-17 22:19:29,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 2; {40#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:29,190 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:29,191 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:29,192 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:29,193 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:29,194 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:29,195 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:29,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 1 == ~result~0; {37#false} is VALID [2020-07-17 22:19:29,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-17 22:19:29,198 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:29,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170194001] [2020-07-17 22:19:29,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:19:29,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:19:29,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99104677] [2020-07-17 22:19:29,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:19:29,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:29,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:19:29,266 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:29,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:19:29,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:19:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:19:29,281 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-17 22:19:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:29,595 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:19:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:19:29,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:19:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:19:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-17 22:19:29,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-17 22:19:29,702 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:29,718 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:19:29,718 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:19:29,722 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:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:19:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:19:29,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:29,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:29,801 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:29,801 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:29,815 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:19:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:29,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:29,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:29,817 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:29,817 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:19:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:29,832 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-17 22:19:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:29,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:29,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:29,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:29,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:19:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:19:29,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-17 22:19:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:29,847 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:19:29,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:19:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:19:29,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:29,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:19:29,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:19:29,850 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-17 22:19:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:29,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972928963] [2020-07-17 22:19:29,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:19:29,914 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:19:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:29,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:29,978 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:29,979 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:29,979 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:29,981 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:29,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2020-07-17 22:19:29,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2020-07-17 22:19:29,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID [2020-07-17 22:19:29,983 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID [2020-07-17 22:19:29,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 2; {211#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:29,986 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:29,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID [2020-07-17 22:19:29,987 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:29,988 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:29,989 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:29,990 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:29,991 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:29,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 1 == ~result~0; {208#false} is VALID [2020-07-17 22:19:29,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2020-07-17 22:19:29,992 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:29,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972928963] [2020-07-17 22:19:29,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:19:29,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:19:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457682212] [2020-07-17 22:19:29,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:19:30,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:30,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:19:30,021 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:30,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:19:30,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:19:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:19:30,025 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-17 22:19:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:30,214 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-17 22:19:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:19:30,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:19:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:19:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:19:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-17 22:19:30,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-17 22:19:30,276 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:30,279 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:19:30,279 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:19:30,280 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:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:19:30,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-17 22:19:30,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:30,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:30,294 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:30,294 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-17 22:19:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:30,298 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:19:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:19:30,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:30,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:30,299 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-17 22:19:30,299 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-17 22:19:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:30,303 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-17 22:19:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:19:30,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:30,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:30,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:30,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:19:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 22:19:30,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-17 22:19:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:30,308 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 22:19:30,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:19:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 22:19:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:19:30,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:30,310 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:30,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:19:30,310 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-17 22:19:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:30,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232609673] [2020-07-17 22:19:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,356 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:30,434 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:30,434 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:30,436 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:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:30,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,443 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:30,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:19:30,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:19:30,446 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:30,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:30,448 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:30,448 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:30,450 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:30,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:19:30,450 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:19:30,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:30,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,452 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:30,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {376#false} is VALID [2020-07-17 22:19:30,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:19:30,453 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:19:30,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:19:30,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,454 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:30,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:19:30,455 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:30,456 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:30,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID [2020-07-17 22:19:30,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID [2020-07-17 22:19:30,458 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:30,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID [2020-07-17 22:19:30,459 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:30,460 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:30,461 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:30,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID [2020-07-17 22:19:30,462 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID [2020-07-17 22:19:30,462 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:30,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,463 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID [2020-07-17 22:19:30,464 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {376#false} is VALID [2020-07-17 22:19:30,464 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID [2020-07-17 22:19:30,464 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID [2020-07-17 22:19:30,465 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:30,465 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 == ~result~0; {376#false} is VALID [2020-07-17 22:19:30,465 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:19:30,467 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:30,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232609673] [2020-07-17 22:19:30,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009226349] [2020-07-17 22:19:30,467 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:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:19:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:19:30,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:19:30,666 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID [2020-07-17 22:19:30,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID [2020-07-17 22:19:30,667 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID [2020-07-17 22:19:30,669 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID [2020-07-17 22:19:30,669 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:30,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2020-07-17 22:19:30,671 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:30,672 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:30,672 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:30,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2020-07-17 22:19:30,674 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:30,675 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:30,677 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:30,678 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:30,678 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:30,678 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID [2020-07-17 22:19:30,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID [2020-07-17 22:19:30,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID [2020-07-17 22:19:30,681 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:30,681 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~ret0;havoc #t~ret1; {453#(<= |fibo1_#in~n| 1)} is VALID [2020-07-17 22:19:30,682 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:30,684 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:30,684 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:30,685 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 == ~result~0; {376#false} is VALID [2020-07-17 22:19:30,685 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID [2020-07-17 22:19:30,687 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:30,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:19:30,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 22:19:30,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900251690] [2020-07-17 22:19:30,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:19:30,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:19:30,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:19:30,742 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:30,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:19:30,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:19:30,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:19:30,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:19:30,744 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-17 22:19:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:31,347 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-17 22:19:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:19:31,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:19:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:19:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:19:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:19:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2020-07-17 22:19:31,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2020-07-17 22:19:31,461 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:31,464 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:19:31,464 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:19:31,465 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:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:19:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 22:19:31,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:19:31,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:31,483 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:31,483 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-17 22:19:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:31,492 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:19:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:19:31,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:31,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:31,493 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-17 22:19:31,493 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-17 22:19:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:19:31,498 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-17 22:19:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-17 22:19:31,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:19:31,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:19:31,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:19:31,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:19:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:19:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-17 22:19:31,506 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-17 22:19:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:19:31,506 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-17 22:19:31,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:19:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-17 22:19:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:19:31,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:19:31,513 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:31,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:19:31,714 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:19:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:19:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-17 22:19:31,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:19:31,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876873349] [2020-07-17 22:19:31,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:19:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:19:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:19:31,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:19:31,753 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:19:31,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation [2020-07-17 22:19:31,782 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation [2020-07-17 22:19:31,783 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:19:31,783 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:19:31,783 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:19:31,787 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:19:31,787 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:19:31,788 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:19:31,788 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:19:31,788 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:19:31,791 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:19:31,791 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:19:31,794 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:19:31,795 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:19:31,795 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:19:31,795 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation [2020-07-17 22:19:31,795 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:19:31,795 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:19:31,796 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:19:31,797 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:19:31,798 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-17 22:19:31,798 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:19:31,798 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:19:31,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:19:31 BoogieIcfgContainer [2020-07-17 22:19:31,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:19:31,808 INFO L168 Benchmark]: Toolchain (without parser) took 3788.08 ms. Allocated memory was 138.9 MB in the beginning and 244.8 MB in the end (delta: 105.9 MB). Free memory was 102.5 MB in the beginning and 104.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:31,810 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:19:31,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.13 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.6 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:31,813 INFO L168 Benchmark]: Boogie Preprocessor took 121.03 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:31,818 INFO L168 Benchmark]: RCFGBuilder took 432.75 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 162.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:31,822 INFO L168 Benchmark]: TraceAbstraction took 2981.97 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 162.1 MB in the beginning and 104.2 MB in the end (delta: 57.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:19:31,829 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.52 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.13 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.03 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 432.75 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 162.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2981.97 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 162.1 MB in the beginning and 104.2 MB in the end (delta: 57.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 2; VAL [x=2] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=1, x=2] [L37] int result = fibo1(x); [L38] COND TRUE result == 1 VAL [result=1, x=2] [L39] __VERIFIER_error() VAL [result=1, x=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 82 SDtfs, 50 SDslu, 259 SDs, 0 SdLazy, 179 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 3 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/8 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 incorrect! Received shutdown request...